Language and library support for practical PRAM programming

Parallel Computing

Volumn 25, Issue 2, 1999, Pages 105-135

  Keßler, Christoph W ^a   Träff, Jesper Larsson ^b,c  

^a UNIVERSITY OF TRIER   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Compilers; Parallel programming languages; Parallel software libraries; PRAM model; Programming environments

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PARALLEL ALGORITHMS; PROGRAM COMPILERS; RANDOM PROCESSES;

PARALLEL RANDOM ACCESS MACHINE (PRAM) MODEL;

PARALLEL PROCESSING SYSTEMS;

EID: 0033076386     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(98)00092-1     Document Type: Article

References (49)

1. F. Abolhassan, R. Drefenstedt, J. Keller, W.J. Paul, D. Scheerer, On the physical design of PRAMs, The Computer Journal 36 (8) (1993) 756-762.
2. F. Abolhassan, J. Keller, W.J. Paul, On the cost-effectiveness of PRAMs, in: Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, IEEE Press, New York, 1991, pp. 2-9.
3. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, B. Smith, The Tera computer system, in: Proceedings of the 1990 International Conference on Supercomputing, ACM, New York, 1990, pp. 1-6.
4. R.J. Anderson, G.L. Miller, Deterministic parallel list ranking, Algorithmica (1991) 6:859-868.
5. P. Bach, M. Braun, A. Formella, J. Friedrich, Th. Grün, H. Leister, C. Lichtenau, Th. Walle, Building the 4 Processor SB-PRAM Prototype, Technical Report 05/1996, Sonderforschungsbereich 124 VLSI-Entwurfsmethoden und Parallelität, Universität des Saarlandes, Saarbrücken (Germany), 1996.
6. Y. Ben-Asher, D.G. Feitelson, L. Rudolph, ParC - an extension of C for shared memory parallel processing, Software - Practice and Experience 26 (5) (1996) 581-612.
7. G.E. Blelloch, Programming parallel algorithms, Communications of the ACM 39 (3) (1996) 85-97.
8. G.E. Blelloch, J.C. Hardwick, J. Sipelstein, M. Zagha, S. Chatterjee, Implementation of a portable nested data-parallel language, Journal of Parallel and Distributed Computing 21 (1994) 4-14.
9. E.D. Brooks III, K.H. Warren, The Parallel C Preprocessor, Technical Report UCRL-TB-122378 Rev. 1, Lawrence Livermore National Laboratories, 1995.
10. D. Callahan, B. Smith, A future-based parallel language for a general-purpose highly-parallel computer, in: Languages and Compilers for Parallel Computing, MIT Press, Cambridge, MA, 1990, pp. 95-113.
11. W.W. Carlson, J.M. Draper, Distributed data access in AC, in: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, New York, 1995, pp. 39-47.
12. R. Cole, U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control 70 (1986) 32-53.
13. D. Cross, R. Drefenstedt, J. Keller, Reduction of network cost and wiring in Ranade's butterfly routing, Information Processing Letters 45 (2) (1993) 63-67.
14. D.E. Culler, A. Dusseau, S.C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick, Parallel programming in Split-C, in: Proceedings of the Supercomputing 1993, IEEE Computer Society Press, Silver Spring, MD, 1993, pp. 262-273.
15. C. Engelmann, J. Keller, Simulation-based comparison of hash functions for emulated shared memory, in: Proceedings of the PARLE 1993 Parallel Architectures and Languages Europe, Lecture Notes in Computer Science, vol. 694, Springer, Berlin, 1993, pp. 1-11.
16. A. Formella, J. Keller, T. Walle, HPP a high-performance PRAM, in: Proceedings of the 2nd International Euro-Par Conference, Lecture Notes in Computer Science, vol. 1123, Springer, Berlin, 1996.
17. C.W. Fraser, D.R. Hanson, A Retargetable C Compiler: Design and Implementation, Benjamin/ Cummings, Menlo Park, CA, 1995.
18. T. Hagerup, A. Schmitt, H. Seidl, FORK: A high-level language for PRAMs, Future Generation Computer Systems 8 (1992) 379-393.
19. T. Hagerup, C. Rub, Optimal merging and sorting on the EREW PRAM, Information Processing Letters 33 (1989) 181-185.
20. T.J. Harris, A survey of PRAM simulation techniques, Computing Surveys 26 (2) (1994) 187-206.
21. P.J. Hatcher, M.J. Quinn, Data-Parallel Programming, MIT Press, Cambridge, MA, 1991.
22. T.-S. Hsu, V. Ramachandran, Efficient massively parallel implementation of some combinatorial algorithms, Theoretical Computer Science 162 (2) (1996) 297-322.
23. T.-S. Hsu, V. Ramachandran, N. Dean, Implementation of Parallel Graph Algorithms on the MasPar, vol. 15, American Mathematical Society, Providence, RI, 1994, pp. 165-198.
24. T.-S. Hsu, V. Ramachandran, N. Dean, Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing, in: Proceedings of the 9th International Parallel Processing Symposium (IPPS), 1995, pp. 106-112.
25. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
26. S. Juvaste, The Programming Language pm2 for PRAM, Technical Report B-1992-1, Department of Computer Science, University of Joensuu, Finland, 1992. ftp://os.joensuu.fi.
27. J. Keller, W.J. Paul, D. Scheerer, Realization of PRAMs: Processor Design, in: Distributed Algorithms, Proceedings of the 8th International Workshop (WDAG94), Lecture Notes in Computer Science, vol. 857, 1994, pp. 17-27.
28. J. Keller, T. Walle, A note on implementing combining networks, Information Processing Letters 55 (4) (1995) 195-200.
29. C.W. Keßler, Practical PRAM programming in Fork95: A tutorial, Technical Report 97-12, FB IV Informatik der Universität Trier, 1997. Available at http://www.informatik.uni-trier.de/~kessler/ fork95/.
30. C.W. Keßler, H. Seidl, The Fork95 parallel programming language: Design, implementation, application, International Journal of Parallel Programming 25 (1) (1997) 17-50.
31. C.W. Keßler, H. Seidl, Language support for synchronous parallel critical sections, in: Proc. APDC'97 Int. Conf. on Advances in Parallel and Distributed Computing, Shanghai, China, IEEE Computer Society Press, New York, 1997.
32. S.R. Kosaraju, A.L. Delcher, Optimal parallel evaluation of tree-structured computations by raking, in: VLSI Algorithms and Architechtures, Proceedings of the 3rd Aegean Workshop on Computing (AWOC 88), Lecture Notes in Computer Science, vol. 319, 1988, pp. 101-110.
33. C.P. Kruskal, L. Rudolph, M. Snir, The power of parallel prefix, IEEE Transactions on Computers C34 (10) (1985) 965-968.
34. C.E. Leiserson, Programming irregular parallel applications in Cilk, in: Proceedings of the IRREGULAR 1997, Springer LNCS 1253, June 1997, pp. 61-71.
35. D. Lenoski, J. Laudon, K. Gharachorloo, W.-D. Weber, A. Gupta, J. Hennessy, M. Horowitz, M.S. Lam, The Stanford DASH multiprocessor, IEEE Computer 25 (3) (1992) 63-79.
36. C. Leon, C. Rodríguez, F. García, F. de Sande, A PRAM oriented programing system, Concurrency: Practice and Experience 9 (3) (1997) 163-179.
37. OpenMP Architecture Review Board, OpenMP: a Proposed Industry Standard API for Shared Memory Programming, White Paper, http://www.openmp.org/, October 1997.
38. W. Paul, U. Vishkin, H. Wagener, Parallel dictionaries on 2-3 trees, in: Proceedings of the 10th ICALP, Lecture Notes in Computer Science, vol. 154, 1983, pp. 597-609.
39. M. Philippsen, W.F. Tichy, Compiling for massively parallel machines, in: R. Giegerich, S.L. Graham (Eds.), Code Generation - Concepts, Tools, Techniques, Springer, Berlin, 1991, pp. 92-111.
40. A.G. Ranade, How to emulate shared memory, Journal of Computer and System Sciences 42 (1991) 307-326.
41. J.R. Rose, G.L. Steele Jr., C*: An extended C language for data parallel programming, in: C++ Workshop Proceedings, USENIX, 1987, pp. 361-397.
42. J.L. Träff, Explicit implementation of a parallel dictionary, Technical Report SFB 124-D6 10/95, Universität des Saarlandes, Saarbrücken, Germany, Sonderforschungsbereich 124, VLSI Entwurfsmethoden und Parallelität, 1995.
43. J.L. Träff, Parallel searching, merging and sorting. Technical Report SFB 124-D6 1/96, Universität des Saarlandes, Saarbrücken, Germany, Sonderforschungsbereich 124, VLSI Entwurfsmethoden und Parallelität, 1996.
44. J.L. Träff, Prefix sums and other operations on parallel arrays, Technical Report SFB 124-D6 6/96, Universität des Saarlandes, Saarbrücken, Germany, Sonderforschungsbereich 124, VLSI Entwurfsmethoden und Parallelität, 1996.
45. J.L. Träff, Parallel list ranking and other operations on lists, Technical Report SFB 124-D6 3/97, Universität des Saarlandes, Saarbrücken, Germany, Sonderforschungsbereich 124, VLSI Entwurfsmethoden und Parallelität, 1997.
46. J.L. Träff, Parallel tree operations, Technical Report SFB 124-D6 4/97, Universität des Saarlandes, Saarbrücken, Germany, Sonderforschungsbereich 124, VLSI Entwurfsmethoden und Parallelität, 1997.
47. L.G. Valiant, A bridging model for paralledl computation, Communications of the ACM 33 (8) (1990) 103-111.
48. U. Vishkin, A parallel blocking flow algorithm for acyclic networks, Journal of Algorithms 13 (1992) 489-501.
49. U. Vishkin, Lectures on Parallel Computaiton, chapter 1, Structural Parallel Algorithmics, Cambridge University Press, Cambridge, 1993, pp. 1-18.