A new method for job scheduling in two-levels hierarchical systems

Authors:
Amin Shokripour;Mohamed Othman;Hamidah Ibrahim;Shamala Subramaniam
Affiliations:
Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia
Venue:
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Year:
2013

Citing 5
Cited 0

Ten Reasons to Use Divisible Load Theory

Computer
Grid scheduling divisible loads from two sources

Computers & Mathematics with Applications
Scheduling Multisource Divisible Loads on Arbitrary Networks

IEEE Transactions on Parallel and Distributed Systems
A new algorithm for divisible load scheduling with different processor available times

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
New method for scheduling heterogeneous multi-installment systems

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of parallel and distributed systems has become very common in the last decade. Dividing data is one of the challenges in these types of systems. Divisible load theory (DLT) is one of the proposed methods for scheduling data distribution in parallel or distributed systems. Many researches have been done in this field, but scheduling a multi-installment heterogeneous system with two-level hierarchical topology in which communication mode is blocking has not been addressed. In this paper, we find the proper size of task for each sub tree. Finally, in the experiments section, we show that the proposed methods work correctly and give us the best scheduling.