Albert G. Greenberg
Boris D. Lubachevsky
- 1.G.R. Ash, :I.-S. Chen, A.E. Frey, and B.D. Huang. Realtime network routing in a dynamic class-of-service network. In Thirteenth International Tcletraffic Congress (ITC-13}, Copenhagen, June 1991.Google Scholar
- 2.T. Blank. The MasPar MP-1 architecture. In Compcon Spring 1990, San Francisco, CA, February 1990. IEEE Computer Society Press.Google Scholar
- 3.K.M. Chandy and }3. Sherman. Space-time and simulation. In Dzstributed Simulation 1989, pages 53-57. The Society for Computer Simulation, 1989.Google Scholar
- 4.S. Eick, A.G. Greenberg, B.D. Lubachevsky, and A. Weiss. Synchronous relaxation for parallel simulations with applications to circuit-switched networks. A CM Transactions on Modeling and Computer Simulation, 1992. A preliminary version appeared in the 1991 SCS Multiconference, Simulation Series; vol. 23, no. 1. Google ScholarDigital Library
- 5.T. Feder, A.G. Greenberg, M. Rausch, V. P#amachandran, and L.-C. Wang. Circuit-switched link simulation: algorithms, complexity, implementation, in preparation, 1992.Google Scholar
- 6.R.M. Fujimoto. Parallel discrete event simulation. Communzcations of the A CM, 33(10):31-53, 1991. Google ScholarDigital Library
- 7.B. Gaujal, A.G. Greenberg, and D.M. Nicol. A sweep algorithm for massively parallel simulation of circuitswitched networks. Journal of Parallel and Distributed Computing, 1993. to appear. Google ScholarDigital Library
- 8.L. M. Goldschlager. The monotone and planar circuit value problem are log space complete for P. SIGA CT News, 9:25-29, 1977. Google ScholarDigital Library
- 9.A.G. Greenberg, A.M. Odlyzko, J. Rexford, and D. Espinosa. Massively parallel algorithms for fixed point approximations for evaluating the performance of circuitswitched networks, unpublished, December 1992.Google Scholar
- 10.D.R. Jefferson. Virtual time. A CM Transactions on Programming Languages and Systems, 7(3):404-425, July 1985. Google ScholarDigital Library
- 11.F.P. Kelly. Loss networks. The Annals of Apphed Probability, 1(3):319-378, August 1991.Google ScholarCross Ref
- 12.R.E. L#tdner #nd M_J_ Fischer. P#rall#l pr#fi# computation. Journal of the A CM, 27:831-838, 1980. Google ScholarDigital Library
- 13.J. Van Leeuwen, editor. Handbook o:f Theoretical Computer Science, volume A. MIT Press, Cambridge, MA, 1990. See Chapter 17, Parallel Algorithms for Shared- Memory Machines, by R.M. Karp and V. Ramachandean.Google Scholar
- 14.E. W. Mayr and A. Subramanian. The complexity of circuit value and network stability. In Proceedings 4th Annual Conference on Structure in Complexity Theory, pages 114-123, Eugene, Oregon, June 1989.Google ScholarCross Ref
- 15.D. Mitra, R.3. Gibbens, and B.D. Huang. Analysis and optimal design of aggregated-least-busy-alternative routing on symmetric loss networks with trunk reservations. In 13th International Teletraffic Congress, Copenhagen, Denmark, June 1991. North Holland.Google Scholar
- 16.D.M. Nicol, A.G. Greenberg, and B.D. Lubachevsky. MIMD parallel simulation of circuit-switched networks. In 199P Winter Simulation Conference, Arlington, VA, December 1992. Google ScholarDigital Library
- 17.R.B. Wolf. Advanced techniques for managing telecommunications networks. IEEE Communications Magazine, 28(2):76-81, October 1990.Google ScholarDigital Library
Index Terms
- Experience in massively parallel discrete event simulation
Recommendations
Parallel discrete event simulation
Special issue on simulationParallel discrete event simulation (PDES), sometimes called distributed simulation, refers to the execution of a single discrete event simulation program on a parallel computer. PDES has attracted a considerable amount of interest in recent years. From ...
Comments