Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Baker and Cirinei (Lecture Notes in Computer Science, vol. 4878, Springer, pp. 62–75, 2007) have introduced an exact but naive algorithm, that consists in solving a state reachability problem in a finite automaton, to check whether a set of sporadic hard real-time tasks is schedulable on an identical multiprocessor platform. However, this algorithm suffers from poor performance due to the exponential size of the automaton relative to the size of the task set. In this paper, we build on the work of Baker and Cirinei, and rely on their formalism to characterise the complexity of this problem. We prove that it is PSpace-complete. In order to obtain an algorithm that is applicable in practice to systems of realistic sizes, we successfully apply techniques developed by the formal verification community, specifically antichain techniques (Doyen and Raskin in Lecture Notes in Computer Science, vol. 6015, Springer, pp. 2–22, 2010) to this scheduling problem. For that purpose, we define and prove the correctness of a simulation relation on Baker and Cirinei’s automaton. We show that our improved algorithm yields dramatically improved performance for the schedulability test and opens for many further improvements. This work is an extended and revised version of a previous conference paper by the same authors (Lindström et al., Proceedings of the 19th International Conference on Real-Time and Network Systems (RTNS 2011), pp. 25–34, 2011).     

Poisson Skeleton Revisited: a New Mathematical Perspective

This paper is concerned with the computation of the skeleton of a shape Ω included in ?². We show some connections between the Euclidean distance function d to ?Ω and the solution u of the Poisson problem Δu(x)=?1 if x is in Ω and u(x)=0 if x is on ?Ω. This enables us to propose a new and fast algorithm to compute an approximation of the skeleton of ?Ω. We illustrate the approach with some numerical experiments.     

Left invertibility,flatness and identifiability of switched linear dynamical systems: a framework for cryptographic applications

The purpose of this article is to illustrate the potential interest of the control theory framework for cryptographic applications. It is shown that under the properties of left invertibility and flatness, dynamical systems are structurally equivalent to some specific cryptographic primitives called self-synchronising stream ciphers. After having motivated the interest of considering hybrid systems for such ciphers, the development is particularised for the special class of switched linear systems. We also show that identifiability is a necessary condition for security, and we describe an identification procedure as a possible attack and assess its complexity.     

Ahead of time static analysis for automatic generation of debugging interfaces to the Linux kernel

The Linux kernel does not export a stable, well-defined kernel interface, complicating the development of kernel-level services, such as device drivers and file systems. While there does exist a set of functions that are exported to external modules, this set of functions frequently changes, and the functions have implicit, ill-documented preconditions. No specific debugging support is provided. We present Diagnosys, an approach to automatically constructing a debugging interface for the Linux kernel. First, a designated kernel maintainer uses Diagnosys to identify constraints on the use of the exported functions. Based on this information, developers of kernel services can then use Diagnosys to generate a debugging interface specialized to their code. When a service including this interface is tested, it records information about potential problems. This information is preserved following a kernel crash or hang. Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty.     

A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems

This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in message-passing systems, very few solutions have been proposed for shared memory systems. As an eventual leader cannot be elected in a pure asynchronous system prone to process crashes, the paper first proposes to enrich the asynchronous system model with an additional assumption. That assumption (denoted AWB) is particularly weak. It is made up of two complementary parts. More precisely, it requires that, after some time, (1) there is a process whose write accesses to some shared variables be timely, and (2) the timers of (t−f) other processes be asymptotically well-behaved (t denotes the maximal number of processes that may crash, and f the actual number of process crashes in a run). The asymptotically well-behaved timer notion is a new notion that generalizes and weakens the traditional notion of timers whose durations are required to monotonically increase when the values they are set to increase (a timer works incorrectly when it expires at arbitrary times, i.e., independently of the value it has been set to). The paper then focuses on the design of t-resilient AWB-based eventual leader protocols. “t-resilient” means that each protocol can cope with up to t process crashes (taking t=n−1 provides wait-free protocols, i.e., protocols that can cope with any number of process failures). Two protocols are presented. The first enjoys the following noteworthy properties: after some time only the elected leader has to write the shared memory, and all but one shared variables have a bounded domain, be the execution finite or infinite. This protocol is consequently optimal with respect to the number of processes that have to write the shared memory. The second protocol guarantees that all the shared variables have a bounded domain. This is obtained at the following additional price: t+1 processes are required to forever write the shared memory. A theorem is proved which states that this price has to be paid by any protocol that elects an eventual leader in a bounded shared memory model. This second protocol is consequently optimal with respect to the number of processes that have to write in such a constrained memory model. In a very interesting way, these protocols show an inherent tradeoff relating the number of processes that have to write the shared memory and the bounded/unbounded attribute of that memory.     

Formal verification of conflict detection algorithms

Safety assessment of new air traffic management systems is a main issue for civil aviation authorities. Standard techniques such as testing and simulation have serious limitations in new systems that are significantly more autonomous than the older ones. In this paper, we present an innovative approach for establishing the correctness of conflict detection systems. Fundamental to our approach is the concept of trajectory, and how we represent a continuous physical trajectory by a continuous path in the x-y plane constrained by physical laws and operational requirements. From the model of trajectories, we extract, and formally prove, high-level properties that can serve as a framework to analyze conflict scenarios. We use the AILS (Airborne Information for Lateral Spacing) alerting algorithm as a case study of our approach. Published online: 19 November 2002     

EM procedures using mean field-like approximations for Markov model-based image segmentation

Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments.     

Towards efficient data distribution on computational desktop grids with BitTorrent

Datacentric applications are still a challenging issue for large-scale distributed computing systems. The emergence of new protocols and software for collaborative content distribution over the Internet offers a new opportunity for efficient and fast delivery of a high volume of data. This paper presents an evaluation of the BitTorrent protocol for computational desktop grids. We first present a prototype of a generic subsystem dedicated to data management and designed to serve as a building block for any desktop grid system. Based on this prototype we conduct experiments to evaluate the potential of BitTorrent compared to a classical approach based on FTP data server. The preliminary results obtained with a 65-node cluster measure the basic characteristics of BitTorrent in terms of latency and bandwidth and evaluate the scalability of BitTorrent for the delivery of large input files. Moreover, we show that BitTorrent has a considerable latency overhead compared to FTP but clearly outperforms FTP when distributing large files or files to a high number of nodes. Tests on a synthetic application show that BitTorrent significantly increases the communication/computation ratio of the applications eligible to run on a desktop grid system.     

Line of sight controller tuning using Bayesian optimisation: application to a double stage stabilisation platform

The inertial stabilisation of the line of sight of an imager fixed on a mobile carrier is considered in order to acquire good quality images despite the disturbances generated by the carrier. A double stage mechanical stabilisation architecture is proposed, where a second stabilisation stage, based on a piezoelectric actuator, is added to the usual structure. The piezoelectric actuator transfer function and hysteresis are characterised through experiments. In order to design the controllers of both stages, a high-level image quality criterion (the modulation transfer function (MTF)) is considered, together with design constraints on the main variables of interest. The criterion and the constraints are evaluated by realistic simulations based on some input and noise profiles measured on a real-life system. The MTF evaluation being time-consuming, a Bayesian optimisation method specially dedicated to expensive-to-evaluate functions is used to obtain the parameters of the controllers. The obtain experimental results are displayed and their performances discussed.     

Correlation between machining direction,cutter geometry and step-over distance in 3-axis milling: Application to milling by zones

Computer-Aided Manufacturing (CAM) occupies an increasingly important role in engineering with all it has to offer in terms of new possibilities and improving designer/manufacturer productivity. The present study addresses machining of free-form surfaces on a 3-axis NC machine tool. There have recently been a large number of studies devoted to planning tool paths on free-form surfaces with various strategies being adopted. These strategies are intended to increase efficiency by reducing the overall length of machining. Often, the choice of the cutter is arbitrary and the work focuses on planning. In order to boost productivity, the present work offers assistance in choosing the cutting tool, the machining direction and cutting by surface zones, adopting a milling strategy by parallel planes. To do so, a comparison is made between milling using a spherical end milling cutter and a torus end milling cutter with the same outer radius. This comparison relates to the radius of curvature of the trace left by the cutter at the point of contact between the tool and the workpiece in relation to the direction of feed motion.