메뉴 건너뛰기




Volumn , Issue , 2002, Pages 212-222

Optimal partitioning for quantized EDF scheduling

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; QUEUEING THEORY; SCHEDULING;

EID: 0036994705     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (16)

References (11)
  • 2
    • 0035538458 scopus 로고    scopus 로고
    • Real-time queues in heavy traffic with earliest deadline first queue discipline
    • Doytchinov, B., Lehoczky, J.P. and Shreve, S., "Real-time queues in heavy traffic with earliest deadline first queue discipline," Ann. of Appl. Prob., 11, 2001, 332-378.
    • (2001) Ann. of Appl. Prob. , vol.11 , pp. 332-378
    • Doytchinov, B.1    Lehoczky, J.P.2    Shreve, S.3
  • 6
    • 0022716643 scopus 로고
    • Performance of real-time bus scheduling algorithms
    • May
    • Lehoczky, J.P. and Sha, L., "Performance of Real-Time Bus Scheduling Algorithms", ACM Perf. Eval. Rev., 14, May 1986, 44-53.
    • (1986) ACM Perf. Eval. Rev. , vol.14 , pp. 44-53
    • Lehoczky, J.P.1    Sha, L.2
  • 9
    • 0002816593 scopus 로고
    • A heavy traffic limit theorem for networks of queues with multiple customer types
    • Peterson, W.P., "A heavy traffic limit theorem for networks of queues with multiple customer types," Math. of Operations Research, 16, 1991, 90-118.
    • (1991) Math. of Operations Research , vol.16 , pp. 90-118
    • Peterson, W.P.1


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