Metamodeling is demonstrated as a methodology to accurately and concisely characterize the behavior of parallel processing interconnection networks. A set of mathematical metamodels are derived from a discrete event simulation model and then used to predict and compare the performance of interconnection networks. To illustrate the development and the application of metamodels, models for the multistage cube network, the single stage cube network (hypercube), and the llliac IV mesh-type network are formulated. These models, validated using empirical data from earlier studies, provide compact mathematical relations between packet delay time, message load, and switch size for each interconnection architecture. This approach provides insight into the complexities of network performance and uses simulation as the experimental vehicle for theoretical development. We show the comparison of network performance and conclude that the use of simulation as a means to estimate mathematical models is beneficial and consistent with experimental evidence. Our metamodels for performance prediction establish a basis for future comparisons that can be directly applied by other researchers. The models give the designer of a parallel processing system additional insight for choosing the interconnection network which best suits the application needs. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

The Halstead theory of software science is used to describe the compilation process and generate a compiler performance index. A nonlinear model of compile time is estimated for four Ada compilers. A fundamental relation between compile time and program modularity is proposed. Issues considered include data collection procedures, the development of a counting strategy, the analysis of the complexity measures used, and the investigation of significant relationships between program characteristics and compile time. The results indicate that the model has a high predictive power and provides interesting insights into compiler performance phenomena. The research suggests that the discrimination rate of a compiler is a valuable performance index and is preferred to average compile-time statistics.>