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 23 for “"Message-Passing Systems"”.
-
Fault-Tolerant Distributed Services in Message-Passing Systems
Distributed systems ranging from small local area networks to large wide area networks like the Internet composed of static and/or mobile users have become increasingly popular. A desirable property for any distributed service is fault-tolerance, which means the service remains uninterrupted even …
-
Space reclamation for uncoordinated checkpointing in message-passing systems
… recovery from transient process failures. In a message-passing system, the rollback of a message sender may cause the rollback of the corresponding receiver, and the system needs to roll back to a consistent set of checkpoints called the recovery line. If the processes are allowed to take …
-
Buffer allocation in message passing systems: An implementation for Mpi
Message passing applications that perform asynchronous communication need sufficient buffer space to hold all undelivered messages, or else the applications may deadlock. Determining the minimum amount of buffer space an application needs is called the Buffer Allocation Problem, and has been shown …
-
Identifying Defects Related to the Order in which Messages are Received in Message-Passing Systems
… defects and faults in software. In recent years, message-passing systems have grown to a significant degree due to the rise of distributed systems, embedded systems, and so forth. In message-passing systems, components communicate with each other through sending and receiving messages. This …
-
The lattice agreement problem in distributed systems
… is an important decision problem in distributed systems. It has applications in implementing atomic snapshot objects and building a special class of replicated state machines. In this work, we design novel algorithms for the lattice agreement problem in a variety of settings. We first focus on …
-
Reducing Interprocessor Communication in Parallel Architectures: System Configuration and Task Assignment
… efficiently run on large parallel processing systems because interprocessor communication and synchronization significantly degrade performance. Interprocessor communication is incurred on message passing systems when two processors exchange data through communication links and in shared …
-
Fault-Tolerant Distributed Algorithms for Agreement and Election
… of Byzantine agreement in asynchronous message-passing systems. Furthermore, there is no agreement protocol that uses test-and-set operations if memory cells have only two values and two or more processes may die. In contrast, there is an agreement protocol with test-and-set operations …
-
Support for Pointer Semantics in a Generative Communication Framework
… 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 …
-
Behavior Isolation in Enterprise Systems
… be used to isolate application components or subsystems from each other. The main contributions of this work are Isolation Points, which are software abstractions for monitoring and understanding dynamic runtime behaviors to better isolation application components hence creating more robust …
-
Dining philosophers with masking tolerance to crash faults
… classic problem is unsolvable in asynchronous message-passing systems subject to even a single crash fault. By contrast, dining can be solved in synchronous systems capable of implementing the perfect failure detector P (from the Chandra-Toueg hierarchy). We show that dining is also solvable in …
-
The Design of Fault Tolerant Software for Loosely Coupled Distributed Systems
Requirements for systems to continue to operate satisfactorily in the presence of faults has led to the development of techniques for the construction of fault tolerant software. This thesis addresses the problem of error detection and recovery in distributed systems which consist of a set of …
-
Impact FD : an unreliable failure detector based on process relevance and confidence in the system
… to trusted states. The Impact FD is suitable for systems that present node redundancy, heterogeneity of nodes, clustering feature, and allow a margin of failures which does not degrade the confidence in the system. We also show that some classes of the Impact FD are equivalent to and § which are …
-
Multiparty session types for distributed and failure-prone systems
Distributed computer systems inherently introduce notions of concurrency, nondeterminism and possibly failure-prone communication into programs. This makes designing, and implementing, correct distributed systems difficult, and it is widely agreed that such systems require rigorous methods of …
-
The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers
… wait-free dining is unsolvable in asynchronous message-passing systems subject to crash faults. To circumvent this impossibility result, it is necessary to assume the existence of bounds on timing properties, such as relative process speeds and message delivery time. As such, it is of interest …
-
Distributed computing with mobile agents: Solving rendezvous and related problems
In this thesis we study mobile agent systems consisting of a network of nodes and a set of autonomous agents travelling through the network. The mobile agents can traverse the edges (channels) of the network to move from one node to another and they can communicate with each other using public …
-
Communicating Haskell processes
… is process-oriented programming, which uses message-passing and is based on Hoare and Roscoe's Communicating Sequential Processes (CSP). CSP is a process calculus centred on concurrent processes that communicate with each other via synchronous channels. This is used as a formal underpinning …
-
Communicating Haskell Processes
… is process-oriented programming, which uses message-passing and is based on Hoare and Roscoe's Communicating Sequential Processes (CSP). CSP is a process calculus centred on concurrent processes that communicate with each other via synchronous channels. This is used as a formal underpinning …
-
An Analyzer for Message Passing Programs
Asynchronous message passing systems are fast becoming a common means for communication between devices. Two problems existing in message passing programs are difficult to solve. The first problem, intended or otherwise, is message-race where a receive may match with more than one send in the …
Page 1 of 2