Sciweavers

175 search results - page 9 / 35
» Scalable Fault-Tolerant Distributed Shared Memory
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
ICPP
1997
IEEE
13 years 11 months ago
Automatic Partitioning of Data and Computations on Scalable Shared Memory Multiprocessors
Abstract—This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationshi...
Sudarsan Tandri, Tarek S. Abdelrahman
IEEEPACT
1998
IEEE
13 years 11 months ago
Parallelization of Benchmarks for Scalable Shared-Memory Multiprocessors
This work identifies practical compiling techniques for scalable shared memory machines. For this, we have focused on experimental studies using a real machine and representative ...
Yunheung Paek, Angeles G. Navarro, Emilio L. Zapat...
ISPA
2004
Springer
14 years 2 days ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
INFOCOM
2012
IEEE
11 years 9 months ago
Network optimization for DHT-based applications
—P2P platforms have been criticized because of the heavy strain that some P2P services can inflict on costly interdomain links of network operators. It is therefore necessary to...
Yi Sun, Yang Richard Yang, Xiaobing Zhang, Yang Gu...