D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, Univ. of Illinois at Urbana-Champaign, 1988.  Home/Search   Document Not in Database   Summary   Related Articles

....k, a k bounded scheduler never schedules one transition more than k times in a row. Formally, a schedule is k bounded, for k 1, iff it contains neither the subsequence l k 1 nor r k 1 ; a scheduler is k bounded iff it contains only k bounded schedules (similar definition is considered in [Jay88]) Let F k be the set of k bounded schedules. The assumption F k of k boundedness is, of course, not sufficiently abstract, because for any k, it is easy to build a fair finite state scheduler that is not k bounded. So let us say a schedule is bounded iff it is k bounded for some positive integer ....

....fault models. These bounds can be established using the finitary weak fairness. Similar observation applies to the results on the session problem for the unknown delay model [RW92] Acknowledgments. Notions that are similar to k bounded fairness, for a fixed k, have been defined in several places [Jay88]; the notion of bounded fairness seems to be part of the folklore, but we do not know of any published account. We thank Leslie Lamport, Amir Pnueli, Fred Schneider, Gadi Taubenfeld, and Sam Toueg for pointers to the literature and for helpful discussions. ....

D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, Univ. of Illinois at Urbana-Champaign, 1988.

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