Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 195
  • Download : 0
We develop an optimal task allocation and scheduling algorithm which minimizes the computing period for multiprocessor systems with general network structures considering task execution time and communication contentions and routing delays explicitly. We presented new ideas of scheduling: (i) individual start allowing overlapping two different iterations, (ii) the scheduling space and the scheduling graph representing feasible schedules, and (iii) the check-and-diffusion algorithm utilizing property of the start-time difference vs. the computing period. With concrete examples of scheduling spaces, segments, and scheduled for various multiprocessor network architectures, we showed that individual start reduces the computing period, and our algorithm can find the optimal computing period without exhaustive search. (c) 2004 Elsevier Inc. All rights reserved.
Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
Issue Date
2005-03
Language
English
Article Type
Article
Keywords

DISTRIBUTED SYSTEMS; ALLOCATION; MODELS

Citation

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.65, pp.261 - 274

ISSN
0743-7315
DOI
10.1016/j.jpdc.2004.04.007
URI
http://hdl.handle.net/10203/90974
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0