Sciweavers

3 search results - page 1 / 1
» Sorting and searching in the presence of memory faults (with...
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 5 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
ICNS
2009
IEEE
13 years 3 months ago
HGRID: Fault Tolerant, Log2N Resource Management for Grids
Grid Resource Discovery Service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fau...
Antonia Gallardo, Kana Sanjeevan, Luis Díaz...
ICFP
2009
ACM
14 years 6 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...