D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, University of Illinois at Urbana-Champaign, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Temporal Proof Methodologies for Timed Transition Systems - Henzinger, Manna, Pnueli (1994) (23 citations) (Correct)
....transition systems. Such a finitary notion of fairness would restrict the nondeterminism of a system. We may want to require, for example, that no competitor of a transition can be taken more than n times without itself being taken (a similar concept has been called bounded fairness in [Jay88] We prefer, both for scheduling and synchronization, an explicit description of the selection process to such implicit assumptions. Since all selection processes that we have found useful can be described within our language, we see no need to introduce additional concepts that would only ....
D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, University of Illinois at Urbana-Champaign, 1988.
Communication Complexity for Parallel Divide-and-Conquer - Wu, Kung (1991) (29 citations) (Correct)
....lower bounds in Theorem 1 and Corollaries 1 and 2 are the first lower bound results for those D C computations whose tree structures are dynamic in the sense that the tree structure is determined only at run time. Previous results on computation and communication cost tradeoffs such as those in [7, 8, 11] deal with only static computation graphs, whose topologies are known before the computation starts. 3 A Scheduling Algorithm and Upper Bounds This section describes a new scheduling algorithm which can achieve the upper bounds in Theorem 2 for both parallel computation cost and communication ....
D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, Dept of CS, University of Illinois at Urbana-Champaign, September 1988.
Timed Transition Systems - Thomas Henzinger (1992) (66 citations) (Correct)
....transition systems. Such a finitary notion of fairness would restrict the nondeterminism of a system. We may want to require, for example, that no competitor of a transition can be taken more than n times without itiself being taken (a similar concept has been called bounded fairness in [Jay88] We prefer, both for scheduling and synchronization, an explicit description of the selection process to such implicit assumptions. Since all selection processes that we have found useful can be described within our language, we see no need to introduce additional concepts that would only ....
D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, University 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