Difference between revisions of "MapReduce Frameworks Lab"
Jump to navigation
Jump to search
| (87 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| + | [[Bottleneck_MapReduce_Framework_Assignment|Bottleneck MapReduce Framework]] | ||
| + | |||
| + | [[Matrix_MapReduce_Framework_Assignment|Matrix MapReduce Framework]] | ||
| + | |||
| + | <!-- | ||
| + | credit for this assignment: Finn Voichick and Dennis Cosgrove | ||
=Motivation= | =Motivation= | ||
| − | Dealing with [https://en.wikipedia.org/wiki/Big_data big data] is Hansel-level hot right now. We will build two implementations to better understand the inner workings of Hadoop and Spark-like frameworks. Your frameworks will actually be more | + | Dealing with [https://en.wikipedia.org/wiki/Big_data big data] is Hansel-level hot right now. We will build two implementations to better understand the inner workings of Hadoop and Spark-like frameworks. Your frameworks will actually be more general than just MapReduce. |
The Matrix implementation gives us experience with dividing the work up into thread confined tasks whose results are then combined together. | The Matrix implementation gives us experience with dividing the work up into thread confined tasks whose results are then combined together. | ||
| Line 7: | Line 13: | ||
[https://en.wikipedia.org/wiki/MapReduce wikipedia article on MapReduce] | [https://en.wikipedia.org/wiki/MapReduce wikipedia article on MapReduce] | ||
| − | As the name suggests, MapReduce refers to the process of mapping then reducing some stream of data. At its core, all a MapReduce algorithm entails is transforming a list of one kind of item before collecting those items and reducing them down to a single | + | As the name suggests, MapReduce refers to the process of mapping then reducing some stream of data. At its core, all a MapReduce algorithm entails is transforming a list of one kind of item before collecting those items and reducing them down to a single values per key using some computation. As you can probably tell, the concept of MapReduce is extremely general and can apply to a wide berth of problems. In this assignment, we will use MapReduce to simulate the Facebook mutual friends algorithm (finding the mutual friends between all friend pairs) as well as pinpointing the offending well in the 1854 Soho Cholera Outbreak. |
For more information on the general concept of MapReduce, refer to [https://stackoverflow.com/questions/28982/simple-explanation-of-mapreduce this] article. | For more information on the general concept of MapReduce, refer to [https://stackoverflow.com/questions/28982/simple-explanation-of-mapreduce this] article. | ||
| Line 13: | Line 19: | ||
=Java Advice= | =Java Advice= | ||
==Parameterized Type Array Tip== | ==Parameterized Type Array Tip== | ||
| − | Creating arrays of parameterized types in Java is madness inducing. Some details are available in [https://docs.oracle.com/javase/tutorial/java/generics/restrictions.html Java Generics Restrictions]. | + | Creating arrays of parameterized types in Java is madness inducing. Some details are available in [https://docs.oracle.com/javase/tutorial/java/generics/restrictions.html#createArrays Java Generics Restrictions]. |
The example below creates an array of List<String>. The <code>@SuppressWarnings</code> annotation is optional. | The example below creates an array of List<String>. The <code>@SuppressWarnings</code> annotation is optional. | ||
| Line 20: | Line 26: | ||
==Use map.entrySet()== | ==Use map.entrySet()== | ||
| − | Prefer the use of map.entrySet() over map.keySet() followed by looking up the value with map.get(key). | + | Prefer the use of [https://docs.oracle.com/javase/8/docs/api/java/util/Map.html#entrySet-- map.entrySet()] over map.keySet() followed by looking up the value with map.get(key). |
==Use the appropriate version of forall== | ==Use the appropriate version of forall== | ||
there are many overloaded versions of forall including: | there are many overloaded versions of forall including: | ||
| − | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/ | + | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/edu/wustl/cse231s/v5/V5.html#forall-int-int-edu.wustl.cse231s.v5.api.CheckedIntConsumer- range of ints from min to maxExclusive] |
| − | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/ | + | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/edu/wustl/cse231s/v5/V5.html#forall-T:A-edu.wustl.cse231s.v5.api.CheckedConsumer- array] |
| − | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/ | + | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/edu/wustl/cse231s/v5/V5.html#forall-java.lang.Iterable-edu.wustl.cse231s.v5.api.CheckedConsumer- Iterable] |
choose the correct one for each situation where "correct" is often the one that produces the cleanest code. | choose the correct one for each situation where "correct" is often the one that produces the cleanest code. | ||
| Line 35: | Line 41: | ||
{{Warning | Ensure that your [[Slices|Slices studio]] is conforming to spec.}} | {{Warning | Ensure that your [[Slices|Slices studio]] is conforming to spec.}} | ||
| − | |||
| − | |||
| − | |||
=Code To Use= | =Code To Use= | ||
| − | To allow our frameworks to work well with JDK8 Streams, we employ a couple of standard interfaces over creating | + | To allow our frameworks to work well with JDK8 Streams, we employ a couple of standard interfaces over creating our own custom ones. |
==BiConsumer== | ==BiConsumer== | ||
| Line 53: | Line 56: | ||
read [https://docs.oracle.com/javase/8/docs/api/java/util/stream/Collector.html the javadoc for Collector] | read [https://docs.oracle.com/javase/8/docs/api/java/util/stream/Collector.html the javadoc for Collector] | ||
| − | check out the [[Collector_MapReduce_Studio# | + | check out the [[Collector_MapReduce_Studio#Background]] |
| + | |||
| + | ==IndexedRange== | ||
| + | [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/slice/core/IndexedRange.html class IndexedRange] | ||
| + | |||
| + | This class has everything you need for n-way split problems, specifically: | ||
| + | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/slice/core/IndexedRange.html#getSliceIndexId() getSliceIndexId()] | ||
| + | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/slice/core/IndexedRange.html#getMinInclusive() getMinInclusive()] | ||
| + | * [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/slice/core/IndexedRange.html#getMaxExclusive() getMaxExclusive()]. | ||
==Slices== | ==Slices== | ||
| − | [https://www.cse.wustl.edu/~cosgroved/courses/cse231/ | + | [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/slice/studio/Slices.html class Slices] |
| − | : [https://www.cse.wustl.edu/~cosgroved/courses/cse231/ | + | : [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/slice/studio/Slices.html#createNSlices(C%5B%5D,int) <nowiki>List<Slice<C[]>> createNSlices(C[] data, int numSlices)</nowiki>] |
| + | |||
| + | ==HashUtils== | ||
| + | [https://www.cse.wustl.edu/~cosgroved/courses/cse231/s20/apidocs/hash/studio/HashUtils.html#toIndex(java.lang.Object,int) toIndex(key,N)] | ||
==MultiWrapMap== | ==MultiWrapMap== | ||
| − | [https://www.cse.wustl.edu/~cosgroved/courses/cse231/ | + | [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/edu/wustl/cse231s/util/MultiWrapMap.html class MultiWrapMap<K,V>] |
=A Path To Victory= | =A Path To Victory= | ||
| Line 67: | Line 81: | ||
* [[Mutual_Friends_MapReduce_Application]] | * [[Mutual_Friends_MapReduce_Application]] | ||
* [[#Optional_Warm_Up]] | * [[#Optional_Warm_Up]] | ||
| − | * [[# | + | * [[#Bottlenecked_MapReduce_Framework]] |
* [[Cholera_MapReduce_Application]] | * [[Cholera_MapReduce_Application]] | ||
* [[#Matrix_MapReduce_Framework]] | * [[#Matrix_MapReduce_Framework]] | ||
| + | |||
| + | =The Core Questions= | ||
| + | *What are the tasks? | ||
| + | *What is the data? | ||
| + | *Is the data mutable? | ||
| + | *If so, how is it shared? | ||
=Optional Warm Up= | =Optional Warm Up= | ||
==WordCountConcreteStaticMapReduce== | ==WordCountConcreteStaticMapReduce== | ||
| − | {{CodeToImplement|WordCountConcreteStaticMapReduce| | + | {{CodeToImplement|WordCountConcreteStaticMapReduce|mapAll<br>accumulateAll<br>finishAll|mapreduce.framework.warmup.wordcount}} |
===Mapper=== | ===Mapper=== | ||
| − | + | ====map (Provided)==== | |
| + | <nowiki> static void map(TextSection textSection, BiConsumer<String, Integer> keyValuePairConsumer) { | ||
| + | mapper.map(textSection, keyValuePairConsumer); | ||
| + | }</nowiki> | ||
===Reducer=== | ===Reducer=== | ||
| − | { | + | ====createMutableContainer (Provided)==== |
| + | <nowiki> static List<Integer> createMutableContainer() { | ||
| + | return collector.supplier().get(); | ||
| + | }</nowiki> | ||
| + | |||
| + | ====accumulate (Provided)==== | ||
| + | <nowiki> static void accumulate(List<Integer> list, int v) { | ||
| + | collector.accumulator().accept(list, v); | ||
| + | }</nowiki> | ||
| − | + | ====combine (Provided)==== | |
| + | <nowiki> static List<Integer> combine(List<Integer> a, List<Integer> b) { | ||
| + | return collector.combiner().apply(a, b); | ||
| + | }</nowiki> | ||
| − | + | ====reduce (Provided)==== | |
| + | <nowiki> static int reduce(List<Integer> list) { | ||
| + | return collector.finisher().apply(list); | ||
| + | }</nowiki> | ||
| − | |||
===Framework=== | ===Framework=== | ||
| + | ====mapAll==== | ||
| + | mapAll can be performed in parallel. A task should be created for each item in the input array. Each task should accept the emitted (key, value) pairs and store them in its own List to avoid data races. These lists make up the array which is returned (one list for each item in the input array). | ||
| + | |||
| + | <youtube>-4prus5cNFo</youtube> | ||
| + | |||
{{Parallel|List<KeyValuePair<String, Integer>>[] mapAll(TextSection[] input)}} | {{Parallel|List<KeyValuePair<String, Integer>>[] mapAll(TextSection[] input)}} | ||
| + | {{Warning| When first created arrays of Objects are filled with null. You will need to assign each array index to a new List before you start the process of adding key-value pairs}} | ||
| + | |||
| + | {{Warning| Reminder: our course libraries consistently specify max to be exclusive. This includes the parallel forall loop.}} | ||
| + | |||
| + | {{Tip|You are encouraged to utilize the provided [[#map_.28Provided.29|map]] method.}} | ||
| + | |||
| + | [[File:Map_all.svg]] | ||
| + | |||
| + | ====accumulateAll==== | ||
{{Sequential|static Map<String, List<Integer>> accumulateAll(List<KeyValuePair<String, Integer>>[] mapAllResults)}} | {{Sequential|static Map<String, List<Integer>> accumulateAll(List<KeyValuePair<String, Integer>>[] mapAllResults)}} | ||
| + | {{Tip|You are encouraged to utilize the provided [[#createMutableContainer_.28Provided.29|createMutableContainer]] and [[#accumulate_.28Provided.29|accumulate]] methods.}} | ||
| + | |||
| + | [[File:Accumulate_all.svg]] | ||
| + | |||
| + | ====finishAll==== | ||
{{Parallel|static Map<String, Integer> finishAll(Map<String, List<Integer>> accumulateAllResult)}} | {{Parallel|static Map<String, Integer> finishAll(Map<String, List<Integer>> accumulateAllResult)}} | ||
| + | |||
| + | {{Tip|You are encouraged to utilize the provided [[#reduce_.28Provided.29|reduce]] method.}} | ||
| + | |||
| + | [[File:Finish_all.svg]] | ||
===Testing Your Solution=== | ===Testing Your Solution=== | ||
====Correctness==== | ====Correctness==== | ||
{{TestSuite|WarmUpWordCountMapReduceTestSuite|mapreduce}} | {{TestSuite|WarmUpWordCountMapReduceTestSuite|mapreduce}} | ||
| − | |||
==MutualFriendsConcreteStaticMapReduce== | ==MutualFriendsConcreteStaticMapReduce== | ||
{{CodeToImplement|MutualFriendsConcreteStaticMapReduce|map<br>reduceCreateList<br>reduceAccumulate<br>reduceCombine<br>reduceFinish<br>mapAll<br>accumulateAll<br>finishAll|mapreduce.framework.warmup.friends}} | {{CodeToImplement|MutualFriendsConcreteStaticMapReduce|map<br>reduceCreateList<br>reduceAccumulate<br>reduceCombine<br>reduceFinish<br>mapAll<br>accumulateAll<br>finishAll|mapreduce.framework.warmup.friends}} | ||
===Mapper=== | ===Mapper=== | ||
| + | ====map==== | ||
{{Sequential|static void map(Account account, BiConsumer<OrderedPair<AccountId>, Set<AccountId>> keyValuePairConsumer)}} | {{Sequential|static void map(Account account, BiConsumer<OrderedPair<AccountId>, Set<AccountId>> keyValuePairConsumer)}} | ||
===Reducer=== | ===Reducer=== | ||
| − | {{Sequential|static List<Set<AccountId>> | + | ====createMutableContainer==== |
| + | {{Sequential|static List<Set<AccountId>> createMutableContainer()}} | ||
| − | {{Sequential|static void | + | ====accumulate==== |
| + | {{Sequential|static void accumulate(List<Set<AccountId>> list, Set<AccountId> v)}} | ||
| − | {{Sequential|static void | + | ====combine==== |
| + | {{Sequential|static void combine(List<Set<AccountId>> a, List<Set<AccountId>> b)}} | ||
| + | |||
| + | ====reduce==== | ||
| + | {{Sequential|static AccountIdMutableContainer reduce(List<Set<AccountId>> list)}} | ||
| − | |||
===Framework=== | ===Framework=== | ||
| + | ====mapAll==== | ||
{{Parallel|static List<KeyValuePair<OrderedPair<AccountId>, Set<AccountId>>>[] mapAll(Account[] input)}} | {{Parallel|static List<KeyValuePair<OrderedPair<AccountId>, Set<AccountId>>>[] mapAll(Account[] input)}} | ||
| + | {{Warning| When first created arrays of Objects are filled with null. You will need to assigned each array index to a new List before you start the process of adding key-value pairs}} | ||
| + | |||
| + | {{Warning| Reminder: our course libraries consistently specify max to be exclusive. This includes the parallel forall loop.}} | ||
| + | |||
| + | {{Tip|You are encouraged to utilize the [[#map|map]] method you implemented.}} | ||
| + | ====accumulateAll==== | ||
{{Sequential|static Map<OrderedPair<AccountId>, List<Set<AccountId>>> accumulateAll(List<KeyValuePair<OrderedPair<AccountId>, Set<AccountId>>>[] mapAllResults)}} | {{Sequential|static Map<OrderedPair<AccountId>, List<Set<AccountId>>> accumulateAll(List<KeyValuePair<OrderedPair<AccountId>, Set<AccountId>>>[] mapAllResults)}} | ||
| + | {{Tip|You are encouraged to utilize the [[#reduceCreateList|reduceCreateList]] and [[#reduceAccumulate|reduceAccumulate]] methods you implemented.}} | ||
| + | |||
| + | ====finishAll==== | ||
{{Parallel|static Map<OrderedPair<AccountId>, MutualFriendIds> finishAll(Map<OrderedPair<AccountId>, List<Set<AccountId>>> accumulateAllResult)}} | {{Parallel|static Map<OrderedPair<AccountId>, MutualFriendIds> finishAll(Map<OrderedPair<AccountId>, List<Set<AccountId>>> accumulateAllResult)}} | ||
| + | |||
| + | {{Tip|You are encouraged to utilize the [[#reduceFinish|reduceFinish]] method you implemented.}} | ||
===Testing Your Solution=== | ===Testing Your Solution=== | ||
| Line 123: | Line 199: | ||
=Required Lab= | =Required Lab= | ||
| − | == | + | ==Bottlenecked MapReduce Framework== |
| − | {{CodeToImplement| | + | {{CodeToImplement|BottleneckedMapReduceFramework|mapAll<br>accumulateAll<br>finishAll|mapreduce.framework.lab.bottlenecked}} |
| − | Navigate to the <code> | + | Navigate to the <code>BottleneckedMapReduceFramework.java</code> class and there will be three methods for you to complete: mapAll, accumulateAll, and finishAll. These frameworks are meant to be extremely general and applied to more specific uses of MapReduce. Whereas the warm ups for this lab serve to prepare you to build this required section of the lab, this bottlenecked framework is in many ways a warm up for the matrix implementation. |
===mapAll=== | ===mapAll=== | ||
| + | NOTE: If you struggle to get through this method, you are strongly encouraged to try the warm-ups. | ||
| + | |||
{{Parallel|List<KeyValuePair<K, V>>[] mapAll(E[] input)}} | {{Parallel|List<KeyValuePair<K, V>>[] mapAll(E[] input)}} | ||
| − | With this method, you will map all of the elements of an array of data into a new array of equivalent size consisting of | + | {{Warning| When first created arrays of Objects are filled with null. You will need to assigned each array index to a new List before you start the process of adding key-value pairs}} |
| + | |||
| + | {{Warning| Reminder: our course libraries consistently specify max to be exclusive. This includes the parallel forall loop.}} | ||
| + | |||
| + | With this method, you will map all of the elements of an array of data into a new array of equivalent size consisting of Lists of key value pairs. We will leverage the Mapper which is a field/instance variable on this BottleneckedFramework instance. When invoking the mapper's map method with an element of the input array and a BiConsumer which will accept each key and value passed to it, adding a KeyValuePair to its List. This list should then be added to the array of lists you previously defined, therefore completing the mapping stage of MapReduce. This should all be done in parallel. | ||
Hint: you should create an array of lists equivalent in size to the original array. Each list will contain all of the emitted (key,value) pairs for its item. | Hint: you should create an array of lists equivalent in size to the original array. Each list will contain all of the emitted (key,value) pairs for its item. | ||
| − | [https://docs.google.com/presentation/d/ | + | [[File:Bottlenecked map all.png|400px]] [https://docs.google.com/presentation/d/1Gtpj6_5_8imUMccpwxmfrOxKSED791OKl4lZR6G2Bm4/pub?start=false&loop=false&delayms=3000&slide=id.g7ea283730e_0_130 slide] |
===accumulateAll=== | ===accumulateAll=== | ||
| Line 145: | Line 227: | ||
In this method, you will take in the array of lists you previously created and accumulate the key value pairs in the lists into a newly defined map. To help deal with this issue, you must make use of the Collector provided to you. More specifically, access the accumulator in the collector by calling the <code>accumulator()</code> method and accept the key/value pair when you add it to the map. You probably noticed that the method must return a map of <K, A>, which differs from the <K, V> generics fed into the method. The framework is designed this way as the data originally fed into the mapping stage can be collected into a mutable container before reaching the finish/reduce stage. In order to access the correct value for the map if the key has no associated value yet, use the supplier associated with the Collector with the <code>supplier()</code> method. | In this method, you will take in the array of lists you previously created and accumulate the key value pairs in the lists into a newly defined map. To help deal with this issue, you must make use of the Collector provided to you. More specifically, access the accumulator in the collector by calling the <code>accumulator()</code> method and accept the key/value pair when you add it to the map. You probably noticed that the method must return a map of <K, A>, which differs from the <K, V> generics fed into the method. The framework is designed this way as the data originally fed into the mapping stage can be collected into a mutable container before reaching the finish/reduce stage. In order to access the correct value for the map if the key has no associated value yet, use the supplier associated with the Collector with the <code>supplier()</code> method. | ||
| − | + | [[File:Bottlenecked accumulate all.png|400px]] [https://docs.google.com/presentation/d/1Gtpj6_5_8imUMccpwxmfrOxKSED791OKl4lZR6G2Bm4/pub?start=false&loop=false&delayms=3000&slide=id.g7ea283730e_0_165 slide] | |
| − | |||
| − | [https://docs.google.com/presentation/d/ | ||
===finishAll=== | ===finishAll=== | ||
| Line 156: | Line 236: | ||
To reduce the data down, use the map returned from the accumulateAll stage and put the results of the reduction into a new map. The provided Collector will come in extremely handy for this stage, more specifically the finisher which can be called using the <code>finisher()</code> method. This step should run in parallel and will probably be the easiest of the three methods. | To reduce the data down, use the map returned from the accumulateAll stage and put the results of the reduction into a new map. The provided Collector will come in extremely handy for this stage, more specifically the finisher which can be called using the <code>finisher()</code> method. This step should run in parallel and will probably be the easiest of the three methods. | ||
| − | + | [[File:Bottlenecked finish all.png|400px]] [https://docs.google.com/presentation/d/1Gtpj6_5_8imUMccpwxmfrOxKSED791OKl4lZR6G2Bm4/pub?start=false&loop=false&delayms=3000&slide=id.g7ea283730e_0_221 slide] | |
==Matrix MapReduce Framework== | ==Matrix MapReduce Framework== | ||
| + | |||
| + | |||
{{CodeToImplement|MatrixMapReduceFramework|mapAndAccumulateAll<br>combineAndFinishAll|mapreduce.framework.lab.matrix}} | {{CodeToImplement|MatrixMapReduceFramework|mapAndAccumulateAll<br>combineAndFinishAll|mapreduce.framework.lab.matrix}} | ||
Navigate to the <code>MatrixMapReduceFramework.java</code> class and there will be two methods for you to complete: mapAndAccumulateAll and combineAndFinishAll. These frameworks are meant to be extremely general and applied to more specific uses of MapReduce. | Navigate to the <code>MatrixMapReduceFramework.java</code> class and there will be two methods for you to complete: mapAndAccumulateAll and combineAndFinishAll. These frameworks are meant to be extremely general and applied to more specific uses of MapReduce. | ||
| − | The matrix framework is much more complex than the | + | The matrix framework is much more complex than the bottlenecked framework, but it boosts performance by grouping the map and accumulate stages so that everything can run in parallel. It does so by slicing up the given data into the specified mapTaskCount number of slices and assigns a reduce task number to each entry using the HashUtils toIndex() method. This, in effect, creates a matrix of dictionaries, hence the name of the framework. In the combineAndFinishAll stage, the matrix comes in handy by allowing us to go directly down the columns of the matrix (as each key is essentially grouped into a bucket), combining and reducing elements all-in-one. This concept was explained in more depth during class. |
===mapAndAccumulateAll=== | ===mapAndAccumulateAll=== | ||
{{Parallel|Map<K, A>[][] mapAndAccumulateAll(E[] input)}} | {{Parallel|Map<K, A>[][] mapAndAccumulateAll(E[] input)}} | ||
| − | In this stage, you will map and accumulate a given array of data into a matrix of | + | In this stage, you will map and accumulate a given array of data into a matrix of dictionaries. This method should run in parallel while performing the map and accumulate portions of the bottlenecked framework (which we recommend you complete prior to embarking on this mission). As mentioned previously, the input should be sliced into a mapTaskCount number of IndexedRanges and then mapped/accumulated into its appropriate dictionary in the matrix. Although you could slice up the data into chunks yourself, we require using an identical algorithm as performed the <code>IndexedRange</code> and <code>Slices</code> classes introduced earlier in the course. This will allow us to provide better feedback to allow you to pinpoint bugs sooner. What is the best way to perform an identical algorithm to your Slices studio? Use your Slices studio, of course. |
| − | For each slice, the mapper should map the input into its | + | For each slice, the mapper should map the input into its appropriate cell in the matrix and accumulate it into that specific dictionary. Essentially, you will need to nestle the actions of the accumulate method into the mapper. In order to find where the input should go in the matrix, remember that each slice keeps track of its index id and HashUtils has a toIndex method. Which is applicable to the row and which is applicable to the column? |
Hint: The number of rows should match the number of slices. | Hint: The number of rows should match the number of slices. | ||
| + | |||
| + | [[File:Matrix map accumulate all.png|400px]] [https://docs.google.com/presentation/d/1bSLKsI5u2e_tFc0d-RSb0BIDwA-kD75U6yXfxvpMf6Y/pub?start=false&loop=false&delayms=3000&slide=id.g7ebdc248f6_0_347 slide] | ||
| + | |||
| + | [[File:Matrix map accumulate art.png|400px]] [https://docs.google.com/presentation/d/1bSLKsI5u2e_tFc0d-RSb0BIDwA-kD75U6yXfxvpMf6Y/pub?start=false&loop=false&delayms=3000&slide=id.g7ebdc248f6_0_388 slide] | ||
===combineAndFinishAll=== | ===combineAndFinishAll=== | ||
| Line 179: | Line 265: | ||
In this stage, you will take the matrix you just completed and combine all of the separate rows down to one array. Afterward, you will convert this combined array of maps into one final map. This method should run in parallel. | In this stage, you will take the matrix you just completed and combine all of the separate rows down to one array. Afterward, you will convert this combined array of maps into one final map. This method should run in parallel. | ||
| − | As mentioned previously, you should go directly down the matrix to access the same bucket across the different slices you created in the mapAndAccumulateAll step. For all of the maps in a column, you should go through each entry and combine it down into one row. You will need to make use of the Collector’s finisher again, but you will also need to make use of the combiner. You can access the Collector’s combiner using the <code>combiner()</code> method. Although the combine step differs from the | + | As mentioned previously, you should go directly down the matrix to access the same bucket across the different slices you created in the mapAndAccumulateAll step. For all of the maps in a column, you should go through each entry and combine it down into one row. You will need to make use of the Collector’s finisher again, but you will also need to make use of the combiner. You can access the Collector’s combiner using the <code>combiner()</code> method. Although the combine step differs from the bottlenecked framework, the finish step should mirror what you did previously. |
Hint: You can use the provided MultiWrapMap class to return the final row as a valid output. You should also combine before you finish. | Hint: You can use the provided MultiWrapMap class to return the final row as a valid output. You should also combine before you finish. | ||
| + | |||
| + | [[File:Matrix combine finish all.png|400px]] [https://docs.google.com/presentation/d/1bSLKsI5u2e_tFc0d-RSb0BIDwA-kD75U6yXfxvpMf6Y/pub?start=false&loop=false&delayms=3000&slide=id.g7ebdc248f6_0_425 slide] | ||
=Testing Your Solution= | =Testing Your Solution= | ||
==Correctness== | ==Correctness== | ||
There is a top-level test suite comprised of sub test suites which can be invoked separately when you want to focus on one part of the assignment. | There is a top-level test suite comprised of sub test suites which can be invoked separately when you want to focus on one part of the assignment. | ||
| − | === | + | {{TestSuite|FrameworksLabTestSuite|mapreduce.framework.lab}} |
| − | {{TestSuite| | + | ===Bottlenecked=== |
| − | === | + | {{TestSuite|BottleneckedFrameworkTestSuite|mapreduce.framework.lab.bottlenecked}} |
| − | {{TestSuite| | + | ====MapAll==== |
| − | {{TestSuite|MatrixFrameworkTestSuite|mapreduce}} | + | {{TestSuite|BottleneckedFrameworkTestSuite|mapreduce.framework.lab.bottlenecked}} |
| + | ====AccumulateAll==== | ||
| + | {{TestSuite|BottleneckedAccumulateAllTestSuite|mapreduce.framework.lab.bottlenecked}} | ||
| + | ====FinishAll==== | ||
| + | {{TestSuite|BottleneckedFinishAllTestSuite|mapreduce.framework.lab.bottlenecked}} | ||
| + | ====Holistic==== | ||
| + | {{TestSuite|BottleneckedHolisticTestSuite|mapreduce.framework.lab.bottlenecked}} | ||
| + | ===Matrix=== | ||
| + | {{TestSuite|MatrixFrameworkTestSuite|mapreduce.framework.lab.matrix}} | ||
| + | ====MapAccumulateAll==== | ||
| + | {{TestSuite|MatrixMapAccumulateAllTestSuite|mapreduce.framework.lab.matrix}} | ||
| + | ====CombineFinishAll==== | ||
| + | {{TestSuite|MatrixCombineFinishAllTestSuite|mapreduce.framework.lab.matrix}} | ||
| + | ====Holistic==== | ||
| + | {{TestSuite|MatrixHolisticTestSuite|mapreduce.framework.lab.matrix}} | ||
=Rubric= | =Rubric= | ||
| Line 198: | Line 300: | ||
Total points: 100 | Total points: 100 | ||
| − | + | Bottlenecked framework subtotal: 40 | |
* Correct mapAll (10) | * Correct mapAll (10) | ||
* Correct accumulateAll (20) | * Correct accumulateAll (20) | ||
* Correct finishAll (10) | * Correct finishAll (10) | ||
| − | Matrix framework subtotal: | + | Matrix framework subtotal: 60 |
| − | * Correct mapAndAccumulateAll ( | + | * Correct mapAndAccumulateAll (30) |
| − | * Correct combineAndFinishAll ( | + | * Correct combineAndFinishAll (30) |
| − | + | --> | |
| − | |||
| − | |||
