Sciweavers

6897 search results - page 520 / 1380
» Parallelization of Modular Algorithms
Sort
View
141
Voted
IPPS
1999
IEEE
15 years 9 months ago
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
Michael Holzrichter, Suely Oliveira
CAV
2009
Springer
139views Hardware» more  CAV 2009»
16 years 5 months ago
A Concurrent Portfolio Approach to SMT Solving
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...
Christoph M. Wintersteiger, Leonardo Mendonç...
141
Voted
PPAM
2005
Springer
15 years 10 months ago
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
Lukasz Masko, Pierre-François Dutot, Gregor...
IPPS
2000
IEEE
15 years 9 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
132
Voted
IPPS
1999
IEEE
15 years 9 months ago
The Performance of Coordinated and Independent Checkpointing
Checkpointing is a very effective technique to tolerate the occurrence of failures in distributed and parallel applications. The existing algorithms in the literature are basicall...
Luís Moura Silva, João Gabriel Silva