# ps3 - Ω | to define a total order on c. Explain how this...

This preview shows pages 1–2. Sign up to view the full content.

Problem Set #3 IE 495 Due September 25 Written Problems 1. A binary relation on a set A is said to be an equivalence relation on A if it is reflexive, symmetric, and transitive, i.e. for all a, b, c A , a a , a b b a , and ( a b ) ( b c ) a c. Furthermore, a partial order on a set A is defined by a relation " " that is reflexive, transitive, and also obeys the property that for a , b A ( a b ) ( b a ) b a A partial order is called a total order if every pair of elements of A are related. Recall the set-valued functions Θ, Ω, O, o, and ϖ we discussed in class (see Lecture 3, slide 16). If is the set of all polynomials, we will denote by Θ | 2 the function Θ restricted to just the set of polynomials and similarly for the other functions we’ve discussed. a. Use the set-valued function Θ | to define an equivalence relation on . You must use the definition to prove your assertion. b. Use the set-valued function

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.

Unformatted text preview: Ω | to define a total order on c. Explain how this relates to asymptotic analysis of algorithms. 2. Compare Amdahl’s Law to the bounds presented in the paper by Gustafson. What assumptions does each author make? Which view do you think is more realistic? Give a concrete numerical example of the difference in predicted speedup between the two models. 3. Consider a parallel version of the merge sort algorithm discussed in class. Calculate the theoretical speedup of such an algorithm. How does this result fit into the frameworks discussed in Problem 2? 4. Is super-linear speedup theoretically possible? Is it possible in practice? Explain a situation in which you might observe super-linear speedup in practice. 5. Solve 2 of the recurrence relations in Miller and Boxer page 62. Programming Problems 6. TBD...
View Full Document

## This note was uploaded on 08/06/2008 for the course IE 495 taught by Professor Linderoth during the Fall '08 term at Lehigh University .

### Page1 / 2

ps3 - Ω | to define a total order on c. Explain how this...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online