Load adjustment and filtering based on process criticality

Tei-Wei Kuo; Shie-Kai Ni; Giun-Haur Huang

doi:10.1109/RTCSA.1998.726334

Load adjustment and filtering based on process criticality

Tei-Wei Kuo
, Shie-Kai Ni
, Giun-Haur Huang

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.

Original language	English
Title of host publication	Proceedings: Fifth International Conference on Real-Time Computing Systems and Applications
Publisher	IEEE
Pages	3-10
ISBN (Print)	081869209X, 9780818692093
DOIs	https://doi.org/10.1109/RTCSA.1998.726334
Publication status	Published - Oct 1998
Externally published	Yes
Event	5th International Conference on Real-Time Computing Systems and Applications (RTCSA 1998) - Hiroshima, Japan Duration: 27 Oct 1998 → 29 Oct 1998 https://ieeexplore.ieee.org/xpl/conhome/5885/proceeding

Publication series

Name	Proceedings - International Conference on Real-Time Computing Systems and Applications, RTCSA
Volume	1998-October

Conference

Conference	5th International Conference on Real-Time Computing Systems and Applications (RTCSA 1998)
Abbreviated title	RTCSA 1998
Place	Japan
City	Hiroshima
Period	27/10/98 → 29/10/98
Internet address	https://ieeexplore.ieee.org/xpl/conhome/5885/proceeding

Access Output

10.1109/RTCSA.1998.726334

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Kuo, T.-W., Ni, S.-K., & Huang, G.-H. (1998). Load adjustment and filtering based on process criticality. In Proceedings: Fifth International Conference on Real-Time Computing Systems and Applications (pp. 3-10). Article 726334 (Proceedings - International Conference on Real-Time Computing Systems and Applications, RTCSA; Vol. 1998-October). IEEE. https://doi.org/10.1109/RTCSA.1998.726334

@inproceedings{1d64710334e0418eb789739d0bb7fd04,

title = "Load adjustment and filtering based on process criticality",

abstract = "This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.",

author = "Tei-Wei Kuo and Shie-Kai Ni and Giun-Haur Huang",

year = "1998",

month = oct,

doi = "10.1109/RTCSA.1998.726334",

language = "English",

isbn = "081869209X",

series = "Proceedings - International Conference on Real-Time Computing Systems and Applications, RTCSA",

publisher = "IEEE",

pages = "3--10",

booktitle = "Proceedings: Fifth International Conference on Real-Time Computing Systems and Applications",

address = "United States",

note = "5th International Conference on Real-Time Computing Systems and Applications (RTCSA 1998), RTCSA 1998 ; Conference date: 27-10-1998 Through 29-10-1998",

url = "https://ieeexplore.ieee.org/xpl/conhome/5885/proceeding",

}

Kuo, T-W, Ni, S-K & Huang, G-H 1998, Load adjustment and filtering based on process criticality. in Proceedings: Fifth International Conference on Real-Time Computing Systems and Applications., 726334, Proceedings - International Conference on Real-Time Computing Systems and Applications, RTCSA, vol. 1998-October, IEEE, pp. 3-10, 5th International Conference on Real-Time Computing Systems and Applications (RTCSA 1998), Hiroshima, Japan, 27/10/98. https://doi.org/10.1109/RTCSA.1998.726334

Load adjustment and filtering based on process criticality. / Kuo, Tei-Wei; Ni, Shie-Kai; Huang, Giun-Haur.
Proceedings: Fifth International Conference on Real-Time Computing Systems and Applications. IEEE, 1998. p. 3-10 726334 (Proceedings - International Conference on Real-Time Computing Systems and Applications, RTCSA; Vol. 1998-October).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Load adjustment and filtering based on process criticality

AU - Kuo, Tei-Wei

AU - Ni, Shie-Kai

AU - Huang, Giun-Haur

PY - 1998/10

Y1 - 1998/10

N2 - This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.

AB - This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.

UR - https://www.scopus.com/pages/publications/85051413464

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85051413464&origin=recordpage

U2 - 10.1109/RTCSA.1998.726334

DO - 10.1109/RTCSA.1998.726334

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 081869209X

SN - 9780818692093

T3 - Proceedings - International Conference on Real-Time Computing Systems and Applications, RTCSA

SP - 3

EP - 10

BT - Proceedings: Fifth International Conference on Real-Time Computing Systems and Applications

PB - IEEE

T2 - 5th International Conference on Real-Time Computing Systems and Applications (RTCSA 1998)

Y2 - 27 October 1998 through 29 October 1998

ER -

Load adjustment and filtering based on process criticality

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this