Sciweavers

534 search results - page 52 / 107
» On Scheduling Parallel Tasks at Twilight
Sort
View
161
Voted
HPCC
2009
Springer
15 years 1 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
IPPS
1998
IEEE
15 years 8 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
CLUSTER
2010
IEEE
14 years 7 months ago
Middleware support for many-task computing
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
Ioan Raicu, Ian T. Foster, Mike Wilde, Zhao Zhang,...
HPDC
2005
IEEE
15 years 9 months ago
Cost-based scheduling for data-intensive applications on global grids
We present an algorithm for scheduling distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing da...
Srikumar Venugopal, Rajkumar Buyya
CCGRID
2009
IEEE
15 years 1 months ago
Resource Information Aggregation in Hierarchical Grid Networks
We propose information aggregation as a method for summarizing the resource-related information, used by the task scheduler. Through this method the information of a set of resour...
Panagiotis C. Kokkinos, Emmanouel A. Varvarigos