|
|
|
|
Finde herein the faintest hint of what bold trials lay soon to come upon the second day of testing.
CS5500
Exam2
Spring 2003 Name:__________________________________________
Email:__________________________________________
1. You want one
process to broadcast data to all other processes, using MPI_Bcast.
The receiving processes get the data by calling a.
MPI_Request 2. An MPI-enabled
program has a global int called foo, initially set to 0.
When process 0 changes foo to 1, the changed value is available to all
other processes a.
immediately b.
after the send buffer is cleared c.
after the receive buffers are cleared d.
the next time control returns to any receiving process e.
none of the above 3. Which
of the following is NOT an example of Monte Carlo Simulation on a real-valued
function over an interval: a.
space sampling to find the
number of zero crossings b.
binary search to find a
local root c.
point sampling to find the
integral d.
domain sampling to find the
ratio of positive to negative function values e.
none of the above 4.
What is the worst-case number of parallel iterations needed to sort a
list of numbers using odd-even sorting? a.
log 2 n b.
n c.
n log n d.
n2 e.
none of the above 5. Which
of the following is a reasonable description of a hardware barrier mechanism? a.
a big AND gate b.
a big OR gate c.
a J-K flip-flop d.
a bit-carry adder e.
none of the above
|
For problems or questions regarding this site contact the class
Web Lackey.
|