Title :
Modeling and performance bounds for concurrent processing
Author :
Mielke, Roland R. ; Stoughton, John W. ; Som, Sukhamoy
Author_Institution :
Dept. of Electr. & Comput. Eng., Old Dominion Univ., Norfolk, VA, USA
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.<>
Keywords :
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; Application software; Communication system control; Computer architecture; Data flow computing; Flow graphs; Parallel architectures; Performance analysis; Process control; Signal processing algorithms; Throughput;
Conference_Titel :
Distributed Computing Systems, 1988., 8th International Conference on
Conference_Location :
San Jose, CA, USA
Print_ISBN :
0-8186-0865-X
DOI :
10.1109/DCS.1988.12557
