Sciweavers

1688 search results - page 194 / 338
» Implementing Optimizations at Decode Time
Sort
View
EWSA
2006
Springer
13 years 12 months ago
Automating the Building of Software Component Architectures
Assembling software components into an architecture is a difficult task because of its combinatorial complexity. There is thus a need for automating this building process, either t...
Nicolas Desnos, Sylvain Vauttier, Christelle Urtad...
CONNECTION
2007
87views more  CONNECTION 2007»
13 years 8 months ago
Efficient architectures for sparsely-connected high capacity associative memory models
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
Lee Calcraft, Rod Adams, Neil Davey
INFOCOM
2011
IEEE
12 years 11 months ago
Dynamic right-sizing for power-proportional data centers
—Power consumption imposes a significant cost for data centers implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of ...
Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, ...
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 2 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
ISPA
2004
Springer
14 years 1 months ago
HPL Performance Prevision to Intending System Improvement
HPL is a parallel Linpack benchmark package widely adopted in massive cluster system performance test. On HPL data layout among processors, a law to determine block size NB theoret...
Wenli Zhang, Mingyu Chen, Jianping Fan