Dynamic Remapping of Parallel Computations with Varying Resource Demands
IEEE Transactions on Computers
Optimal Dynamic Remapping of Data Parallel Computations
IEEE Transactions on Computers
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Concurrency: Practice and Experience
Efficient load balancing and data remapping for adaptive grid calculations
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Automated parallelization of discrete state-space generation
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Dynamic data distribution and processor repartitioning for irregularly structured computations
Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Load Balancing in Parallel Computers: Theory and Practice
Load Balancing in Parallel Computers: Theory and Practice
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Stochastic Prediction of Execution Time for Dynamic Bulk Synchronous Computations
The Journal of Supercomputing
Beyond Execution Time: Expanding the Use of Performance Models
IEEE Parallel & Distributed Technology: Systems & Technology
Stochastic Bounds for Parallel Program Execution Times with Processor Constraints
IEEE Transactions on Computers
Performance of Synchronous Parallel Algorithms with Regular Structures
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Synchronized Iterative Algorithms on Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Runtime Incremental Parallel Scheduling (RIPS) on Distributed Memory Computers
IEEE Transactions on Parallel and Distributed Systems
A Practical Approach to Dynamic Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
IEEE Transactions on Parallel and Distributed Systems
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Stochastic modeling and analysis of hybrid mobility in reconfigurable distributed virtual machines
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
Dynamic remapping is critical to the performance of bulk synchronous computations that have non-deterministic behaviors because of the need of barrier synchronization between phases. There are two basic issues in remapping: when and how to remap. This paper presents a formal analysis of the issue of when to remap for dynamic computations with a priori known statistical behaviors, with an objective of finding optimal remapping frequencies for a given tolerance of load imbalance. The problem is formulated as two complement sequential stochastic optimization. Since general optimization techniques tend to reveal stationary properties of the workload process, they are not readily applicable to the analysis of the effect of periodic remapping. Instead, this paper develops new analytical approaches to precisely characterize the transient statistical behaviors of the workload process on both homogeneous and heterogeneous machines. Optimal remapping frequencies are derived for various random workload change processes with known or unknown probabilistic distributions. They are shown accurate via simulations.