1534 search results - page 41 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
CCGRID
2007
IEEE
14 years 2 months ago
2007
IEEE
The existence of good probabilistic models for the job arrival process and job characteristics is important for the improved understanding of grid systems and the prediction of th...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
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...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Bulk-Synchronous Parallel ML (BSML) is a functional dataparallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, a...
ISPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can...
JAIR
1998
13 years 7 months ago
1998
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...