Interprocessor communication with limited memory

IEEE Transactions on Parallel and Distributed Systems

Volumn 15, Issue 7, 2004, Pages 606-616

  Pinar, Ali ^a   Hendrickson, Bruce ^a  

^a IEEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

APPROXIMATION ALGORITHMS; DATA MIGRATION; DYNAMIC LOAD BALANCING; INTERPROCESSOR COMMUNICATION; MINIMUM PHASE REMAPPING PROBLEM; MULTICOMMODITY FLOW FORMULATION;

PARALLEL PROCESSING SYSTEMS;

EID: 3242676274     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2004.22     Document Type: Article

References (10)

1. G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel Distributed Computing, vol. 7, pp. 279-301, 1989.
2. B. Hendrickson and K. Devine, "Dynamic Load Balancing in Computational Mechanics," Computer Methods in Applied Mechanics and Eng., vol. 184, nos. 2-4, pp. 485-500, 2000.
3. K.D. Devine, B. Hendrickson, E.G. Boman, M.M. St. John, and C. Vaughan, "Zoltan: A Dynamic Load-Balancing Library for Parallel Applications - User's Guide," Technical Report SAND99-1377, Sandia Nat'l Laboratories, Albuquerque, New Mexico, http://www.cs.sandia.gov/Zoltan/, 1999.
4. A. Pinar and B. Hendrickson, "Interprocessor Communication with Memory Constraints," Proc. 12th ACM Symp. Parallel Algorithms and Architectures, pp. 39-45, July 2000.
5. A. Pinar and B. Hendrickson, "Communication Support for Adaptive Computation," Proc. 10th SIAM Conf. Parallel Processing for Scientific Computing, Mar. 2001.
6. R. Cypher and S. Konstantinidou, "Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers," SIAM J. Computing, vol. 25, no. 5, pp. 1082-1104, 1996.
7. J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes, "On Algorithms for Efficient Data Migration," Proc. Symp. Discrete Algorithms, 2001.
8. R.M. Karp, "Reducibility among Combinatorial Problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., pp. 85-103, New York: Plenum Press, 1972.
9. R.K. Ahuja, R.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications. Englewood Cliffs, N.J.: Prentice Hall, 1993.
10. A. Pinar and B. Hendrickson, "Partitioning for Complex Objectives," Proc. 15th Int'l Parallel and Distributed Processing Symp., 2001.