ACM Home Page
Please provide us with feedback. Feedback
Experience in massively parallel discrete event simulation
Full text PdfPdf (1.11 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents
Velen, Germany
Pages: 193 - 202  
Year of Publication: 1993
ISBN:0-89791-599-2
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165256
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
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.
 
2
T. Blank. The MasPar MP-1 architecture. In Compcon Spring 1990, San Francisco, CA, February 1990. IEEE Computer Society Press.
 
3
K.M. Chandy and }3. Sherman. Space-time and simulation. In Dzstributed Simulation 1989, pages 53-57. The Society for Computer Simulation, 1989.
4
 
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.
6
 
7
8
 
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.
10
 
11
F.P. Kelly. Loss networks. The Annals of Apphed Probability, 1(3):319-378, August 1991.
12
 
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.
 
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.
 
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.
16
 
17
R.B. Wolf. Advanced techniques for managing telecommunications networks. IEEE Communications Magazine, 28(2):76-81, October 1990.


Collaborative Colleagues:
Albert G. Greenberg: colleagues
Boris D. Lubachevsky: colleagues
Li-C. Wang: colleagues