Ready.

Page 56. This page is in the page-by-page raw-dumps section.



Fig.3.5 Time-lines

The figure is a time chart and says that when two processes are running concurrently, they may overlap in time. The figure is trivial. Yet, the consequences, as discussed on other pages, breaks the naive verification algorithm which copycat82 assumes would work. As a result, the intention, obviously, was not to tell the situation, before doing something about it. Only telling it, filling a page, and more. Then, completely ignores its side-effects.





Further Reading

(page-by-page raw-dumps section) . . . . . previous . . . . . next




Any Questions?: . . (Request Content . . . . . Correct Errors . . . . . Submit Case Study . . . . . Report Content Similarity.)

LastUpdated: June 10, 2004
Page-version: 0_0_1 (Links-update: June 18, 2004)
Written by: Ahmed Ferzen/Ferzan R Midyat-Zilan (or, Earth)
Copyright (c) [2002,] 2003, 2004 Ferzan Midyat. All rights reserved.