Sciweavers

60 search results - page 12 / 12
» When lisp is faster than C
Sort
View
PPOPP
2010
ACM
13 years 11 months ago
Load balancing on speed
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
Steven Hofmeyr, Costin Iancu, Filip Blagojevic
ISLPED
2005
ACM
122views Hardware» more  ISLPED 2005»
13 years 10 months ago
A simple mechanism to adapt leakage-control policies to temperature
Leakage power reduction in cache memories continues to be a critical area of research because of the promise of a significant pay-off. Various techniques have been developed so fa...
Stefanos Kaxiras, Polychronis Xekalakis, Georgios ...
DATE
2009
IEEE
155views Hardware» more  DATE 2009»
13 years 8 months ago
Automatically mapping applications to a self-reconfiguring platform
The inherent reconfigurability of SRAM-based FPGAs enables the use of configurations optimized for the problem at hand. Optimized configurations are smaller and faster than their g...
Karel Bruneel, Fatma Abouelella, Dirk Stroobandt
BMCBI
2008
214views more  BMCBI 2008»
13 years 4 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
CCE
2004
13 years 4 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...