메뉴 건너뛰기




Volumn 247 LNEE, Issue , 2014, Pages 397-412

Scheduling of real-time networks with a column generation approach

Author keywords

Column generation; Deadline monotonic scheduling; End to end deadline; Rate monotonic scheduling; Real time network; Scheduling; Task chain

Indexed keywords

CHAINS; COMPUTER SCIENCE;

EID: 84958553662     PISSN: 18761100     EISSN: 18761119     Source Type: Book Series    
DOI: 10.1007/978-94-007-6818-5_28     Document Type: Conference Paper
Times cited : (2)

References (18)
  • 8
    • 33846861495 scopus 로고    scopus 로고
    • Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
    • DOI 10.1007/s11241-007-9012-7
    • Davis RI, Burns A, Bril RJ, Lukkien JJ (2007) Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Syst 35(3):239-272 (Pubitemid 46223453)
    • (2007) Real-Time Systems , vol.35 , Issue.3 , pp. 239-272
    • Davis, R.I.1    Burns, A.2    Bril, R.J.3    Lukkien, J.J.4
  • 10
    • 84893194179 scopus 로고    scopus 로고
    • Gurobi Optimization Inc
    • Gurobi Optimization, Inc. (2012) Gurobi optimizer reference manual (2012).http://www.gurobi.com
    • (2012) Gurobi Optimizer Reference Manual , Issue.2012
  • 11
    • 0022796618 scopus 로고
    • Finding response times in a real-time system
    • Joseph M, Pandya PK (1986) Finding response times in a real-Time system. Comput J 29:390-395 (Pubitemid 17463568)
    • (1986) Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 12
    • 0024915921 scopus 로고
    • Rate monotonic scheduling algorithm: Exact characterization and average case behavior
    • Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: IEEE Real-Time systems, symposium, pp 166-171 (Pubitemid 20714278)
    • (1989) Proceedings - Real-Time Systems Symposium , pp. 166-171
    • Lehoczky, J.1    Sha, L.2    Ding, Y.3
  • 13
    • 0020271514 scopus 로고
    • On the complexity of fixed-priority scheduling of periodic, real-time tasks
    • DOI 10.1016/0166-5316(82)90024-4
    • Leung JYT, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic, real-Time tasks. Perform Eval 2(4):237-250 (Pubitemid 13487696)
    • (1982) Performance Evaluation , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.Y.T.1    Whitehead, J.2
  • 17
    • 0026865757 scopus 로고
    • Allocating hard real-time tasks: An NP-Hard problem made easy
    • Tindell K, Burns A, Wellings A (1992) Allocating hard real time tasks (an NPhard problem made easy). J Real-Time Syst 4:145-165 (Pubitemid 23566343)
    • (1992) Real-Time Systems , vol.4 , Issue.2 , pp. 145-165
    • Tindell, K.W.1    Burns, A.2    Wellings, A.J.3


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