메뉴 건너뛰기




Volumn 94, Issue 1-3, 1999, Pages 141-159

List schedules for cyclic scheduling

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0041708230     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00017-7     Document Type: Article
Times cited : (4)

References (11)
  • 1
    • 0043048333 scopus 로고
    • Transient and limiting behavior of timed event graphs
    • P. Chrétienne, Transient and limiting behavior of timed event graphs, RAIRO-TSI 4 (1985) 127-142.
    • (1985) RAIRO-TSI , vol.4 , pp. 127-142
    • Chrétienne, P.1
  • 2
    • 0003925289 scopus 로고
    • The basic cyclic scheduling problem with deadlines
    • P. Chrétienne, The basic cyclic scheduling problem with deadlines, Discrete Appl. Math. 30 (1991) 109-123.
    • (1991) Discrete Appl. Math. , vol.30 , pp. 109-123
    • Chrétienne, P.1
  • 3
    • 0022026963 scopus 로고
    • A linear system theoretic view of discrete event process and its use for performance evaluation in manufacturing
    • G. Cohen, D. Dubois, J.P. Quadrat, M. Viot, A linear system theoretic view of discrete event process and its use for performance evaluation in manufacturing, IEEE Trans. Automat Control 30 (1985) 3.
    • (1985) IEEE Trans. Automat Control , vol.30 , pp. 3
    • Cohen, G.1    Dubois, D.2    Quadrat, J.P.3    Viot, M.4
  • 4
    • 0015482117 scopus 로고
    • Optimal scheduling for two processors systems
    • E.G. Coffman, Jr., R.L. Graham, Optimal scheduling for two processors systems, Act. Inference 13 (1972) 200-213.
    • (1972) Act. Inference , vol.13 , pp. 200-213
    • Coffman E.G., Jr.1    Graham, R.L.2
  • 5
    • 0028715149 scopus 로고
    • Generating close to optimal loop schedules on parallel processors
    • F. Gasperoni, U. Schwiegelshohn, Generating close to optimal loop schedules on parallel processors, Par. Proc. Lett. 4 (4) (1994) 391-403.
    • (1994) Par. Proc. Lett. , vol.4 , Issue.4 , pp. 391-403
    • Gasperoni, F.1    Schwiegelshohn, U.2
  • 6
    • 0014477093 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17 (1969) 416-429.
    • (1969) SIAM J. Appl. Math. , vol.17 , pp. 416-429
    • Graham, R.L.1
  • 7
    • 0006673324 scopus 로고
    • A study of the cyclic scheduling problem on parallel processors
    • C. Hanen, A. Munier, A study of the cyclic scheduling problem on parallel processors, Discrete Appl. Math. 57 (1995) 167-192.
    • (1995) Discrete Appl. Math. , vol.57 , pp. 167-192
    • Hanen, C.1    Munier, A.2
  • 8
    • 0002591492 scopus 로고
    • Cyclic scheduling on parallel processors
    • 1995. P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Wiley, Chapter 9
    • C. Hanen, A. Munier, (1995). Cyclic scheduling on parallel processors, in: P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and its Applications, Wiley, 1995. pp. 193-224 (Chapter 9).
    • (1995) Scheduling Theory and its Applications , pp. 193-224
    • Hanen, C.1    Munier, A.2
  • 10
    • 0003032696 scopus 로고
    • Computing near optimal schedules
    • P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Wiley, New York, Chapter 1
    • J.K. Lenstra, D.B. Shmoys, Computing near optimal schedules, in: P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and its Applications. Wiley, New York, 1995, pp. 193-224 (Chapter 1).
    • (1995) Scheduling Theory and its Applications , pp. 193-224
    • Lenstra, J.K.1    Shmoys, D.B.2


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