This project is an investigation into a new generation of hierarchical partitioning methods motivated by the need to 1) cope with high circuit complexity, 2) improve a system's performance under I/O pin count constraints, and 3) control intermodule delay in order to optimize system performance. The principal investigator proposes to extend previous partitioning research by adopting different circuit models including petri nets, data flows, and state machines, by improving the efficiency and effectiveness of the methods, and by deriving theoretical results on variations of partitioning formulations. He plans to apply partitioning methods to netlist mappings for various hardware emulation machines and to find potential applications of these methods to VLSI design problems

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9315794
Program Officer
Michael Foster
Project Start
Project End
Budget Start
1994-04-01
Budget End
1997-04-30
Support Year
Fiscal Year
1993
Total Cost
$165,000
Indirect Cost
Name
University of California San Diego
Department
Type
DUNS #
City
La Jolla
State
CA
Country
United States
Zip Code
92093