Efficient parallel algorithms for numerical simulation

Future Generation Computer Systems

Volumn 17, Issue 8, 2001, Pages 961-967

  Lecomber, David ^a   Rudgyard, Mike ^b  

^a TRINITY COLLEGE   (United Kingdom)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Multi set median finding problem; Numerical simulations; Parallel algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; PARALLEL ALGORITHMS; PROBLEM SOLVING;

MULTI-SET MEDIAN-FINDING PROBLEMS; MULTILEVEL PARTITIONING METHOD;

PARALLEL PROCESSING SYSTEMS;

EID: 0035371415     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(01)00038-3     Document Type: Article

References (14)

1. Farhat C. A simple and efficient automatic FEM domain decomposer. Comput. Struct. 28(5):1988;579-602.
2. A. Geist, A. Beguelin, J. Dongarra, J. Weicheng, R. Manchek, V. Sunderam, PVM: A Users Guide and Tutorial for Networked Parallel Computing, MIT Press, Cambridge, MA, 1994.
3. A.V. Gerbessiotis, C.J. Siniolakis, Deterministic sorting and randomized median finding on the BSP model, in: Proceedings of the Eighth ACM Symposium on Parallel Algorithms and Architectures (SPAA'96), ACM Press, New York, June 1996.
4. B. Hendrickson, Graph partitioning and parallel solvers: has the emperor no clothes, in: Proceedings of the Irregular'98, 1998.
5. J.M.D. Hill, D.B. Skillicorn, Lessons learned from implementing BSP, Lecture Notes in Computer Science, Vol. 1225, 1997, 762 pp.
6. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
7. G. Karypis, V. Kumar, Parallel multilevel k-way partitioning scheme for irregular graphs, in: Proceedings of the Supercomputing'96, 1996.
8. Kernighan B.W., Lin S. An efficient heuristic for partitioning graphs. Bell Syst. Tech. J. 49(2):1970;291-307.
9. D. Lecomber, M. Rudgyard, Algorithms for generic tools in parallel numerical simulation, in: Proceedings of HPCN Europe 2000, Lecture Notes in Computer Science, Vol. 1823, Springer, Berlin, May 2000.
10. W.F. McColl, Scalable computing, Lecture Notes in Computer Science, Vol. 1000, 1995, p. 46.
11. M. Rudgyard, D. Lecomber, T. Schönfeld, The COUPL+ User Manual, 1998.
12. Simon H.D. Partitioning of unstructured problems for parallel processing. Comput. Syst. Eng. 36(5):1991;745-764.
13. M. Snir, S.W. Otto, S. Huss-Lederman, D.W. Walker, J. Dongarra, MPI: The Complete Reference, MIT Press, Cambridge, MA, 1995.
14. Valiant L. A bridging model for parallel computation. Commun. ACM. 33(8):1990;103-111.