EDF is a classic dynamic embedded realtime multi-task scheduling algorithm. In an embedded soft real-time system, the deadline missing ratio is an important metric to evaluate system performance. When an embedded soft realtime system is overloaded, EDF algorithm is not effective. Considering the unsteadiness and unpredictability of a practical task running environment due to the unsteadiness of...

On parallel and distributed heterogeneous computing systems, a heuristic-based task scheduling algorithm typically consists of two phases: task prioritization and processor selection. In a heuristic based task scheduling algorithm, different prioritization will produce different makespan on a heterogeneous computing system. Therefore, a good scheduling algorithm should be able to efficiently as...

To deliver high performance in power limited systems, architects have turned to using heterogeneous systems, either CPU+GPU or mixed CPU-hardware systems. However, in systems with different processor types and task affinities, scheduling tasks becomes more challenging than in homogeneous multi-core systems or systems without task affinities. The problem is even more complex when specialized acc...

System virtualization provides low-cost, flexible and powerful executing environment for virtualized data centers, which plays an important role in the infrastructure of Cloud computing. However, the virtualization also brings some challenges, particularly to the resource management and task scheduling. This paper proposes an efficient dynamic task scheduling scheme for virtualized data centers...

Efficient scheduling is essential to exploit the tremendous potential of high performance computing systems. Scheduling tasks with precedence constraints is a well studied problem and a number of heuristics have been proposed. In this thesis, we first consider the problem of scheduling task graphs in heterogeneous distributed computing systems (HDCS) where the processors have different capabili...

The personnel task scheduling problem is a subject of commercial interest which has been investigated since the 1950s. This paper proposes an effective and efficient three-phase algorithm for solving the shift minimization personnel task scheduling problem (SMPTSP). To illustrate the increased efficacy of the proposed algorithm over an existing algorithm, computational experiments are performed...

A new hybrid algorithm is proposed in this paper. An independent task scheduling algorithm is designed based on the hybrid algorithm. The hybrid algorithm adopt list scheduling method to code harmony solution and convert harmony vector to priority-based independent task scheduling model, and perform variable neighborhood search on harmony solutions to improve Harmony Search efficiency and solut...

With the emergence of Cloud computing and Grid Computing, Distributed Scheduling (DS) problems have attracted attention by researchers in recent years. Distributed scheduling requires an uneven distribution of tasks on individual processors. Different heuristic based algorithms to perform the task scheduling have been proposed by the various researchers. This paper offers a new strategy for tas...

The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Sched...

Task scheduling plays an important part in the improvement of parallel and distributed systems. The problem of task scheduling has been shown to be NP hard. The time consuming is more to solve the problem in deterministic techniques. There are algorithms developed to schedule tasks for distributed environment, which focus on single objective. The problem becomes more complex, while considering ...