CSCE 5160: Final Examination
Thursday Dec. 13, 2012: 9:00-11am
Open Books and Open Notes
1. (30) Consider extending Dijkstra's algorithm for finding shortest path for graphs that include
negative weights. Assume that there are no negative cost cycles (so
CSCE 5610 Solutions To Midterm
Thursday October 18, 2012
1 (35%). Consider an array A of elements a0, a1, , an. Write an algorithm that creates a new array where
a0 will be in position k such that
ai <= ak for all i <k
ak <= aj for all k <j
Note that I am
CSCE 5610 Solutions To Midterm Exam
October 18, 2011
1 (20%). The value of pi can be computed as an integral of the following function
1
1
4
f ( x ) dx =
dx
0
(1 + x 2 )
0
We use summation to replace integration. We use very small slices of x and compute
CSCE 5160 Parallel Processing
Homework #7: Implement Floyds algorithms in MPI
You can use either checkerboard or row striping
Try with at least 4 processes and 16 nodes
You can use distances between cities if you want
No Class on November 2
CSCE 5160 Solutions to Homework #3
4.5. Refer to Figure 4.7 (page 155). In the first iteration, the following pairs of processors
exchange their data of size m : (0,4), (1,5), (2,6), and (3,7). This step takes ts + 4twm
time because four messages of size
CSCE 5610: Solutions to Homework #1
2.2. The computation performs 8 FLOPS on 2 cache lines, i.e., 8 FLOPS in 200 ns. This
corresponds to a computation rate of 40 MFLOPS.
2.3. In the best case, the vector gets cached. In this case, 8 FLOPS can be perfor