Sciweavers

4155 search results - page 95 / 831
» External Memory Algorithms
Sort
View
ALGORITHMICA
2008
131views more  ALGORITHMICA 2008»
15 years 2 months ago
Sorting and Searching in Faulty Memories
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
Irene Finocchi, Giuseppe F. Italiano
FOCS
1990
IEEE
15 years 6 months ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig
PARA
2004
Springer
15 years 7 months ago
Analyzing Advanced PDE Solvers Through Simulation
Abstract. By simulating a real computer it is possible to gain a detailed knowledge of the cache memory utilization of an application, e.g., a partial differential equation (PDE) s...
Henrik Johansson, Dan Wallin, Sverker Holmgren
ERSA
2009
131views Hardware» more  ERSA 2009»
15 years 9 days ago
Acceleration of Optical-Flow Extraction Using Dynamically Reconfigurable ALU Arrays
An effective way to implement image processing applications is to use embedded processors with dynamically reconfigurable accelerator cores. The processing speed of these processor...
Hasitha Muthumala Waidyasooriya, Masanori Hariyama...
LCPC
2005
Springer
15 years 8 months ago
Applying Data Copy to Improve Memory Performance of General Array Computations
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
Qing Yi