메뉴 건너뛰기




Volumn , Issue , 2005, Pages

An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; INTER-ARRIVAL TIME; PRIORITY-DRIVEN SCHEDULING; RELATIVE DEADLINES; SCHEDULABILITY ANALYSIS; SOFT REAL-TIME APPLICATIONS; SYMMETRIC MULTI-PROCESSORS; UTILIZATION BOUNDS;

EID: 84879327773     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2005.8     Document Type: Conference Paper
Times cited : (31)

References (15)
  • 1
    • 0842321991 scopus 로고    scopus 로고
    • Mixed pfair/erfair scheduling of asynchronous periodic tasks
    • J. Anderson and A. Srinivasan. Mixed pfair/erfair scheduling of asynchronous periodic tasks. Journal of Computer and System Sciences, 68(1):157-204, 2004.
    • (2004) Journal of Computer and System Sciences , vol.68 , Issue.1 , pp. 157-204
    • Anderson, J.1    Srinivasan, A.2
  • 2
    • 3042649802 scopus 로고    scopus 로고
    • PhD thesis, Department of Computer Engineering, Chalmer University of Technology, Goteborg, Sweden
    • B. Andersson. Static-priority scheduling on multiprocessors. PhD thesis, Department of Computer Engineering, Chalmer University of Technology, Goteborg, Sweden, 2003.
    • (2003) Static-priority Scheduling on Multiprocessors
    • Andersson, B.1
  • 5
    • 0001326859 scopus 로고    scopus 로고
    • Proportionate progress: A notion of fairness in resource allocation
    • S. Baruah, N. Cohen, C. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 6, 1996.
    • (1996) Algorithmica , vol.6
    • Baruah, S.1    Cohen, N.2    Plaxton, C.3    Varvel, D.4
  • 8
    • 0141495587 scopus 로고    scopus 로고
    • Priority-driven scheduling of periodic task systems on multiprocessors
    • Sep-Oct
    • J. Goossens, S. Funk, and S. Baruah. Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Systems, 25(2-3):187-205, Sep-Oct 2003.
    • (2003) Real-Time Systems , vol.25 , Issue.2-3 , pp. 187-205
    • Goossens, J.1    Funk, S.2    Baruah, S.3
  • 9
    • 0010338549 scopus 로고
    • chapter Bounds on the performance of scheduling algorithms. Wiley, New York
    • R. Graham. Computer and Job Scheduling Theory, chapter Bounds on the performance of scheduling algorithms. Wiley, New York, 1976.
    • (1976) Computer and Job Scheduling Theory
    • Graham, R.1
  • 11
    • 84879398029 scopus 로고
    • Multiprocessor scheduling of periodic tasks in a hard real-time environment. Technical report, Tata Institute of Fundamental Research
    • A. Khemka and R. K. Shyamasunda. Multiprocessor scheduling of periodic tasks in a hard real-time environment. Technical report, Tata Institute of Fundamental Research, 1990.
    • (1990)
    • Khemka, A.1    Shyamasunda, R.K.2
  • 13
    • 0029411663 scopus 로고
    • Allocating fixed-priority periodic tasks on multiprocessor systems
    • Y. Oh and S. H. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Journal on Real Time Systems, 9, 1995.
    • (1995) Journal on Real Time Systems , vol.9
    • Oh, Y.1    Son, S.H.2
  • 15
    • 84879380540 scopus 로고    scopus 로고
    • An upper bound to the lateness of edf on multiprocessors. Technical Report RETIS TR05-01, Scuola Superiore S. Anna
    • P. Valente and G. Lipari. An upper bound to the lateness of edf on multiprocessors. Technical Report RETIS TR05-01, Scuola Superiore S. Anna, 2005. http://feanor.sssup.it/~pv/edf-tr.pdf.
    • (2005)
    • Valente, P.1    Lipari, G.2


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