A Design-Driven Partitioning Algorithm for Distributed Verilog Simulation
Many partitioning algorithms have been proposed for distributed VLSI simulation. Typically, they make use of a gate level netlist, and attempt to achieve a minimal cut size subject to a load balance constraint. The algorithm executes on a hypergraph which represents the netlist. In this paper we pro...
Saved in:
| Published in: | 21st International Workshop on Principles of Advanced and Distributed Simulation (PADS 2007): San Diego, California - 12-15 June 2007 pp. 211 - 218 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
Washington, DC, USA
IEEE Computer Society
12.06.2007
IEEE |
| Series: | ACM Conferences |
| Subjects: | |
| ISBN: | 9780769528984, 0769528988 |
| ISSN: | 1087-4097 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

