LeggedRaces

Motivation

In a legged race, a group of people must try to move forward as quickly as possible with their legs tied to each other. In other words, the group can only be as quick as its slowest link and they must try to move in unison. In many ways, this concept mirrors parallel phasers. In this studio, you will use phasers and forall loops in order to simulate a legged race.

Code To Use

Legged Races

interface Participant

takeStep

Looping

Java For Loop

Java For Each Loop

forall

Phasers

class Phaser (Guide to the Java Phaser)

register

bulkRegister

arrive

awaitAdvance

arriveAndAwaitAdvance

Questions To Ask Yourself

1. What are my tasks?
2. What work does each task need to do?
3. Upon what does each task depend? That is: what does each task have to wait for before it may proceed?
4. What could have possibly been more important than adding a random stopping to tie their shoes animation to the visualization?

Code To Implement

SequentialLeggedRace

class:	SequentialLeggedRace.java
methods:	takeSteps
package:	leggedrace.studio
source folder:	student/src/main/java

method: public void takeSteps(Participant[] participants, int stepCount) (sequential implementation only)

In this implementation, try to solve the problem sequentially. Your method should go through the array of participants and make each one takeStep until you do this for every stepIndex up until the stepCount for every participant.

Hint: Basically, you will need two for loops. One that iterates up until the stepCount and another which goes through the array of participants.

ForallLeggedRace

class:	ForallLeggedRace.java
methods:	takeSteps
package:	leggedrace.studio
source folder:	student/src/main/java

method: public void takeSteps(Participant[] participants, int stepCount) (parallel implementation required)

In this implementation, the participants should all take each individual step in parallel. However, the steps should be taken each in turn sequentially. Think about where to place the forall loop so that the program only progresses to the next stepIndex after every participant has performed a takeStep with the current index value.

ForallPhasedLeggedRace

class:	ForallPhasedLeggedRace.java
methods:	takeSteps
package:	leggedrace.studio
source folder:	student/src/main/java

method: public void takeSteps(Participant[] participants, int stepCount) (parallel implementation required)

In this solution, you will flip your sequentialLoop/parallelLoop pattern into a parallelLoop/sequentialLoop pattern with a phaser.

ForallPhasedPointToPointLeggedRace

class:	ForallPhasedPointToPointLeggedRace.java
methods:	takeSteps
package:	leggedrace.studio
source folder:	student/src/main/java

method: public void takeSteps(Participant[] participants, int stepCount) (parallel implementation required)

Warning:When you create an array, the contents will initially be null.

In this implementation, you will build on what you did with the forall implementation to incorporate an array of phasers. Start this off by instantiating an array of phasers Use provided int getPartnerIndex(int) to find the partner for a participant.

   	private static int getPartnerIndex(int index) {
          	boolean isOddIndex = (index&0x1) == 0x1;
          	if( isOddIndex ) {
                 	return index - 1;
          	} else {
                 	return index + 1;
          	}
   	}

Testing Your Solution

Visualization

class:	LeggedRaceVisualizationApp.java	VIZ
package:	leggedrace.viz
source folder:	student/src//java

Click on the buttons on the right to visualize your solutions when you have implemented them.

Correctness

class:	LeggedRaceTestSuite.java
package:	leggedrace.studio
source folder:	testing/src/test/java

class:	PartialCreditLeggedRaceTestSuite.java
package:	leggedrace.studio
source folder:	testing/src/test/java

When you are passing the tests and your visualization looks good, demo it to an instructor.