Title page for ETD etd-02222005-153132

Type of Document Dissertation
Author Neil, Richard L
URN etd-02222005-153132
Title Support for Pointer Semantics in a Generative Communication Framework
Degree PhD
Department Computer Science
Advisory Committee
Advisor Name Title
Arthur, James D. Committee Chair
Davis, Nathaniel J. IV Committee Member
Kafura, Dennis G. Committee Member
Lee, John A. N. Committee Member
Santos, Eunice E. Committee Member
  • Pointer Semantics
  • Tuple Space
  • Generative Communication
  • Asynchronous Communication
  • Concurrent Access
  • Shared Dataspace
Date of Defense 2004-12-17
Availability unrestricted
The Generative Communication (GC) paradigm was introduced in the early 1980s in the form of the Linda coordination and communication language (Gelernter & Bernstein, 1982). The goal of the language was to provide an elegant, intuitive alternative to the state-of-the-art in parallel and distributed processing languages at that time, namely remote procedure calls; message passing systems; and shared memory systems (Gelernter, 1985). Despite the longevity of the Linda coordination language and the GC paradigm, in general, the literature is devoid of meaningful research into the construction and manipulation of dynamic, pointer-based data structures within the context of the GC paradigm. This document motivates the need for such data structures in GC. In addition, this document explores the reasons for the lack literature regarding dynamic pointer-based data structures in GC. Finally, we develop solutions to address the lack of support, within the GC paradigm, for such data structures.
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Neil_diss.pdf 477.81 Kb 00:02:12 00:01:08 00:00:59 00:00:29 00:00:02

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.