✦ LIBER ✦

Improved on-line broadcast scheduling with deadlines

✍ Scribed by Stanley P. Y. Fung; Feifeng Zheng; Wun-Tat Chan; Francis Y. L. Chin; Chung Keung Poon; Prudence W. H. Wong

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 391 KB
Volume: 11
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-007-0036-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line scheduling with tight deadlines

✍ Chiu-Yuen Koo; Tak-Wah Lam; Tsuen-Wan Ngan; Kunihiko Sadakane; Kar-Keung To 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 136 KB

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

On lazy bureaucrat scheduling with commo

On lazy bureaucrat scheduling with common deadlines

✍ Ling Gai; Guochuan Zhang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 264 KB

Simple On-Line Scheduling Algorithms for

Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks

✍ Marsan, Marco Ajmone ;Bianco, Andrea ;Leonardi, Emilio ;Neri, Fabio ;Nucci, Anto 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 891 KB

Batch scheduling with deadlines on paral

Batch scheduling with deadlines on parallel machines: An NP-hard case

✍ Mikhail Y. Kovalyov; Yakov M. Shafransky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 529 KB

The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. ( 1997) and Kovalyov and Shafransky ( 1994). A classification of computational complexities of special cases was provided only for the situation when all groups

Online real-time preemptive scheduling o

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

✍ Bhaskar Das Gupta; Michael A. Palis 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-