How using busses in multicomputer programs affects conservative parallel simulation
Abstract
In this paper we consider the effect of using bus interconnection structures on the overheads present in conservative parallel simulations of multicomputer programs. We use a modified version of the Poker Programming Environment to empirically measure the overhead in three parallel algorithms using buses. We discuss the sources of overhead and compare them with those found using point-to-point communication. Preliminary results indicate that the overheads encountered using a bus interconnection structure were not predicted by our previous results using point-to-point communications.
References
[1]
Barley, M. L. and M. A. Pagels. 1991. "Measuring the Overhead in Conservative Parallel Simulations of Multicomputer Programs." In 1991 Winter Simulation Conference Proceedings. 627-636.
[2]
Barley, M. L.; M. A. Pagels; and K. K. Wong. 1992." How Using Busses in Multicomputer Programs Affects Conservative Parallel Simulation: Detailed Measurements.~ Technical Report TR 92-27. Computer Science Department, University of Arizona.
[3]
Bryant, R. E. 1977. "Simulation of Packet Communication Architecture Computer Systems." Technical Report MIT-LCS-TR-188. Massachusetts Institute of Technology.
[4]
Chandy, K. M. and J. Misra. 1979. "Distributed Simulation: A Case Study in Design and Verification of Distributed Programs.~ IEEE Transactions on Software Engineering SE-5, no. 5 (Sept): 440-452.
[5]
Felderman, R. E. and L. Kleinrock. 1991. "Two Processor Time Warp Analysis: Some Results on a Unifying Approach.~ In Proceedings of the SCS Multiconference on Distributed Simulation. 3- 10.
[6]
Fujimoto, R. M. 1989. ~l~me Warp on a Shared Memory Multiprocessor.~ Transactions of the Society for Computer Simulation 6, no. 3: 211-239.
[7]
Fujimoto, R. M. 1990. ~Parallel Discrete Event Simulation.~ Communications of the Association of Computing Machinery 33, no. 10: 30-53.
[8]
Gupta, A.; I. F. Akyildiz; and R. M. Fujimoto. 1991. "Performance Analysis of Time Warp with Multiple Homogeneous Processors." IEEE Transactions on Software Engineering 17, no. 10: 1013- 1027.
[9]
Hennessy, J. L. and D. A. Patterson. 1990. Computer Architecture A Quantitative Approach. Morgan Kaufmann Publishers, Inc., Palo Alto, California.
[10]
Jefferson, D. R. 1985. ~rLrtual Time.~ ACM Transactions on Programming Languages and Systems 7, no. 3: 404-425.
[11]
Lin, Y. B. and E. D. Lazowska. 1990. "Optimality Considerations for Time-Warp Parallel Simulation." In Proceedings of the SCS Multiconference on Distributed Simulation. 29-34.
[12]
Lin, Y. B.; E. D. Lazowska; and M. L. Bailey. 1990. "Comparing Synchronization Protocols for Parallel Logic-Level Simulation." In Proceedings of the 1990 International Conference on Parallel Processing. III-223 - III-227.
[13]
Lipton, R. J. and D. W. Mizell. 1990. "Time Warp vs. Chandy- Misra: A Worst-Case Comparison.~ In Proceedings of the SCS Multiconference on Distributed Simulation. 137.143. Madisetti, V.; J. Walrand; and D. Messerschmitt. 1990. "Synchro-
[14]
nization in Message-Passing Computers - Models, Algorithms, and Analysis.~ In Proceedings of the SCS Multiconference on Distributed Simulation. 35-48.
[15]
Mitra, D. and I. Mitrani. 1984. ~Analysis and Optimum Performance of Two Message-Passing Parallel Processors Synchronized by Rollback.~ Performance 1984 : 35-50.
[16]
Nicol, D. M. 1991. "Performance Bounds on Parallel Self-Initiating Discrete-Event Simulations.~ IEEE Transactions on Modeling and Computer Simulation 1, no. 1: 24-50.
[17]
Notkin, D.; L. Snyder; D. Socha; M. L. Bailey; B. Forstall; K. Gates; Greenlaw R; W. G. Griswold; T. J. Holman; R. Korry; G. Lasswell; R. Mitchell; and P. A. Nelson. 1988. ~Experiences with Poker.~ In Proceedings of the ACM /SIGPLAN PPEALS. 10-20.
[18]
Reed, D. A.; A. D. Malony; and B. D. McCredie. 1988. "Parallel Discrete Event Simulation Using Shared Memory.~ IEEE Transactions on Software Engineering 14, no. 4: 541-553.
[19]
Reynolds, P. F. and P. N. Dickens. 1989. "SPECTRUM: A Parallel Simulation Testbed.~ In Proceedings of the 4th Annual Hypercube Conference.
[20]
Snyder, L. 1984. ~Parallel Programming and the Poker Programming Environment." Computer 17, no. 7: 27-36.
[21]
Snyder, L. 1988. ~Poker (4.2) Programmers Reference Guide.~ Technical Report TR88-10-05. Computer Science Department, University of Washington.
Index Terms
- How using busses in multicomputer programs affects conservative parallel simulation
Recommendations
How using busses in multicomputer programs affects conservative parallel simulation
PADS '93: Proceedings of the seventh workshop on Parallel and distributed simulationIn this paper we consider the effect of using bus interconnection structures on the overheads present in conservative parallel simulations of multicomputer programs. We use a modified version of the Poker Programming Environment to empirically measure ...
Evolving buses: backplane buses mature to keep pace with technology
Considers how the role and importance of the backplane bus in a system has evolved along with the advances in technology over the past decade. Backplane buses have come a long way from the early days of fairly simple protocols, a couple of connectors, ...
Comments
Information & Contributors
Information
Published In
July 1993
164 pages
Copyright © 1993 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 1993
Published in SIGSIM Volume 23, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 136Total Downloads
- Downloads (Last 12 months)51
- Downloads (Last 6 weeks)17
Reflects downloads up to 02 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in