Problem Set #1
IE 495
Due September 11
Written Problems
1. Explain how you could simulate a shared memory model of computation using a
distributed memory model with one additional processor. [Hint: What does the
interconnection network look like?]
How well do you think this scheme would work in practice? Hint: Consider the time
required to perform a semigroup operation.
2. *Explain some of the potential pitfalls of asymptotic analysis. Do you think that the
models of computation we’ve discussed in class are realistic and/or useful? Why or
why not?
3. *In an effort to design more realistic models of computation, Parberry suggests that
interconnection schemes be limited to those that satisfy the following three properties:
Each processor has a constant number of allpurpose registers.
The degree of the network is a constant.
The interconnection scheme can be computed in polynomial time.
He calls such schemes
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '08
 Linderoth
 Operations Research, Analysis of algorithms, efficient algorithm, shared memory model, interconnection scheme, fastest possible algorithm, distributed memory model

Click to edit the document details