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 38 for “"Mutual exclusion"”.
-
Distributed mutual exclusion algorithms
… original algorithms which solve the distributed mutual exclusion problem. Two of the three solve the problem of allowing only one site at a time into the critical section. The third solves the more difficult problem of allowing a specific number of sites (k sites) into the critical section at a …
-
Performance evaluation of distributed mutual exclusion algorithms
… in which concurrent processes share resources, mutual exclusion refers to the problem of guaranteeing the integrity of those resources by restricting their use to one process at a time. Due the complex nature of distributed systems, distributed mutual exclusion algorithms are often not amenable …
-
Types for mutual exclusion in concurrent programming languages
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-04-12 without embargo terms
-
Correctness proofs of the Peterson-Fischer mutual exclusion algorithms
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.
-
Utility Accrual Real-Time Scheduling: Models and Algorithms
… time/utility function (TUF) time constraints and mutual exclusion resource constraints. A TUF specifies the utility of completing an application activity as an application- or situation-specific function of when that activity completes. GBS considers the scheduling objective of maximizing …
-
Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
… Second, Gamma achieves distributed real-time mutual exclusion in unreliable environments. Third, the algorithm guards against potential disruption of message propagation due to Byzantine attacks using a mechanism called Launcher-Attacker-Infective-Susceptible-Immunized-Removed-Consumer (or …
-
Lower bounds in distributed computing
… computing problems, clock synchronization and mutual exclusion. Our contributions are as follows. 1. We introduce the gradient clock synchronization (GCS) problem. As in traditional clock synchronization, a group of nodes in a bounded delay communication network try to synchronize their logical …
-
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
… satisfied during overloads, while ensuring task mutual exclusion constraints and freedom from deadlocks. This problem is NP-hard. We develop a class of polynomial-time heuristic algorithms, called the Global Utility Accrual (or GUA) class of algorithms. The algorithms construct a directed acyclic …
-
Self-stabilizing tree algorithms
… for calculating tree metrics and for achieving mutual exclusion on a tree structured distributed system.
-
Energy-Efficient, Utility Accrual Real-Time Scheduling
… time/utility function (or TUF) time constraints, mutual exclusion constraints on concurrent sharing of non-CPU resources, timeliness requirements including assurances on individual activity timeliness behavior, and system-level energy consumption requirements including a non-exhaustable energy …
-
PERFORMANCE ESTIMATION AND SCHEDULING FOR PARALLEL PROGRAMS WITH CRITICAL SECTIONS
… that is imposed due to the presence of mutual exclusion variables or critical sections. In this work we investigate a model that considers the threads consisting of an equal number L of functional blocks, where each functional block has the same duration and either accesses a critical …
-
Utility Accrual Real-Time Scheduling Under Variable Cost Functions
… times described using VCFs, and concurrent, mutually exclusive sharing of non-CPU resources. We consider the multi-criteria scheduling objective of (1) assuring that the maximum interval between any two consecutive, successful completions of jobs of a task must not exceed a specified upper …
-
Solutions for Dynamic Channel Assignment and Synchronization Problem for Distributed Wireless Multimedia System
… for dynamic channel allocation based upon mutual exclusion model, and an efficient distributed synchronization algorithm using Quasi-sink for wireless and mobile multimedia systems to ensure and facilitate mobile client access to multimedia objects are proposed. Algorithm's performance with …
-
Stochastic gene expression during lineage specification of single T helper lymphocytes
… network reveals its effect, leading to classic mutual exclusion of antagonistic transcriptional factors.
-
HyFlow: A High Performance Distributed Software Transactional Memory Framework
… Java remote method invocation (RMI) with mutual exclusion and read/write locks, distributed shared memory (DSM), and directory-based D-STM.
-
Contention Bounds for Locking Computations
… of task-parallel execution traces to account for mutual exclusion locks. While lock profiling and contention detection tools abound in software, empirical measurements of contention suffer from wide fluctuations across different executions of the same code due to scheduling variation and processor …
-
Scheduling of track inspection and maintenance activities in railroad networks
… including very complex constraints such as mutual exclusion constraints and consecution constraints. A multiple neighborhood search algorithm, including a decomposition and restriction search and a block-interchange search, was developed to solve the model. Various performance enhancement …
-
Explicit-State Model Checking of Concurrent x86-64 Assembly
… through an evaluation on several classical mutual-exclusion benchmarks and mainstream benchmarks from the Userspace Read-Copy-Update (URCU) concurrency library, where the benchmarks range from $250-3700$ lines of x86 assembly. The framework is the first that supports systematic model …
-
Exploiting wireless broadcast property to improve performance of distributed algorithms and mac protocols in wireless networks
… in three different aspects. First, we design mutual exclusion algorithms for wireless networks in which opportunistic packet overhearing is exploited to decrease the number of transmitted messages as well as the delay of the algorithm. Second, we design a distributed and dynamically adaptive …
-
Properties of link reversal algorithms for routing and leader election
… and algorithms for solving leader election and mutual exclusion. While proofs exist to establish the acyclicity property of PR, they rely on assigning labels to either the nodes or the edges in the graph. In this work we present simpler direct proof of the acyclicity property of partial reversal …
Page 1 of 2