Sciweavers

543 search results - page 9 / 109
» A Randomized Parallel Sorting Algorithm with an Experimental...
Sort
View
FCS
2006
13 years 9 months ago
A Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
Rashid Muhammad
IWFM
1998
13 years 9 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
EUROPAR
2008
Springer
13 years 9 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
IEEEHPCS
2010
13 years 6 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 7 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...