✦ LIBER ✦

Preemptive scheduling with finite capacity input buffers

✍ Scribed by Nicholas G. Hall; Marc E. Posner; Chris N. Potts

Book ID: 110380599
Publisher: Springer US
Year: 1997
Tongue: English
Weight: 93 KB
Volume: 70
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018990625142

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Job-shop scheduling with limited capacit

Job-shop scheduling with limited capacity buffers

✍ Peter Brucker; Silvia Heitmann; Johann Hurink; Tim Nieberg 📂 Article 📅 2006 🏛 Springer 🌐 German ⚖ 265 KB

Optimum scheduling and memory management

Optimum scheduling and memory management in input queued switches with finite buffer space

✍ Sarkar, S. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 606 KB

Scheduling flowshops with finite buffers

Scheduling flowshops with finite buffers and sequence-dependent setup times

✍ Bryan A Norman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 145 KB

In this paper we explore ¯owshop scheduling problems containing both sequence-dependent setup times and ®nite buers. To the best of our knowledge, problems containing both of these complexities have not been addressed previously in the literature. The problem is clearly NP-hard and therefore we only

Buffer Amplifier with Femtofarad Input C

Buffer Amplifier with Femtofarad Input Capacity Using Operational Amplifiers

✍ Kootsey, J. Mailen; Johnson, Edward A. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 932 KB

Scheduling Divisible Loads with Processo

Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks

✍ Veeravalli Bharadwaj; Gerassimos Barlas 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 262 KB

An analytical model for Network-on-Chip

An analytical model for Network-on-Chip with finite input buffer

✍ Wang, Jian ;Li, Yu-bai ;Wu, Chang 📂 Article 📅 2010 🏛 Higher Education Press and Springer 🌐 English ⚖ 390 KB