Deadlocks and Dihomotopy in Mutual Exclusion Models

Deadlocks and Dihomotopy in Mutual Exclusion Models Deadlocks and Dihomotopy in Mutual Exclusion Models

Design of a Mutual Exclusion and Deadlock Algorithm in PCBSD – FreeBSD

— This paper shows the implementation of mutual exclusion in PCBSD-FreeBSD operating systems on SMPng environments, providing solutions to problems like investment priority, priority propagation, interlock, CPU downtime, deadlocks, between other. Mutex Control concept is introduced as a solution to these problems through the integration of the scheduling algorithm of multiple queues fed back an...

Investigating The Algebraic Structure of Dihomotopy Types

This presentation is the sequel of a paper published in the GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper focuses precisely on detailing some of its aspects. The main idea is that the category of homotopy types can be embedded in a new category of dihomotopy types,...

Components of the Fundamental Category II

In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1982), as arising in e.g. concurrency theory (Fajstrup et al., 2006), initiated in (Fajstrup et al., 2004). The “algebra” of dipaths modulo dihomotopy (the fundamental category) of such a po-space is essentially finite...

Cs 242: Operating Systems Transactions 2 Transaction Models

In our discussion of mutual exclusion so far, we have considered atomic access to a single object. What if we wish to atomically access multiple objects. For instance, what if we wish to atomically remove an item from the input buffer and put it in the echo buffer? The high-level constructs such as monitors and path expressions do not give users of shared objects flexibility in defining the uni...