메뉴 건너뛰기




Volumn , Issue , 2006, Pages 709-715

Platform-based resource binding using a distributed register-file microarchitecture

Author keywords

Behavior synthesis; Distributed register file; Resource binding

Indexed keywords

DESIGN; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FUZZY LOGIC; LANDFORMS; MICROPROCESSOR CHIPS; REDUCTION; TELECOMMUNICATION;

EID: 34547302203     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2006.320017     Document Type: Conference Paper
Times cited : (25)

References (39)
  • 1
  • 5
    • 7944228490 scopus 로고    scopus 로고
    • A flexible datapath allocation method for architectural synthesis
    • K. Choi and S. P. Levitan, "A flexible datapath allocation method for architectural synthesis," ACM Trans. Des. Autom. Electron. Syst., vol. 4, no. 4, pp. 376-404, 1999.
    • (1999) ACM Trans. Des. Autom. Electron. Syst , vol.4 , Issue.4 , pp. 376-404
    • Choi, K.1    Levitan, S.P.2
  • 9
    • 0024706222 scopus 로고
    • Algorithms for hardware allocation in data path synthesis
    • July
    • S. Devadas and A. Newton, "Algorithms for hardware allocation in data path synthesis," IEEE Trans. Computer-Aided Design, vol. 8(7), pp. 768-781, July 1989.
    • (1989) IEEE Trans. Computer-Aided Design , vol.8 , Issue.7 , pp. 768-781
    • Devadas, S.1    Newton, A.2
  • 13
    • 0026837903 scopus 로고
    • Optimal synthesis of high-performance architectures
    • Mar
    • C. Gebotys and M. Elmasry, "Optimal synthesis of high-performance architectures," IEEE J. Solid-State Circuits, vol. 27(3), pp. 389-397, Mar. 1992.
    • (1992) IEEE J. Solid-State Circuits , vol.27 , Issue.3 , pp. 389-397
    • Gebotys, C.1    Elmasry, M.2
  • 19
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • Feb
    • B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell System Technical J., vol. 49, no. 2, Feb. 1970.
    • (1970) Bell System Technical J , vol.49 , Issue.2
    • Kernighan, B.W.1    Lin, S.2
  • 22
    • 0029237023 scopus 로고
    • An integrated data path synthesis algorithm based on network flow method
    • May
    • T. Kim and C. L. Liu, "An integrated data path synthesis algorithm based on network flow method," Proc. of the IEEE Custom Integrated Circuits Conference, vol. 1-4, pp. 615-618, May 1995.
    • (1995) Proc. of the IEEE Custom Integrated Circuits Conference , vol.1-4 , pp. 615-618
    • Kim, T.1    Liu, C.L.2
  • 23
    • 0029407440 scopus 로고
    • A new approach to the multiport memory allocation problem in data path synthesis
    • _, "A new approach to the multiport memory allocation problem in data path synthesis," Integr. VLSI J., vol. 19, no. 3, pp. 133-160, 1995.
    • (1995) Integr. VLSI J , vol.19 , Issue.3 , pp. 133-160
    • Kim, T.1    Liu, C.L.2
  • 24
    • 0031211386 scopus 로고    scopus 로고
    • Simultaneous scheduling, allocation and binding in high level synthesis
    • Aug
    • P. Kollig and B. M. Al-Hashimi, "Simultaneous scheduling, allocation and binding in high level synthesis," Elect. Let., vol. 33, Aug. 1997.
    • (1997) Elect. Let , vol.33
    • Kollig, P.1    Al-Hashimi, B.M.2
  • 29
    • 0027561267 scopus 로고
    • Applying simulated evolution to high level synthesis
    • Mar
    • T. A. Ly and J. T. Mowchenko, "Applying simulated evolution to high level synthesis," IEEE Trans. Computer-Aided Design, vol. 12(3), pp. 389-409, Mar. 1993.
    • (1993) IEEE Trans. Computer-Aided Design , vol.12 , Issue.3 , pp. 389-409
    • Ly, T.A.1    Mowchenko, J.T.2
  • 31
    • 0032065759 scopus 로고    scopus 로고
    • Some new results in the complexity of allocation and binding in data path synthesis
    • C. A. Mandal, P. P. Chakrabarti, and S. Ghose, "Some new results in the complexity of allocation and binding in data path synthesis," Computers and Mathematics with Applications, vol. 35, no. 10, pp. 93-105, 1998.
    • (1998) Computers and Mathematics with Applications , vol.35 , Issue.10 , pp. 93-105
    • Mandal, C.A.1    Chakrabarti, P.P.2    Ghose, S.3
  • 32
    • 0026257187 scopus 로고
    • On the complexity of connectivity binding
    • B. M. Pangrle, "On the complexity of connectivity binding," IEEE Trans. Computer-Aided Design, vol. 10(11), pp. 1460-1465, 1991.
    • (1991) IEEE Trans. Computer-Aided Design , vol.10 , Issue.11 , pp. 1460-1465
    • Pangrle, B.M.1
  • 34
    • 0026172137 scopus 로고
    • Fast prototyping of datapath-intensive architectures
    • J. M. Rabaey, C. Chu, P. Hoang, and M. Potkonjak, "Fast prototyping of datapath-intensive architectures," IEEE Des. Test. Comput., vol. 8, no. 2, pp. 40-51, 1991.
    • (1991) IEEE Des. Test. Comput , vol.8 , Issue.2 , pp. 40-51
    • Rabaey, J.M.1    Chu, C.2    Hoang, P.3    Potkonjak, M.4
  • 39
    • 0022756374 scopus 로고
    • Automated synthesis of data paths in digital systems
    • July
    • C.-J. Tseng and D. Siewiorek, "Automated synthesis of data paths in digital systems," IEEE Trans. Computer-Aided Design, vol. 5(3), pp. 379-395, July 1986.
    • (1986) IEEE Trans. Computer-Aided Design , vol.5 , Issue.3 , pp. 379-395
    • Tseng, C.-J.1    Siewiorek, D.2


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