A session-based process satisfies the progress property if its sessions never get stuck when it is executed in an adequate context. Previous work studied how to define progress by introducing the notion of catalysers, execution contexts generated from the type of a process. In this paper, we refine such definition to capture a more intuitive notion of context adequacy for checking progress. Int...

Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared data objects are highly concurrent and guarantee that at least one operation, from a set of concurrently executed operations, finishes after a finite number of steps regardless of the state of the other operations. Lock-free data objects provide progress guarantees on the object level. In this paper...

Conventional data warehouses employ the query-at-a-time model, which maps each query to a distinct physical plan. When several queries execute concurrently, this model introduces contention, because the physical plans—unaware of each other—compete for access to the underlying I/O and computation resources. As a result, while modern systems can efficiently optimize and evaluate a single complex ...

In this paper, the supervisory control of a class of Discrete Event Systems is investigated. Discrete event systems are modeled either by a collection of Finite State Machines that behave asynchronously or by a Hierarchical Finite State Machine. The basic problem of interest is to ensure the invariance of a set of particular configurations in the system. When the system is modeled as asynchrono...

Bene8 s established the notion of wide-sense nonblocking by constructing an example on the symmetric 3-stage Clos network under packing which requires less hardware compared to strict nonblocking. This has remained the only example of a wide-sense non-blocking 3-stage Clos network which is not strictly nonblocking. In this paper, we study packing as well as several other routing strategies whic...

0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.022 * Corresponding author. Tel.: +39 0223993580. E-mail address: [email protected] (A. Pattav This paper considers three-stage switching networks able to support multicast traffic, i.e. connections in which one network inlet is connected to more than one network outlet at the same time. The non-blocking condi...

The transaction processing on the mobile network may lead to disconnection due to poor bandwidth. To deploy traditional database applications into the mobile networks the transactions are to be executed consistently without hindrance of blocking. In this paper, the proposal is made to handle the transactions efficiently despite the frequent disconnections of the wireless network. With the use o...

Sharing patterns in shared-memory multiproa single shared store. The difficulty in implementing any such cessors are the key to performance: uniprocessor latencytolerating techniques such as out-of-order execution and non-blocking caches have proved unable to completely hide the latency of remote memory access. Recently proposed prediction mechanisms accelerate coherence protocols by guessing w...

Completeness is a desirable property of test suites. Roughly, completeness guarantees that a nonequivalent implementation under test will always be identified. Several approaches proposed sufficient, and sometimes also necessary, conditions on the specification model and on the test suite in order to guarantee completeness. Usually, these approaches impose several restrictions on the specificat...

Two key synchronization paradigms for the construction of scalable concurrent data-structures are software combining and elimination. Elimination-based concurrent data-structures allow operations with reverse semantics (such as push and pop stack operations) to “collide” and exchange values without having to access a central location. Software combining, on the other hand, is effective when col...