PRAM programming: Theory vs. practice

Proceedings of the 6th Euromicro Workshop on Parallel and Distributed Processing, PDP 1998

Volumn , Issue , 1998, Pages 164-170

  Gerbessiotis, A V ^a   Lecomber, D S ^a   Siniolakis, C J ^a   Sujithan, K R ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

DATA LOCALITY; DIRECT MODE; OVERHEAD COSTS; PRAM ALGORITHMS; TOOLSETS;

C++ (PROGRAMMING LANGUAGE);

EID: 0040063907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.1998.647194     Document Type: Conference Paper

References (20)

1. F. Abolhassan, R. Drefenstedt, J. Keller, W. J. Paul, and D. Scheerer. On the physical design of PRAMs. Computer Journal, 36(8):756-762,1993.
2. A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71:3-28, 1990.
3. A. G. Alexandrakis, A. V. Gerbessiotis, D. S. Lecomber and C. J. Siniolakis. Bandwidth, space and computation efficient PRAM programming: The BSP approach. In Proceedings of the SUPEUR'96 Conference, Krakow, September 1996.
4. A. Baumker, W. Dittrich, F. Meyer auf der Heide and I. Rieping. Realistic parallel algorithms: Priority queue pperations and selection for the BSP* model. In Proceedings of EUROPAR'96, LNCS volume 1124, August 1996.
5. J. L. Carter and M. N. Wegman. Universal classes of hash functions. In Proceedings of the 9-th ACM STOC, pp. 106-112, 1977.
6. M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proceedings of ICALP, pp. 6-19, LNCS, Volume 443, Springer Verlag, 1990.
7. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings of the 10-th ACM STOC, pp. 114-118, 1978.
8. A. V. Gerbessiotis. Topics in parallel and distributed computing. PhD Thesis (Technical Report TR-03-93), Aiken Computing Laboratory, Harvard University, 1993.
9. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251-267, 1994.
10. A. V. Gerbessiotis and C. J. Siniolakis. Primitive Operations on the BSP model. Technical Report PRG-TR-23-96, Computing Laboratory, Oxford University, October 1996.
11. M. T. Goodrich. Communication-efficient parallel sorting. In Proceedings of the 26-th ACM STOC, 1996.
12. M. W. Goudreau, J. M. D. Hill, K. Lang, W. F. McColl, S. B. Rao, D. C. Stefanescu, T. Suel, T. Tsantilas. A proposal for the BSP worldwide standard library. Technical Report, Oxford University Computing Laboratory, April 1996.
13. J. JaJa. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
14. D. S. Lecomber and K. R. Sujithan. Architecture-independent locality analysis and efficient PRAM simulations. In Proceedings of HPCN'97
15. W. F. McColl. Scalable parallel computing: A grand unified theory and its practical development. In Proceedings of IFIP World Congress, 1:539-546, Hamburg, August 1994.
16. G. L. Miller and J. H. Reif. Parallel tree contraction and its application. In Proceedings of the 26-th IEEE Symposium on Foundations of Computer Science, pp. 478-489, 1985.
17. R. Miller. A library for bulk-synchronous parallel programming. In Proceedings of the BCS Parallel Processing Specialist Group workshop on General Purpose Parallel Computing, 1993.
18. A. G. Ranade. A framework for analyzing locality and portability issues in parallel computing. In Parallel architectures and their efficient use, LNCS, Volume 678, Springer-Verlag, 1993.
19. K. R. Sujithan. Towards a scalable parallel object database - The bulk-synchronous parallel approach. Technical Report PRG-TR-17-96, Oxford University Computing Laboratory, August 1996.
20. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33:103-111, 1990.