DAIET
Author(s) -
Amedeo Sapio,
Ibrahim Abdelaziz,
Marco Canini,
Panos Kalnis
Publication year - 2017
Publication title -
king abdullah university of science and technology repository (king abdullah university of science and technology)
Language(s) - English
Resource type - Conference proceedings
ISBN - 978-1-4503-5028-0
DOI - 10.1145/3127479.3132018
Subject(s) - computation , computer science , scalability , server , distributed computing , partition (number theory) , parallel computing , data center , scale (ratio) , computer network , algorithm , operating system , mathematics , combinatorics , physics , quantum mechanics
Many data center applications nowadays rely on distributed computation models like MapReduce and Bulk Synchronous Parallel (BSP) for data-intensive computation at scale [4]. These models scale by leveraging the partition/aggregate pattern where data and computations are distributed across many worker servers, each performing part of the computation. A communication phase is needed each time workers need to synchronize the computation and, at last, to produce the final output. In these applications, the network communication costs can be one of the dominant scalability bottlenecks especially in case of multi-stage or iterative computations [1]
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom