메뉴 건너뛰기




Volumn , Issue , 2015, Pages 179-186

Federated Scheduling of Sporadic DAG Task Systems

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

EID: 84971274736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2015.33     Document Type: Conference Paper
Times cited : (76)

References (20)
  • 1
    • 84880861455 scopus 로고
    • Preemptively scheduling hard-realtime sporadic tasks on one processor
    • Orlando, Florida: IEEE Computer Society Press
    • S. Baruah, A. Mok, L. Rosier, "Preemptively scheduling hard-realtime sporadic tasks on one processor," in Proceedings of the 11th Real-Time Systems Symposium. Orlando, Florida: IEEE Computer Society Press, 1990, pp. 182-190.
    • (1990) Proceedings of the 11th Real-Time Systems Symposium , pp. 182-190
    • Baruah, S.1    Mok, A.2    Rosier, L.3
  • 2
    • 0032299031 scopus 로고    scopus 로고
    • A general model for recurring real-time tasks
    • Madrid, Spain: IEEE Computer Society Press, December
    • S. Baruah, "A general model for recurring real-time tasks," in Proceedings of the Real-Time Systems Symposium. Madrid, Spain: IEEE Computer Society Press, December 1998, pp. 114-122.
    • (1998) Proceedings of the Real-Time Systems Symposium , pp. 114-122
    • Baruah, S.1
  • 5
    • 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, vol. 55, no. 7, pp. 918-923, July 2006.
    • (2006) IEEE Transactions on Computers , vol.55 , Issue.7 , pp. 918-923
    • Baruah, S.1    Fisher, N.2
  • 7
    • 79951790068 scopus 로고    scopus 로고
    • An empirical comparison of global, partitioned, clustered multiprocessor real-time schedulers
    • San Diego, CA: IEEE Computer Society Press
    • A. Bastoni, B. Brandenburg, J.,erson, "An empirical comparison of global, partitioned, clustered multiprocessor real-time schedulers," in Proceedings of the Real-Time Systems Symposium. San Diego, CA: IEEE Computer Society Press, 2010, pp. 14-24.
    • (2010) Proceedings of the Real-Time Systems Symposium , pp. 14-24
    • Bastoni, A.1    Brandenburg, B.2    Erson, J.3
  • 9
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessing anomalies
    • R. Graham, "Bounds for certain multiprocessing anomalies," Bell System Technical Journal, vol. 45, pp. 1563-1581, 1966.
    • (1966) Bell System Technical Journal , vol.45 , pp. 1563-1581
    • Graham, R.1
  • 10
    • 0014477093 scopus 로고
    • Bounds on multiprocessor timing anomalies
    • -, "Bounds on multiprocessor timing anomalies," SIAM Journal on Applied Mathematics, vol. 17, pp. 416-429, 1969.
    • (1969) SIAMJournal on Applied Mathematics , vol.17 , pp. 416-429
    • Graham, R.1
  • 11
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • R. L. Graham, E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Ann. Discrete Mathematics, vol. 5, pp. 287-326, 1979.
    • (1979) Ann. Discrete Mathematics , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Kan, A.H.G.R.4
  • 12
    • 0023170393 scopus 로고
    • Using dual approximation algorithms for scheduling problems: Theoretical and practical results
    • Jan.
    • D. Hochbaum and D. Shmoys, "Using dual approximation algorithms for scheduling problems: Theoretical and practical results," Journal of the ACM, vol. 34, no. 1, pp. 144-162, Jan. 1987.
    • (1987) Journal of the ACM , vol.34 , Issue.1 , pp. 144-162
    • Hochbaum, D.1    Shmoys, D.2
  • 13
    • 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, vol. 26, no. 1, pp. 22-35, 1978.
    • (1978) Operations Research , vol.26 , Issue.1 , pp. 22-35
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 16
    • 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, vol. 20, no. 1, pp. 46-61, 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.1    Layland, J.2
  • 17
    • 0004088928 scopus 로고
    • Ph.D. dissertation Laboratory for Computer Science Massachusetts Institute of Technology Technical Report No. MIT/LCS/TR-297
    • A. Mok, "Fundamental design problems of distributed systems for the hard-real-time environment," Ph.D. dissertation, 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


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