메뉴 건너뛰기




Volumn , Issue , 2012, Pages 13-23

U-EDF: An unfair but optimal multiprocessor scheduling algorithm for sporadic tasks

Author keywords

[No Author keywords available]

Indexed keywords

EXTENSIVE SIMULATIONS; FAIRNESS PROPERTIES; MULTI PROCESSOR SCHEDULING; OPTIMAL ALGORITHM; OPTIMALITY; PERIODIC TASKS; SUBSTANTIAL REDUCTION;

EID: 84866451094     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2012.36     Document Type: Conference Paper
Times cited : (54)

References (24)
  • 1
    • 84855525854 scopus 로고    scopus 로고
    • Reducing preemptions and migrations in real-time multiprocessor scheduling algorithms by releasing the fairness
    • G. Nelissen, V. Berten, J. Goossens, and D. Milojevic, "Reducing preemptions and migrations in real-time multiprocessor scheduling algorithms by releasing the fairness," in RTCSA'11, 2011, pp. 15-24.
    • RTCSA'11, 2011 , pp. 15-24
    • Nelissen, G.1    Berten, V.2    Goossens, J.3    Milojevic, D.4
  • 2
    • 38949097813 scopus 로고    scopus 로고
    • Schedulability analysis of global EDF
    • S. K. Baruah and T. P. Baker, "Schedulability analysis of global EDF," Real-Time Systems, vol. 38, no. 3, pp. 223-235, 2008.
    • (2008) Real-Time Systems , vol.38 , Issue.3 , pp. 223-235
    • Baruah, S.K.1    Baker, T.P.2
  • 3
    • 70349240602 scopus 로고    scopus 로고
    • Portioned EDF-based scheduling on multiprocessors
    • S. Kato and N. Yamasaki, "Portioned EDF-based scheduling on multiprocessors," in EMSOFT '08, 2008, pp. 139-148.
    • EMSOFT '08, 2008 , pp. 139-148
    • Kato, S.1    Yamasaki, N.2
  • 4
    • 70449572703 scopus 로고    scopus 로고
    • Semi-partitioned scheduling of sporadic task systems on multiprocessors
    • S. Kato, N. Yamasaki, and Y. Ishikawa, "Semi-partitioned scheduling of sporadic task systems on multiprocessors," in ECRTS' 09, 2009, pp. 249-258.
    • ECRTS' 09, 2009 , pp. 249-258
    • Kato, S.1    Yamasaki, N.2    Ishikawa, Y.3
  • 5
    • 84855802779 scopus 로고    scopus 로고
    • Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme
    • A. Burns, R. Davis, P. Wang, and F. Zhang, "Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme," Real-Time Systems, vol. 48, no. 1, pp. 3-33, 2011.
    • (2011) Real-Time Systems , vol.48 , Issue.1 , pp. 3-33
    • Burns, A.1    Davis, R.2    Wang, P.3    Zhang, F.4
  • 6
    • 0036039360 scopus 로고    scopus 로고
    • Optimal rate-based scheduling on multiprocessors
    • A. Srinivasan and J. H. Anderson, "Optimal rate-based scheduling on multiprocessors," in STOC '02, 2002, pp. 189-198.
    • STOC '02, 2002 , pp. 189-198
    • Srinivasan, A.1    Anderson, J.H.2
  • 8
    • 80052681273 scopus 로고    scopus 로고
    • DP-Fair: A unifying theory for optimal hard real-time multiprocessor scheduling
    • S. Funk, G. Levin, C. Sadowski, I. Pye, and S. Brandt, "DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling," Real-Time Systems, vol. 47, pp. 389-429, 2011.
    • (2011) Real-Time Systems , vol.47 , pp. 389-429
    • Funk, S.1    Levin, G.2    Sadowski, C.3    Pye, I.4    Brandt, S.5
  • 9
    • 38949135956 scopus 로고    scopus 로고
    • An optimal real-time scheduling algorithm for multiprocessors
    • H. Cho, B. Ravindran, and E. D. Jensen, "An optimal real-time scheduling algorithm for multiprocessors," in RTSS '06, 2006, pp. 101-110.
    • RTSS '06, 2006 , pp. 101-110
    • Cho, H.1    Ravindran, B.2    Jensen, E.D.3
  • 10
    • 80051664491 scopus 로고    scopus 로고
    • An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
    • D. Zhu et al., "An optimal boundary fair scheduling algorithm for multiprocessor real-time systems," Journal of Parallel and Distributed Computing, vol. 71, no. 10, pp. 1411-1425, 2011.
    • (2011) Journal of Parallel and Distributed Computing , vol.71 , Issue.10 , pp. 1411-1425
    • Zhu, D.1
  • 11
    • 34547286633 scopus 로고    scopus 로고
    • Multiprocessor scheduling with few preemptions
    • B. Andersson and E. Tovar, "Multiprocessor scheduling with few preemptions," in RTCSA '06, 2006, pp. 322-334.
    • RTCSA '06, 2006 , pp. 322-334
    • Andersson, B.1    Tovar, E.2
  • 12
    • 0027187278 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," in STOC '93, 1993, pp. 345-354.
    • STOC '93, 1993 , pp. 345-354
    • Baruah, S.K.1    Cohen, N.K.2    Plaxton, C.G.3    Varvel, D.A.4
  • 13
    • 0001326859 scopus 로고    scopus 로고
    • Proportionate progress: A notion of fairness in resource allocation
    • -, "Proportionate progress: A notion of fairness in resource allocation," Algorithmica, vol. 15, no. 6, pp. 600-625, 1996.
    • (1996) Algorithmica , vol.15 , Issue.6 , pp. 600-625
    • Baruah, S.K.1    Cohen, N.K.2    Plaxton, C.G.3    Varvel, D.A.4
  • 14
    • 0029227396 scopus 로고    scopus 로고
    • Fast scheduling of periodic tasks on multiple resources
    • S. K. Baruah, J. Gehrke, and C. G. Plaxton, "Fast scheduling of periodic tasks on multiple resources," in IPPS '95, 1995, pp. 280-288.
    • IPPS '95, 1995 , pp. 280-288
    • Baruah, S.K.1    Gehrke, J.2    Plaxton, C.G.3
  • 15
    • 84856553711 scopus 로고    scopus 로고
    • RUN: Optimal multiprocessor real-time scheduling via reduction to uniprocessor
    • P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt, "RUN: Optimal multiprocessor real-time scheduling via reduction to uniprocessor," in RTSS '11, December 2011, pp. 104-115.
    • RTSS '11, December 2011 , pp. 104-115
    • Regnier, P.1    Lima, G.2    Massa, E.3    Levin, G.4    Brandt, S.5
  • 16
    • 78650692284 scopus 로고    scopus 로고
    • LRE-TL: An optimal multiprocessor algorithm for sporadic task sets
    • S. Funk and V. Nadadur, "LRE-TL: An optimal multiprocessor algorithm for sporadic task sets," in RTNS' 09, October 2009, pp. 159-168.
    • RTNS' 09, October 2009 , pp. 159-168
    • Funk, S.1    Nadadur, V.2
  • 17
    • 52049084771 scopus 로고    scopus 로고
    • Sporadic multiprocessor scheduling with few preemptions
    • B. Andersson and K. Bletsas, "Sporadic multiprocessor scheduling with few preemptions," in ECRTS'08, 2008, pp. 243-252.
    • ECRTS'08, 2008 , pp. 243-252
    • Andersson, B.1    Bletsas, K.2
  • 18
    • 79959572852 scopus 로고    scopus 로고
    • Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
    • K. Bletsas and B. Andersson, "Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound," Real-Time Systems, vol. 47, pp. 319-355, 2011.
    • (2011) Real-Time Systems , vol.47 , pp. 319-355
    • Bletsas, K.1    Andersson, B.2
  • 20
    • 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, vol. 20, no. 1, pp. 46-61, 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 21
  • 22
    • 0002643827 scopus 로고
    • Scheduling with deadlines and loss functions
    • R. McNaughton, "Scheduling with deadlines and loss functions," Management Science, vol. 6, no. 1, pp. 1-12, 1959.
    • (1959) Management Science , vol.6 , Issue.1 , pp. 1-12
    • McNaughton, R.1
  • 23
    • 84866456744 scopus 로고    scopus 로고
    • [Online]. Available
    • Tilera, "Tile-gx 3000 series overview," 2011. [Online]. Available: http://www.tilera.com/sites/default/files/productbriefs/TILE- Gx3000SeriesBrief.pdf
    • (2011) Tile-gx 3000 Series Overview


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