• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Fast and Mass Generation of Random Benchmark Circuits That Are Not Too Artificial

Research Project

Project/Area Number 08558024
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section展開研究
Research Field 計算機科学
Research InstitutionKYOTO UNIVERSITY (1997)
Kyushu University (1996)

Principal Investigator

IWAMA Kazuo  Kyoto University, Information Science, Professor, 工学研究科, 教授 (50131272)

Co-Investigator(Kenkyū-buntansha) MIYANO Eiji  Kyushu University, CS & CE,Research Associate, 大学院・システム情報科学研究科, 助手 (10284548)
OGINO Hiroyuki  Kyoto Univ., Information Science, Research Associate, 工学研究科, 助手 (40144323)
YASUOKA Koichi  Kyoto Univ., Data Processing Center, Associate Professor, 大型計算機センター, 助教授 (20230211)
OKABE Yasuo  Kyoto Univ., Data Processing Center, Associate Professor, 大型計算機センター, 助教授 (20204018)
岩本 宙造  九州芸術工科大学, 講師 (60274495)
澤田 直  九州大学, 大学院・システム情報科学研究科, 助手 (70235464)
櫻井 幸一  九州大学, 大学院・システム情報科学研究科, 助教授 (60264066)
Project Period (FY) 1996 – 1997
Project Status Completed (Fiscal Year 1997)
Budget Amount *help
¥4,000,000 (Direct Cost: ¥4,000,000)
Fiscal Year 1997: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 1996: ¥3,100,000 (Direct Cost: ¥3,100,000)
Keywordslogic design / CAD / optimization / benchmarks / random generation / ランダム論理回路 / ベンチマーク生成システム / 論理回路最適化システム / NANDゲート回路 / 入出力次数制限 / 等価変換 / オンセットサイズ / 回路理論的複雑さ
Research Abstract

When evaluating the performance of logic optimization systems such as SIS using random instances, it is often said that random instances are too artificial and far from the real world. Thus, in this research, we do not develop "fully" random generators but we develop random generators which can control several attributes of circuits.
First of all, we developed a basic type of generator. The algorithm starts with an initial circuit and then applies a sequence of transformation rules to make a circuit complicated. At each step, transformation is selected at random from the set of transformation rules. Each transformation rule is equivalent, namely, it does not change the logic function.
Then we improved the original system. Our new generator can control the maximum fan-in of the logic gates, which was impossible in the original version The original system possibly outputs a circuit of extremely large fan-in, but the new system can generate a circuit of limited fan-in, say 4, which is a reasonable size.
In the original version, we had to input an appropriate benchmark circuit as an initial circuit. However, our new system can generate initial circuits automatically. It can also control the parameters of initial circuits including the size of the on-set of the function and the degree of its complexity. Initial circuits are given by CNF formulas. To control the on-set, we need to count the number of satisfying assignments of the initial circuit, which usually takes great amount of time. However, we can compute it quickly using our original counring methods based on the inclusion-exclusion pronciple. Controlling the degree of complexity can be done by adjusting the number of clauses including a lot of literals.
We also emplricall evaluated logic optimization systems, SIS and Transduction Method, using our test instances and found some difference between the performance of these two systems.

Report

(3 results)
  • 1997 Annual Research Report   Final Research Report Summary
  • 1996 Annual Research Report
  • Research Products

    (24 results)

All Other

All Publications (24 results)

  • [Publications] Iwama, K, .: "A canonical form of vector machines" Information and Computation. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.: "Better approximations of non-Hamiltonian graphs" Discrete Applied Mathematics. 81. 239-261 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.: "Complexity of Finding Short Resolution Proofs" Proc.22nd Symposium on Mathematical Foundation of Computer Sceince (MFCS'97). LNCS1295. 309-318 (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.: "Three-dimensional mashes are less powerful than two-dimesional ones in oblivious routing" Proc. Fifth Europian Symposium on Algorithms (ESA'97). LNCS1284. 284-295 (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K, .: "Local search algorithms for partial MAXSAT" Proc.AAAI'97. 263-268 (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, k, .: "Random benchmark circutis with controlled attributes" Proc. European Design & Test Conference and Exhibition. 90-97 (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.and Iwamoto, C.: "A canonical form of vector machines" Information and Computation. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.and Miyano, E.: "Better approximations of non-Hamiltonian graphs" Discrete Applied Mathematics. Vol.81. 239-261 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.: "Complexity of Finding Short Resolution Proofs" Proc.MFCS'97. LNCS 1295. 309-318 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K.and Miyano, E.: "Three-dimensional mashes are less powerful than two-dimesional ones in oblivious routing" Proc.ESA'97. LNCS 1284. 284-295 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Cha, B., Iwama, K., Kambayashi, Y.and Miyazaki, S.: "Local search algorithms for partial MAXSAT" Proc.AAAI'97. 263-268 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama, K., Hino, K., Kurokawa, H.and Sawada, S.: "Random venchmark circuits with controlled attributes" Proc.ED & TC'97. 90-97 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1997 Final Research Report Summary
  • [Publications] Iwama,K.: "A canonical form of vector machines" Information and Computation. (to appear).

    • Related Report
      1997 Annual Research Report
  • [Publications] Iwama,K.: "Better approximations of non-Hamiltonian graphs" Discrete Applied Mathematics. 81. 239-261 (1998)

    • Related Report
      1997 Annual Research Report
  • [Publications] Iwama,K.: "Complexity of Finding Short Resolution Proofs" Proc.22nd Symposium on Mathematical Foundation of Computer Sceince (MFCS'97). LNCS1295. 309-318 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] Iwama,K.: "Three-dimensional mashes are less powerful than two-dimesional ones in oblivious routing" Proc.Fifth Europian Symposium on Algorithms (ESA'97). LNCS1284. 284-295 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] Iwama,K.: "Local search algorithms for partial MAXSAT" Proc.AAAI'97. 263-268 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] Iwama,K.: "Random benchmark circuits with controlled attributes" Proc.European Design & Test Conference and Exhibition (ED & TC'97). 90-97 (1997)

    • Related Report
      1997 Annual Research Report
  • [Publications] 岩間,一雄: "α-connectivity:A gradually non-parallel graph problem" Journal of Algorithms. 20・3. 526-544 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 岩間,一雄: "Routing problems on the mesh of buses" Journal of Algorithms. 20・3. 613-631 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 岩間,一雄: "A faster parallel algorithem for κ-connectivity" Proc.KOREA-JAPAN Joint Workshop on Algorithms and Computation. 8-13 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 岩本,宙造: "PRAMおよび対数時間一様な論理回路族に基づく計算量の階層" 数理解析研究所講究録. 950. 26-32 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 櫻井,幸一: "A hidden cryptographic assumption in no-trasferable identification schemes" Advances in Cryptology-Asiacrypt'96,Lecture Notes in Test Computer Science.

    • Related Report
      1996 Annual Research Report
  • [Publications] 岩間,一雄: "Random benchmark circuits with controlled attributes" European Design & Conference,ED & TC-97. (発表予定). (1997)

    • Related Report
      1996 Annual Research Report

URL: 

Published: 1996-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi