Name
Abstract | ||
|---|---|---|
A novel graph-theoretic model for describing the relation between a decomposed algorithm and its execution in a multiprocessor environment is developed. Called ATAMM, the model consists of a set of Petri-net marked graphs that incorporates the general specifications of a data-flow architecture. The model is useful for representing decision-free algorithms having large-grained, computationally complex primitive operations. Performance measures of computing speed and throughput capacity are defined. The ATAMM model is used to develop analytically lower bounds for these parameters.<> |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/DCS.1988.12557 | San Jose, CA, USA |
Keywords | Field | DocType |
directed graphs,multiprocessing programs,multiprocessing systems,performance evaluation,ATAMM,Petri-net marked graphs,computing speed,concurrent processing,data-flow architecture,decision-free algorithms,graph-theoretic model,multiprocessor environment,performance bounds,throughput capacity | Graph,Dataflow architecture,Computer science,Parallel computing,Directed graph,Multiprocessing,Process control,Throughput,Application software,Signal processing algorithms,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.40 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roland R. Mielke | 1 | 22 | 6.81 |
| John W. Stoughton | 2 | 3 | 0.83 |
| Sukhamoy Som | 3 | 3 | 0.83 |