Sciweavers

334 search results - page 54 / 67
» eXtended Block Cache
Sort
View
IEEEPACT
2003
IEEE
14 years 25 days ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
ACIIDS
2009
IEEE
144views Database» more  ACIIDS 2009»
14 years 20 days ago
Processing Exact Results for Sliding Window Joins over Time-Sequence, Streaming Data Using a Disk Archive
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...
Abhirup Chakraborty, Ajit Singh
P2P
2002
IEEE
112views Communications» more  P2P 2002»
14 years 14 days ago
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications
In this paper, we present the concept of Passive Distributed Indexing, a general-purpose distributed search service for mobile file sharing applications, which is based on peer-to...
Christoph Lindemann, Oliver P. Waldhorst
ASPLOS
1994
ACM
13 years 11 months ago
Reducing Branch Costs via Branch Alignment
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
Brad Calder, Dirk Grunwald
ALGORITHMICA
2005
84views more  ALGORITHMICA 2005»
13 years 7 months ago
Optimal Read-Once Parallel Disk Scheduling
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
Mahesh Kallahalla, Peter J. Varman