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 6 of 6 for “"deadlock freedom"”.
-
Bandwidth-sensitive oblivious routing
… flow has its own private channel to guarantee deadlock freedom. Though adaptive routing schemes can react to varying network traffic, they require complicated router designs. In this thesis, we present a polynomial-time heuristic routing algorithm that takes bandwidth requirements of each flow …
-
Static and dynamic virtual channel allocation for high performance, in-order communication in on-chip networks
… when oblivious routing is used, and ensures deadlock freedom for arbitrary minimal routes when two or more VCs are available. EDVCA, on the other hand, is done at runtime, not requiring knowledge of traffic patterns or routes in advance. We demonstrate that both static VCA and EDVCA guarantee …
-
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
… 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 graph representation of the task …
-
Real-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations
… are accessed in a specific order to prevent deadlocks. In contrast, STM allows multiple objects to be accessed in a transaction in any order, while guaranteeing deadlock-freedom, which significantly increases programmability. Moreover, STM offers platform independence: the proposed contention …
-
Symbolic reachability analysis for rewrite theories
This dissertation presents a significant step forward in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically …
-
Scalable and flexible bulk architecture
… modules in a sequential manner to ensure deadlock freedom, which may incur long latency for large directory groups. Second, two chunks with cross-processor write-after-write (WAW) dependences between them cannot commit concurrently; one squashes the other, even though these are name …