Header menu link for other important links
X
Arranging job flow on hadoop
C. Navaneethan, S. Meenatchi, M. Iyapparaja,
Published in Institute of Advanced Scientific Research, Inc.
2018
Volume: 10
   
Issue: 5 Special Issue
Pages: 1558 - 1561
Abstract
Scheduling job line on Hadoop is a successful way to deal with stay away from starvation and minimize reaction time with the use of HFS protocol. All the cluster nodes are allocated by the scheduler using job size while the activity steps forward to its conclusion. Selection of scheduling help out the approaches of virtual time and all the cluster resources focusing on jobs with their arrangement. This guarantees not any of the jobs small job or big jobs without meet the starvation situation. We use the shortest remaining processing time(SRPT) to organize and prioritizes the small amount of work to finish first, because the smallest job has the minimum response time. The HFS (Hadoop Fair sojourn) protocol pauses the jobs which has higher response time and permit other holding jobs in line basis of first come first serve(FCFS). © 2018, Institute of Advanced Scientific Research, Inc. All rights reserved.
About the journal
JournalJournal of Advanced Research in Dynamical and Control Systems
PublisherInstitute of Advanced Scientific Research, Inc.
ISSN1943023X