Affiliation:
1. Georgia Institute of Technology, Atlanta
Abstract
We analyze distributed event-driven computation on message-passing parallel computing systems. Synchronization is the mechanism that ensures that causality in the ordering of stochastically generated events for execution during the computation is maintained. We characterize distributed event-driven computation into weakly coupled (weak interactions) and strongly coupled (strong interactions) distributed systems and propose and analyze a number of new algorithms for efficient synchronization. The analytical results for steady state performance are complemented with detailed simulations of the transient performance. We show that synchronization enforced separately from computation results in an efficient implementation. Effects of the memory hierarchy and communication delays are also incorporated.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modeling and Simulation
Reference35 articles.
1. Response change in linearized circuits and systems: Computational algorithms and applications
2. Multicomputers: message-passing concurrent computers
3. BERSTEKAS D. AND TSITSIKLIS J. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Englewood Cliffs N.J. 1987. BERSTEKAS D. AND TSITSIKLIS J. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Englewood Cliffs N.J. 1987.
4. Asynchronous distributed simulation via a sequence of parallel computations
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献