Title
Turnaround time for messages of differing priorities
Abstract
Queuing theory and statistical methods are used in this paper to derive formulas for determining average turnaround time in teleprocessing systems that handle messages on a priority basis. This information is needed to ensure, for example, that messages are processed within acceptable time limits and that eficient use is made of system resources. Factors considered in arriving at the formulas described here include waiting time in message queues, message processing time, I/O waiting time, and delays for higher priority processing. Results conform closely with those obtained from simulation studies.
Year
DOI
Venue
1968
10.1147/sj.72.0103
IBM Systems Journal
Keywords
Field
DocType
simulation study,higher priority processing,message processing time,queuing theory,priority basis,average turnaround time,acceptable time limit,eficient use,message queue,statistical method
Message processing,Computer science,Message queue,Queueing theory,Turnaround time,Distributed computing
Journal
Volume
Issue
ISSN
7
2
0018-8670
Citations 
PageRank 
References 
2
1.50
0
Authors
1
Name
Order
Citations
PageRank
Hauth, C.121.50