Implementation parallelized queueing network simulations using FORTRAN and data abstraction

  • Authors:
  • Keith W. Miller;David M. Nicol

  • Affiliations:
  • Department of Computer Science, The College of William and Mary, Williamsburg, Virginia;Department of Computer Science, The College of William and Mary, Williamsburg, Virginia

  • Venue:
  • WSC '88 Proceedings of the 20th conference on Winter simulation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Researchers experimenting with simulation on novel computers with parallel architectures must contend with numerous disadvantages: limited availability of programming tools, unique synchronization problems when implementing the simulation, and unexpected interactions between elements of the simulation and characteristics of the underlying computer. Since FORTRAN is likely to be available on the computer and familiar to the researcher, it may be the most logical candidate for coding the simulation. However, FORTRAN does not enforce data abstraction, a useful tool in specifying, designing, and implementing a simulation effort. FAD is a FORTRAN preprocessor which allows the encapsulation of user-defined abstract data types. Data abstraction and FAD is illustrated in the simulation of a queueing network. The separation of concerns between a simulation expert (“the user”) and an expert in exploiting a parallel architecture (“the implementor”) has benefits for both.