Sciweavers

1074 search results - page 6 / 215
» Parallelizing post-placement timing optimization
Sort
View
SPAA
1993
ACM
13 years 11 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout
SBACPAD
2004
IEEE
124views Hardware» more  SBACPAD 2004»
13 years 9 months ago
Improving Parallel Execution Time of Sorting on Heterogeneous Clusters
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
Christophe Cérin, Michel Koskas, Hazem Fkai...
PDPTA
2000
13 years 8 months ago
Parallel Real-Time Cryptography: Beyond Speedup II
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second eq...
Selim G. Akl, Stefan D. Bruda
IRREGULAR
1995
Springer
13 years 11 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 7 months ago
Integrating Job Parallelism in Real-Time Scheduling Theory
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. ...
Sébastien Collette, Liliana Cucu, Joël...