Sciweavers

874 search results - page 102 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
ISPASS
2010
IEEE
15 years 4 months ago
Synthesizing memory-level parallelism aware miniature clones for SPEC CPU2006 and ImplantBench workloads
Abstract—We generate and provide miniature synthetic benchmark clones for modern workloads to solve two pre-silicon design challenges, namely: 1) huge simulation time (weeks to m...
Karthik Ganesan, Jungho Jo, Lizy K. John
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
ICPPW
2000
IEEE
15 years 2 months ago
Reducing Web Latency with Hierarchical Cache-Based Prefetching
Proxy caches have become a central mechanism for reducing the latency of web document retrieval. While caching alone reduces latency for previously requested documents, web docume...
Dan Foygel, Dennis Strelow
BMCBI
2010
146views more  BMCBI 2010»
14 years 10 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...
IPPS
2006
IEEE
15 years 3 months ago
Loosely-coupled loop scheduling in computational grids
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...