We address a problem arising in debugging parallel programs, detecting race conditions in programs using semaphores for synchronization. It is NPcomplete to detect race conditions in programs that use many semaphores [10]. We show in this paper that it remains NP-complete even if the programs are allowed to use only two semaphores. For the case of single semaphore, Lu et al. [8] give the previo...

We address a problem arising in debugging parallel programs, detecting race conditions in programs using semaphores for synchronization. It is NPcomplete to detect race conditions in programs that use many semaphores [10]. We show in this paper that it remains NP-complete even if the programs are allowed to use only two semaphores. For the case of single semaphore, Lu et al. [8] give the previo...

concurrency control is one of the important problems in operation systems. various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. this paper presents a survey of the current methods for controlling...

The readers-writers problem is one of the very well known problems in concurrency theory. It was first introduced by Courtois et.al. in 1971 1 and requires the synchronization of processes trying to read and write a shared resource. Several readers are allowed to access the resource simultaneously, but a writer must be given exclusive access to that resource. Courtois et.al. gave semaphore-base...

In this paper we introduce the concepts of k-p-in x codes, n-k-ps-in x languages, n-k-in xout x codes, and n-k-pre x-su x languages, which are natural generalizations of our previous work on k-pre x codes, k-in x codes and so on. We obtain several properties of k-p-in x codes and semaphore codes. The relations and hierarchies of k-p-in x codes, n-k-ps-languages, and n-kpre x-su x languages, and...

Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document specifies a method for encapsulating and transmitting IPv4/IPv6 packets over the Semaphore Flag Signal System (SFSS).

We present an approximation technique for solving open queueing networks consisting of several su~networks.Each subnetwork models a set of shared resources managed by a semaphore. The 9~euelng n~tworks analyzed have features that are commonly used in Petri Nets, such as, fork and JOIn operations and semaphore queues. This type of queueing network arises naturally when modelling multiple window ...