메뉴 건너뛰기




Volumn 2239, Issue , 2001, Pages 625-639

Fast optimal instruction scheduling for single-issue processors with arbitrary latencies

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DIGITAL ARITHMETIC; HEURISTIC METHODS; INTEGER PROGRAMMING; OPEN SOURCE SOFTWARE; PROGRAM COMPILERS;

EID: 84947913653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_52     Document Type: Conference Paper
Times cited : (20)

References (22)
  • 1
    • 0022151809 scopus 로고
    • An optimal instruction-scheduling model for a class of vector processors
    • S. Arya. An optimal instruction-scheduling model for a class of vector processors. IEEE Transactions on Computers, C-34(11):981–995, 1985.
    • (1985) IEEE Transactions on Computers , Issue.11 , pp. 981-995
    • Arya, S.1
  • 2
    • 0024304123 scopus 로고
    • Scheduling expressions on a pipelined processor with a maximal delay of one cycle
    • D. Bernstein and I. Gertner. Scheduling expressions on a pipelined processor with a maximal delay of one cycle. ACM Transactions on Programming Languages and Systems, 11(1):57–66, 1989.
    • (1989) ACM Transactions on Programming Languages and Systems , vol.11 , Issue.1 , pp. 57-66
    • Bernstein, D.1    Gertner, I.2
  • 3
    • 0024735520 scopus 로고
    • On the complexity of scheduling problems for parallel/pipelined machines
    • D. Bernstein, M. Rodeh, and I. Gertner. On the complexity of scheduling problems for parallel/pipelined machines. IEEE Transactions on Computers, 38(9):1308–1313, 1989.
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.9 , pp. 1308-1313
    • Bernstein, D.1    Rodeh, M.2    Gertner, I.3
  • 5
    • 0031268141 scopus 로고    scopus 로고
    • Using integer programming for instruction scheduling and register allocation in multi-issue processors
    • C.-M. Chang, C.-M. Chen, and C.-T. King. Using integer programming for instruction scheduling and register allocation in multi-issue processors. Computers and Mathematics with Applications, 34(9):1–14, 1997.
    • (1997) Computers and Mathematics with Applications , vol.34 , Issue.9 , pp. 1-14
    • Chang, C.-M.1    Chen, C.-M.2    King, C.-T.3
  • 6
    • 0025228149 scopus 로고
    • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
    • R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41:273–312, 1990.
    • (1990) Artificial Intelligence , vol.41 , pp. 273-312
    • Dechter, R.1
  • 10
    • 0032044670 scopus 로고    scopus 로고
    • Scheduling expression DAGs for minimal register need
    • C. W. Kessler. Scheduling expression DAGs for minimal register need. Computer Languages, 24(1):33–53, 1998.
    • (1998) Computer Languages , vol.24 , Issue.1 , pp. 33-53
    • Kessler, C.W.1
  • 11
    • 84947903716 scopus 로고    scopus 로고
    • Constraint-based scheduling: A theoretical comparison of resource constraint propagation rules
    • Brighton, UK, August
    • C. Le Pape and P. Baptiste. Constraint-based scheduling: A theoretical comparison of resource constraint propagation rules. In Proceedings of the ECAI Workshop on Non-Binary Constraints, Brighton, UK, August 1998.
    • Proceedings of the ECAI Workshop on Non-Binary Constraints , pp. 1998
    • Le Pape, C.1    Baptiste, P.2
  • 14
    • 0031102303 scopus 로고    scopus 로고
    • Time-constrained code compaction for DSPs
    • R. Leupers and P. Marwedel. Time-constrained code compaction for DSPs. IEEE Trans. VLSI Systems, 5(1):112–122, 1997.
    • (1997) IEEE Trans. VLSI Systems , vol.5 , Issue.1 , pp. 112-122
    • Leupers, R.1    Marwedel, P.2


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