This article presents and evaluates the Slack Method, a new constructive heuristic for the allocation (mapping) of periodic hard realtime tasks to multiprocessor or distributed systems. The Slack Method is based on task deadlines, in contrast with other constructive heuristics, such as List Processing. The presented evaluation shows that the Slack Method is superior to list-processing-based approaches with regard to both finding more feasible solutions as well as finding solutions with better objective function values. In a comparative survey we evaluate the Slack Method against several alternative allocation techniques. This includes comparisons with optimal algorithms, non-guided search heuristics (e.g. Simulated Annealing), and other con...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
A static scheduling algorithm is presented for off-line scheduling of tasks in distributed hard real...
A static algorithm for allocating and scheduling components of complex periodic tasks across sites i...
This report addresses the problem of jointly scheduling tasks with both hard and soft time constrai...
Abstract—In this paper, multiprocessor scheduling of a set of real-time periodic tasks with implicit...
We present an optimal solution to the problem of allocating communicating periodic tasks to heteroge...
In this paper we present a low-cost Slack-Stealing method, named Fast Slack, to be employed in a Fix...
This paper describes a heuristic approach for solving the problem of dynamically scheduling tasks in...
Abstract*. We present a method for producing heuristics to direct the search for solutions in task a...
In this paper we present a new search method for par-titioning and scheduling a set of periodic task...
The application of optimal search strategies to scheduling for distributed real-time systems is, in ...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
A static scheduling algorithm is presented for off-line scheduling of tasks in distributed hard real...
A static algorithm for allocating and scheduling components of complex periodic tasks across sites i...
This report addresses the problem of jointly scheduling tasks with both hard and soft time constrai...
Abstract—In this paper, multiprocessor scheduling of a set of real-time periodic tasks with implicit...
We present an optimal solution to the problem of allocating communicating periodic tasks to heteroge...
In this paper we present a low-cost Slack-Stealing method, named Fast Slack, to be employed in a Fix...
This paper describes a heuristic approach for solving the problem of dynamically scheduling tasks in...
Abstract*. We present a method for producing heuristics to direct the search for solutions in task a...
In this paper we present a new search method for par-titioning and scheduling a set of periodic task...
The application of optimal search strategies to scheduling for distributed real-time systems is, in ...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
A static scheduling algorithm is presented for off-line scheduling of tasks in distributed hard real...