메뉴 건너뛰기




Volumn 46, Issue 2, 2010, Pages 153-159

Provably good multiprocessor scheduling with resource sharing

Author keywords

Competitive ratio for multiprocessor resource sharing; Multiprocessor scheduling with resource sharing

Indexed keywords

COMPETITIVE ALGORITHMS; MULTI PROCESSOR SCHEDULING; RESOURCE SHARING; SHARED RESOURCES;

EID: 78049530086     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-010-9105-6     Document Type: Article
Times cited : (17)

References (8)
  • 4
    • 0035680674 scopus 로고    scopus 로고
    • Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip
    • Gai P, Lipari G, Di Natale M (2001) Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In: Proceedings of IEEE real-time systems symposium, pp 73-83
    • (2001) Proceedings of IEEE Real-Time Systems Symposium , pp. 73-83
    • Gai, P.1    Lipari, G.2    Di Natale, M.3
  • 5
    • 3142724149 scopus 로고    scopus 로고
    • Utilization bounds for EDF scheduling on real-time multiprocessor systems
    • López JM, Díaz JL, García FD (2004) Utilization bounds for EDF scheduling on real-time multiprocessor systems. J Real-Time Syst 28(1):39-68
    • (2004) J Real-Time Syst , vol.28 , Issue.1 , pp. 39-68
    • López, J.M.1    Díaz, J.L.2    García, F.D.3
  • 6
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control- The single node case
    • Parekh A, Gallager R (1993) A generalized processor sharing approach to flow control- the single node case. IEEE/ACM Trans Netw 1(3):344-357
    • (1993) IEEE/ACM Trans Netw , vol.1 , Issue.3 , pp. 344-357
    • Parekh, A.1    Gallager, R.2


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