• DocumentCode
    2888366
  • Title

    Pipelined concurrent simulation on distributed-memory parallel computers

  • Author

    Tai, Shang-E ; Bhattacharya, Debashis

  • Author_Institution
    Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA
  • fYear
    1991
  • fDate
    4-8 Jan 1991
  • Firstpage
    63
  • Lastpage
    68
  • Abstract
    Presents a space- and time-efficient approach to fault simulation on distributed-memory message-passing parallel computers. The processors in the parallel machine, and the host, communicate in a pipelined fashion where each processor simulates only one partition of the circuit under consideration using the concurrent simulation approach. If good load balancing can be obtained, this approach leads to nearly linear speedup when a large number of vectors are simulated. Further, practical implementations of this approach uses memory in the parallel machine efficiently. A preliminary implementation of this approach on an Intel hypercube machine is then described. Experimental results obtained using the ISCAS85 benchmark circuits confirm the prediction that the actual speedup is primarily dependent on the load distribution across processors. Further, simple circuit partitioning heuristic is seen to provide moderate to good speedup in most cases
  • Keywords
    circuit CAD; digital simulation; hypercube networks; parallel machines; pipeline processing; ISCAS85 benchmark circuits; Intel hypercube machine; concurrent simulation approach; distributed-memory message-passing parallel computers; fault simulation; load balancing; load distribution; partition; pipelined fashion; time-efficient approach; Circuit faults; Circuit simulation; Computational modeling; Computer simulation; Concurrent computing; Distributed computing; Hypercubes; Load management; Parallel machines; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    VLSI Design, 1991. Proceedings., Fourth CSI/IEEE International Symposium on
  • Conference_Location
    New Delhi
  • Print_ISBN
    0-8186-2125-7
  • Type

    conf

  • DOI
    10.1109/ISVD.1991.185094
  • Filename
    185094