Sciweavers

352 search results - page 22 / 71
» Parallel Algorithms for Hypercube Allocation
Sort
View
CCGRID
2005
IEEE
14 years 2 months ago
Task scheduling strategies for workflow-based applications in grids
Grid applications require allocating a large number of heterogeneous tasks to distributed resources. A good allocation is critical for efficient execution. However, many existing ...
James Blythe, S. Jain, Ewa Deelman, Yolanda Gil, K...
IPPS
1997
IEEE
14 years 11 hour ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
SPAA
1996
ACM
14 years 18 days ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ICANN
2005
Springer
14 years 2 months ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
ESCIENCE
2006
IEEE
14 years 2 months ago
Application-Level Resource Provisioning on the Grid
In this paper, we present algorithms for Grid resource provisioning that employ agreement-based resource management. These algorithms allow userlevel resource allocation and sched...
Gurmeet Singh, Carl Kesselman, Ewa Deelman