This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1991 Third IEEE Symposium on Parallel and Distributed Processing
A decentralized task scheduling algorithm and its performance modeling for computer networks
Dallas, Texas USA
December 02-December 05
ISBN: 0-8186-2310-1
ASCII Text
x 
 
Ahmad, Ghafoor, Mehrotra, "A decentralized task scheduling algorithm and its performance modeling for computer networks," Parallel and Distributed Processing, IEEE Symposium on, pp. 314-321, 1991 Third IEEE Symposium on Parallel and Distributed Processing, 1991.
 
 
BibTex
x
 
@article{ 10.1109/SPDP.1991.218225,
author = { Ahmad and Ghafoor and Mehrotra},
title = {A decentralized task scheduling algorithm and its performance modeling for computer networks},
journal ={Parallel and Distributed Processing, IEEE Symposium on},
volume = {0},
year = {1991},
isbn = {0-8186-2310-1},
pages = {314-321},
doi = {http://doi.ieeecomputersociety.org/10.1109/SPDP.1991.218225},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing, IEEE Symposium on
TI - A decentralized task scheduling algorithm and its performance modeling for computer networks
SN - 0-8186-2310-1
SP314
EP321
A1 - Ahmad,
A1 - Ghafoor,
A1 - Mehrotra,
PY - 1991
KW - scheduling queues
KW - decentralized task scheduling algorithm
KW - performance modeling
KW - computer networks
KW - dynamic task scheduling algorithm
KW - nearest neighbor load balancing
KW - multicomputers
KW - store and forward
KW - communication network
KW - central server open queueing network
KW - response time
KW - settling time
KW - scheduling time
KW - communication time
KW - waiting time
KW - execution queue
KW - performance evaluation
KW - task transfer cost
VL - 0
JA - Parallel and Distributed Processing, IEEE Symposium on
ER -
 
Ahmad, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
Ghafoor, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
Mehrotra, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
A dynamic task scheduling algorithm is presented. The algorithm is an extension of a nearest neighbor load balancing strategy with an enhanced degree of efficiency and it is intended for multicomputers connected by a store and forward communication network. The algorithm is modeled by a central server open queueing network. It is shown that the response time of a task consists of two parts. The first part comprises a task's settling time which consists of scheduling time, communication time, and waiting time. The second part comprises waiting time in the execution queue in the execution time itself. The algorithm is comprehensively evaluated through a simulation and analytical model, and is shown to be both stable and efficient. For performance evaluation, the task transfer cost and the scheduling overhead is also taken into account. Experimental results are also obtained for another nearest neighbor scheduling scheme and compared with the algorithm.
Index Terms:
scheduling queues, decentralized task scheduling algorithm, performance modeling, computer networks, dynamic task scheduling algorithm, nearest neighbor load balancing, multicomputers, store and forward, communication network, central server open queueing network, response time, settling time, scheduling time, communication time, waiting time, execution queue, performance evaluation, task transfer cost
Citation:
Ahmad, Ghafoor, Mehrotra, "A decentralized task scheduling algorithm and its performance modeling for computer networks," spdp, pp.314-321, 1991 Third IEEE Symposium on Parallel and Distributed Processing, 1991
Usage of this product signifies your acceptance of the Terms of Use.