Sciweavers

3202 search results - page 300 / 641
» Memory access scheduling
Sort
View
IPPS
2003
IEEE
15 years 12 months ago
Performance Prediction of Paging Workloads Using Lightweight Tracing
A trace of a workload’s system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. R...
Ariel N. Burton, Paul H. J. Kelly
ISLPED
2003
ACM
127views Hardware» more  ISLPED 2003»
15 years 12 months ago
Lightweight set buffer: low power data cache for multimedia application
A new architectural technique to reduce power dissipation in data caches is proposed. In multimedia applications, a major portion of data cache accesses hit in the same cache set ...
Jun Yang 0002, Youtao Zhang
ADBIS
1999
Springer
80views Database» more  ADBIS 1999»
15 years 11 months ago
S*-Tree: An Improved S+-Tree for Coloured Images
In this paper we propose and analyze a new spatial access method, namely the S∗ -tree, for the efficient secondary memory encoding and manipulation of images containing multiple ...
Enrico Nardelli, Guido Proietti
EDBT
2000
ACM
15 years 10 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
CLUSTER
2001
IEEE
15 years 10 months ago
Clusterfile: A Flexible Physical Layout Parallel File System
This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. Existing parallel file systems offer little control over matc...
Florin Isaila, Walter F. Tichy