MARC record from Internet Archive

LEADER: 02033nam 2200289 a 45 0
001 a192470
008 971205s1985 cau b f000|0 eng d
040 $aCMontNP$cCMontNP
086 0 $aD 208.14/2:NPS-55-85-004
100 1 $aGaver, Donald Paul.
245 10 $a"Processor-shared time-sharing models in heavy traffic" /$cby Donald P. Gaver, Patricia A. Jacobs.
260 $aMonterey, Calif. :$bNaval Postgraduate School ;$aSpringfield, Va. :$bAvailable from National Technical Information Service,$c[1985]
300 $a53 p. ;$c28 cm.
500 $aTitle from cover.
500 $a"NPS-55-85-004."
500 $a"March 1985."
500 $aAD A159 314.
504 $aIncludes bibliographical references (p. 47-48).
520 $aProcessor sharing (PS) is a mathematically tractable approximation to time sharing, a procedure followed in many actual computer systems. In effect, PS assigns to each job of the i, (i = 1,2,...) present for processing 1/ith of the total processing effort; equivalently, a single job with Markovian service rate micron completes processing in (t, t+dt) with probability (micron/i)dt + o (dt). One advantage of PS is that short jobs are not trapped behind long jobs, as is possible in a FC-FS discipline. In this document probability models are presented for computer systems with processorshared(time sliced) service discipline. The response (sojourn) time of an arriving job that requires T units of processing time is shown to be approximately Gaussian/normal under moderately heavy traffic conditions, e.g. when the number of terminals becomes large. Keywords: Tables(data)
592 $aaq/ /aq cc:9116 12/05/97
650 4 $aMATHEMATICAL MODELS.
650 4 $aTIME SHARING.
700 1 $aJacobs, Patricia A.
710 2 $aNaval Postgraduate School (U.S.).$bDept. of Operations Research.
740 01 $aNPS-55-85-004.
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-55-85-004$dBOOK$eNEVER$f1
926 $aNPS-LIB$bFEDDOCS$cD 208.14/2:NPS-55-85-004$dBOOK$f2