Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job...

Scheduling complex problem solving tasks, where tasks are interrelated and there are multiple diierent ways to go about achieving a particular task, is an imprecise science and the justiication for this lies soundly in the combinatorics of the scheduling problem. Intractable problems require approximate solutions. We have developed a new domain-independent approach to task scheduling called Des...

The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision fo r a given real-time task system b y the rate monotonic scheduling algorithm. It presents a new necessary a n d suficient condition fo r a given task system to be feasible, and a new feasibility decision algorithm based on that cond...

One of critical issues aaecting parallel system performance is the scheduling of tasks onto available target processors. A great number of algorithms and software tools have been presented to deal with the task scheduling problem in parallel processing. In this paper, we study a general (less-restricted) scheduling case, named \conditional task scheduling", in which the task model of each progr...

This paper presents a technique to be applied to list scheduling algorithms which significantly reduces scheduling costs without sacrificing performance. In list scheduling algorithms, at each scheduling step one task is scheduled to the processor on which the task achieves the earliest start time. As a result, each task is tentatively scheduled to each processor to find the destination process...

Task Scheduling [1] is the allocation of resources over time to perform a collection of tasks. Real -time systems make use of scheduling algorithms to maximize the number of real -time tasks that can be processed without violating timing constraints. A scheduling algorithm provides a schedule for a task set that assigns tasks to processors and provides an ordered list of tasks. The schedule is ...

A task scheduling simulator for timing analysis of the various task sets with different scheduling policies was implemented and tested. The simulator supports the various scheduling policies like Rate Monotonic, deadline monotonic and EDF, widely used for scheduling real time applications. It simulates the task execution for the time period, and then it outputs the time based representation of ...

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the s...

Real-time systems and networks are of increasing importance in many applications, including automated factories, telecommunication systems, defense systems, and space systems. This book introduces the concepts and state-of-the-art research developments of resource management in real-time systems and networks. Unlike other texts in the field, it covers the entire spectrum of issues in resource m...

Task scheduling problem is one of the most important steps in using cloud computing environment capabilities. Different experiments show that although having an optimum solution is almost impossible but having a sub-optimal solution using heuristic algorithms seems possible. In this paper three heuristic approaches for task scheduling on cloud environment have been compared with each other. The...