메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 56-67

Effective compilation support for Variable Instruction Set Architecture

Author keywords

Application specific processors; Computer architecture; Dictionaries; Embedded software; Hardware; Instruction sets; Lifting equipment; Processor scheduling; Program processors; Runtime

Indexed keywords

APPLICATION PROGRAMS; AUTOMATIC PROGRAMMING; BUDGET CONTROL; CODES (SYMBOLS); COMPUTER HARDWARE; COMPUTER SOFTWARE REUSABILITY; ECONOMIC AND SOCIAL EFFECTS; EMBEDDED SOFTWARE; GLOSSARIES; NETWORK COMPONENTS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; PROGRAM PROCESSORS; SCHEDULING;

EID: 3042692405     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2002.1106004     Document Type: Conference Paper
Times cited : (10)

References (19)
  • 5
    • 0024735520 scopus 로고
    • On the complexity of scheduling problems for parallel/pipelined machines
    • September
    • D. Bernstein, M. Rodeh, and I. Gertner. On the complexity of scheduling problems for parallel/pipelined machines. IEEE Transaction on Computers, 38(9):1308-1313, September 1989.
    • (1989) IEEE Transaction on Computers , vol.38 , Issue.9 , pp. 1308-1313
    • Bernstein, D.1    Rodeh, M.2    Gertner, I.3
  • 6
    • 0000000310 scopus 로고
    • A tree search algorithm for mixed integer programming problems
    • R. Darkin. A tree search algorithm for mixed integer programming problems. Computer Journal, 8:250-255, 1965.
    • (1965) Computer Journal , vol.8 , pp. 250-255
    • Darkin, R.1
  • 7
    • 0019595341 scopus 로고
    • Some experiments in local microcode compaction for horizontal machines
    • July
    • S. Davidson, D. Landskov, B. Shriver, and P. Mallett. Some experiments in local microcode compaction for horizontal machines. IEEE Transaction on Computers, C-30(7):460-477, July 1981.
    • (1981) IEEE Transaction on Computers , vol.C-30 , Issue.7 , pp. 460-477
    • Davidson, S.1    Landskov, D.2    Shriver, B.3    Mallett, P.4
  • 9
    • 0030652311 scopus 로고    scopus 로고
    • A parameterized branch-and-bound strategy for scheduling precedence-constraint tasks on a multiprocessor system
    • IEEE, August
    • J. Jonsson and K. Shin. A parameterized branch-and-bound strategy for scheduling precedence-constraint tasks on a multiprocessor system. In Proc. of the Int'l Conf. on Parallel Processing, pages 158-165. IEEE, August 1997.
    • (1997) Proc. of the Int'l Conf. on Parallel Processing , pp. 158-165
    • Jonsson, J.1    Shin, K.2
  • 10
  • 12
    • 23044530732 scopus 로고    scopus 로고
    • A fast approach to computing exact solutions to the resource-constrained scheduling problem
    • October
    • M. Narasimhan and J. Ramanujam. A fast approach to computing exact solutions to the resource-constrained scheduling problem. ACM Transactions on Design Automation of Electronic Systems, 6(4):490-500, October 2001.
    • (2001) ACM Transactions on Design Automation of Electronic Systems , vol.6 , Issue.4 , pp. 490-500
    • Narasimhan, M.1    Ramanujam, J.2
  • 14
    • 0028413050 scopus 로고
    • Lower-bound performance estimation for the high-level synthesis scheduling problem
    • April
    • M. Rim and R. Jain. Lower-bound performance estimation for the high-level synthesis scheduling problem. IEEE Transactions on Computer-Aided Design, 13(4):451-458, April 1994.
    • (1994) IEEE Transactions on Computer-Aided Design , vol.13 , Issue.4 , pp. 451-458
    • Rim, M.1    Jain, R.2


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