Sciweavers

822 search results - page 32 / 165
» Contention in shared memory algorithms
Sort
View
ICDCS
1996
IEEE
14 years 29 days ago
The Performance Value of Shared Network Caches in Clustered Multiprocessor Workstations
This paper evaluates the bene t of adding a shared cache to the network interface as a means of improving the performance of networked workstations con gured as a distributed shar...
John K. Bennett, Katherine E. Fletcher, William Ev...
SPDP
1993
IEEE
14 years 28 days ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
ICPP
2009
IEEE
13 years 6 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
IPPS
2009
IEEE
14 years 3 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
HCI
2009
13 years 6 months ago
Evaluation of User Reputation on YouTube
In the Web 2.0 era, people not only read web contents but upload, view, share and evaluate all contents on the web. This leads us to introduce a new type of social network that is ...
Yo-Sub Han, Laehyun Kim, Jeong-Won Cha