dc.contributor.authorXu, Yongliang
dc.date.accessioned2015-07-16T03:45:23Z
dc.date.available2015-07-16T03:45:23Z
dc.date.copyright2015en_US
dc.date.issued2015
dc.identifier.citationXu, Y. (2015). Hadoop job scheduling with dynamic task splitting. Master’s thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/65309
dc.description.abstractJob scheduling affects the fairness and performance of shared Hadoop clusters. Fairness measures how fair the resources in the cluster are shared among different users in the Hadoop cluster. In Hadoop, schedulers will always attempt to maximize data locality. Data locality refers to the processing of data by tasks on nodes where the data is stored. Processing of data on data-local nodes improves performance, as there is no need to transfer data from one node to another. However, fairness and data locality are often in conflict. During scheduling, it is not always possible that the available nodes contain the data that a user’s job requires. In such cases, a scheduler may choose to schedule the tasks on these nodes regardless of data locality thus sacrificing performance. Alternatively, a scheduler may choose to give up the user’s slot and wait for a data-local node thus sacrificing fairness. Achieving pure fairness may compromise the data locality of the tasks that will in turn negatively affects performances, and vice-versa. Delay scheduling is a technique that attempts to improve data locality by waiting for a data-local node to be available. It violates the fairness criteria. The Dynamic Task Splitting Scheduler (DTSS) is proposed to mitigate the tradeoffs between fairness and data locality during job scheduling. DTSS does so by dynamically splitting a task and executing the split task immediately, on a non-data-local node, to improve the fairness. Analysis and experiments results show that it is possible to improve both fairness and the performance by adjusting the proportion of the task split. DTSS is shown to improve the makespan of different users in a cluster by 2% to 11% as compared to delay scheduling under conditions that is difficult to obtain data-local nodes on a cluster. Lastly, experiments show that DTSS is not a suitable scheduler under conditions where jobs are able to obtain data-local nodes easily.en_US
dc.format.extent68 p.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Engineering::Computer science and engineering::Information systems::Information systems applicationsen_US
dc.titleHadoop job scheduling with dynamic task splittingen_US
dc.typeThesis
dc.contributor.supervisorCai Wentongen_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.description.degreeMaster of Engineering (SCE)en_US
dc.contributor.researchParallel and Distributed Computing Centreen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record