New parallel model for the analysis of asynchronous algorithms

Parallel Computing

Volumn 26, Issue 6, 2000, Pages 753-767

  Rodriguez C ^a   Roda, J L ^a   Sande, F ^a   Morales, D G ^a   Almeida, F ^a  

^a Fac Farmacia Univ L   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; DATA COMMUNICATION SYSTEMS; DYNAMIC PROGRAMMING; INTERFACES (COMPUTER); PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS); VIRTUAL REALITY;

MESSAGE PASSING INTERFACE; NESTED DATA PARALLELISM; PARALLEL VIRTUAL MACHINE; PROCESSOR VIRTUALIZATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0342573142     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00002-8     Document Type: Article

References (14)

1. A. Baümker, W. Dittrich, F. Meyer auf der Heide, Truly efficient parallel algorithms: c-Optimal multisearch for an extension of the BSP model, in: Proceedings of European Symposium on Algorithms, 1995, pp. 17-30.
2. D. Culler, K. Richard, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM SIGPLAN, Symposium on Principles and Practice of Parallel Programming. 1993.
3. F. Dehne, A. Fabri, A. Rau-Chaplin, Scalable parallel computational geometry for coarse grained multicomputers, in: Proceedings of ACM SCG, 1993, pp. 298-307.
4. M. Goudreau, K. Lang, S. Rao, Towards efficiency and portability: programming with the BSP model, in: Proceedings of SPAA'96: 8th Annual ACM SPAA, 1996, pp. 1-12.
5. 3: A parallel model for coarse-grained machines. J. Parallel and Distributed Computing. 32(2):1996;139-154.
6. J. Hill, S. Donaldson, Stability of communication performance in practice: from the CRAY-T3E to networks of workstations. Oxford University Computing Laboratory, PRG-TR-33-97, 1997.
7. B.H.H. Juurlink, H.A.G. Wijshoff, A quantitative comparison of parallel computation models, in: Proceedings of SPAA'96, 1996.
8. J. Marín, A. Martínez, Testing PVM versus BSP programming, VIII Jornadas de Paralelismo, 1997, pp. 153-160.
9. Pacheco P. Parallel Programming with MPI. 1997;Morgan Kauffman, Los Altos, CA.
10. C. Rodríguez, F. Sande, J.L. Roda, F. Almeida, L. García, M. Sánchez, C. León, F. García, D. González, Very high level and efficient programming with message passing libraries, Actas VIII Jornadas de Paralelismo, 1997.
11. J. Roda, C. Rodríguez, F. Almeida, D. Morales, Prediction of parallel algorithms performance on bus based networks using PVM, 6th Euromicro Workshop on Parallel and Distributed Processing Madrid, Spain. IEEE Computer Society Press, Silver Spring, 1998.
12. C. Rodríguez, F. Sande, C. Leon, L. García, Extending processor assignment statements, in: Proceedings of the Second European Conference on Parallel and Distributed Systems, Vienna, 1998.
13. D.B. Skillcorn, J. Hill, W.F. McColl, Questions and Answers about BSP, Oxford University Computing Laboratory, Report PRG-TR-15-96, 96.
14. Valiant L.G. A bridging model for parallel computation. Comm. ACM. 33(8):1990;103-111.