Sciweavers

4139 search results - page 656 / 828
» Designing and Implementing Combinator Languages
Sort
View
98
Voted
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
15 years 10 months ago
Automatic synthesis of compressor trees: reevaluating large counters
Despite the progress of the last decades in electronic design automation, arithmetic circuits have always received way less attention than other classes of digital circuits. Logic...
Ajay K. Verma, Paolo Ienne
148
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...
ANCS
2005
ACM
15 years 9 months ago
Addressing data compatibility on programmable network platforms
Large-scale applications require the efficient exchange of data across their distributed components, including data from heterogeneous sources and to widely varying clients. Inher...
Ada Gavrilovska, Karsten Schwan
154
Voted
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 8 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
154
Voted
MAM
2007
157views more  MAM 2007»
15 years 3 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene