Effect of queueing disciplines on response times in distributed systems
Conference
·
OSTI ID:6773573
A distributed program consists of processes, many of which can execute concurrently on different processors in a distributed system of processors. When several processes from the same or different distributed programs have been assigned to a processor in a distributed system, the processor must select the next process to run. The question investigated is: What is an appropriate method for selecting the next process to run. Standard processor queueing disciplines, such as first-come-first-serve and round-robin-fixed-quantum, are studied. The results for four classes of queueing disciplines tested on three problems are presented. These problems were run on a testbed, consisting of a compiler and simulator used to run distributed programs on user-specified architectures.
- Research Organization:
- Texas Univ., Austin (USA). Dept. of Computer Sciences
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 6773573
- Report Number(s):
- LA-UR-84-1561; CONF-840869-1; ON: DE84012639
- Country of Publication:
- United States
- Language:
- English
Similar Records
On job assignment for a parallel system of processor sharing queues
Multiple customer-class LBPS queueing discipline. [Last Batch/Processor Sharing]
Evaluation of concurrent priority queue algorithms. Technical report
Journal Article
·
Sun Jul 01 00:00:00 EDT 1990
· IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)
·
OSTI ID:6569538
Multiple customer-class LBPS queueing discipline. [Last Batch/Processor Sharing]
Conference
·
Sun Dec 31 23:00:00 EST 1978
·
OSTI ID:6219149
Evaluation of concurrent priority queue algorithms. Technical report
Technical Report
·
Thu Jan 31 23:00:00 EST 1991
·
OSTI ID:5603266