Validating real-time constraints in heterogeneous multiprocessor and distributed systems

Rhan Ha; Hojung Cha; Jane W.S. Liu

doi:10.1023/A:1026436324575

Validating real-time constraints in heterogeneous multiprocessor and distributed systems

Rhan Ha, Hojung Cha, Jane W.S. Liu

College of Computing

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

A heterogeneous system or distributed system typically contains different types of processors. Some jobs can execute on certain types of processors but not other types. Processors of different types may have different speeds. We present several worst-case upper bounds and efficient algorithms for determining the completion times of independent jobs that have arbitrary timing constraints and variable execution times and are scheduled on available processors dynamically in a priority-driven manner. Bounds and algorithms take into account the effects of nonmigratability, nonpreemptability and different levels of migratability.

Original language	English
Pages (from-to)	207-222
Number of pages	16
Journal	Journal of Systems Integration
Volume	9
Issue number	3
DOIs	https://doi.org/10.1023/A:1026436324575
Publication status	Published - 1999 Oct

Bibliographical note

Funding Information:
The authors are grateful to the anonymous reviewers for their helpful comments. This work is supported by the Korea Science and Engineering Foundation (grant no: 97-01-02-05-01-3 and 97-01-00-12-01-5).

All Science Journal Classification (ASJC) codes

Earth and Planetary Sciences(all)

Access to Document

10.1023/A:1026436324575

Cite this

@article{445f9e9bd51e4be9912763dabab7875d,

title = "Validating real-time constraints in heterogeneous multiprocessor and distributed systems",

abstract = "A heterogeneous system or distributed system typically contains different types of processors. Some jobs can execute on certain types of processors but not other types. Processors of different types may have different speeds. We present several worst-case upper bounds and efficient algorithms for determining the completion times of independent jobs that have arbitrary timing constraints and variable execution times and are scheduled on available processors dynamically in a priority-driven manner. Bounds and algorithms take into account the effects of nonmigratability, nonpreemptability and different levels of migratability.",

author = "Rhan Ha and Hojung Cha and Liu, {Jane W.S.}",

note = "Funding Information: The authors are grateful to the anonymous reviewers for their helpful comments. This work is supported by the Korea Science and Engineering Foundation (grant no: 97-01-02-05-01-3 and 97-01-00-12-01-5).",

year = "1999",

month = oct,

doi = "10.1023/A:1026436324575",

language = "English",

volume = "9",

pages = "207--222",

journal = "Journal of Systems Integration",

issn = "0925-4676",

publisher = "Kluwer Academic Publishers",

number = "3",

}

TY - JOUR

T1 - Validating real-time constraints in heterogeneous multiprocessor and distributed systems

AU - Ha, Rhan

AU - Cha, Hojung

AU - Liu, Jane W.S.

N1 - Funding Information: The authors are grateful to the anonymous reviewers for their helpful comments. This work is supported by the Korea Science and Engineering Foundation (grant no: 97-01-02-05-01-3 and 97-01-00-12-01-5).

PY - 1999/10

Y1 - 1999/10

N2 - A heterogeneous system or distributed system typically contains different types of processors. Some jobs can execute on certain types of processors but not other types. Processors of different types may have different speeds. We present several worst-case upper bounds and efficient algorithms for determining the completion times of independent jobs that have arbitrary timing constraints and variable execution times and are scheduled on available processors dynamically in a priority-driven manner. Bounds and algorithms take into account the effects of nonmigratability, nonpreemptability and different levels of migratability.

AB - A heterogeneous system or distributed system typically contains different types of processors. Some jobs can execute on certain types of processors but not other types. Processors of different types may have different speeds. We present several worst-case upper bounds and efficient algorithms for determining the completion times of independent jobs that have arbitrary timing constraints and variable execution times and are scheduled on available processors dynamically in a priority-driven manner. Bounds and algorithms take into account the effects of nonmigratability, nonpreemptability and different levels of migratability.

UR - http://www.scopus.com/inward/record.url?scp=0033364788&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033364788&partnerID=8YFLogxK

U2 - 10.1023/A:1026436324575

DO - 10.1023/A:1026436324575

M3 - Article

AN - SCOPUS:0033364788

SN - 0925-4676

VL - 9

SP - 207

EP - 222

JO - Journal of Systems Integration

JF - Journal of Systems Integration

IS - 3

ER -

Validating real-time constraints in heterogeneous multiprocessor and distributed systems

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this