Sciweavers

822 search results - page 15 / 165
» Contention in shared memory algorithms
Sort
View
ICDCSW
2002
IEEE
14 years 15 days ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...
NETWORKING
2007
13 years 9 months ago
Accelerated Packet Placement Architecture for Parallel Shared Memory Routers
Abstract. Parallel shared memory (PSM) routers represent an architectural approach for addressing the high memory bandwidth requirements dictated by output-queued switches. A funda...
Brad Matthews, Itamar Elhanany, Vahid Tabatabaee
DC
2008
13 years 7 months ago
The weakest failure detectors to boost obstruction-freedom
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
13 years 11 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
SIGCOMM
2009
ACM
14 years 2 months ago
A standalone content sharing application for spontaneous communities of mobile handhelds
This demo illustrates the benefits of BitHoc, a standalone protocol for content sharing among spontaneous communities of mobile handhelds using wireless multi-hop connections. Bi...
Amir Krifa, Mohamed Karim Sbai, Chadi Barakat, Thi...