Sciweavers

1074 search results - page 24 / 215
» Parallelizing post-placement timing optimization
Sort
View
PPSN
2010
Springer
14 years 7 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
75
Voted
IPPS
2000
IEEE
15 years 2 months ago
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity ON , where 2  3. We show that such an algorithm can be parallelize...
Keqin Li
IPPS
2005
IEEE
15 years 3 months ago
Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform
The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distribu...
Alexey Kalinov, Sergey Klimov
69
Voted
QUESTA
2008
73views more  QUESTA 2008»
14 years 9 months ago
Optimal control of parallel server systems with many servers in heavy traffic
We consider a parallel server system that consists of several customer classes and server pools in parallel. We propose a simple robust control policy to minimize the total linear...
J. G. Dai, Tolga Tezcan
IPPS
1998
IEEE
15 years 1 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...