This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 4: Consider the following program: const int n = 50; int tally; void total() { int count; for (count = 1; count &lt;= n; count++) { tally++; } } void main() { tally = 0; parbegin (total (), total () ); write (tally); } A. Determine the proper lower bound and upper bound on the final value of the shared variable tally output by this concurrent program. Assume processes can execute at any relative speed and that a value can only be incremented after it has been loaded into a register by a separate machine instruction. B. Suppose that an arbitrary number of these processes are permitted to execute in parallel under the assumptions of part (a).What effect will this modification have on the range of final values of tally ?...
View
Full Document
 Fall '10
 Burroughs
 Central processing unit, Computer program, Order theory, Partially ordered set, variable tally output

Click to edit the document details