M. Ajtai, J. Aspnes, C. Dwork, O. Waarts, "The Competitive Analysis of WaitFree Algorithms and its Application to the Cooperative Collect Problem", to appear in PODC, 1994.  Home/Search   Document Not in Database   Summary   Related Articles

....are similar. Future developments in asynchronous parallel computation will employ randomization as well as the array of deterministic techniques surveyed here. The work on fault tolerant and efficient parallel shared memory models has also been applied to distributed message passing models; see [1, 9, 10]. In Section 3 we examine an array of algorithms for the Write All problem. These employ a variety of deterministic techniques and are extensible to the computation of other functions (see Section 6) In Section 4 we examine the problem of approximate Write All , which has a work optimal solution. ....

M. Ajtai, J. Aspnes, C. Dwork, O. Waarts, "The Competitive Analysis of WaitFree Algorithms and its Application to the Cooperative Collect Problem", to appear in PODC, 1994.

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