ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper Evaluation of Relative-Class based Job Assignment
Cited 1 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Yong-Hyuk Moon, Chan-Hyun Youn
Issue Date
2011-09
Citation
International Conference on Information and Communication Technology Convergence (ICTC) 2011, pp.714-715
Publisher
IEEE
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.1109/ICTC.2011.6082683
Abstract
The conventional size-interval (SI) based job assignment only depends on the job's size for classifying its execution priority. In this paper, we consider computational and deadline requirements of jobs in order to decide the relative priority (i.e., class) of each job in a batch. To evaluate asymptotic behavior of a modified SI algorithm with the relative class, we propose a new queueing model. The simulation result shows that the fundamental limiting boundary of the proposed job assignment algorithm can be achieved with respect to the mean response time in distributed and heterogeneous resources. © 2011 IEEE.
KSP Keywords
Heterogeneous Resources, Job assignment, Mean response time, SI algorithm, asymptotic behavior, queueing model, relative priority