id: Simula.ND.321
ERROR IN ENCODING
title: Kahn process networks are a flexible alternative to MapReduce
publication_year: 2009
abstract: Experience has shown that development using shared-memory concurrency, the   prevalent parallel programming paradigm today, is hard and synchronization   primitives nonintuitive because they are low-level and inherently   nondeterministic. To help developers, we propose Kahn process networks,   which are based on message-passing and shared-nothing model, as a simple and   flexible tool for modeling parallel applications.  We argue that they are   more flexbile than MapReduce, which is widely recognized for its efficiency   and simplicity.  Nevertheless, Kahn process networks are equally intuitive   to use, and, indeed, MapReduce is implementable as a Kahn process network.   Our presented benchmarks (word count and k-means) show that a Kahn process   network framework permits alternative implementations that bring significant   performance advantages: the two programs run by a factor of up to $\sim 2.8$   (word-count) and $\sim 1.8$ (k-means) faster than their implementations for   Phoenix, which is a MapReduce framework specifically optimized for executing   on multicore machines.
publication_url: 
pdf_url: 
booktitle: Proceedings of 11th IEEE International Conference on High Performance Computing and Communications (HPCC)
editor: NA
volume: 
number: 
chapter: 
pages: 154-162
publisher: IEEE Computer Society
organization: 
address: 
edition: 
series: 
isbn: 978-0-7695-3738-2
keywords: ()
publication_month: 
note: 
annote: 
additional: []
location: 
publication_state: Published
simula_ou: [<Department at /simula/department/media>, <Department at /simula/research/mpg>]
publisher_url: 
category: Conference
from_date: 2009/06/25 00:00:00 GMT+2
to_date: 2009/06/27 00:00:00 GMT+2