✦ LIBER ✦

On-line scheduling with tight deadlines

✍ Scribed by Chiu-Yuen Koo; Tak-Wah Lam; Tsuen-Wan Ngan; Kunihiko Sadakane; Kar-Keung To

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 136 KB
Volume: 295
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00407-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Nonpreemptive LCFS Scheduling with De

On Nonpreemptive LCFS Scheduling with Deadlines

✍ U. Schmid; J. Blieberger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 947 KB

We investigate some real time behaviour of a (discrete time) single server system with nonpreemptive LCFS task scheduling. The main results deal with the probability distribution of a random variable \(\operatorname{SRD}(T)\), which describes the time the system operates without any violation of a f

Scheduling with tails and deadlines

✍ Francis Sourd; Wim Nuijten 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 299 KB

Online Scheduling with Hard Deadlines

✍ Sally A Goldman; Jyoti Parwatikar; Subhash Suri 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We study non-preemptive, online admission control in the hard deadline model: each job must either be serviced prior to its deadline or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it ne

Parallel machine batching and scheduling

Parallel machine batching and scheduling with deadlines

✍ T. C. Edwin Cheng; Mikhail Y. Kovalyov 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 137 KB 👁 1 views

In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled

The basic cyclic scheduling problem with

The basic cyclic scheduling problem with deadlines

✍ Philippe Chretienne 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 971 KB

Preemptive scheduling with release times

Preemptive scheduling with release times and deadlines

✍ Kwang Soo Hong; Joseph Y-T. Leung 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 905 KB

We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms ex