"Processor-shared time-sharing models in heavy traffic"
Our rough guess is there are 13,250 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 53 minutes to read. With a half hour per day, this will take 2 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Jacobs, Patricia A. - Contributor
- Naval Postgraduate School (U.S.). Dept. of Operations Research - Contributor
Publication
1985 - Available from National Technical Information Service, Monterey, Calif, California
Language
English
Word Count
13,250 words, Guess
Page Count
53 pages
Identifiers
- Internet Archiveprocessorsharedt00gave
- Open LibraryOL25484006M
Alternate Titles
- NPS-55-85-004.
Description
Processor 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)
Subjects
Topics
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!