Research on Information Processing with Delay Fair Scheduling Algorithm Based on Resource Situation

Xue Ying Jiang; Yang Yang; Di Jing

doi:10.4028/www.scientific.net/AMR.1046.363

Paper Titles

A Semi-Persistent Scheduling Algorithm for VoIP in LTE-Advanced System
p.343

A Time Synchronization Algorithm Based on Cluster-Tree
p.348

The Design of Embedded Ethernet System Based Microcontroller
p.352

Research on Information Processing with Dynamic Adaptive Job Scheduling Algorithm Based on Hadoop Platform
p.359

Research on Information Processing with Delay Fair Scheduling Algorithm Based on Resource Situation
p.363

A Variables Clustering Based Differential Evolution Algorithm to Solve Multistage Goal Programming Model in Defense Projects Portfolio
p.367

Chaotic Clonal Genetic Algorithm for Routing Optimization
p.371

Projection Method for Material Selection Problem with Triangular Fuzzy Numbers
p.375

Applied-Information Technology in Adaptive Kalman Filter with Model Error and Noise Error
p.380

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 1046Research on Information Processing with Delay Fair...

Research on Information Processing with Delay Fair Scheduling Algorithm Based on Resource Situation

Abstract:

Job scheduling algorithm is one of the key technologies Hadoop platform. In this paper, waiting for a fair scheduling algorithm based on delay resource situation. The algorithm periodically obtain status through the use of cluster resources to determine the wait timeout, it has dynamic. Experimental results show that the Delay Fair Scheduling Algorithm Based On the Resource Situation than the original algorithm to some extent reduces the job run time and improve the throughput of Hadoop platform.

You might also be interested in these eBooks

Advanced Development of Engineering Science IV

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 1046)

Pages:

363-366

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.1046.363

Citation:

Cite this paper

Online since:

October 2014

Authors:

Xue Ying Jiang*, Yang Yang, Di Jing

Keywords:

Delay Fair Scheduling, Hadoop, MapReduce, Resources Status

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Christopher Barnatt. A brief Gudie To Cloud Computing[M]，Britain，TheUnited Kingdom publisher，February 2013, 2-4.

Google Scholar

[2] Weiming Zhou, Jiong Yu, Changtian Ying. delayed scheduling algorithm based on dynamic latency threshold [J] Computer Application Research, 2012, 29 (11): 4073-4078.

Google Scholar

[3] Chuck Lam. Hadoop combat [M], People Post Press, October 2011, 86-102.

Google Scholar

[4] Liying Li, Zhuo Tang, Renfa Li. locality improved scheduling algorithm based LATE of Hadoop data [J] Computer Science, 2011, 11: 014.

Google Scholar

[5] Todd D. Plantega, Yung Ryn Choe, Ann Yoshimura. Using Performance Measurements to Improve MapReduce Algorithms[J], Procedia Computer Science, 2012, Vol9, 20-29.

DOI: 10.1016/j.procs.2012.04.210

Google Scholar

[6] Genhong Zhou, Guogui Yang. Study Hadoop platform under fair scheduler algorithm [J], thecommunications market, in 2012, January-February, 22-25.

Google Scholar

[7] Momtaz A, Amreen S. Detecting document similarity in large document collecting using MapReduce and the Hadoop framework[J]. (2012).

Google Scholar