Scheduling real-time fork-join structures in cluster computing

Authors:
Reda Ammar;Abdulrahman Alhamdan
Affiliations:
U 2155, Department of Computer Science and Computer Engineering, University of Connecticut, 371 Fairfield Rd., 1155 Unit, Storrs, CT 06269 2155, USA.;U 2155, Department of Computer Science and Computer Engineering, University of Connecticut, 371 Fairfield Rd., 1155 Unit, Storrs, CT 06269 2155, USA.
Venue:
International Journal of High Performance Computing and Networking
Year:
2005

Citing 20
Cited 0

A comparison of receiver-initiated and sender-initiated adaptive load sharing

Performance Evaluation
Distributed Scheduling of Tasks with Deadlines and Resource Requirements

IEEE Transactions on Computers
A model to predict the average response time of user programs

Performance Evaluation
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
CPU reservations and time constraints: efficient, predictable scheduling of independent activities

Proceedings of the sixteenth ACM symposium on Operating systems principles
Challenger: a multi-agent system for distributed resource allocation

AGENTS '97 Proceedings of the first international conference on Autonomous agents
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Adaptive performance prediction for distributed data-intensive applications

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Stochastic scheduling

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Application-level scheduling on distributed heterogeneous networks

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
Theory and Practice in Parallel Job Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Predicting Application Run Times Using Historical Information

IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Hierarchical Performance Modeling for Distributed System Architectures

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Real-time scheduling using compact task graphs

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Why the Mean is Inadequate for Accurate Scheduling Decisions

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Two Case Studies in Predictable Application Scheduling Using Rialto/NT

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Static task scheduling and grain packing in parallel processing systems

Static task scheduling and grain packing in parallel processing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling a large number of high performance computing applications on cluster computing environment is a complex task especially in real-time systems. Efficient scheduling strategies are critically important for achieving a good performance. A cluster scheduler should adequately manage the cluster resources. In this paper, we present an algorithm for scheduling real-time applications represented as parallel task graphs on a cluster. We utilise the available processing power on each processor to maximise the degree of parallelism while satisfying the required tasks' deadlines. The algorithm reduces the communication cost among tasks and the possibility of processing power fragmentation.