A tool to aid in the design of parallel computers by computing their performance is developed. Currently queueing networks or stochastic Petri nets are the main methods used for computing the performance indices of parallel systems. A method that uses probabilistic automata to model parallel computers will make the tool easy to use, comprehensive and efficient. Probabilistic automata are a modular way of modeling parallel systems. The modeler is relieved from dealing with a global model of a parallel system as the system is divided into modules that are dealt with separately. Problems such as the design of architectures for certain problem domains and the mapping of algorithms to architectures are studied with the aid of such a tool.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9308099
Program Officer
Yechezkel Zalcstein
Project Start
Project End
Budget Start
1993-09-01
Budget End
1998-02-28
Support Year
Fiscal Year
1993
Total Cost
$78,855
Indirect Cost
Name
North Dakota State University Fargo
Department
Type
DUNS #
City
Fargo
State
ND
Country
United States
Zip Code
58108