Scalable and Low-Latency Data Processing with StreamMapReduce
Research output: Contribution to conferences › Paper › Contributed › peer-review
Contributors
Abstract
We present StreamMapReduce, a data processing approach that combines ideas from the popular MapReduce paradigm and recent developments in Event Stream Processing. We adopted the simple and scalable programming model of MapReduce and added continuous, low-latency data processing capabilities previously found only in Event Stream Processing systems. This combination leads to a system that is efficient and scalable, but at the same time, simple from the user's point of view. For latency-critical applications, our system allows a hundred-fold improvement in response time. Notwithstanding, when throughput is considered, our system offers a ten-fold per node throughput increase in comparison to Hadoop. As a result, we show that our approach addresses classes of applications that are not supported by any other existing system and that the MapReduce paradigm is indeed suitable for scalable processing of real-time data streams.
Details
Original language | English |
---|---|
Pages | 48-58 |
Number of pages | 11 |
Publication status | Published - 2011 |
Peer-reviewed | Yes |
Conference
Title | 3rd IEEE International Conference on Cloud Computing Technology and Science |
---|---|
Abbreviated title | CloudCom 2011 |
Conference number | 3 |
Duration | 29 November - 1 December 2011 |
Website | |
Degree of recognition | International event |
City | Athen |
Country | Greece |
External IDs
Scopus | 84857167165 |
---|
Keywords
Research priority areas of TU Dresden
DFG Classification of Subject Areas according to Review Boards
Keywords
- Programming, Fault Tolerance, Fault tolerant systems, Scalability, Databases, Ral time systems, Instruction sets, data handling, distributed algorithms, event stream processing, complex event processing, MapReduce