Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Adaptively Scheduling Parallel Loops in Distributed Shared-Memory Systems
IEEE Transactions on Parallel and Distributed Systems
A parallel iterative linear system solver with dynamic load balancing
ICS '98 Proceedings of the 12th international conference on Supercomputing
Parallel programming: techniques and applications using networked workstations and parallel computers
IEEE Transactions on Parallel and Distributed Systems
Balancing load versus decreasing communication: parameterizing the tradeoff
Journal of Parallel and Distributed Computing
Observations on Using Genetic Algorithms for Dynamic Load-Balancing
IEEE Transactions on Parallel and Distributed Systems
Impact of Workload and System Parameters on Next Generation Cluster Scheduling Mechanisms
IEEE Transactions on Parallel and Distributed Systems
Task assignment with unknown duration
Journal of the ACM (JACM)
Parallel Processing of Adaptive Meshes with Load Balancing
IEEE Transactions on Parallel and Distributed Systems
SimpleFit: A Framework for Analyzing Design Trade-Offs in Raw Architectures
IEEE Transactions on Parallel and Distributed Systems
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Handbook on Parallel and Distributed Processing
Handbook on Parallel and Distributed Processing
Resource Management in Real-Time Systems and Networks
Resource Management in Real-Time Systems and Networks
Diffusive Load-Balancing Policies for Dynamic Applications
IEEE Concurrency
Distributed Load Balancing for Parallel Main Memory Hash Join
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
Hi-index | 0.00 |
In this paper, a parallel dynamic load balancing algorithm; which offers a good trade-off between the balancing degree and communication costs; is proposed. The proposed algorithm is analyzed, investigated, and implemented. Also, a new mathematical solution for that algorithm is presented. The analytical solution is tested on standard task graphs (STG) as common test-bed benchmarks. All the different parameters concerned with processors, memory, interconnection networks, and task programs are also presented. The new proposed algorithm is compared and evaluated with a traditional dynamic load balancing one. Experimental results are presented by considering a set of criteria for evaluating the overall performance. Simulation and analytical results proved that the proposed algorithm outperforms the chosen one.