Sciweavers

2186 search results - page 62 / 438
» Considering an Organization's Memory
Sort
View
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 7 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
CGI
1998
IEEE
15 years 10 months ago
An Anti-Aliasing Method for Parallel Rendering
This paper describes a parallel rendering method based on the adaptive supersampling technique to produce anti-aliased images with minimal memory consumption. Unlike traditional s...
Sam Lin, Rynson W. H. Lau, Xiaola Lin, Paul Y. S. ...
HIPS
1998
IEEE
15 years 10 months ago
Implementing Automatic Coordination on Networks of Workstations
Distributed shared objects are a well known approach to achieve independenceof the memory model for parallel programming. The illusion of shared (global) objects is a conabstracti...
Christian Weiß, Jürgen Knopp, Hermann H...
SIGMOD
1991
ACM
104views Database» more  SIGMOD 1991»
15 years 9 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
JOT
2007
99views more  JOT 2007»
15 years 5 months ago
On Flash-Based DBMSs: Issues for Architectural Re-Examination
Flash memory is being rapidly deployed as data storage for mobile devices. Flash memory offers many advantages over hard disk, and considering its rapid technical improvement both...
Sang-Won Lee, Won Kim