Multiple Job Scheduling in a Connection-Limited Data Parallel System

Authors:
Alessandro Amoroso;Keith Marzullo
Affiliations:
IEEE Computer Society;IEEE Computer Society
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2006

Citing 16
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Improved Algorithms for Bipartite Network Flow

SIAM Journal on Computing
Allocating independent tasks to parallel processors: an experimental study

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations

IEEE Transactions on Parallel and Distributed Systems
NILE: wide-area computing for high energy physics

EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Data management and transfer in high-performance computational grid environments

Parallel Computing - Parallel data-intensive algorithms and applications
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better

CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Scheduling From the Perspective of the Application

HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Performance Analysis of Scheduling and Replication Algorithms on Grid Datafarm Architecture for High-Energy Physics Applications

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Simulation of Dynamic Data Replication Strategies in Data Grids

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Wide-Area Nile: A Case Study of a Wide-Area Data-Parallel Application

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Task Assignment with Unknown Duration

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
File and Object Replication in Data Grids

HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms

IEEE Transactions on Parallel and Distributed Systems
Grid computing in Europe: from research to deployment

ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a hybrid approach to the scheduling of jobs in a distributed system where the critical response is the bandwidth to access stored data. Our approach supports the master-worker scheme, but could be applied to other cases of parallel computation over stored data. We tested our new approach under various circumstances and measured it performance by means of several metrics. We made comparisons of our approach with respect to other scheduling policies; it performed significantly better than the majority of cases, and in worst cases, it was as good as the best of the others.