Sciweavers

3600 search results - page 213 / 720
» The settling-time reducibility ordering
Sort
View
DATE
2006
IEEE
119views Hardware» more  DATE 2006»
15 years 10 months ago
Compiler-driven FPGA-area allocation for reconfigurable computing
In this paper, we propose two FPGA-area allocation algorithms based on profiling results for reducing the impact on performance of dynamic reconfiguration overheads. The problem o...
Elena Moscu Panainte, Koen Bertels, Stamatis Vassi...
ESA
2006
Springer
102views Algorithms» more  ESA 2006»
15 years 10 months ago
Necklaces, Convolutions, and X + Y
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...
EUROSYS
2006
ACM
15 years 10 months ago
TCP offload through connection handoff
This paper presents a connection handoff interface between the operating system and the network interface. Using this interface, the operating system can offload a subset of TCP c...
Hyong-youb Kim, Scott Rixner
ICPP
1995
IEEE
15 years 10 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
FM
1991
Springer
164views Formal Methods» more  FM 1991»
15 years 10 months ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin