Sciweavers

7303 search results - page 85 / 1461
» Optimality for dynamic patterns
Sort
View
ICS
2000
Tsinghua U.
15 years 1 months ago
Hardware-only stream prefetching and dynamic access ordering
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
Chengqiang Zhang, Sally A. McKee
DPD
2010
158views more  DPD 2010»
14 years 7 months ago
DYFRAM: dynamic fragmentation and replica management in distributed database systems
In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to rep...
Jon Olav Hauglid, Norvald H. Ryeng, Kjetil N&oslas...
CASES
2004
ACM
15 years 1 months ago
Reducing energy consumption of queries in memory-resident database systems
The tremendous growth of system memories has increased the capacities and capabilities of memory-resident embedded databases, yet current embedded databases need to be tuned in or...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
AOSD
2008
ACM
15 years 13 hour ago
Edicts: implementing features with flexible binding times
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
Venkat Chakravarthy, John Regehr, Eric Eide
IPPS
2006
IEEE
15 years 4 months ago
A compiler-based communication analysis approach for multiprocessor systems
In this paper we describe a compiler framework which can identify communication patterns for MPIbased parallel applications. This has the potential of providing significant perfo...
Shuyi Shao, Alex K. Jones, Rami G. Melhem