✦ LIBER ✦

Stable strategies for processor sharing systems

✍ Scribed by Moshe Haviv

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 315 KB
Volume: 52
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(91)90340-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Load balancing in processor sharing syst

Load balancing in processor sharing systems

✍ E. Altman; U. Ayesta; B. J. Prabhu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 761 KB

Power series approximations for two-clas

Power series approximations for two-class generalized processor sharing systems

✍ Joris Walraevens; J. S. H. van Leeuwaarden; Onno J. Boxma 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 560 KB

The processor-sharing queueing model for

The processor-sharing queueing model for time-shared systems with bulk arrivals

✍ L. Kleinrock; R. R. Muntz; E. Rodemich 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

Comparing Processor Allocation Strategie

Comparing Processor Allocation Strategies in Multiprogrammed Shared-Memory Multiprocessors

✍ Kelvin K. Yue; David J. Lilja 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 142 KB

A discrete shared processor model for DQ

A discrete shared processor model for DQDB

✍ Philip G. Potter; Moshe Zukerman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A constrained optimization problem for a

A constrained optimization problem for a processor sharing queue

✍ Peter De Waal 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 765 KB

In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or reject