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 411 for “"distributed systems"”.
-
Sharing memory in distributed systems
We propose an algorithm for simulating atomic registers, test-and-set, fetch-and-add, and read-modify-write registers in a message passing system. The algorithm is fault tolerant and works correctly in presence of up to (N/2) -1 node failures where N is the number of processors in the system. The …
-
Object tracking in distributed systems
… migration) is a very important feature in modern distributed systems. By allowing objects to migrate from one machine to another preemptively, the sys-tem can provide several benefits. These include sharing load, reducing communication cost, increasing availability, and improving invocation …
-
Link Prediction on Distributed Systems
… are a fundamental component of modern distributed systems, enabling scalability, flexibility, and resilience. However, understanding and predicting the interactions between microservices, which evolve over time, remains a significant challenge. Traditional static models fail to capture …
-
Task Assignment in Distributed Systems
… addresses the problem of task assignment in distributed systems. A distributed system is defined as any configuration of two or more processors, each with private memory, in which computations utilize the combined resources of the component machines. A distributed process is defined as a set …
-
Failure diagnosis in distributed systems
Failures in computing systems are unavoidable. Therefore, it is important to detect and diagnose failures early to improve the reliability of systems. In this dissertation, new approaches on root-cause diagnosis for two notorious types of failures in distributed systems are introduced. This …
-
Process migration in distributed systems
… discusses process migration in message-based systems and procedure-oriented systems. The issues that we deal with are the correctness of process migration and the design of migration schemes. The design goal of the migration schemes is to maintain migration transparency.
-
A pragmatic testbed for distributed systems
Distributed systems have become ubiquitous and they continue their growth through a range of services. With advances in resource virtualization technology such as Virtual Machines and software containers, developers no longer require high-end servers to test and develop distributed software. Even …
-
Selfishness and Malice in Distributed Systems
Large-scale distributed systems are increasingly prevalent. Two issues can impact the performance of such systems: selfishness and malice. Selfish players can reduce social welfare of games, and malicious nodes can disrupt networks. In this dissertation, we provide algorithms to address both of …
-
Best matching processes in distributed systems
… gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless …
-
Atomic Broadcast in Heterogeneous Distributed Systems
… effect on both performance and robustness of distributed systems. Distributed applications rely on a multitude of protocols for the support of these services. Of crucial importance are multicast protocols. Reliable multicast protocols enhance the efficiency and robustness of distributed …
-
Automatic software upgrades for distributed systems
… the software of long-lived, highly-available distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be unavailable and halting the system for an upgrade is unacceptable. Instead, upgrades may happen gradually, and there may be …
-
On building blocks for distributed systems
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2000.
-
Scheduling Memory Transactions in Distributed Systems
Distributed transactional memory (DTM) is an emerging, alternative concurrency control model that promises to alleviate the difficulties of lock-based distributed synchronization. In DTM, transactional conflicts are traditionally resolved by a contention manager. A complementary approach for …
-
Synthesizing Structure: Patterned Control of Distributed Systems
Nature provides fabulous proofs-of-concept for distributed systems, such as flocks of starlings that perform stunning aerial displays without the direction of a single leader. Autonomous engineering systems (such as groups of robots) are often architected in the same fashion, with a control action …
-
NON-FUNCTIONAL CERTIFICATION OF MODERN DISTRIBUTED SYSTEMS
… the last two decades, changing the way in which distributed systems are designed, developed, and operated. From the launch of services at the beginning of the 2000s, systems moved from monolithic and static code bases to elastic and multi-layer distributed systems, where each layer transparently …
-
Self-stabilizing deadlock algorithms in distributed systems
A self-stabilizing system is a network of processors, which, when started from an arbitrary (and possibly illegal) initial state, always returns to a legal state in a finite number of steps. Self-stabilization is an evolving paradigm in fault-tolerant computing. This research will be the first time …
-
Large Scale Online Aggregation Via Distributed Systems
… bounds. The key difference in a large-scale distributed computing environment is the importance of block-based processing. At a random time instance, the system is likely processing blocks that take longer to process. Hence blocks that take longer to process are less likely to be taken into …
Page 1 of 21