ON RESPONSE TIME ESTIMATION OF REAL-TIME SYSTEMS WITH FCFS SCHEDULER.

Wagner Chiepa Cunha; Masafumi Yamashita; Tadashi Ae

ON RESPONSE TIME ESTIMATION OF REAL-TIME SYSTEMS WITH FCFS SCHEDULER.

Wagner Chiepa Cunha, Masafumi Yamashita, Tadashi Ae

数理情報

研究成果: Contribution to journal › Article › 査読

1 被引用数 (Scopus)

抄録

This paper discusses the response time problem for concurrent processes sharing resources which are granted according to an FCFS strategy. The problem is shown to be NP-hard, but when less than four resources are shared, a restricted case is shown to be solvable in linear time.

本文言語	英語
ページ（範囲）	840-843
ページ数	4
ジャーナル	Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E
巻	E69
号	8
出版ステータス	出版済み - 8 1 1986

All Science Journal Classification (ASJC) codes

Engineering(all)

他のファイルとリンク

フィンガープリント「ON RESPONSE TIME ESTIMATION OF REAL-TIME SYSTEMS WITH FCFS SCHEDULER.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル

@article{143a99ff28eb4d92a72a4ac53a1e1096,

title = "ON RESPONSE TIME ESTIMATION OF REAL-TIME SYSTEMS WITH FCFS SCHEDULER.",

abstract = "This paper discusses the response time problem for concurrent processes sharing resources which are granted according to an FCFS strategy. The problem is shown to be NP-hard, but when less than four resources are shared, a restricted case is shown to be solvable in linear time.",

author = "Cunha, {Wagner Chiepa} and Masafumi Yamashita and Tadashi Ae",

year = "1986",

month = aug,

day = "1",

language = "English",

volume = "E69",

pages = "840--843",

journal = "Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E",

issn = "0387-236X",

number = "8",

}

TY - JOUR

T1 - ON RESPONSE TIME ESTIMATION OF REAL-TIME SYSTEMS WITH FCFS SCHEDULER.

AU - Cunha, Wagner Chiepa

AU - Yamashita, Masafumi

AU - Ae, Tadashi

PY - 1986/8/1

Y1 - 1986/8/1

N2 - This paper discusses the response time problem for concurrent processes sharing resources which are granted according to an FCFS strategy. The problem is shown to be NP-hard, but when less than four resources are shared, a restricted case is shown to be solvable in linear time.

AB - This paper discusses the response time problem for concurrent processes sharing resources which are granted according to an FCFS strategy. The problem is shown to be NP-hard, but when less than four resources are shared, a restricted case is shown to be solvable in linear time.

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

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

M3 - Article

AN - SCOPUS:0022761389

VL - E69

SP - 840

EP - 843

JO - Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E

JF - Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E

SN - 0387-236X

IS - 8

ER -