The normal approximation and queue control for response times in a processor-shared computer system model
Loading...
Authors
Gaver, Donald Paul
Jacobs, Patricia A.
Latouche, Guy
Subjects
Processor-sharing queues
job response time
central limit theorem; diffusion approximation
queue control
job response time
central limit theorem; diffusion approximation
queue control
Advisors
Date of Issue
1984-02
Date
1984-02
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Represent a time-shared computer system as a group of N terminals, each
having submission rate A and exponential (u) task durations, with tasks submitted
to a central (single) processor. There they are serviced in processorsharing
or time-sliced mode. It is shown that the R(t), the response time
conditional on t , the required processing time, becomes approximately normally
distributed as t increases. Similar results are. derived when N increases.
Variations of the model consider control: an "inside," processor-shared
queue services at most c tasks, others queueing first-come first-served "outside." Other possibilities are described and analyzed.
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS55-84-001
Sponsors
prepared with the partial support of the Probahility and
Statistics Program of the Office of Naval Research, Arlington, VA
Funder
N0001484WR24011
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
