Sciweavers

10805 search results - page 323 / 2161
» Mapping Computation with No Memory
Sort
View
FOCS
1998
IEEE
15 years 11 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin
ICALP
2005
Springer
16 years 8 days ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
KES
2005
Springer
16 years 7 days ago
Sustainable Memory System Using Global and Conical Spaces
: We present a concept and implementation of a computational support for spatial memory management and describe its temporal evolution. Our essential idea is to use an immersible g...
Hidekazu Kubota, Satoshi Nomura, Yasuyuki Sumi, To...
VLDB
1997
ACM
109views Database» more  VLDB 1997»
15 years 11 months ago
Effective Memory Use in a Media Server
A number of techniques have been developed for maximizing disk utilization in media servers, including disk arm scheduling and data placement ones. Instead, in this paper we focus...
Edward Y. Chang, Hector Garcia-Molina
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
15 years 10 months ago
The Price of Resiliency: A Case Study on Sorting with Memory Faults
We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and ...
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe...