메뉴 건너뛰기




Volumn , Issue , 2015, Pages 1-10

The federated scheduling of systems of conditional sporadic DAG tasks

Author keywords

conditional constructs; constrained deadline; federated scheduling; Intra task parallelism; sporadic DAG tasks

Indexed keywords

ALGORITHMS; EMBEDDED SOFTWARE; POLYNOMIAL APPROXIMATION; SCHEDULING;

EID: 84962268648     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMSOFT.2015.7318254     Document Type: Conference Paper
Times cited : (79)

References (29)
  • 2
    • 0032299031 scopus 로고    scopus 로고
    • A general model for recurring real-time tasks
    • Madrid, Spain, December IEEE Computer Society Press
    • S. Baruah. A general model for recurring real-time tasks. In Proceedings of the Real-Time Systems Symposium, pages 114-122, Madrid, Spain, December 1998. IEEE Computer Society Press.
    • (1998) Proceedings of the Real-Time Systems Symposium , pp. 114-122
    • Baruah, S.1
  • 3
    • 84910050871 scopus 로고    scopus 로고
    • Improved multiprocessor global schedulability analysis of sporadic dag task systems
    • Madrid (Spain), IEEE Computer Society Press
    • S. Baruah. Improved multiprocessor global schedulability analysis of sporadic dag task systems. In Proceedings of the 2012 26th Euromicro Conference on Real-Time Systems, ECRTS '14, Madrid (Spain), 2014. IEEE Computer Society Press.
    • (2014) Proceedings of the 2012 26th Euromicro Conference on Real-Time Systems, ECRTS '14
    • Baruah, S.1
  • 4
    • 84910050871 scopus 로고    scopus 로고
    • Improved multiprocessor global schedulability analysis of sporadic dag task systems
    • Madrid (Spain), IEEE Computer Society Press
    • S. Baruah. Improved multiprocessor global schedulability analysis of sporadic dag task systems. In Proceedings of the 2014 26th Euromicro Conference on Real-Time Systems, ECRTS '14, pages 97-105, Madrid (Spain), 2014. IEEE Computer Society Press.
    • (2014) Proceedings of the 2014 26th Euromicro Conference on Real-Time Systems, ECRTS '14 , pp. 97-105
    • Baruah, S.1
  • 11
    • 33744818212 scopus 로고    scopus 로고
    • The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems
    • July
    • S. Baruah and N. Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Transactions on Computers, 55(7):918-923, July 2006.
    • (2006) IEEE Transactions on Computers , vol.55 , Issue.7 , pp. 918-923
    • Baruah, S.1    Fisher, N.2
  • 12
    • 0026238820 scopus 로고
    • Preemptively scheduling hard-real-time sporadic tasks on one processor
    • Orlando, Florida, IEEE Computer Society Press
    • S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium, pages 182-190, Orlando, Florida, 1990. IEEE Computer Society Press.
    • (1990) Proceedings of the 11th Real-Time Systems Symposium , pp. 182-190
    • Baruah, S.1    Mok, A.2    Rosier, L.3
  • 14
    • 41549146820 scopus 로고    scopus 로고
    • Integrating job parallelism in real-time scheduling theory
    • S. Collette, L. Cucu, and J. Goossens. Integrating job parallelism in real-time scheduling theory. Information Processing Letters, 106(5):180-187, 2008.
    • (2008) Information Processing Letters , vol.106 , Issue.5 , pp. 180-187
    • Collette, S.1    Cucu, L.2    Goossens, J.3
  • 15
    • 0014477093 scopus 로고
    • Bounds on multiprocessor timing anomalies
    • R. Graham. Bounds on multiprocessor timing anomalies. SIAM Journal on Applied Mathematics, 17:416-429, 1969.
    • (1969) SIAM Journal on Applied Mathematics , vol.17 , pp. 416-429
    • Graham, R.1
  • 16
    • 79951794986 scopus 로고    scopus 로고
    • Scheduling parallel real-time tasks on multi-core processors
    • IEEE Computer Society
    • K. Lakshmanan, S. Kato, and R. Rajkumar. Scheduling parallel real-time tasks on multi-core processors. In RTSS, pages 259-268. IEEE Computer Society, 2010.
    • (2010) RTSS , pp. 259-268
    • Lakshmanan, K.1    Kato, S.2    Rajkumar, R.3
  • 17
    • 0017924416 scopus 로고
    • Complexity of scheduling under precedence constraints
    • J. K. Lenstra and A. H. G. Rinnooy Kan. Complexity of scheduling under precedence constraints. Operations Research, 26(1):22-35, 1978.
    • (1978) Operations Research , vol.26 , Issue.1 , pp. 22-35
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 20
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.1    Layland, J.2
  • 21
    • 0032122085 scopus 로고    scopus 로고
    • A new approach for scheduling of parallelizable tasks in real-time multiprocessor systems
    • G. Manimaran, C. S. R. Murthy, and K. Ramamritham. A new approach for scheduling of parallelizable tasks in real-time multiprocessor systems. REAL-TIME SYSTEMS, 15:39-60, 1998.
    • (1998) Real-Time Systems , vol.15 , pp. 39-60
    • Manimaran, G.1    Murthy, C.S.R.2    Ramamritham, K.3
  • 23
    • 0004088928 scopus 로고
    • PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Available as Technical Report No. MIT/LCS/TR-297
    • A. Mok. Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, 1983. Available as Technical Report No. MIT/LCS/TR-297.
    • (1983) Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment
    • Mok, A.1
  • 29
    • 77954728477 scopus 로고    scopus 로고
    • Conditional hardness of precedence constrained scheduling on identical machines
    • New York, NY, USA. ACM
    • O. Svensson. Conditional hardness of precedence constrained scheduling on identical machines. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 745-754, New York, NY, USA, 2010. ACM.
    • (2010) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10 , pp. 745-754
    • Svensson, O.1


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