Parametric Analysis of Static Load Balancing of Multi-Class Jobs in a Distributed Computer System

Chonggun KIM; Hisao KAMEDA

Parametric Analysis of Static Load Balancing of Multi-Class Jobs in a Distributed Computer System

Chonggun KIM, Hisao KAMEDA

Full Text Views

0

Cite this

Summary :

The effects of changing system parameters on job scheduling policies are studied for load balancing of multi-class jobs in a distributed computer system that consists of heterogeneous host computers connected by a single-channel communications network. A job scheduling policy decides which host should process the arriving jobs. We consider two job scheduling policies. The one is the overall optimal policy whereby jobs are scheduled so as to minimize the overall mean job response time. Tantawi and Towsley obtained the algorithm that gives the solution of the policy in the single class job environment and Kim and Kameda extended it to the multiple job class environment. The other is the individually optimal policy whereby jobs are scheduled so that every job may feel that its own expected response time is minimized. We can consider three important system parameters in a distributed computer system: the communication time of the network, the processing capacity of each node, and the job arrival rate of each node. We examine the effects of these three parameters on the two load balancing policies by numerical experiment.

Publication: IEICE TRANSACTIONS on Information Vol.E75-D No.4 pp.527-534

Publication Date: 1992/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computer Networks

Cite this

Copy

Chonggun KIM, Hisao KAMEDA, "Parametric Analysis of Static Load Balancing of Multi-Class Jobs in a Distributed Computer System" in IEICE TRANSACTIONS on Information, vol. E75-D, no. 4, pp. 527-534, July 1992, doi: .
Abstract: The effects of changing system parameters on job scheduling policies are studied for load balancing of multi-class jobs in a distributed computer system that consists of heterogeneous host computers connected by a single-channel communications network. A job scheduling policy decides which host should process the arriving jobs. We consider two job scheduling policies. The one is the overall optimal policy whereby jobs are scheduled so as to minimize the overall mean job response time. Tantawi and Towsley obtained the algorithm that gives the solution of the policy in the single class job environment and Kim and Kameda extended it to the multiple job class environment. The other is the individually optimal policy whereby jobs are scheduled so that every job may feel that its own expected response time is minimized. We can consider three important system parameters in a distributed computer system: the communication time of the network, the processing capacity of each node, and the job arrival rate of each node. We examine the effects of these three parameters on the two load balancing policies by numerical experiment.
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_4_527/_p

Copy

@ARTICLE{e75-d_4_527,
author={Chonggun KIM, Hisao KAMEDA, },
journal={IEICE TRANSACTIONS on Information},
title={Parametric Analysis of Static Load Balancing of Multi-Class Jobs in a Distributed Computer System},
year={1992},
volume={E75-D},
number={4},
pages={527-534},
abstract={The effects of changing system parameters on job scheduling policies are studied for load balancing of multi-class jobs in a distributed computer system that consists of heterogeneous host computers connected by a single-channel communications network. A job scheduling policy decides which host should process the arriving jobs. We consider two job scheduling policies. The one is the overall optimal policy whereby jobs are scheduled so as to minimize the overall mean job response time. Tantawi and Towsley obtained the algorithm that gives the solution of the policy in the single class job environment and Kim and Kameda extended it to the multiple job class environment. The other is the individually optimal policy whereby jobs are scheduled so that every job may feel that its own expected response time is minimized. We can consider three important system parameters in a distributed computer system: the communication time of the network, the processing capacity of each node, and the job arrival rate of each node. We examine the effects of these three parameters on the two load balancing policies by numerical experiment.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Parametric Analysis of Static Load Balancing of Multi-Class Jobs in a Distributed Computer System
T2 - IEICE TRANSACTIONS on Information
SP - 527
EP - 534
AU - Chonggun KIM
AU - Hisao KAMEDA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - July 1992
AB - The effects of changing system parameters on job scheduling policies are studied for load balancing of multi-class jobs in a distributed computer system that consists of heterogeneous host computers connected by a single-channel communications network. A job scheduling policy decides which host should process the arriving jobs. We consider two job scheduling policies. The one is the overall optimal policy whereby jobs are scheduled so as to minimize the overall mean job response time. Tantawi and Towsley obtained the algorithm that gives the solution of the policy in the single class job environment and Kim and Kameda extended it to the multiple job class environment. The other is the individually optimal policy whereby jobs are scheduled so that every job may feel that its own expected response time is minimized. We can consider three important system parameters in a distributed computer system: the communication time of the network, the processing capacity of each node, and the job arrival rate of each node. We examine the effects of these three parameters on the two load balancing policies by numerical experiment.
ER -