메뉴 건너뛰기




Volumn 38, Issue 2, 2008, Pages 133-189

Tardiness bounds under global EDF scheduling on a multiprocessor

Author keywords

EDF; Global scheduling; Migrations; Partitioning; Preemptions; Soft real time; Tardiness

Indexed keywords

OPERATING COSTS; REAL TIME SYSTEMS; SCHEDULING;

EID: 38749101370     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-007-9042-1     Document Type: Article
Times cited : (74)

References (47)
  • 3
    • 0842321991 scopus 로고    scopus 로고
    • Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
    • 1
    • Anderson J, Srinivasan A (2004) Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. J Comput Syst Sci 68(1):157-204
    • (2004) J Comput Syst Sci , vol.68 , pp. 157-204
    • Anderson, J.1    Srinivasan, A.2
  • 7
    • 0035248502 scopus 로고    scopus 로고
    • Optimal reward-based scheduling for periodic real-time tasks
    • 2
    • Aydin H, Melhem R, Mosse D, Alvarez PM (2001) Optimal reward-based scheduling for periodic real-time tasks. IEEE Trans Comput 50(2):111-130
    • (2001) IEEE Trans Comput , vol.50 , pp. 111-130
    • Aydin, H.1    Melhem, R.2    Mosse, D.3    Alvarez, P.M.4
  • 8
    • 0346935131 scopus 로고    scopus 로고
    • Multiprocessor EDF and deadline monotonic schedulability analysis
    • December 2003
    • Baker TP (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the 24th IEEE real-time systems symposium, December 2003, pp 120-129
    • (2003) Proceedings of the 24th IEEE Real-time Systems Symposium , pp. 120-129
    • Baker, T.P.1
  • 9
    • 3042673718 scopus 로고    scopus 로고
    • Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors
    • 6
    • Baruah S (2004) Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans Comput 53(6):781-784
    • (2004) IEEE Trans Comput , vol.53 , pp. 781-784
    • Baruah, S.1
  • 10
    • 33746932478 scopus 로고    scopus 로고
    • The non-preemptive scheduling of periodic tasks upon multiprocessors
    • 1-2
    • Baruah S (2006) The non-preemptive scheduling of periodic tasks upon multiprocessors. Real-Time Syst 32(1-2):9-20
    • (2006) Real-Time Syst , vol.32 , pp. 9-20
    • Baruah, S.1
  • 11
    • 0001326859 scopus 로고    scopus 로고
    • Proportionate progress: A notion of fairness in resource allocation
    • 6
    • Baruah S, Cohen N, Plaxton CG, Varvel D (1996) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15(6):600-625
    • (1996) Algorithmica , vol.15 , pp. 600-625
    • Baruah, S.1    Cohen, N.2    Plaxton, C.G.3    Varvel, D.4
  • 17
    • 35348814541 scopus 로고    scopus 로고
    • PhD thesis, University of North Carolina at Chapel Hill, December 2006
    • Devi U (2006) Soft real-time scheduling on multiprocessors. PhD thesis, University of North Carolina at Chapel Hill, December 2006
    • (2006) Soft Real-time Scheduling on Multiprocessors
    • Devi, U.1
  • 22
    • 0017925569 scopus 로고
    • On a real-time scheduling problem
    • 1
    • Dhall SK, Liu CL (1978) On a real-time scheduling problem. Oper. Res. 26(1):127-140
    • (1978) Oper. Res. , vol.26 , pp. 127-140
    • Dhall, S.K.1    Liu, C.L.2
  • 24
    • 0035538458 scopus 로고    scopus 로고
    • Real-time queues in heavy traffic with Earliest-Deadline-First queue discipline
    • 2
    • Doytchinov B, Lehoczky J, Shreve S (2001) Real-time queues in heavy traffic with Earliest-Deadline-First queue discipline. Ann Appl Probab 11(2):332-378
    • (2001) Ann Appl Probab , vol.11 , pp. 332-378
    • Doytchinov, B.1    Lehoczky, J.2    Shreve, S.3
  • 25
    • 0016485958 scopus 로고
    • Expected time bounds for selection
    • 3
    • Floyd R, Rivest R (1975) Expected time bounds for selection. Commun ACM 18(3):165-172
    • (1975) Commun ACM , vol.18 , pp. 165-172
    • Floyd, R.1    Rivest, R.2
  • 26
    • 0141495587 scopus 로고    scopus 로고
    • Priority-driven scheduling of periodic task systems on multiprocessors
    • 2-3
    • Goossens J, Funk S, Baruah S (2003) Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Syst 25(2-3):187-205
    • (2003) Real-Time Syst , vol.25 , pp. 187-205
    • Goossens, J.1    Funk, S.2    Baruah, S.3
  • 27
    • 84938157299 scopus 로고
    • A dynamic priority assignment technique for streams with (m,k)-firm deadlines
    • 12
    • Hamdaoui M, Ramanathan P (1995) A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Trans Comput 44(12):1443-1451
    • (1995) IEEE Trans Comput , vol.44 , pp. 1443-1451
    • Hamdaoui, M.1    Ramanathan, P.2
  • 28
    • 0348164422 scopus 로고
    • Algorithm 63 (PARTITION) and algorithm 65 (FIND)
    • 7
    • Hoare CAR (1961) Algorithm 63 (PARTITION) and algorithm 65 (FIND). Commun ACM 4(7):321-322
    • (1961) Commun ACM , vol.4 , pp. 321-322
    • Hoare, C.A.R.1
  • 30
    • 0029487571 scopus 로고
    • Skip-over: Algorithms and complexity for overloaded systems that allow skips
    • December 1995 IEEE New York
    • Koren G, Shasha D (1995) Skip-over: algorithms and complexity for overloaded systems that allow skips. In: Proceedings of the 16th IEEE real-time systems symposium, December 1995. IEEE, New York, pp 110-117
    • (1995) Proceedings of the 16th IEEE Real-time Systems Symposium , pp. 110-117
    • Koren, G.1    Shasha, D.2
  • 31
    • 6944238857 scopus 로고    scopus 로고
    • Earliest-deadline-first service in heavy-traffic acyclic networks
    • 3
    • Kurk L, Lehoczky J, Shreve S, Yeung S-N (2004) Earliest-deadline-first service in heavy-traffic acyclic networks. Ann Appl Probab 14(3):1306-1352
    • (2004) Ann Appl Probab , vol.14 , pp. 1306-1352
    • Kurk, L.1    Lehoczky, J.2    Shreve, S.3    Yeung, S.-N.4
  • 32
    • 0026237987 scopus 로고
    • Fixed priority scheduling of periodic task sets with arbitrary deadlines
    • December 1990 IEEE New York
    • Lehoczky J (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11st IEEE real-time systems symposium, December 1990. IEEE, New York, pp 201-209
    • (1990) Proceedings of the 11st IEEE Real-time Systems Symposium , pp. 201-209
    • Lehoczky, J.1
  • 34
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard-real-time environment
    • 1
    • Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J Assoc Comput Mach 20(1):46-61
    • (1973) J Assoc Comput Mach , vol.20 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 35
    • 0026154831 scopus 로고
    • Algorithms for scheduling imprecise computations
    • 5
    • Liu JWS, Lin K-J, Shih W-K, Yu AC (1991) Algorithms for scheduling imprecise computations. IEEE Comput 24(5):58-68
    • (1991) IEEE Comput , vol.24 , pp. 58-68
    • Liu, J.W.S.1    Lin, K.-J.2    Shih, W.-K.3    Yu, A.C.4
  • 37
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The single node case
    • 3
    • Parekh AK, Gallager RG (1993) A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Trans Netw 1(3):344-357
    • (1993) IEEE/ACM Trans Netw , vol.1 , pp. 344-357
    • Parekh, A.K.1    Gallager, R.G.2
  • 41
    • 15344340303 scopus 로고    scopus 로고
    • Fair scheduling of dynamic task systems on multiprocessors
    • 1
    • Srinivasan A, Anderson J (2005) Fair scheduling of dynamic task systems on multiprocessors. J Syst Softw 77(1):67-80
    • (2005) J Syst Softw , vol.77 , pp. 67-80
    • Srinivasan, A.1    Anderson, J.2
  • 42
    • 33746663460 scopus 로고    scopus 로고
    • Optimal rate-based scheduling on multiprocessors
    • 6
    • Srinivasan A, Anderson J (2006) Optimal rate-based scheduling on multiprocessors. J Comput Syst Sci 72(6):1049-1117
    • (2006) J Comput Syst Sci , vol.72 , pp. 1049-1117
    • Srinivasan, A.1    Anderson, J.2
  • 43
    • 0037206559 scopus 로고    scopus 로고
    • Deadline-based scheduling of periodic task systems on multiprocessors
    • 2
    • Srinivasan A, Baruah S (2002) Deadline-based scheduling of periodic task systems on multiprocessors. Inf Process Lett 84(2):93-98
    • (2002) Inf Process Lett , vol.84 , pp. 93-98
    • Srinivasan, A.1    Baruah, S.2
  • 46
    • 84879327773 scopus 로고    scopus 로고
    • An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors
    • December 2005
    • Valente P, Lipari G (2005) An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors. In: Proceedings of the 26th IEEE real-time systems symposium, December 2005, pp 311-320
    • (2005) Proceedings of the 26th IEEE Real-time Systems Symposium , pp. 311-320
    • Valente, P.1    Lipari, G.2


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