W. Haque


  1. [1] W. Gropp, E. Lusk, & A. Skjellum, Using MPI: Portable parallel programming with the message passing interface, 2nd ed. (Cambridge, MA: MIT Press, 1999).
  2. [2] M. Snir, S. Otto, S. Huss-Ledeman, D. Walker, & J. Dongarra, MPI: The complete reference, 2nd ed. (Cambridge, MA: MIT Press, 1998).
  3. [3] P.S. Pacheco, Parallel programming with MPI (San Francisco: Morgan Kaufman, 1997).
  4. [4] Message Passing Interface Forum, docs/docs.html.
  5. [5] R.H.B. Netzer, Optimal tracing and replay for debugging shared-memory parallel programs, Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, San Diego, 1993, 1–11. doi:10.1145/174266.174268
  6. [6] S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, & T. Anderson, Eraser: a dynamic data race detector for multithreaded programs, ACM Trans. on Computer Systems, 15 (4), 1997, 391–411. doi:10.1145/265924.265927
  7. [7] S. Huband & C. MacDonald, Debugging parallel programs using incomplete information, Proc. 1st IEEE Computer Society Int. Workshop on Cluster Computing, Melbourne, Australia, 1999, 278–286. doi:10.1109/IWCC.1999.810897
  8. [8] J. Zhou & K. Tai, Deadlock analysis of synchronous messagepassing programs, Proc. Int. Symp. on Software Engineering for Parallel and Distributed Systems, Los Angeles, 1999, 62–71. doi:10.1109/PDSE.1999.779739
  9. [9] G. Luecke, Y. Zou, J. Coyle, J. Hoekstra, & M. Kraeva, Deadlock detection in MPI programs, Concurrency and Computation: Practice and Experience, 14(11), 2002, 911–932. doi:10.1002/cpe.701
  10. [10] J.S. Vetter & B.R. de Supinski, Dynamic software testing of MPI applications with Umpire, Proc. Supercomputing 2000, Dallas, TX, 2000.
  11. [11] MPICH Test Suite available at mpi/mpi-test/tsuite.html.
  12. [12] NAS Parallel Benchmarks available at http://www.nas.nasa. gov/Software/NPB.
  13. [13] R. Reusser, P. Sanders, L. Prechelt, & M. Muller, SKaMPI: A detailed, accurate MPI benchmark, Proc. EuroPVM/MPI, University of Liverpool, UK, 1998, 52–59.
  14. [14]∼haque/mpidd_perf.

Important Links:

Go Back