On job assignment for a parallel system of processor sharing queues

Journal Article · Sun Jul 01 04:00:00 EDT 1990 · IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)

DOI:https://doi.org/10.1109/12.55688· OSTI ID:6569538

Bonomi, F ^[1]

---

1. AT and T Bell Labs., Holmdel, NJ (USA)

Interest in the job assignment problem for parallel queues has been recently stimulated by research in the area of load balancing in distributed systems, where one is concerned with assigning tasks or processes to processors in order to achieve optimal system performance. However, most of the studies found in the literature refer to a system of parallel queues with FCFS service discipline, while it is well known that the processors sharing (PS) service discipline is often a better model for CPU scheduling in time-shared computer systems. In this paper, the authors underline some interesting peculiarities of the assignment problem with PS queues as compared to the usual case of the FCFS systems. Also, they propose an approach to the design of assignment algorithms which, in this case, produces solutions performing better than the well-known join-the-shortest-queue (JSQ) assignment rule.

• OSTI ID: 6569538
• Journal Information: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA), Journal Name: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA) Vol. 39:7; ISSN ITCOB; ISSN 0018-9340
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTERS
DATA PROCESSING
DIGITAL COMPUTERS
DISTRIBUTED DATA PROCESSING
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
SUPERCOMPUTERS