Scheduling parallel tasks with individual deadlines
نویسندگان
چکیده
منابع مشابه
Scheduling Tasks With Variable Deadlines
Traditional real-time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real-time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications. Because the states of the objects change with time, the dead...
متن کاملOnline Scheduling of Parallel Communications with Individual Deadlines
We consider the online competitiveness for scheduling a set of communication jobs (best described in terms of a weighted graph where nodes denote the communication agents and edges denote communication jobs and three weights associated with each edge denote its length, release time, and deadline, respectively), where each node can only send or receive one message at a time. A job is accepted if...
متن کاملScheduling parallel Kalman filters with quantized deadlines
In this paper we explore the problem of scheduling parallel processes of Kalman filters to meet individual estimation error requirements. It is assumed that at each time-step measurements of only one process are received. We define real-time deadlines of transmissions and convert the problem into arranging sequence of tasks with corresponding deadlines. To reduce computations, cycles of transmi...
متن کاملOnline Parallel Machine Scheduling With Hard Deadlines
This paper considers the problem of online job scheduling on M identical machines with hard deadlines. The processing time and delay time of a job are known only on its arrival. Jobs are discarded if they do not meet delay time requirement. The objective of the present work is to minimize the number of tardy jobs. A lower bound of competitive ratio when the processing time and delay time are bo...
متن کاملScheduling Interval Ordered Tasks with Non-Uniform Deadlines
Garey and Johnson defined an algorithm that finds minimum-lateness schedules for arbitrary graphs with unit-length tasks on two processors. Their algorithm can be easily generalised to an algorithm that constructs minimumlateness schedules for interval orders on m processors. In this paper, we study the problem of scheduling interval orders with deadlines without neglecting the communication co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00178-3