| Towards efficiency and portability: programming with the BSP model |
| Full text |
Pdf
(1.38 MB)
|
| Source
|
ACM Symposium on Parallel Algorithms and Architectures
archive
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
table of contents
Padua, Italy
Pages: 1 - 12
Year of Publication: 1996
ISBN:0-89791-809-6
|
|
Authors
|
|
Mark Goudreau
|
Department of Computer Science, University of Central Florida, Orlando, FL
|
|
Kevin Lang
|
NEC Research Institute, 4 Independence Way, Princeton, NJ
|
|
Satish Rao
|
NEC Research Institute, 4 Independence Way, Princeton, NJ and University of California at Berkeley, Berkeley, CA
|
|
Torsten Suel
|
NEC Research Institute, 4 Independence Way, Princeton, NJ and University of California at Berkeley, Berkeley, CA
|
|
Thanasis Tsantilas
|
Department of Computer Science, Columbia University, New York, NY
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 32, Citation Count: 17
|
|
|
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
|
|
 |
2
|
|
| |
3
|
J. Barnes and P. Hut. A hierarchical O(NtogN) force-calculation algorithm. Nature, 324(4):446-449, 1986.
|
| |
4
|
|
| |
5
|
R. H. Bisseling. Sparse matrix computations on bulk synchronous parallel computers, in Proc. Int. Conf on Industrial and Applied Math., July 1995.
|
| |
6
|
R. H. Bisseling and W. F. McColl. Scientific computing on bulk synchronous parallel architectures. In B. Pehrson and I. Simon, editors, Proc. 13th IFIP World Computer Congress, volume 1, pages 509-514. Elsevier, 1994.
|
| |
7
|
J. Cartier, L. Greengard, and V. Rokhlin. A fast adaptive multipole algorithm for particle simulations. SlAM J. on Scientific and Statistical Computing, 9(4):669-686, July 1988.
|
| |
8
|
T. Cheatham, A. Fahmy, and D. Stefanescu. General purpose optimization technology. Tech. report, Center for Research in Computing Technology, Harvard University, Dec. 1994.
|
| |
9
|
|
 |
10
|
A. Krishnamurthy , D. E. Culler , A. Dusseau , S. C. Goldstein , S. Lumetta , T. von Eicken , K. Yelick, Parallel programming in Split-C, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.262-273, December 1993, Portland, Oregon, United States
[doi> 10.1145/169627.169724]
|
 |
11
|
David Culler , Richard Karp , David Patterson , Abhijit Sahay , Klaus Erik Schauser , Eunice Santos , Ramesh Subramonian , Thorsten von Eicken, LogP: towards a realistic model of parallel computation, Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.1-12, May 19-22, 1993, San Diego, California, United States
|
| |
12
|
Al Geist , Adam Beguelin , Jack Dongarra , Weicheng Jiang , Robert Manchek , Vaidy Sunderam, PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing, MIT Press, Cambridge, MA, 1995
|
| |
13
|
|
| |
14
|
A.V. Goldberg, K. Lang, and S. Rap. Computing minimum spanning. tree with the Green BSP library. In preparation, April 1996.
|
| |
15
|
M. Goudreau, K. Lang, S. Rap, and T. Tsantilas. The Green BSP library. Tech. Report CR-TR-95-11, University of Central Florida, 1995.
|
| |
16
|
|
 |
17
|
|
| |
18
|
S. Knee. Program development and performance prediction on BSP machines using Opal. Technical Report PRG-TR-18-94, Oxford University Computing Laboratory, Aug. 1994.
|
| |
19
|
|
| |
20
|
D. Lecomber. An object-oriented programming model for BSP computations. Tech. Report, Oxford Unwersity Computing Laboratory, 1994.
|
| |
21
|
C. Leiserson and B. M. Maggs. Communieation-efficientparallel algorithms for distributed random-access machines. Algorithmics, 3:53-77, 1988.
|
 |
22
|
|
 |
23
|
|
| |
24
|
|
| |
25
|
|
| |
26
|
W. E McColl. BSP programming. In G.E. Blelloch, K.M. Chandy, and S. Jagannathan, editors, Proc. DIMACS Workshop on Specification of Parallel Algorithms, pages 21-35 American Math. Soc. May 1994.
|
| |
27
|
Richard Miller. A library for bulk-synchronous parallel programming. In Proc. of the Brttish Computer Society Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing, Dec. 1993.
|
| |
28
|
M. Nibhanupudi, C. Norton, and B. Szymanski. Plasma simulation on networks of workstations using the bulk synchronous parallel model. In Proc. Int. Cony on Parallel and Distributed Processing Techniques and Applications, Nov. 1995.
|
| |
29
|
J. P. Singh. Data locality and memory system performance in the parallel simulation of ocean eddy currents. In Proc. 2nd Int. Symp. on High Performance Computmg, Oct. 1991.
|
| |
30
|
|
| |
31
|
|
| |
32
|
T. Suel. Programming Parallel N-Body Simulations with the Bulk- Synchronous Parallel Model. In preparation, April 1996.
|
| |
33
|
|
 |
34
|
|
| |
35
|
L. G. Valiant. Why BSP computers? In Proc. 7th Int. Parallel Processmg Syrup., pages 2-5. IEEE Press, April 1993.
|
 |
36
|
Thorsten von Eicken , David E. Culler , Seth Copen Goldstein , Klaus Erik Schauser, Active messages: a mechanism for integrated communication and computation, Proceedings of the 19th annual international symposium on Computer architecture, p.256-266, May 19-21, 1992, Queensland, Australia
|
| |
37
|
|
CITED BY 17
|
|
Mark W. Goudreau , Kevin Lang , Girija Narlikar , Satish B. Rao, BOS is boss: a case for bulk-synchronous object systems, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, p.115-125, June 27-30, 1999, Saint Malo, France
|
|
|
Micah Adler , Phillip B. Gibbons , Vijaya Ramachandran , Yossi Matias, Modeling parallel bandwidth: local vs. global restrictions, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.94-105, June 23-25, 1997, Newport, Rhode Island, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Curtis Lisle , Rebecca Parsons, Recursive, object-oriented structures for molecular modeling, Proceedings of the 1998 ACM symposium on Applied Computing, p.50-54, February 27-March 01, 1998, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|