메뉴 건너뛰기




Volumn 52, Issue 10, 2003, Pages 1347-1361

An incremental server for scheduling overloaded real-time systems

Author keywords

Approximate algorithms; Incremental processing; Real time systems scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA HANDLING; ONLINE SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SERVERS;

EID: 0142134993     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1234531     Document Type: Article
Times cited : (15)

References (25)
  • 2
    • 0035248502 scopus 로고    scopus 로고
    • Optimal reward-based scheduling for periodic real-time tasks
    • Feb.
    • H. Aydin, R. Melhem, D. Mossé, and P. Mejía-Alvarez, "Optimal Reward-Based Scheduling for Periodic Real-Time Tasks," IEEE Trans. Computers, vol. 50, no. 2, pp. 111-130, Feb. 2001.
    • (2001) IEEE Trans. Computers , vol.50 , Issue.2 , pp. 111-130
    • Aydin, H.1    Melhem, R.2    Mossé, D.3    Mejía-Alvarez, P.4
  • 3
    • 0013287754 scopus 로고
    • Stack based scheduling of real-time processes
    • T. Baker, "Stack Based Scheduling of Real-Time Processes," J. Real-Time Systems, vol. 3, no. 1, pp. 284-292, 1993.
    • (1993) J. Real-Time Systems , vol.3 , Issue.1 , pp. 284-292
    • Baker, T.1
  • 10
    • 0024755194 scopus 로고
    • Some results of the earliest deadline scheduling algorithm
    • Oct.
    • H. Chetto and M. Chetto, "Some Results of the Earliest Deadline Scheduling Algorithm," IEEE Trans. Software Eng., Oct. 1989.
    • (1989) IEEE Trans. Software Eng.
    • Chetto, H.1    Chetto, M.2
  • 11
    • 84938157299 scopus 로고
    • A dynamic priority assignment technique for streams with (m,k)-firm deadlines
    • Dec.
    • M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m,k)-Firm Deadlines," IEEE Trans. Computers, vol. 44, no. 12, pp. 1443-1451, Dec. 1995.
    • (1995) IEEE Trans. Computers , vol.44 , Issue.12 , pp. 1443-1451
    • Hamdaoui, M.1    Ramanathan, P.2
  • 14
    • 0022796618 scopus 로고
    • Finding response times in a real-time system
    • Oct.
    • M. Joseph and P. Pandya, "Finding Response Times in a Real-Time System," Computer J., pp. 390-395, Oct. 1986.
    • (1986) Computer J. , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 17
    • 0002264123 scopus 로고    scopus 로고
    • Schedulability analysis of periodic and aperiodic tasks with resource constraints
    • Jan.
    • G. Lipari and G. Buttazzo, "Schedulability Analysis of Periodic and Aperiodic Tasks with Resource Constraints," J. Systems Architecture, vol. 46, pp. 327-338, Jan. 2000.
    • (2000) J. Systems Architecture , vol.46 , pp. 327-338
    • Lipari, G.1    Buttazzo, G.2
  • 18
    • 84974687699 scopus 로고
    • Scheduling algorithms for multi-programming in hard real-time environments
    • Jan.
    • C.L. Liu and J. Layland, "Scheduling Algorithms for Multi-programming in Hard Real-Time Environments," J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
    • (1973) J. ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.2
  • 20
    • 0003744646 scopus 로고
    • Best-effort decision making for real-time scheduling
    • PhD thesis, Computer Science Dept., Carnegie Mellon Univ.
    • C.D. Locke, "Best-Effort Decision Making for Real-Time Scheduling," PhD thesis, Computer Science Dept., Carnegie Mellon Univ., 1986.
    • (1986)
    • Locke, C.D.1
  • 22
    • 0016437461 scopus 로고
    • Approximate algorithms for the 0/1 knapsack problem
    • Jan.
    • S. Sahni, "Approximate Algorithms for the 0/1 Knapsack Problem," J. ACM, Jan. 1975.
    • (1975) J. ACM
    • Sahni, S.1
  • 24
    • 0040333770 scopus 로고    scopus 로고
    • Optimal scheduling of progressive processing tasks
    • S. Zilberstein and A. Mouaddib, "Optimal Scheduling of Progressive Processing Tasks," Int'l J. Approximate Processing, vol. 25, pp. 169-186, 2000.
    • (2000) Int'l J. Approximate Processing , vol.25 , pp. 169-186
    • Zilberstein, S.1    Mouaddib, A.2
  • 25
    • 0024684902 scopus 로고
    • Aperiodic task scheduling for hard real-time systems
    • B. Sprunt, L. Sha, and J. Lehoczky, "Aperiodic Task Scheduling for Hard Real-Time Systems," J. Real-Time Systems, vol. 1, pp. 27-60, 1989.
    • (1989) J. Real-Time Systems , vol.1 , pp. 27-60
    • Sprunt, B.1    Sha, L.2    Lehoczky, J.3


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