Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers
SIAM Journal on Computing
Interprocessor communication with memory constraints
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Partitioning for Complex Objectives
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Pursuing scalability for hypre's conceptual interfaces
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
An assumed partition algorithm for determining processor inter-communication
Parallel Computing
MADRE: The Memory-Aware Data Redistribution Engine
Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Fine-Grained Data Distribution Operations for Particle Codes
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A Memory-Efficient Data Redistribution Algorithm
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Madre: the Memory-Aware Data Redistribution Engine
International Journal of High Performance Computing Applications
An assumed partition algorithm for determining processor inter-communication
Parallel Computing
An in-place algorithm for irregular all-to-all communication with limited memory
EuroMPI'10 Proceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface
Energy-efficient data redistribution in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Optimizing Memory Constrained Environments in Monte Carlo Nuclear Reactor Simulations
International Journal of High Performance Computing Applications
| Hi-index | 0.00 |
Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages. We propose a model for optimizing the exchange of messages under such circumstances which we call the minimum phase remapping problem. We first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, we show how the problem can be phrased as an instance of multicommodity flow. Next, we study a continuous approximation to the problem. We show that this continuous approximation has a solution which requires at most two more phases than the optimal discrete solution, but the question of how to consistently obtain a good discrete solution from the continuous problem remains open. We also devise a simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases. We also present an empirical study of variations of our algorithms which indicate that our approaches are quite practical.