Sciweavers

3202 search results - page 190 / 641
» Memory access scheduling
Sort
View
HPDC
2006
IEEE
15 years 11 months ago
On the Harmfulness of Redundant Batch Requests
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
Henri Casanova
BNCOD
2009
162views Database» more  BNCOD 2009»
15 years 6 months ago
Answering Multiple-Item Queries in Data Broadcast Systems
A lot of research has been done on answering single-item queries, only a few have looked at answering multiple-item queries in data broadcast systems. The few that did, have propos...
Adesola Omotayo, Ken Barker, Moustafa A. Hammad, L...
SIGMOD
1991
ACM
104views Database» more  SIGMOD 1991»
15 years 8 months ago
Managing Persistent Objects in a Multi-Level Store
This paper presents an architecture for a persistent object store in which multi-level storage is explicitly included. Traditionally, DBMSs have assumed that all accessible data r...
Michael Stonebraker
PDPTA
2003
15 years 6 months ago
Comparing Multiported Cache Schemes
The performance of the data memory hierarchy is extremely important in current and near future high performance superscalar microprocessors. To address the memory gap, computer de...
Smaïl Niar, Lieven Eeckhout, Koenraad De Boss...
WAE
2000
128views Algorithms» more  WAE 2000»
15 years 6 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs