G.V. Wilson and P. Lu. Parallel Programming Using C++. Scientific and Engineering Computation Series. The MIT Press, 1996.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Issues and Experiences in Implementing a Distributed.. - Fenwick, Jr., Pollock (1996) (Correct)
....that allows experimentation and modification. In order to gain this flexibility in experimentation, an implementation of distributed tuplespace for a network of workstations has been developed. The experiences of this implementation effort have found existing distributed tuplespace implementations [6, 12, 16, 31, 44, 49] to be incomplete in their descriptions of the implementation issues faced and the potential solutions and pitfalls in addressing these issues. This paper focuses on filling this gap, by sharing our experiences in designing and implementing a distributed tuplespace, focusing on the design issues ....
....are not well specified, making the eval a potential source of non portability of applications across different imple13 mentations. Specifically, the model does not define whether the new process shares global variables with its parent, or if a process can modify parameters passed by reference [44, 49]. In the absence of a clear semantic definition, implementations seem to generally let the machine s available process creation primitives dictate the definition of their semantics. For example, on a shared memory machine, access to the values of the parent process global variables is easily ....
Gregory V. Wilson. Practical Parallel Programming. Scientific and Engineering Computation Series. The MIT Press, 1995.
Optimizing the Use of Distributed Queues in Tuplespace - Fenwick, Jr., Pollock (1997) (Correct)
....queue position. Thus, accessing a single element of a distributed queue, in general, requires the requesting process to participate in five network transmissions as seen in Figure 1(a) Figure 1(b) illustrates an improvement to this default tuplespace handling of distributed queues. Wilson [19] terms this improvement triangular messaging. Triangular messaging does not eliminate any of the messages required, but rather changes who initiates messages and when messages are initiated. As Figure 1(b) shows, the user process on node 1 no longer initiates network transmission 4 requesting the ....
Gregory V. Wilson. Practical Parallel Programming. Scientific and Engineering Computation Series. The MIT Press, 1995.
Issues and Experiences in Implementing a Distributed.. - Fenwick, Jr., Pollock (1996) (Correct)
....that allows experimentation and modification. In order to gain this flexibility in experimentation, an implementation of distributed tuplespace for a network of workstations has been developed. The experiences of this implementation effort have found existing distributed tuplespace implementations [6, 12, 16, 31, 44, 49] to be incomplete in their descriptions of the implementation issues faced and the potential solutions and pitfalls in addressing these issues. This paper focuses on filling this gap, by sharing our experiences in designing and implementing a distributed tuplespace, focusing on the design issues ....
....operator are not well specified, making this a potential source of non portability of applications across different implementations. Specifically, the model does not define whether the new process shares global variables with its parent, or if a process can modify parameters passed by reference [44, 49]. In the absence of a clear semantic definition, implementations seem to generally let the machine s available process creation primitives dictate the definition of their semantics. For example, on a shared memory machine, access to the values of the parent process global variables is easily ....
Gregory V. Wilson. Practical Parallel Programming. Scientific and Engineering Computation Series. The MIT Press, 1995.
Understanding Control Flow - With Concurrent Programming using.. - Buhr (1995) (1 citation) Self-citation (Programming) (Correct)
....and used. While thread libraries have been written for many languages, only ones associated with C and C are discussed here, as that is sufficient to present the fundamental ideas and approaches. Even by restricting to C C , there are still several thread lock libraries for C [BMS94] and C [BLL88, WL96]. 12.2.1 C Thread Library: PThreads One of the currently popular thread libraries is the POSIX PThreads [But97] Because PThreads is designed for C, all of the PThreads routines are written in a non object oriented style, i.e. they explicitly receive the object being manipulated as one of the ....
Gregory V. Wilson and Paul Lu, editors. Parallel Programming in C++. Scientific and Engineering Computation Series. MIT Press, 1996.
A Software Architecture for User Transparent Parallel.. - Seinstra, Koelma.. (2001) (3 citations) (Correct)
No context found.
G.V. Wilson and P. Lu. Parallel Programming Using C++. Scientific and Engineering Computation Series. The MIT Press, 1996.
Accurate Performance Models of Parallel Low Level Image.. - Seinstra, Koelma (2000) (Correct)
No context found.
G.V. Wilson and P. Lu. Parallel Programming Using C++. Scientific and Engineering Computation Series. The MIT Press, 1996. The ISIS article class is written by Rein van den Boomgaard
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