Sciweavers

1279 search results - page 202 / 256
» Fast Implementations of Automata Computations
Sort
View
DAC
2006
ACM
14 years 16 days ago
Steiner network construction for timing critical nets
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
Shiyan Hu, Qiuyang Li, Jiang Hu, Peng Li
CLUSTER
2001
IEEE
14 years 15 days ago
GulfStream - a System for Dynamic Topology Management in Multi-domain Server Farms
This paper describes GulfStream, a scalable distributed software system designed to address the problem of managing the network topology in a multi-domain server farm. In particul...
Sameh A. Fakhouri, Germán S. Goldszmidt, Mi...
CCS
2008
ACM
13 years 10 months ago
Improving the scalability of platform attestation
In the process of platform attestation, a Trusted Platform Module is a performance bottleneck, which causes enormous delays if multiple simultaneously attestation requests arrive ...
Frederic Stumpf, Andreas Fuchs, Stefan Katzenbeiss...
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
13 years 10 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
EUROPAR
2008
Springer
13 years 10 months ago
Efficiently Building the Gated Single Assignment Form in Codes with Pointers in Modern Optimizing Compilers
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code ...
Manuel Arenaz, Pedro Amoedo, Juan Touriño