article

Free access

Computer Time-Sharing Queues with Priorities

Author:

Igal AdiriAuthors Info & Claims

Journal of the ACM (JACM), Volume 16, Issue 4

Pages 631 - 645

https://doi.org/10.1145/321541.321552

Published: 01 October 1969 Publication History

PDF eReader

Abstract

The paper deals with computer time-sharing disciplines in which external priorities are introduced. For a computer system under a time-sharing discipline, the following priority disciplines are discussed: (a) head-of-the-line; (b) preemptive repeat; and (c) mixed preemptive strategy. All models in question assume that customers arrive according to homogeneous Poisson processes, and that service times are mutually independent exponentially distributed random variables. Results are given in terms of steady-state expectations.

References

[1]

ADIRI, I. A time-sharing queue with preemptive resume priority discipline. The Israel J. of Tech. 6, 5 (1968), 277-282.

Google Scholar

[2]

ADIRI, I., AND AV{-ITZHAK, B. A time-sharing queue. Mimeograph Series No. 5 of Oper. Res., Stat. and Econ. Dep. of lndustr, and Mgmt. Eng., Teehnioa. To appear in Management Science).

Google Scholar

[3]

AVI-ITzHAK, B. Preemptive repeat priority queues as a special case of the multipurpose server problem, I and II. Oper. Res. 11, 4 (1963), 597-619.

Google Scholar

[4]

AVI-ITZHAK, B., AND NAOR, P. Some queueing problems with the service station subject to breakdown. Oper. Res. 11,3(1963), 303-320.

Google Scholar

[5]

COBHAM, A. Priority assignment in waiting line problems. Oper. Res., 2, 1 (1954) 70-76.

Google Scholar

[6]

LITTLE, J. D. C. A proof for the queueing formula L = kW. Oper. Res. 9, 3(1961), pp. 383-387.

Google Scholar

[7]

SCHRAGE, L. E. Some queueing models for time-shared facility. Ph.D. Th., Cornell U., Ithaca, N. Y., Feb. 1966.

Google Scholar

[8]

WELCH, P.D. On a generalized M/G/1 queueing process in which the first customer of each busy period received exceptional service. Oper. Res. 12, 5(1964), 736-752.

Google Scholar

Cited By

View all

McGuffee JCabezas R(2006)Starvation-proof priority round-robin queues for time-sharing systemsJournal of Computing Sciences in Colleges10.5555/1127389.112743621:4(253-258)Online publication date: 1-Apr-2006
https://dl.acm.org/doi/10.5555/1127389.1127436
Vinyes-Sanz JRiera-Garcia J(1986)Waiting times in a transport protocol entity schedulerACM SIGCOMM Computer Communication Review10.1145/15706.1570716:5(4-12)Online publication date: 1-Nov-1986
https://dl.acm.org/doi/10.1145/15706.15707
Reddi A(1986)Microcomputer memory performance in a resource sharing distributed information processing enviornmentMicroprocessing and Microprogramming10.1016/0165-6074(86)90121-317:3(129-137)Online publication date: 1-Mar-1986
https://dl.acm.org/doi/10.1016/0165-6074%2886%2990121-3
Show More Cited By

Index Terms

Computer Time-Sharing Queues with Priorities
1. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory

Recommendations

Some Waiting-Time Distributions for Queues with Multiple Feedback and Priorities

This paper considers a single-server queue where incoming calls require exactly N services before leaving the system. Each service has a certain priority in relation to all other services, the server always accepting for service the call at the head of ...
Feedback queues with preemption-distance priorities
SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

The method of moments is used to derive exact analytical solutions for an open priority queueing system with preemption-distance priorities and feedback. Customers enter from outside in a Poisson stream. They can feed back for several times, changing ...
A Time-Sharing Model with Many Queues

This paper presents a mathematical study of a time-sharing system with a single server and many queues. In each queue a customer receives one quantum of service and is then sent to the end of the next queue, provided his service demand has not been ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 16, Issue 4

Oct. 1969

132 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321541

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1969

Published in JACM Volume 16, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
385
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)8

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

McGuffee JCabezas R(2006)Starvation-proof priority round-robin queues for time-sharing systemsJournal of Computing Sciences in Colleges10.5555/1127389.112743621:4(253-258)Online publication date: 1-Apr-2006
https://dl.acm.org/doi/10.5555/1127389.1127436
Vinyes-Sanz JRiera-Garcia J(1986)Waiting times in a transport protocol entity schedulerACM SIGCOMM Computer Communication Review10.1145/15706.1570716:5(4-12)Online publication date: 1-Nov-1986
https://dl.acm.org/doi/10.1145/15706.15707
Reddi A(1986)Microcomputer memory performance in a resource sharing distributed information processing enviornmentMicroprocessing and Microprogramming10.1016/0165-6074(86)90121-317:3(129-137)Online publication date: 1-Mar-1986
https://dl.acm.org/doi/10.1016/0165-6074%2886%2990121-3
Chua YBernstein A(1974)Analysis of a Feedback SchedulerSIAM Journal on Computing10.1137/02030123:3(159-176)Online publication date: 1-Sep-1974
https://dl.acm.org/doi/10.1137/0203012
Kovalenko I(1974)Queueing theoryJournal of Soviet Mathematics10.1007/BF010838692:1(1-66)Online publication date: 1974
https://doi.org/10.1007/BF01083869
Losapio NBulgren WDonovan J(1972)Simulation of dispatching algorithms in a multiprogramming environmentProceedings of the ACM annual conference - Volume 210.1145/800194.805879(903-913)Online publication date: 1-Aug-1972
https://dl.acm.org/doi/10.1145/800194.805879
Heacox HPurdom P(1972)Analysis of Two Time-Sharing Queueing ModelsJournal of the ACM10.1145/321679.32168619:1(70-91)Online publication date: 1-Jan-1972
https://dl.acm.org/doi/10.1145/321679.321686

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Some Waiting-Time Distributions for Queues with Multiple Feedback and Priorities

Feedback queues with preemption-distance priorities

A Time-Sharing Model with Many Queues

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations