From 64d0d207430962458c3885c64460a16cef5a2200 Mon Sep 17 00:00:00 2001 From: Remzi Arpaci-Dusseau Date: Wed, 11 Apr 2018 13:45:13 -0500 Subject: [PATCH] small nit --- concurrency-mapreduce/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/concurrency-mapreduce/README.md b/concurrency-mapreduce/README.md index fa178c6..95d00e0 100644 --- a/concurrency-mapreduce/README.md +++ b/concurrency-mapreduce/README.md @@ -239,9 +239,9 @@ Here are a few things to consider in your implementation: - **Thread Management**. This part is fairly straightforward. You should create `num_mappers` mapping threads, and assign a file to each `Map()` invocation in some manner you think is best (e.g., Round Robin, - Shortest-File-First, etc.). Which way might lead to best performance? - You should also create `num_reducers` reducer threads at some point, to - work on the map'd output. + Shortest-File-First, etc.). Which way might lead to best performance? You + should also create `num_reducers` reducer threads at some point, to work + on the map'd output. - **Partitioning and Sorting**. Your central data structure should be concurrent, allowing mappers to each put values into different