ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Drafting Algorithm for Load Balancing
IEEE Transactions on Software Engineering
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Parallel discrete-event simulation of FCFS stochastic queueing networks
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
GAMMON: A Load Balancing Strategy for Local Computer Systems with Multiaccess Networks
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimization by simulated evolution with applications to standard cell placement
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
The cost of conservative synchronization in parallel discrete event simulations
Journal of the ACM (JACM)
The communication challenge for MPP: Intel Paragon and Meiko CS-2
Parallel Computing
A static partitioning and mapping algorithm for conservative parallel simulations
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Automated parallelization of timed Petri-net simulations
Journal of Parallel and Distributed Computing
Automated load balancing in SPEEDES
WSC '95 Proceedings of the 27th conference on Winter simulation
A comparison of two methods for advancing time in parallel discrete event simulation
WSC '95 Proceedings of the 27th conference on Winter simulation
Experiments in automated load balancing
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Dynamic load balancing strategies for conservative parallel simulations
Proceedings of the eleventh workshop on Parallel and distributed simulation
Grain Size Determination for Parallel Processing
IEEE Software
On Process Migration and Load Balancing in Time Warp
IEEE Transactions on Parallel and Distributed Systems
An adaptive partitioning algorithm for distributed discrete event simulation systems
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
An Empirical Investigation of Load Indices for Load Balancing Applications
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
The use of copy-on-reference in a process migration system
The use of copy-on-reference in a process migration system
Parallel simulation on the hypercube multiprocessor
Distributed Computing
HPPNetSim: a parallel simulation of large-scale interconnection networks
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Simulation environment configuration for parallel simulation of multicore embedded systems
Proceedings of the 48th Design Automation Conference
Hi-index | 0.00 |
This paper studies the problem of load balancing for conservative distributed simulations for execution on a multicomputer architecture. The synchronization protocol makes use of Chandy-Misra null messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length which indicates the workload at each processor.We examine two variations of the algorithm--referred to as the centralized and multi-level hierarchical methods--and experiment with four simulation workload models to study the scalability of our algorithm. The experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40% the synchronization overhead when compared to the use of a static partitioning algorithm. The results also indicate that the hierarchical version outperforms both the centralized version of the dynamic load balancing algorithm and the static partitioning scheme.