메뉴 건너뛰기




Volumn , Issue , 2006, Pages 322-331

Multiprocessor scheduling with few preemptions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING; TIME VARYING SYSTEMS;

EID: 34547286633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTCSA.2006.45     Document Type: Conference Paper
Times cited : (99)

References (11)
  • 1
    • 0020271514 scopus 로고
    • On the Complexity of Fixed-priority Scheduling of Periodic Real-Time Tasks
    • J. Leung and J. Whitehead, "On the Complexity of Fixed-priority Scheduling of Periodic Real-Time Tasks," Performance Evaluation, Elsevier Science, vol. 22, pp. 237-250, 1982.
    • (1982) Performance Evaluation, Elsevier Science , vol.22 , pp. 237-250
    • Leung, J.1    Whitehead, J.2
  • 2
    • 0017925569 scopus 로고
    • On a real-time scheduling problem
    • S. K. Dhall and C. L. Liu, "On a real-time scheduling problem," Operations Research, vol. 26, pp. 127-140, 1978.
    • (1978) Operations Research , vol.26 , pp. 127-140
    • Dhall, S.K.1    Liu, C.L.2
  • 3
    • 0032166831 scopus 로고    scopus 로고
    • Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment
    • D.-I. Oh and T. P. Baker, "Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment," Real Time Systems Journal, vol. 15, pp. 183-192, 1998.
    • (1998) Real Time Systems Journal , vol.15 , pp. 183-192
    • Oh, D.-I.1    Baker, T.P.2
  • 4
    • 0001326859 scopus 로고    scopus 로고
    • Proportionate Progress: A Notion of Fairness in Resource Allocation
    • S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, "Proportionate Progress: A Notion of Fairness in Resource Allocation," Algorithmica, vol. 15, pp. 600-625, 1996.
    • (1996) Algorithmica , vol.15 , pp. 600-625
    • Baruah, S.K.1    Cohen, N.K.2    Plaxton, C.G.3    Varvel, D.A.4
  • 5
    • 0842321991 scopus 로고    scopus 로고
    • Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
    • J. Anderson and A. Srinivasan, "Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks," Journal of Computer and System Sciences, vol. 68, pp. 157-204, 2004.
    • (2004) Journal of Computer and System Sciences , vol.68 , pp. 157-204
    • Anderson, J.1    Srinivasan, A.2
  • 7
    • 84974687699 scopus 로고
    • 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," Journal of the ACM (JACM), vol. 20, pp. 46-61, 1973.
    • (1973) Journal of the ACM (JACM) , vol.20 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 9
    • 34249956267 scopus 로고
    • Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
    • S. K. Baruah, R. Howell, and L. Rosier, "Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor," Real-Time Systems, pp. 301-324, 1990.
    • (1990) Real-Time Systems , pp. 301-324
    • Baruah, S.K.1    Howell, R.2    Rosier, L.3
  • 11


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