HD Webcom Document1 Word Table Tools References Mailings Review View Help Foxit

Question

HD Webcom Document1 Word Table Tools References Mailings Review View Help Foxit PDF Design LayoutTell QUESTION 1 1. Bob claims that "all algorithms run faster on multiple cores. Why does Alice disagree? C Alice knows that some algorithms are limited by memory, not cores. C Alice knows that not all algorithms are equally parallelizable. Alice knows that some single core machines have faster disk drives. Alice does not like Bob. QUESTION 2 1 Two threads are sirmuitaseoualy accessing chared data. Can; thia reaut in a race condition? No the threade have local copies

Explanation / Answer

1)Answer: Alice knows that all algorithms are not equally parllelizable

explanation : all algorithms can't be parallelizable to get effecient output, like graph traversals

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.