SCOPUS 정보 검색 플랫폼

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2012, Pages 189-198

Hardness results for static priority real-time scheduling

(2) Stigge, Martin a Yi, Wang a

a UPPSALA UNIVERSITY (Sweden)

Author keywords

co np hardness; complexity; real time; scheduling theory

Indexed keywords

COMPLEXITY; DYNAMIC PRIORITY; GENERALIZED MULTIFRAME; GRAPH-BASED MODELS; HARDNESS RESULT; PERIODIC TASKS; PROBLEM COMPLEXITY; REAL TIME SCHEDULING; REAL-TIME; SCHEDULABILITY; SCHEDULING THEORY; STATIC PRIORITY;

GRAPHIC METHODS; HARDNESS; POLYNOMIAL APPROXIMATION; REAL TIME SYSTEMS;

SCHEDULING;

EID: 84866443703 PISSN: 10683070 EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/ECRTS.2012.13 Document Type: Conference Paper

Times cited : (21)

References (10)

1
- 84974687699
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
- (1973) J. ACM , vol.20 , Issue.1 , pp. 46-61
- Liu, C.L.¹ Layland, J.W.²

2
- 79957627753
- The Digraph Real-Time Task Model
- M. Stigge, P. Ekberg, N. Guan, and W. Yi, "The Digraph Real-Time Task Model," in Proc. of RTAS 2011, pp. 71-80.
- Proc. of RTAS 2011 , pp. 71-80
- Stigge, M.¹ Ekberg, P.² Guan, N.³ Yi, W.⁴

3
- 0032649292
- Generalized multiframe tasks
- S. Baruah, D. Chen, S. Gorinsky, and A. Mok, "Generalized multiframe tasks," Real-Time Syst., vol. 17, no. 1, pp. 5-22, 1999.
- (1999) Real-Time Syst. , vol.17 , Issue.1 , pp. 5-22
- Baruah, S.¹ Chen, D.² Gorinsky, S.³ Mok, A.⁴

4
- 0031334453
- Schedulability of Generalized Multiframe Task Sets under Static Priority Assignment
- H. Takada and K. Sakamura, "Schedulability of Generalized Multiframe Task Sets under Static Priority Assignment," in Proc. of RTCSA 1997, pp. 80-86.
- Proc. of RTCSA 1997 , pp. 80-86
- Takada, H.¹ Sakamura, K.²

5
- 0022796618
- Finding Response Times in a Real-Time System
- M. Joseph and P. K. Pandya, "Finding Response Times in a Real-Time System," The Computer Journal, vol. 29, pp. 390-395, 1986.
- (1986) The Computer Journal , vol.29 , pp. 390-395
- Joseph, M.¹ Pandya, P.K.²

6
- 80053035836
- On the Tractability of Digraph-Based Task Models
- M. Stigge, P. Ekberg, N. Guan, and W. Yi, "On the Tractability of Digraph-Based Task Models," in Proc. of ECRTS 2011, pp. 162-171.
- Proc. of ECRTS 2011 , pp. 162-171
- Stigge, M.¹ Ekberg, P.² Guan, N.³ Yi, W.⁴

7
- 84958042785
- On the complexity of scheduling conditional real-time code
- S. Chakraborty, T. Erlebach, and L. Thiele, "On the complexity of scheduling conditional real-time code," in WADS 2001, pp. 38-49.
- WADS 2001 , pp. 38-49
- Chakraborty, S.¹ Erlebach, T.² Thiele, L.³

8
- 69549119047
- Tech. Rep.
- A. Zuhily, "Exact Response Time Analysis for Multiframe Tasks," Tech. Rep., 2007.
- (2007) Exact Response Time Analysis for Multiframe Tasks
- Zuhily, A.¹

9
- 35348848599
- Feasibility Analysis of Recurring Branching Tasks
- S. Baruah, "Feasibility Analysis of Recurring Branching Tasks," in Proc. of ECRTS 1998, pp. 138-145.
- Proc. of ECRTS 1998 , pp. 138-145
- Baruah, S.¹

10
- 0003603813
- W. H. Freeman & Co.
- M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
- (1990) Computers and Intractability; A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.