메뉴 건너뛰기




Volumn , Issue , 2014, Pages 428-433

A framework for automatic custom instruction identification on multi-issue ASIPs

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; INDUSTRIAL INFORMATICS;

EID: 84914170140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INDIN.2014.6945551     Document Type: Conference Paper
Times cited : (5)

References (19)
  • 2
    • 0036663707 scopus 로고    scopus 로고
    • Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    • J. W. Raymond and P. Willett, "Maximum common subgraph isomorphism algorithms for the matching of chemical structures," Journal of Computer-Aided Molecular Design, vol. 16, p. 2002, 2002
    • (2002) Journal of Computer-Aided Molecular Design , vol.16 , pp. 2002
    • Raymond, J.W.1    Willett, P.2
  • 6
    • 65349083666 scopus 로고    scopus 로고
    • Modern architectures for embedded reconfigurable systems-a survey
    • L. Józwiak and N. Nedjah, "Modern architectures for embedded reconfigurable systems-a survey," Journal of Circuits, Systems, and Computers, vol. 18, no. 2, pp. 209-254, 2009
    • (2009) Journal of Circuits, Systems, and Computers , vol.18 , Issue.2 , pp. 209-254
    • Józwiak, L.1    Nedjah, N.2
  • 7
    • 84867368085 scopus 로고    scopus 로고
    • The instruction-set extension problem: A survey
    • May
    • C. Galuzzi and K. Bertels, "The instruction-set extension problem: A survey," ACM Trans. Reconfigurable Technol. Syst., vol. 4, no. 2, pp. 18:1-18:28, May 2011
    • (2011) ACM Trans. Reconfigurable Technol. Syst. , vol.4 , Issue.2 , pp. 181-1828
    • Galuzzi, C.1    Bertels, K.2
  • 11
    • 79958119833 scopus 로고    scopus 로고
    • Automatic identification of customized instruction based on multiple attribute decision-making for multi-issue architectures
    • June
    • H. Tan and Y. Sun, "Automatic identification of customized instruction based on multiple attribute decision-making for multi-issue architectures," Tsinghua Science and Technology, vol. 16, no. 3, pp. 278-284, June 2011
    • (2011) Tsinghua Science and Technology , vol.16 , Issue.3 , pp. 278-284
    • Tan, H.1    Sun, Y.2
  • 13
    • 70450235127 scopus 로고    scopus 로고
    • Design-space exploration of resourcesharing solutions for custom instruction set extensions
    • December
    • M. Zuluaga and N. Topham, "Design-space exploration of resourcesharing solutions for custom instruction set extensions," Trans. Comp.-Aided Des. Integ. Cir. Sys., vol. 28, pp. 1788-1801, December 2009
    • (2009) Trans. Comp.-Aided Des. Integ. Cir. Sys. , vol.28 , pp. 1788-1801
    • Zuluaga, M.1    Topham, N.2
  • 15
    • 0034909407 scopus 로고    scopus 로고
    • Enumerating all connected maximal common subgraphs in two graphs
    • I. Koch, "Enumerating all connected maximal common subgraphs in two graphs," Theoretical Computer Science, vol. 250, no. 1, pp. 1-30, 2001
    • (2001) Theoretical Computer Science , vol.250 , Issue.1 , pp. 1-30
    • Koch, I.1
  • 16
    • 84867997005 scopus 로고    scopus 로고
    • A fast algorithm for the maximum clique problem
    • special devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization
    • P. R. stergrd, "A fast algorithm for the maximum clique problem," Discrete Applied Mathematics, vol. 120, no. 13, pp. 197-207, 2002, special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization
    • (2002) Discrete Applied Mathematics , vol.120 , Issue.13 , pp. 197-207
    • Stergrd, P.R.1
  • 17
    • 79952688955 scopus 로고    scopus 로고
    • Parallel algorithms for finding cliques in a graph
    • S. Szab, "Parallel algorithms for finding cliques in a graph," Journal of Physics: Conference Series, vol. 268, no. 1, p. 012030, 2011
    • (2011) Journal of Physics: Conference Series , vol.268 , Issue.1 , pp. 012030
    • Szab, S.1
  • 18
    • 84914116418 scopus 로고    scopus 로고
    • A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components
    • abs/1302.6256
    • R. A. Rossi, D. F. Gleich, A. H. Gebremedhin, and M. M. A. Patwary, "A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components," CoRR, vol. abs/1302.6256, 2013
    • (2013) CoRR
    • Rossi, R.A.1    Gleich, D.F.2    Gebremedhin, A.H.3    Patwary, M.M.A.4


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