Sciweavers

1534 search results - page 9 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
SPAA
1996
ACM
13 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
SPAA
2009
ACM
14 years 8 days ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
ICS
1995
Tsinghua U.
13 years 11 months ago
Run-Time Methods for Parallelizing Partially Parallel Loops
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...
Lawrence Rauchwerger, Nancy M. Amato, David A. Pad...
APSCC
2008
IEEE
13 years 9 months ago
Optimizing the Execution Time of the SLA-based Workflow in the Grid with Parallel Processing Technology
Service Level Agreements (SLAs) is currently one of the major research topics in Grid Computing. Among many system components for the supporting of SLA-aware Gridbased workflow, t...
Dang Minh Quan, Jörn Altmann, Laurence Tianru...