A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
Compile-Time Scheduling and Assignment of Data-Flow Program Graphs with Data-Dependent Iteration
IEEE Transactions on Computers
Multiprocessor scheduling to account for interprocessor communication
Multiprocessor scheduling to account for interprocessor communication
Machines and models for parallel computing
International Journal of Parallel Programming
Distributed Hardwired Barrier Synchronization for Scalable Multiprocessor Clusters
IEEE Transactions on Parallel and Distributed Systems
Dynamic Task Allocation Models for Large Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers
IEEE Transactions on Parallel and Distributed Systems
How Network Topology Affects Dynamic Load Balancing
IEEE Parallel & Distributed Technology: Systems & Technology
Grain Size Determination for Parallel Processing
IEEE Software
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Load Sharing in Distributed Systems
IEEE Transactions on Computers
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
The design and implementation of an operating system to support distributed multimedia applications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper we have introduced the K1 heuristic algorithm for dynamic task scheduling with precedence constraints and communication delays. The execution of a task set repeats in cycles, while the execution and communication profile of a task set changes in time. During a task set execution, a new schedule is generated by tuning the previous schedule. The scheduling is distributed - performed on the processors of a highly parallel computer architecture. The goal is to reduce a dominant sequence of a task set during run-time. Only the tasks that can have an influence on dominant sequence reduction are considered for reordering/migration. The applied techniques are load balancing, task reordering, and data-wait reduction. Simulation is used for the algorithm validation and evaluation.