10.1145/318242.318468acmconferencesArticle/Chapter ViewAbstractPublication PageswscConference Proceedings
ARTICLE

Concurrent simulation: an alternative to distributed simulation

ABSTRACT

The advent of a new generation of multiprocessors allows new approaches to parallel simulation. Previous work in this area has concentrated on distributed simulation; this approach uses spatial decomposition to allow simulations to be run on networks of machines, where the message flow between processors in the network is related closely to the topology of the system being simulated. This paper presents an alternate approach, concurrent simulation, which is based on temporal decomposition. This allows natural use to be made of the shared memory facilities and load-balancing capabilities of the new multiprocessors, and it overcomes some fundamental limitations of the distributed approach.

References

  1. Baskett, F. and J. Hennessy j. (1986). Small Shared-Memory Multiprocessor s. 231, 963-967.Google ScholarGoogle Scholar
  2. Bell, C. G. (1985). Multis: A New Class of Mul tiprocessor Computers. ~ 2~, 462-467.Google ScholarGoogle Scholar
  3. Birnbaum, J. S. (1985). Towards the Domestication of Microel ectronics. CommuDicaof the ACM 28, 1225-1235. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chandy, K. M., and Misra, J. (1979). Distributed Simulation: A Case Study. /~ ~. on Software Engineer in~g SE-5, 440 -452.Google ScholarGoogle Scholar
  5. Dijkstra, E. W. (1971). Hierarchical Ordering of sequential Processes. Informatica i, 115-13 8.Google ScholarGoogle Scholar
  6. Jones, D. W. (1985). Concurrent Operations on Priority Queues. submitted for publication.Google ScholarGoogle Scholar
  7. Jones, D. W. (1986). An Empirical Comparison of Priority-Queue and Event-Set Implementations. Communications of the 29, 300-311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Kuck, D. J., et al. (1986). Parallel Supercomputing Today and the Cedar Approach. 2~, 967-97 4.Google ScholarGoogle Scholar
  9. O' Keel e, R. M. (1986) . The Three-Phase Approach. In: Proceedings ~i~ /~ Simulation Conference.Google ScholarGoogle Scholar
  10. Overstreet, C. M. (1982). Model Specification and Analysis for Discrete Event Simulation. Unpublished Ph.D. Thesis, Computer Science Department, Virginia Polytechnic Institute, Blacksburg, Virginia. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Overstreet, C. M. (1986). World View Based Discrete Event Model Simplification. In: Modellina and Simulation MeJuhDd~loqv in the Artificial /d%telligence Y~A. North Holland, Amsterdam.Google ScholarGoogle Scholar
  12. Peacock, J. K., Wong, J. W., and Manning, E. G. (1979a). A Distributed Approach to Queueing Network Simulation. In: Proceedinus of the ~ ~ ~erence. Institute of Electrical and Electronics Engineers, 399-406. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Peacock, J. K., Wong, J. W. and Manning, E. G.(197 9b) . Distributed Simulation Using a Network of Processors. Computer Netw~ks 3, 44-56.Google ScholarGoogle Scholar
  14. Quinn, M. J. and Deo, N. (1984) .Parallel Graph Algorithms. ACM Computing /~, 319-348. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Concurrent simulation

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!