Sciweavers

25167 search results - page 100 / 5034
» Parallel and Distributed Algorithms
Sort
View
IPPS
1997
IEEE
15 years 2 months ago
Parallel Simulated Annealing: An Adaptive Approach
This paper analyses alternatives for the parallelization of the Simulated Annealing algorithm when applied to the placement of modules in a VLSI circuit considering the use of PVM...
Jonas Knopman, Júlio S. Aude
ICPP
1995
IEEE
15 years 1 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
IPPS
2006
IEEE
15 years 3 months ago
A pattern selection algorithm for multi-pattern scheduling
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit
IPPS
2000
IEEE
15 years 2 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar
EUROPAR
2008
Springer
14 years 11 months ago
The Impact of Clustering on Token-Based Mutual Exclusion Algorithms
We present in this article a theoretical study and performance results about the impact of the Grid architecture on token-based mutual exclusion algorithms. To this end, both the o...
Julien Sopena, Luciana Arantes, Fabrice Legond-Aub...