Scribd
Upload
118 views

CH 6

The document provides instructions for baking 3 blueberry pound cakes. It lists the ingredients and steps to make a single cake. The recipe calls for 1 cup of butter, 1 cup of sugar, 4 eggs, vanilla extract, salt, nutmeg, 1 1/2 cups of flour and 1 cup of blueberries. The steps include preheating the oven, beating the wet ingredients, mixing in the dry ingredients and folding in the blueberries before baking. The document asks questions about efficiently making 3 cakes with limited resources and additional helpers.

Uploaded by

jl t
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
118 views

CH 6

The document provides instructions for baking 3 blueberry pound cakes. It lists the ingredients and steps to make a single cake. The recipe calls for 1 cup of butter, 1 cup of sugar, 4 eggs, vanilla extract, salt, nutmeg, 1 1/2 cups of flour and 1 cup of blueberries. The steps include preheating the oven, beating the wet ingredients, mixing in the dry ingredients and folding in the blueberries before baking. The document asks questions about efficiently making 3 cakes with limited resources and additional helpers.

Uploaded by

jl t
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

6.2 You are trying to bake 3 blueberry pound cakes.

Cake

ingredients are as follows:

1 cup buĴ er, softened

1 cup sugar

4 large eggs

1 teaspoon vanilla extract

1/2 teaspoon salt

1/4 teaspoon nutmeg

1 1/2 cups flflour

1 cup blueberries

The recipe for a single cake is as follows:Step 1: Preheat oven

to 325°F (160°C). Grease and flflour

your cake pan.

Step 2: In large bowl, beat together with a mixer buĴ er

and sugar at medium speed until light and flfluffffy. Add

eggs, vanilla, salt and nutmeg. Beat until thoroughly

blended. Reduce mixer speed to low and add flflour, 1/2

cup at a time, beating just until blended.

Step 3: Gently fold in blueberries. Spread evenly in

prepared baking pan. Bake for 60 minutes.

6.2.1 [5] <§6.2> Your job is to cook 3 cakes as effiffifficiently as

possible. Assuming that you only have one oven large enough
to hold one cake, one large bowl, one cake pan, and one mixer,

come up with a schedule to make three cakes as quickly as

possible. Identify the boĴ lenecks in completing this task.

6.2.2 [5] <§6.2> Assume now that you have three bowls, 3 cake

pans and 3 mixers. How much faster is the process now that

you have additional resources?

6.2.3 [5] <§6.2> Assume now that you have two friends that

will

help you cook, and that you have a large oven that can

accommodate all three cakes. How will this change the

schedule you arrived at in Exercise 6.2.1 above?

6.2.4 [5] <§6.2> Compare the cake-making task to computing 3

iterations of a loop on a parallel computer. Identify data-level

parallelism and task-level parallelism in the cake-making

loop.

6.3 Many computer applications involve searching through a

set of data and sorting the data. A number of effiffifficient

searching

and sorting algorithms have been devised in order to reduce

the runtime of these tedious tasks. In this problem we will

consider how best to parallelize these tasks.


6.3.1 [10] <§6.2> Consider the following binary search

algorithm

(a classic divide and conquer algorithm) that searches for a

value X in an sorted N-element array A and returns the index

of matched entry:

Assume that you have Y cores on a multi-core processor to run


BinarySearch. Assuming that Y is much smaller than N, express
the speedup factor you might expect to obtain for values of Y
and N. Plot these on a graph.
6.3.2 [5] <§6.2> Next, assume that Y is equal to N. How would
this affect your conclusions in your previous answer? If you
were tasked with obtaining the best speedup factor possible
(i.e., strong scaling), explain how you might change this code to
obtain it.

6.6 Matrix multiplication plays an important role in a number


of applications. Two matrices can only be multiplied if the
number of columns of the first matrix is equal to the number of
rows in the second.
Let’s assume we have an m × n matrix A and we want to
multiply it by an n × p matrix B. We can express their product
as an m × p matrix denoted by AB (or A·B). If we assign C = AB,
and ci,j denotes the entry in C at position (i, j), then for each
element i and j with 1 ≤ i ≤ m and . Now we
want to see if we can parallelize the computation of C. Assume
that matrices are laid out in memory sequentially as follows:
a1,1
, a2,1
, a3,1
, a4,1
, …, etc.
6.6.1 [10] <§6.5> Assume that we are going to compute C on
both a single core shared memory machine and a 4-core sharedmemory machine. Compute the
speedup we would expect to
obtain on the 4-core machine, ignoring any memory issues.
6.6.2 [10] <§6.5> Repeat Exercise 6.6.1, assuming that updates to
C incur a cache miss due to false sharing when consecutive
elements are in a row (i.e., index i) are updated.
6.6.3 [10] <§6.5> How would you fix the false sharing issue that
can occur?

6.8 The dining philosopher’s problem is a classic problem of


synchronization and concurrency. The general problem is
stated as philosophers siĴ ing at a round table doing one of two
things: eating or thinking. When they are eating, they are not
thinking, and when they are thinking, they are not eating.
There is a bowl of pasta in the center. A fork is placed in
between each philosopher. The result is that each philosopher
has one fork to her left and one fork to her right. Given the
nature of eating pasta, the philosopher needs two forks to eat,
and can only use the forks on her immediate left and right. The
philosophers do not speak to one another.
6.8.1 [10] <§6.8> Describe the scenario where none of
philosophers ever eats (i.e., starvation). What is the sequence of
events that happen that lead up to this problem?
6.8.2 [10] <§6.8> Describe how we can solve this problem by
introducing the concept of a priority? But can we guarantee
that we will treat all the philosophers fairly? Explain.
Now assume we hire a waiter who is in charge of assigning
forks to philosophers. Nobody can pick up a fork until the
waiter says they can. The waiter has global knowledge of all
forks. Further, if we impose the policy that philosophers will
always request to pick up their left fork before requesting to
pick up their right fork, then we can guarantee to avoid
deadlock.
6.8.3 [10] <§6.8> We can implement requests to the waiter as
either a queue of requests or as a periodic retry of a request.
With a queue, requests are handled in the order they are
received. The problem with using the queue is that we may not
always be able to service the philosopher whose request is at
the head of the queue (due to the unavailability of resources).
Describe a scenario with 5 philosophers where a queue is
provided, but service is not granted even though there are forks
available for another philosopher (whose request is deeper in
the queue) to eat.
6.8.4 [10] <§6.8> If we implement requests to the waiter by
periodically repeating our request until the resources become
available, will this solve the problem described in Exercise
6.8.3? Explain.

6.14 Download the CUDA Toolkit and SDK from


hĴ ps://developer.nvidia.com/cuda-downloads. Make sure to
use the “emurelease” (Emulation Mode) version of the code
(you will not need actual NVIDIA hardware for this
assignment). Build the example programs provided in the SDK,
and confirm that they run on the emulator.
6.14.1 [90] <§6.6> Using the “template” SDK sample as a starting
point, write a CUDA program to perform the following vector
operations:
1) a − b (vector-vector subtraction)
2) a · b (vector dot product)
The dot product of two vectors a = [a1, a2, … , an] and b = [b1, b2,… , bn] is defined as:

Submit code for each program that demonstrates each


operation and verifies the correctness of the results.

6.14.2 [90] <§6.6> If you have GPU hardware available, complete


a performance analysis on your program, examining the
computation time for the GPU and a CPU version of your
program for a range of vector sizes. Explain any results you see.

You might also like