We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge signals propagate along the switch chain producing semaphores results in a network that is fast and highly hardware-compact. The proposed architecture for prefix counting N 1 bits features a total delay of (4 logN +pN 2...

In this paper we describe a language for defining scheduling algorithms for hard real-time systems and a tool to simulate the behavior of such systems on a predefined task set. The language is suited for describing a real-time system composed of a task set, resources and a scheduling algorithm. The tasks can either be periodic or aperiodic, dependent or independent and the time constraints (e.g...

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 supervision based on place invariants (SBPI) is an efficient technique for the supervisory control of Petri nets. This paper reveals the significance of the SBPI based on a literature survey, applications, and an analysis of problems and supervisory settings that can be addressed using SBPI. Special attention is given to the various settings within which the problem can be formulated. Such ...

This article describes ARTK, a compact real-time kernel for the Arduino embedded systems development environment. It provides a priority-driven preemptive task scheduler, semaphores for task synchronisation, and serial channel output. It is compatible with Arduino boards containing more or less than 64 kbytes of memory. The memory footprint of ARTK is under 8 kbytes.

Processes running in a multiple-disk environment may share non-preemptible resources on the processor and, at the same time, request services from disk subsystems. In this paper, we propose a methodology which is efficient and easy to implement for scheduling processes in multiple-disk environments. In other words, our methodology addresses the scheduling of real-time processes which may stop t...

Multithreaded programs are prone to errors caused by unintended interference between concurrent threads. This paper focuses on verifying that deterministically-parallel code is free of such thread interference errors. Deterministically-parallel code may create and use new threads, via fork and join, and coordinate their behavior with synchronization primitives, such as barriers and semaphores. ...

Principal component analysis is a multivariate statistical method frequently used in science and engineering to reduce the dimension of a problem or extract the most significant features from a dataset. In this paper, using a similar notion to the quantum counting, we show how to apply the amplitude amplification together with the phase estimation algorithm to an operator in order to procure th...

Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to systematically exercise all the behaviors of a program. The main contribution of this paper is a general model for reachability testing. This model allows reachability testing to be applied to many different types of co...

The Stack Resource Policy (SRP) is a resource allocation policy which permits processes with different priorities to share a single runtime stack. It is a refinement of the Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky, which strictly bounds priority inversion and permits simple schedulability tests. With or without stack sharing, the SRP offers improvements over the PCP, by: (1...