Sciweavers

822 search results - page 68 / 165
» Contention in shared memory algorithms
Sort
View
GLOBECOM
2006
IEEE
14 years 3 months ago
A Practical Switch-Memory-Switch Architecture Emulating PIFO OQ
— Emulating Output Queued (OQ) Switch with sustainable implementation cost and low fixed delay is always preferable in designing high performance routers. The SwitchMemory-Switch...
Nan Hua, Yang Xu, Peng Wang, Depeng Jin, Lieguang ...
IPPS
2005
IEEE
14 years 2 months ago
Reconfigurable Object Consistency Model
Consistency is an important issue in Distributed Shared Memory (DSM) systems. These systems share a set of objects or virtual memory pages. The data sharing enables the applicatio...
Christiane V. Pousa, Luís Fabrício W...
STACS
2005
Springer
14 years 2 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
ISMM
2011
Springer
12 years 11 months ago
Towards a Parallel Topological Watershed: First Results
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
Joël van Neerbos, Laurent Najman, Michael H. ...
ICPP
2009
IEEE
13 years 6 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun