By Topic

Job Scheduling in a Single-Node Hierarchical Network for Process Control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Engelberg, G.P. ; Canadian National Railways ; Howard, J.A. ; Mellichamp, Duncan A.

The operating characteristics of a typical single-node hierarchical element in a multiprocessor network such as might be used for process control are described, and the class of scheduling problems arising from the use of such a network is discussed and related to similar problems which have been reported in the literature. Two measures of system performance are then defined: the "settling time," defined as the maximum of the finishing times of all jobs when a set of jobs is initiated once in the network, and the "steady-state service," a related performance index for the case where jobs are initiated on a periodic basis. Finally, a simulation model is used to evaluate the operating characteristics of the hierarchical network using the two metrics in conjunction with several synthetic workloads; a general optimization procedure is shown to lead to values of scheduling parameters which are close to optimal even for network workloads with many degrees of freedom (i.e., when many computers are initiating jobs).

Published in:

Computers, IEEE Transactions on  (Volume:C-29 ,  Issue: 8 )