J.Misra. Loosely coupled processes. Proceedings of PARLE'91, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands. LNCS 506: 1 -- 26.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....sets yield new results and generalized versions of known theorems. 1 Introduction Although leads to properties are not compositional, in general, it is worthwhile to identify the special cases where they are. Composition theorems for leads to properties have been proposed, for example, in [Rao92, Mi91a, Mi91b]. In this paper, we develop a general theory about composition of leads to properties, then specialize the results to give a composition theorem based on the notion of progress sets. A progress set for a program F and target q is a set of predicates satisfying certain properties. The theorem ....

....by message passing where the partial order is given by the length of the messages that have been sent along a communication channel. 6 Generalized commutativity conditions The importance of commutativity in program composition has been known for some time. Both Lipton [Lip75] and Misra [Mi91b] have proposed relevant conditions and their relationship has been explored by Rao [Rao92] Here, we give generalized definitions of both Lipton and Misra commutativity and prove 16 a composition theorem using these results. The advantage of our results is that they apply when q in p ; q is not ....

[Article contains additional citation context not shown here]

J.Misra. Loosely coupled processes. Proceedings of PARLE'91, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands. LNCS 506: 1 -- 26.

....processor. Since each RTP operates on its private system objects, frequent cache invalidation caused by system activities such as thread scheduling is avoided. Maintaining only a loose coupling between the processing units of a multiprocessor is a key to exploit its full computational power [7]. In order to achieve multiprocessor scheduling, threads have to be migrated between RTPs, either explicitly or by a load balancer. One design objective of the PANDA architecture is to handle shared resources, devices in particular, outside of the kernel with dedicated service agents whenever ....

J. Misra. Loosely-Coupled Processes. In: E.H.L. Aarts, J. van Leeuwen, and M. Rem (eds.), Proc. Parallel Architectures and Languages Europe (PARLE'91), Springer-Verlag, LNCS 506, pp. 1-26, Eindhoven, The Netherlands, June 1991.

....succeeds. In fact, even the simplest optimization, like constant propagation, will fail if applied without modification. Most compilers avoid the risks by restricting data sharing between concurrent threads (e.g. the model proposed by Steele [Ste90] and loosely coupled processes proposedby Misra [Mis91]) or not optimizing the parallel codes at all. We believe as more people write parallel programs, the demand to develop various compile time analysis techniques for these parallel programs will become stronger. For those who dislike parallel programming, the development of these techniques will ....

....as mutual exclusion or shared variable synchronization. Among them, Steele [Ste90] proposes a model requiring any two operations that are not causally related must commute , in order to make asynchronous programs safe in the sense that nondeterminism and data races are impossible. Misra [Mis91] proposesa similar concept, loosely coupledprocesses,and argues that large scale shared variable programming is feasible only if processes are loosely coupled . Srinivasan and Wolfe [SW91] propose a copy in copy out semantics for parallel constructs, where each concurrent thread gets a private ....

Jayadev Misra. Loosely-Coupled Processes (Preliminary Version) . In PARLE 91, Vol. II, volume 506 of Lecture Notes in Computer Science, pages 1--26. Springer-Verlag, 1991.

....histories, both h; o; o 0 and h; o 0 ; o are equivalent sequential histories. The above definition is similar to the idea of forward commutativity by Weihl [29] which is used to develop concurrency control protocols for abstract objects, and to the idea of loosely coupled processes by Misra [26]. It is clear from the definition that any pair of operations on different memory objects commute. Furthermore, any pair of read operations commute and operations that are never enabled simultaneously commute. Intuitively, all operations that commute with one another can be executed in any order ....

J. Misra. Loosely-coupled processes. In E.H.L. Aarts et.al, editor, Parallel Architectures and Languages Europe, volume II, pages 1--26, 1991.

....this semantics did not extend to more general components, such as fair merge. Fully abstract semantics have since been proposed for general dataflow networks, but these semantics require recording the causality ordering between messages, and are thus not very useful in practice. Recently, Misra [Mis91] pointed out that the essential features of Kahn s model could be captured in shared variable systems by replacing the asynchronous communication discipline with a commutativity condition between the transitions of the system; a program satisfying this condition is said to be loosely coupled . ....

....there is no way to perform two entries to the critical section in a row. By modelling semaphores in this miraculous way, it turns out that P operations left commute with all semaphore operations. It is evident that such an approach cannot extend to progress properties. The observation (due to [Mis91]) that underlies our approach to commutativity is the following: actions by a sender and receiver on the same channel do not commute; however, they do commute (progress included) from states in which both are enabled (i.e. when the channel is nonempty) This observation was the inspiration for ....

J. Misra. Loosely coupled processes. In Parallel Architectures and Languages Europe, pages 1--26, June 1991.

No context found.

Misra J., "Loosely-Coupled Processes", Proc. of P a r a l l e A r c h e c u r e s a n d L a n g u a g e s E u r o p e (PARLE'91), Netherlands, June 1991, Springer-Verlag, LNCS 506, pp 1-26.

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