CISC Parallel Programming - Fall 2003
                                                    TEAM PRETEST
Name:                                Secret Code:                    Background:

You are given a stack of 1000 UNO cards.  You are asked to compute the number of red cards and number of blue cards, and report the two sums.

a.  Describe a sequential algorithm for this computation.
 
 
 
 
 

b.  Describe how you might perform this computation using parallelism.
 
 
 
 
 
 
 
 

c.  What parameters could you adjust in your algorithm to try to increase the speed of your program?
 
 

d.  If you had 100 workers working on the computation, what is the maximum amount you would expect your program to ever speed up over the sequential program?
 

e.  What factors might actually prevent your program from obtaining that maximum speedup over the sequential program?
 
 
 

f.  What other kinds of real-life computations could possibly benefit from parallelism?
 
 
 
 
 

g.  Can you make any generalizations about what steps are involved in achieving parallelism, and what factors can affect the parallel solution in detrimental ways?