Sciweavers

147 search results - page 2 / 30
» A Distributed and Oblivious Heap
Sort
View
IPPS
2002
IEEE
13 years 9 months ago
Heaps and Stacks in Distributed Shared Memory
Software-based distributed shared memory (DSM) systems do usually not provide any means to use shared memory regions as stacks or via an efficient heap memory allocator. Instead ...
Markus Pizka, Christian Rehn
ICALP
2003
Springer
13 years 10 months ago
Optimal Cache-Oblivious Implicit Dictionaries
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
Gianni Franceschini, Roberto Grossi
SPAA
2005
ACM
13 years 10 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
SPAA
2003
ACM
13 years 10 months ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
13 years 9 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...