Cyclic scheduling approach for relative timing requirements

Sheng-Tzong Cheng, Chia Mei Chen

研究成果: Paper

2 引文 (Scopus)

摘要

We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.

原文English
頁面160-163
頁數4
出版狀態Published - 1996 十二月 1
事件Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems - Montreal, Can
持續時間: 1996 十月 211996 十月 25

Other

OtherProceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems
城市Montreal, Can
期間96-10-2196-10-25

指紋

Scheduling
Experiments

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications

引用此文

Cheng, S-T., & Chen, C. M. (1996). Cyclic scheduling approach for relative timing requirements. 160-163. 論文發表於 Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems, Montreal, Can, .
Cheng, Sheng-Tzong ; Chen, Chia Mei. / Cyclic scheduling approach for relative timing requirements. 論文發表於 Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems, Montreal, Can, .4 p.
@conference{368e34de85f047c58c3cd5b8f3b2a951,
title = "Cyclic scheduling approach for relative timing requirements",
abstract = "We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.",
author = "Sheng-Tzong Cheng and Chen, {Chia Mei}",
year = "1996",
month = "12",
day = "1",
language = "English",
pages = "160--163",
note = "Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems ; Conference date: 21-10-1996 Through 25-10-1996",

}

Cheng, S-T & Chen, CM 1996, 'Cyclic scheduling approach for relative timing requirements', 論文發表於 Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems, Montreal, Can, 96-10-21 - 96-10-25 頁 160-163.

Cyclic scheduling approach for relative timing requirements. / Cheng, Sheng-Tzong; Chen, Chia Mei.

1996. 160-163 論文發表於 Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems, Montreal, Can, .

研究成果: Paper

TY - CONF

T1 - Cyclic scheduling approach for relative timing requirements

AU - Cheng, Sheng-Tzong

AU - Chen, Chia Mei

PY - 1996/12/1

Y1 - 1996/12/1

N2 - We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.

AB - We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.

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

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

M3 - Paper

AN - SCOPUS:0030384676

SP - 160

EP - 163

ER -

Cheng S-T, Chen CM. Cyclic scheduling approach for relative timing requirements. 1996. 論文發表於 Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems, Montreal, Can, .