Parallelism and recursion in message passing libraries: An efficient methodology

Concurrency Practice and Experience

Volumn 11, Issue 7, 1999, Pages 355-365

  Rodriguez C ^a   De Sande, F ^a   Leon C ^a   Garcia L ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE PORTABILITY; PIPELINE PROCESSING SYSTEMS; RECURSIVE FUNCTIONS; STORAGE ALLOCATION (COMPUTER); SUBROUTINES;

MESSAGE PASSING LIBRARIES; NESTED PARALLELISM; PROCESSOR VIRTUALIZATION;

PARALLEL PROCESSING SYSTEMS;

EID: 18744425693     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(199906)11:7<355::AID-CPE429>3.0.CO;2-Y     Document Type: Article

References (29)

1. A. Geist, A. Begelin, J. Dongarra, W. Jiang, R. Mancheck and V. Sunderam, PVM 3.1. User's Guide and Reference Manual, Oak Ridge Laboratory, 1993.
2. Message Passing Interface Forum, 'MPI: A message-passing interface standard', Tech. Rep. CS-94-230, University of Tennessee, Knoxville, 1994.
3. High Performance Fortran Forum, 'High Performance Fortran Language Specifications', Scientific Programming, 2(1-2), 1-170 (1993).
4. J. R. Rose and G. L. Steele, 'C* An extended language for data parallel programming', Proceedings of the Second International Conference on Supercomputing, Vol. 2, 2-16, 1987.
5. M. J. Quinn and P. J. Hatcher, 'Data parallel programming on multicomputers', IEEE Software, 7(5), 69-76 (1990).
6. J. R. Larus, B. Richards and G. Viswanathan, 'C**: A large-grain, object oriented, data-parallel programming language', Tech. Rep. UW #1126, Computer-Science Dep. University of Wisconsin-Madison, 1992.
7. I. Foster, Designing and Building Parallel Programs, Addison-Wesley, 1994.
8. G. E. Blelloch, J. Hardwick, J. Sipelstein, M. Zagha and S. Chatterjee, 'Implementation of a portable nested data-parallel language', J. Parallel Distrib. Comput., 21, 4-14 (1994).
9. G. Blelloch and G. Sabot, 'Compiling collection-oriented languages onto massively parallel computers', J. Parallel Distrib. Comput., 8(2), 119-134 (1990).
10. C. Kessler and H. Seidl, 'Integrating synchronous and asynchronous paradigms: the Fork95 parallel programming language', Proceedings of MPPM-95 Conference on Massively Parallel Programming Models, IEEE CS Press, Berlin, 1995.
11. T. Hagerup, Schmidt and H. Seidl, 'FORK: A high-level language for PRAMs', Future Gener. Comput. Syst., 8, 379-393 (1992).
12. C. León, C. Rodríguez, F. García and F. Sande, 'A PRAM oriented programming system', Concurrency: Pract. Exp., 9(3), 163-179 (1997).
13. G. Blelloch and J. Greiner, 'A provable time and space efficient implementation of NESL', ACM Sigplan International Conference on Functional Programming, 213-225, 1996.
14. R. Milner, M. Tofte and R. Harper, The Definition of Standard ML, MIT Press, Cambridge, Mass., 1990.
15. P. B. Hansen, Brinch Hansen on Pascal Compilers, Prentice-Hall, 1985.
16. J. Abolhassan, J. Keller and W. J. Paul, 'On physical realizations of the theoretical PRAM model', Technical Report 21/1990, Universität des Saarlandes, SFB 124, 1990.
17. S. Fortune and J. Wyllie, 'Parallelism in random access machines', Proc. 10th Annual ACM Symposium on Theory of Computing, 114-118, 1978.
18. J. L. Roda, C. Rodríguez, F. Sande, D. G. Morales and F. Almeida, 'A new model for the analysis of asynchronous parallel algorithms', Proceedings of the EuroPVM/MPI98, Liverpool, UK, 1998.
19. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
20. F. P. Preparata and M. I. Shamos, Computational Geometry. An Introduction, Springer-Verlag, New York, 1985.
21. C. A. R. Hoare, 'Proof of a program: Find', Commun. ACM, 14, 39-45 (1971).
22. IBM, 'PVMe for AIX User's Guide and Subroutine Reference Version 2, Release 1', Document number GC23-3884-00. IBM Corp., 1995.
23. P. B. Hansen, 'Do hypercubes sort faster than tree machines?', Concurrency: Pract. Exp., 6(2), 143-151 (1994).
24. C. Rodríguez, D. González, F. Almeida, J. Roda and F. García, 'Parallel algorithms for polyadic problems', 5th EUROMICRO Workshop on Parallel and Distributed Processing, 394-400, 1997.
25. F. Almeida, F. García, D. Morales and C. Rodríguez, 'A parallel algorithm for the integer knapsack problem for pipeline networks', J. Parallel Algorithms Appl., 6, 3-4 (1994).
26. J. A. Moreno, J. L. Roda and J. M. Moreno-Vega, 'Parallel genetic algorithm for the discrete p-median problem', Stud. Locat. Analy., (7), 131-141 (1995).
27. F. Almeida, F. Garcia, J. Roda, D. Morales and C. Rodríguez, 'A comparative study of two distributed systems: PVM and transputers', Transputers Applications and Systems '95, IOS Press, 244-258, 1995.
28. D. Morales, J. Roda, F. Almeida, C. Rodríguez and F. García, 'Integral knapsack problems: parallel algorithms and their implementations on distributed systems', Proceedings of the 1995 International Conference on Supercomputing, ACM Press, 218-226, 1995.
29. G. Mckeown, V. Rayward-Smith, A. Rush and H. Turpin, 'Using a transputer network to solve branch-and-bound problems', Proceedings of the TRANSPUTING '91 Conference, IOS Press, 781-800, 1991.