Sciweavers

1074 search results - page 7 / 215
» Parallelizing post-placement timing optimization
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Parallelism orchestration using DoPE: the degree of parallelism executive
In writing parallel programs, programmers expose parallelism and optimize it to meet a particular performance goal on a single platform under an assumed set of workload characteri...
Arun Raman, Hanjun Kim, Taewook Oh, Jae W. Lee, Da...
ICS
1993
Tsinghua U.
13 years 11 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
11 years 10 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
COLT
1994
Springer
13 years 11 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...