Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 25 for “"Tuple Space"”.

  1. A tuple space based agent programming framework

    … with both message passing and distributed tuple spaces. A tuple space facilitates dynamic coordination among a group of agents that work together towards a common goal. We apply TSAM to an example of an e-market system to validate its usefulness, simplicity and support for dynamic couplings …

    concordia Download PDF for A tuple space based agent programming framework (opens in a new tab)

  2. Reactive tuple space for a mobile agent platform

    … is based on message passing, which usually is space and time coupled. This thesis aims at developing a multiple reactive tuple space coordination media that provides space and time decoupling for agent dynamic interaction. It provides three categories of primitives: (i) synchronous primitives, …

    concordia Download PDF for Reactive tuple space for a mobile agent platform (opens in a new tab)

  3. A SequenceL interpreter using tuplespaces

    … thesis is a preliminary investigation into a Tuple space based implementation of SequenceL. The results of the research are: • Tuple space was identified as a simple and straight forward approach to distributed evaluation of SequenceL programs. The tuple space concept matches closely with the …

    ttu Repository record for A SequenceL interpreter using tuplespaces (opens in a new tab)

  4. Supporting fault-tolerant parallel programming in Linda.

    … feature is a distributed shared memory called tuple space. FT-Linda extends Linda by providing support to allow a program to tolerate failures in the underlying computing platform. The distinguishing features of FT-Linda are stable tuple spaces and atomic execution of multiple tuple space …

    arizona-thes Repository record for Supporting fault-tolerant parallel programming in Linda. (opens in a new tab)

  5. Properties of positive definite matrices and applications

    … on arbitrary closed convex cones in the real n-tuple space.</p> <p>Chapter 3 is concerned with Hadamard products of positive definite matrices, and Kronecker product of positive definite and positive semidefinite matrices.</p> <p>Chapter 4 discusses some applications of positive definite …

    ut-knoxville Repository record for Properties of positive definite matrices and applications (opens in a new tab)

  6. Linda Implementations Using Monitors and Message Passing

    … in specifying that shared data be added in tuple form to an environment called tuple space, where a tuple exists independently until some process chooses to use it. Interesting properties arise from the model, including space and time uncoupling as well as structured naming. We delineate the …

    unf Repository record for Linda Implementations Using Monitors and Message Passing (opens in a new tab) Download PDF for Linda Implementations Using Monitors and Message Passing (opens in a new tab)

  7. A PARALLEL LISP SYSTEM

    … and cooperation, the Linda model of tuple space is used. For task creation, a scaled-down version of the Multilisp future construct is used together with those Lisp constructs that already possess semantics conducive to parallel execution. The result is a parallel Lisp dialect that …

    nus Repository record for A PARALLEL LISP SYSTEM (opens in a new tab) Download file for A PARALLEL LISP SYSTEM (opens in a new tab)

  8. View-centric Reasoning About Parallel and Distributed Computation

    … distributed computation models, Actors and tuple space. We show how paraDOS allows us to use operational semantics to reason about computation when such reasoning must account for multiple, inconsistent and imperfect views. We then extend the paraDOS model with an abstraction to support …

    ucf Repository record for View-centric Reasoning About Parallel and Distributed Computation (opens in a new tab)

  9. Instructional footprinting: a basis for exploiting concurrency through instructional decomposition and code motion

    … made to the operating system or as advanced as Tuple Space operations specific to a Linda programming system. The problem with such calls, however, is that they block while waiting for data or information to be returned. This synchronous nature and lack of concurrency can be avoided by …

    vt Repository record for Instructional footprinting: a basis for exploiting concurrency through instructional decomposition and code motion (opens in a new tab)

  10. A sorted partitioning approach to fast and scalable dynamic packet classification

    … fast updates nor high dimensionality. The Tuple Space Search (TSS) algorithm used in Open vSwitch achieves fast updates and high dimensionality but not high-speed packet classification. We propose a hybrid approach, PartitionSort, that combines the benefits of both TSS and decision trees …

    msu Repository record for A sorted partitioning approach to fast and scalable dynamic packet classification (opens in a new tab)

  11. Properties and determination of optimal decentralized feedback structure

    … Jordan normal form method and essential control tuple space method are presented. The later method can be readily applied in a computer-aided design environment. From the theory a set of relationships of eigenvalues and eigenvectors between the plant system and the synthesis system are deduced. …

    njit Repository record for Properties and determination of optimal decentralized feedback structure (opens in a new tab)

  12. Divide and conquer : packet classification by smart division

    … each part can then be binary searched. Finally, TupleMerge uses rule list separation to partition the rule list into parts that are hashable; it requires fewer hash tables than Tuple Space Search which reduces search times."--Page ii.

    msu Repository record for Divide and conquer : packet classification by smart division (opens in a new tab)

  13. A TRANSPUTER-BASED IMPLEMENTATION FOR PARALLEL LISP APPLICATIONS

    … for results that may be required, and Linda tuple space operations to enforce the proper communications, synchronization, mutual exclusion and shared variable access for parallel tasks. This research investigates the use of BaLinda Lisp for some application areas and the implementation of …

    nus Repository record for A TRANSPUTER-BASED IMPLEMENTATION FOR PARALLEL LISP APPLICATIONS (opens in a new tab) Download file for A TRANSPUTER-BASED IMPLEMENTATION FOR PARALLEL LISP APPLICATIONS (opens in a new tab)

  14. Adaptive Middleware for Resource-Constrained Mobile Ad Hoc and Wireless Sensor Networks

    … via the integration of mobile agent and tuple space programming models, which is critical given the continuously changing network. It is the first system to successfully demonstrate the feasibility of using mobile agents and tuple spaces within WSNs. Servilla addresses the challenges that …

    wustl Repository record for Adaptive Middleware for Resource-Constrained Mobile Ad Hoc and Wireless Sensor Networks (opens in a new tab)

  15. Implementing a fault-tolerant C-Linda in OS/2

    … by distributing and replicating a tuple space in a ring arrangement over the Local Area Network. This thesis describes the development of a fault-tolerant Linda injected into the ANSI C programming language running on a Local Area Network of Personal Computers, each one running …

    edithcowan Repository record for Implementing a fault-tolerant C-Linda in OS/2 (opens in a new tab)

  16. Composite web services provisioning in dynamic environments

    … react to runtime exceptions. We then propose a tuple space based service orchestration model for distributed, self-managed composite services execution. We introduce the concept of execution controller that is associated with a service and is responsible for monitoring and controlling service …

    unsw Repository record for Composite web services provisioning in dynamic environments (opens in a new tab)

Page 1 of 2