A parallel algorithm for state assignment of finite state machines

被引：4
|
作者：
Hasteer, G
Banerjee, P
机构：
[1] Ambit Design Syst, Santa Clara, CA 95051 USA
[2] Northwestern Univ, Ctr Parallel & Distributed Comp, Evanston, IL 60208 USA
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1998年 / 47卷 / 02期
关键词：
encoding; state assignment; linear speedup; portable; conflict resolution;
D O I：
10.1109/12.663772
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Optimization of large sequential circuits has become unmanageable in CAD of VLSI due to time and memory requirements. We report a parallel algorithm for the state assignment problem for finite state machines. Our algorithm has three significant contributions: It is an asynchronous parallel algorithm portable across different MIMD machines. Time and memory requirements reduce linearly with the number of processors, enabling the parallel implementation to handle large problem sizes. The quality of the results for multiprocessor runs remains comparable to the serial algorithm on which it is based due to an implicit backtrack correction mechanism built into the parallel implementation.
引用
收藏
页码：242 / 246
页数：5
相关论文
共 50 条
  • [1] A parallel state assignment algorithm for finite state machines
    Bader, DA
    Madduri, K
    [J]. HIGH PERFORMANCE COMPUTING - HIPC 2004, 2004, 3296 : 297 - 308
  • [2] A state assignment algorithm for finite state machines
    Skias, D
    Haniotakis, T
    Tsiatouhas, Y
    Arapoyanni, A
    [J]. ICECS 2000: 7TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS & SYSTEMS, VOLS I AND II, 2000, : 823 - 826
  • [3] Evolutionary algorithm for state assignment of finite state machines
    Chyzy, M
    Kosinski, W
    [J]. EUROMICRO SYMPOSIUM ON DIGITAL SYSTEM DESIGN, PROCEEDINGS: ARCHITECTURES, METHODS AND TOOLS, 2002, : 359 - 362
  • [4] Simulated annealing based parallel state assignment of finite state machines
    Hasteer, G
    Banerjee, P
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1997, 43 (01) : 21 - 35
  • [5] Simulated annealing based parallel state assignment of finite state machines
    Hasteer, G
    Banerjee, P
    [J]. TENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 1997, : 69 - 75
  • [6] STATE ASSIGNMENT OF FINITE-STATE MACHINES USING A GENETIC ALGORITHM
    ALMAINI, AEA
    MILLER, JF
    THOMSON, P
    BILLINA, S
    [J]. IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1995, 142 (04): : 279 - 286
  • [7] HARD: A hypercube embedding algorithm for state assignment of finite state machines
    Ahmad, I
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2003, 29 (02) : 327 - 356
  • [8] OPTIMAL STATE ASSIGNMENT FOR FINITE STATE MACHINES
    DEMICHELI, G
    BRAYTON, RK
    SANGIOVANNIVINCENTELLI, A
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (03) : 269 - 285
  • [9] State assignment of finite-state machines
    Ahmad, I
    Dhodhi, MK
    [J]. IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (01): : 15 - 22
  • [10] Low Power Synthesis of Finite State Machines - State Assignment Decomposition Algorithm
    Kajstura, Krzysztof
    Kania, Dariusz
    [J]. JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2018, 27 (03)
12345