ACM Home Page
Please provide us with feedback. Feedback
Algorithms for unboundedly parallel simulations
Full text PdfPdf (1.40 MB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 9 ,  Issue 3  (August 1991) table of contents
Pages: 201 - 221  
Year of Publication: 1991
ISSN:0734-2071
Authors
Albert G. Greenberg  AT&T Bell Laboratories, Murray Hill, NJ
Boris D. Lubachevsky  University of Newcastle, Newcastle upon Tyne, NE1 7RU, UK
Isi Mitrani
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 32,   Citation Count: 22
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/128738.128739
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
ABRAHAMSON, N Development of the ALOHANET. IEEE Trans. Inf. Theor. 17'-31, 2 (Mar. 1985), 119-123.
 
2
 
3
 
4
BACCELLI, F Ergodic theory of stochastic petri nets. Tech. Rep 1037, INRIA-Sophia Antipolis, INRIA-Sophia 06565 Valbonne, France, May 1989.
5
 
6
BATCnER, K. E. Sorting networks and their apphcations. In AF{PS 1968 Spring Joznt Computer Conference (Atlantic City, NJ, May 1968). AFIPS Press, Montvale, NJ, pp. 307-314.
 
7
CHANDY, K. M, AND MmRA, J. Distributed simulation: a case study in design and verification of distributed programs. IEEE Trans. Softw. Eng SE-5, 5 (1979), 440-452.
 
8
CHANDY, K. M. AND SHERMAN, B Space-time and simulation. In Distributed Simulation 1989, Socmty for Computer Simulation, 1989, pp. 53-57.
 
9
Connectton Machine, Model CM-2 Technical Summary, Version 5.1. Thinking Machines Corporation, Cambridge, Mass., May 1989.
 
10
FENa, T.Y. A survey of interconnection networks. Computer 14 (1981), 12-27.
 
11
GAVER, D. P., AND TttOMPSON, G. L Programming and Probabthty Models zn Operations Research. Brooks/Cole division of Wadsworth, Monterey, Calif., 1973
 
12
GREENBERG, A. G., LADNER, R. E., PATERSON, M., AND GALm, Z. Efficient parallel algorithms for linear recurrence computation. Inf Process Lett. 15, I (Aug. 1982), 31-35.
 
13
GREENBERG, A. G., AND LUBACHEVSK~, B. D. A simple efficient asynchronous parallel prefix algorithm. In 1987 International Conference on Parallel Processing (Penn State Univ., Aug. 1987), pp 66-69.
 
14
GROrqDALSKI, R. A chip set for a masswely parallel architecture. In IEEE Internattonal Sohd State Ctrcuits Conference (New York, Feb. 1987).
 
15
16
17
18
 
19
 
20
K~USKAL, C. P Searching, merging, and sorting in parallel computation. IEEE Trans. Comput. TC-32 (Oct. 1983), 942-946.
 
21
KRUSKAL, C. P., RUDOLPH, L., AND SNm, M. The power of parallel prefix. IEEE Trans. Comput. C-34, 10 (Oct. 1985), 965-968.
22
 
23
LEIGHTON, T. An introduction to the theory of networks, parallel computation and VLSI design, 1989. Draft.
24
 
25
LUBACHEVSKY, B. D. Efficient parallel simulations of asynchronous cellular arrays. Complex Syst. I (1987), 1099-1123.
26
27
 
28
29
 
30
SIEGEL, H. J., NATION, W., KRUSKAL, C. P., AND NAPOLITANO, L.M. Uses of the multistage cube network topology. To appear in the Proceedings of the IEEE, 1989.
31
 
32
WHITT, W. The efficiency of one long run versus independent replications in steady state simulation. Preprint, 1989.

CITED BY  22

Collaborative Colleagues:
Albert G. Greenberg: colleagues
Boris D. Lubachevsky: colleagues
Isi Mitrani: colleagues