메뉴 건너뛰기




Volumn , Issue , 1995, Pages 124-132

Optimized priority assignment for tasks and messages in distributed hard real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTERACTIVE COMPUTER SYSTEMS; PROGRAM PROCESSORS; SIMULATED ANNEALING;

EID: 84866446879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPDRTS.1995.470498     Document Type: Conference Paper
Times cited : (81)

References (7)
  • 5
    • 0020271514 scopus 로고
    • On the complexity offixed-priority scheduling of periodic Real-Time tasks
    • Dec
    • J.Y.T. Leung, J. Whitehead, "On the Complexity ofFixed-Priority Scheduling of Periodic Real-Time Tasks", Performance Evaluation, 2, (4), Dec. 1982, pp.237-250.
    • (1982) Performance Evaluation , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.Y.T.1    Whitehead, J.2
  • 6
    • 84974687699 scopus 로고
    • Scheduling algorithms formultiprogramming in a Hard Real-Time environment
    • C.L. Liu, and J.W. Layland, "Scheduling Algorithms forMultiprogramming in a Hard Real-Time Environment".Journal of the ACM, 20 (l), 1973, pp 46-61.
    • (1973) Journal of the ACM , vol.20 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 7
    • 0003093702 scopus 로고
    • A systematic approach todesigning distributed Real-Time systems
    • September
    • L. Sha, and S.S. Sathaye, "A Systematic Approach toDesigning Distributed Real-Time Systems". IEEEComputer, September 1993, pp. 68-78.
    • (1993) IEEEComputer , pp. 68-78
    • Sha, L.1    Sathaye, S.S.2


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