Sciweavers

16 search results - page 1 / 4
» Modular Partitioning for Incremental Compilation
Sort
View
FPL
2006
Springer
103views Hardware» more  FPL 2006»
13 years 8 months ago
Modular Partitioning for Incremental Compilation
This paper presents an automated partitioning strategy to divide a design into a set of partitions based on design hierarchy information. While the primary objective is to use the...
Mehrdad Eslami Dehkordi, Stephen Dean Brown, Terry...
HICSS
2003
IEEE
110views Biometrics» more  HICSS 2003»
13 years 10 months ago
Phobos: A Front-End Approach to Extensible Compilers
Abstract. This paper describes a practical approach for implementing certain types of domain-specific languages with extensible compilers. Given a compiler with one or more front-...
Adam Granicz, Jason Hickey
TVLSI
2002
130views more  TVLSI 2002»
13 years 4 months ago
Incremental compilation for parallel logic verification systems
Although simulation remains an important part of application-specific integrated circuit (ASIC) validation, hardware-assisted parallel verification is becoming a larger part of the...
R. Tessier, S. Jana
RSP
1999
IEEE
122views Control Systems» more  RSP 1999»
13 years 9 months ago
Incremental Compilation for Logic Emulation
Over the past decade, the steady growth rate of FPGA device capacities has enabled the development of multi-FPGA prototyping environments capable of implementing millions of logic...
Russell Tessier
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
13 years 10 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...