S.F. Hummel. SMARTS - Shared-memory Multiprocessor Ada Run Time Supervisor. Technical Report 495, NYU, February 1990.  Home/Search   Document Not in Database   Summary   Related Articles

....for concurrent access to shared data structures fall in two broad categories: blocking and non blocking. Blocking algorithms are those in which a process 1 trying to read or modify the data structure isolates or locks part or all of the data structure to prevent interference from other processes [1, 2, 3, 4]. The problem with the blocking approach is that in an asynchronous system with processes having different speeds, a slower process might prevent faster processes from accessing the data structure. Non blocking algorithms, on the other hand, ensure that the data structure is always accessible to ....

....of Current Work Shared data structures are required in a number of multiprocessing applications. We shall deal with lists in this paper, although the methods described can be easily applied to any data structure. Lists are interesting because they are required for many operating system functions [2] and can be used to make more complex data structures, such as buddy system memory managers [6] Non blocking implementations are desirable due to their robustness and continued fast operation in the presence of processes with varying speeds. Many concurrent implementations are in existence [2, 6, ....

[Article contains additional citation context not shown here]

S.F. Hummel. SMARTS - Shared-memory Multiprocessor Ada Run Time Supervisor. Technical Report 495, NYU, February 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC