Fair multi-agent task allocation for large data sets analysis

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many companies are using MapReduce applications to process very large amounts of data. Static optimization of such applications is complex because they are based on user-defined operations, called map and reduce, which prevents some algebraic optimization. In order to optimize the task allocation, several systems collect data from previous runs and predict the performance doing job profiling. However they are not effective during the learning phase, or when a new type of job or data set appears. In this paper, we present an adaptive multiagent system for large data sets analysis with MapReduce. We do not preprocess data and we adopt a dynamic approach, where the reducer agents interact during the job. In order to decrease the workload of the most loaded reducer-and so the execution time-we propose a task re-allocation based on negotiation.

Cite

CITATION STYLE

APA

Baert, Q., Caron, A. C., Morge, M., & Routier, J. C. (2016). Fair multi-agent task allocation for large data sets analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9662, pp. 24–35). Springer Verlag. https://doi.org/10.1007/978-3-319-39324-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free