Question 12 / 18: 

3. [8 points]: Which of the following statements about the Lockset algorithm as used in the Race-Track paper (Reading #7 "RaceTrack: Efficient Detection of Data Race Conditions via Adaptive Tracking” by Yu, Rodeheffer, and Chen, Proc. of the 20th ACM Symposium on Operating Systems Principles, 2005) is true?

It can report false race conditions that are not actually present in the code.
A  True
B  False
<< First < Previous Flashcard Next > Last >>
Explanation:

TRUE. Racetrack flags any case where two concurrent threads both access a shared variable without consistently holding some lock as a race condition. There may be situations (such as lock-free code) that contain no races but don’t require this strict locking discipline to be followed.

The experimental results demonstrate clearly that a number of non-race conditions are detected by the algorithm.

Exam Home Page
https://www.jobilize.com/computer-system-engineering-exam-by-prof-robert-morris-mit

Computer System Engineering 6.033 Spring 2009

Author:

Access: Public Instant Grading

Attribution:  Morris, Robert, and Samuel Madden. 6.033 Computer System Engineering, Spring 2009. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-033-computer-system-engineering-spring-2009 (Accessed 2 May, 2014). License: Creative Commons BY-NC-SA
Ask
Copy and paste the following HTML code into your website or blog.
<iframe src="https://www.jobilize.com/embed/computer-system-engineering-exam-by-prof-robert-morris-mit" width="600" height="600" frameborder="0" marginwidth="0" marginheight="0" scrolling="yes" style="border:1px solid #CCC; border-width:1px 1px 0; margin-bottom:5px" allowfullscreen webkitallowfullscreen mozallowfullscreen> </iframe>