论文信息 - Performance modeling for the ATAMM data flow architecture

Performance modeling for the ATAMM data flow architecture

The algorithm-to-architecture mapping model (ATAMM) is a new marked graph (a class of Petri net) model from which the rules for data and control flow in a homogeneous, multicomputer, data-flow architecture may be defined. This study is concerned with performance modeling for periodic execution of large-grain, decision-free algorithms in such an ATAMM-defined architecture. Major applications are expected to be real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The computing environment, problem domain, and algorithm execution pattern are described. Performance measures of computing speed and throughout capacity are defined. Performance bounds are established. Resource (computing element) needs are determined for periodic execution of algorithms.<<ETX>>

Roland R. Mielke | John W. Stoughton | S. Som

[1] Tadao Murata,et al. Relevance of network theory to models of distributed/parallel processing☆ , 1980 .

[2] Roland R. Mielke,et al. Modeling and performance bounds for concurrent processing , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[3] Tilak Agerwala,et al. Data Flow Systems: Guest Editors' Introduction , 1982, Computer.

[4] Israel Koren,et al. The Effect of Operation Scheduling on the Performance of a Data Flow Computer , 1987, IEEE Transactions on Computers.

[5] S. Som. Performance modeling and enhancement for the ATAMM data flow architecture , 1990 .

[6] Richard D. Sidwell,et al. Modeling and analysis of concurrent systems , 1987 .

[7] Tadao Murata,et al. Circuit theoretic analysis and synthesis of marked graphs , 1977 .

[8] Tadao Murata. Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance , 1980, IEEE Transactions on Software Engineering.