메뉴 건너뛰기




Volumn , Issue , 2011, Pages 115-124

Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

Author keywords

approximation algorithms; bicriteria approximation; memory constrained scheduling; partitioned scheduling; Unrelated multiprocessors

Indexed keywords

BICRITERIA APPROXIMATION; HETEROGENEOUS MULTIPROCESSORS; MEMORY POOL; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; REAL TIME SCHEDULING; SHARED MEMORY MULTIPROCESSOR; UNRELATED MULTIPROCESSORS;

EID: 80052992021     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2011.19     Document Type: Conference Paper
Times cited : (8)

References (7)
  • 1
    • 0002792672 scopus 로고
    • Control robotics: The procedural control of physical processors
    • M. Dertouzos. Control robotics : the procedural control of physical processors. In Proceedings of the IFIP Congress, pages 807-813, 1974.
    • (1974) Proceedings of the IFIP Congress , pp. 807-813
    • Dertouzos, M.1
  • 2
    • 80053003883 scopus 로고    scopus 로고
    • Heterogeneous processors sharing a common cache
    • United States Patent 7,577,792. Assignee: Intel Corporation
    • F. T. Hady, M. B. Cabot, J. Beck, and M. Rosenbluth. Heterogeneous processors sharing a common cache. United States Patent 7,577,792. Assignee: Intel Corporation, 2009.
    • (2009)
    • Hady, F.T.1    Cabot, M.B.2    Beck, J.3    Rosenbluth, M.4
  • 3
    • 0023170393 scopus 로고
    • Using dual approximation algorithms for scheduling problems: Theoretical and practical results
    • D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34:144-162, 1987.
    • (1987) Journal of the ACM , vol.34 , pp. 144-162
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 4
    • 0024018137 scopus 로고
    • A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
    • D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing, 17:539-551, 1988.
    • (1988) SIAM Journal on Computing , vol.17 , pp. 539-551
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 5
    • 0000438412 scopus 로고
    • Approximation algorithms for scheduling unrelated parallel machines
    • J. K. Lenstra, D. B. Shmoys, and É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. In Mathematical Programming 46, pages 259-271, 1990.
    • (1990) Mathematical Programming , vol.46 , pp. 259-271
    • Lenstra, J.K.1    Shmoys, D.B.2    Tardos, É.3
  • 6
    • 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:46-61, 1973.
    • (1973) Journal of the ACM , vol.20 , pp. 46-61
    • Liu, C.1    Layland, J.2


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