MOMTH: multi-objective scheduling algorithm of many tasks in Hadoop
Tipo de documentoArtículo
Fecha de publicación2015-09-01
EditorKluwer Academic Publishers
Condiciones de accesoAcceso abierto
A real challenge sits in front of the business solutions these days, in the context of the big amount of data generated by complex software applications: efficiently using the given limited resources to accomplish specific operations and tasks. Depending on the type of application dealing with, when trying to deliver a certain service in a specific time and with a limited budget, a sequential application may be redesigned in a convenient way so that it will become scalable and able to run on multiple resources. Many task computing model brings together loosely coupled applications, composed of many dependent/independent tasks, which will work together for a common result. When asking for a certain service, the most frequently constraints addressed by the user are deadline and budget. This paper elaborates on a multi-objective scheduling algorithm of many tasks in Hadoop for big data processing, named MOMTH. We consider objective functions related to users and resources in the same time with constraints like deadline (scheduling in due time) and budget. The algorithm evaluation was realized in scheduling load simulator, a tool integrated in Hadoop. MobiWay, a collaboration platform that expose interoperability between a large number of sensing mobile devices and a wide-range of mobility applications, was chosen for performance analysis of MOMTH. We compared the proposed algorithm with first in first out and fair schedulers and we obtained similar performance for our approach.
This is a copy of the author 's final draft version of an article published in the journal Cluster computing. The final publication is available at Springer via http://dx.doi.org/10.1007/s10586-015-0454-8
CitaciónNita, M., Pop, F., Voicu, C., Dobre, C., Xhafa, F. MOMTH: multi-objective scheduling algorithm of many tasks in Hadoop. "Cluster computing", 01 Setembre 2015, vol. 18, núm. 3, p. 1011-1024.
Versión del editorhttp://link.springer.com/article/10.1007/s10586-015-0454-8