ConMR: Concurrent MapReduce programming model for large scale shared-Data applications
Author | Zhang, Fan |
Author | Malluhi, Qutaibah. M. |
Author | Elsyed, Tamer M. |
Available date | 2024-07-17T07:14:47Z |
Publication Date | 2013 |
Publication Name | Proceedings of the International Conference on Parallel Processing |
Resource | Scopus |
Identifier | http://dx.doi.org/10.1109/ICPP.2013.134 |
ISSN | 1903918 |
Abstract | The rapid growth of large-data processing has brought in the MapReduce programming model as a widely accepted solution. However, MapReduce limits itself to a onemap- To-one-reduce framework. Meanwhile, it lacks built-in support and optimization when the input datasets are shared among concurrent applications and/or jobs. The performance might be improved when the shared and frequently accessed data is read from local instead of distributed file system. To enhance the performance of big data applications, this paper presents Concurrent MapReduce, a new programming model built on top of MapReduce that deals with large amount of shared data items. Concurrent MapReduce provides support for processing heterogeneous sources of input datasets and offers optimization when the datasets are partially or fully shared. Experimental evaluation has shown an execution runtime speedup of 4X compared to traditional nonconcurrent MapReduce implementation with a manageable time overhead. |
Language | en |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Subject | Concurrency MapReduce Programming model Shared input data |
Type | Conference Paper |
Pagination | 671-679 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Computer Science & Engineering [2284 items ]