Lecture

MapReduce: Execution Models for Distributed Computing

Description

This lecture introduces the MapReduce programming model for distributed computing, focusing on its vision, sample applications like word-count, and under-the-hood mechanisms like shuffling and reducing. It discusses the simplicity and complexity of distributed computation, the challenges with MapReduce, and its impact on big data processing.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.