268 research outputs found

    Time-critical multirate scheduling using contemporary real-time operating system services

    Get PDF
    Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems

    A theoretical basis for the analysis of redundant software subject to coincident errors

    Get PDF
    Fundamental to the development of redundant software techniques fault-tolerant software, is an understanding of the impact of multiple-joint occurrences of coincident errors. A theoretical basis for the study of redundant software is developed which provides a probabilistic framework for empirically evaluating the effectiveness of the general (N-Version) strategy when component versions are subject to coincident errors, and permits an analytical study of the effects of these errors. The basic assumptions of the model are: (1) independently designed software components are chosen in a random sample; and (2) in the user environment, the system is required to execute on a stationary input series. The intensity of coincident errors, has a central role in the model. This function describes the propensity to introduce design faults in such a way that software components fail together when executing in the user environment. The model is used to give conditions under which an N-Version system is a better strategy for reducing system failure probability than relying on a single version of software. A condition which limits the effectiveness of a fault-tolerant strategy is studied, and it is posted whether system failure probability varies monotonically with increasing N or whether an optimal choice of N exists

    Application of queueing models to multiprogrammed computer systems operating in a time-critical environment

    Get PDF
    A model of a central processor (CPU) which services background applications in the presence of time critical activity is presented. The CPU is viewed as an M/M/1 queueing system subject to periodic interrupts by deterministic, time critical process. The Laplace transform of the distribution of service times for the background applications is developed. The use of state of the art queueing models for studying the background processing capability of time critical computer systems is discussed and the results of a model validation study which support this application of queueing models are presented

    An experimental evaluation of software redundancy as a strategy for improving reliability

    Get PDF
    The strategy of using multiple versions of independently developed software as a means to tolerate residual software design faults is suggested by the success of hardware redundancy for tolerating hardware failures. Although, as generally accepted, the independence of hardware failures resulting from physical wearout can lead to substantial increases in reliability for redundant hardware structures, a similar conclusion is not immediate for software. The degree to which design faults are manifested as independent failures determines the effectiveness of redundancy as a method for improving software reliability. Interest in multi-version software centers on whether it provides an adequate measure of increased reliability to warrant its use in critical applications. The effectiveness of multi-version software is studied by comparing estimates of the failure probabilities of these systems with the failure probabilities of single versions. The estimates are obtained under a model of dependent failures and compared with estimates obtained when failures are assumed to be independent. The experimental results are based on twenty versions of an aerospace application developed and certified by sixty programmers from four universities. Descriptions of the application, development and certification processes, and operational evaluation are given together with an analysis of the twenty versions

    Flight Demonstration of Integrated Airport Surface Technologies for Increased Capacity and Safety

    Get PDF
    A flight demonstration was conducted to address airport surface movement area capacity and safety issues by providing pilots with enhanced situational awareness information. The demonstration presented an integration of several technologies to government and industry representatives. These technologies consisted of an electronic moving map display in the cockpit, a Differential Global Positioning system (DGPS) receiver, a high speed very high frequency (VHF) data link, an Airport Surface Detection Equipment (ASDE-3) radar, and the Airport Movement Area Safety System (AMASS). Aircraft identification was presented to an air traffic controller on an AMASS display. The onboard electronic map included the display of taxi routes, hold instructions, and clearances, which were sent to the aircraft via data link by the controller. The map also displayed the positions of other traffic and warning information, which were sent to the aircraft automatically from the ASDE-3/AMASS system. This paper describes the flight demonstration in detail, along with test results

    Microwave and Physical Electronics

    Get PDF
    Contains reports on six research projects

    On the rate of quantum ergodicity in Euclidean billiards

    Full text link
    For a large class of quantized ergodic flows the quantum ergodicity theorem due to Shnirelman, Zelditch, Colin de Verdi\`ere and others states that almost all eigenfunctions become equidistributed in the semiclassical limit. In this work we first give a short introduction to the formulation of the quantum ergodicity theorem for general observables in terms of pseudodifferential operators and show that it is equivalent to the semiclassical eigenfunction hypothesis for the Wigner function in the case of ergodic systems. Of great importance is the rate by which the quantum mechanical expectation values of an observable tend to their mean value. This is studied numerically for three Euclidean billiards (stadium, cosine and cardioid billiard) using up to 6000 eigenfunctions. We find that in configuration space the rate of quantum ergodicity is strongly influenced by localized eigenfunctions like bouncing ball modes or scarred eigenfunctions. We give a detailed discussion and explanation of these effects using a simple but powerful model. For the rate of quantum ergodicity in momentum space we observe a slower decay. We also study the suitably normalized fluctuations of the expectation values around their mean, and find good agreement with a Gaussian distribution.Comment: 40 pages, LaTeX2e. This version does not contain any figures. A version with all figures can be obtained from http://www.physik.uni-ulm.de/theo/qc/ (File: http://www.physik.uni-ulm.de/theo/qc/ulm-tp/tp97-8.ps.gz) In case of any problems contact Arnd B\"acker (e-mail: [email protected]) or Roman Schubert (e-mail: [email protected]

    Prefigurative politics between ethical practice and absent promise

    Get PDF
    'Prefigurative politics' has become a popular term for social movements' ethos of unity between means and ends, but its conceptual genealogy has escaped attention. This article disentangles two components: an ethical revolutionary practice, chiefly indebted to the anarchist tradition, which fights domination while directly constructing alternatives; and prefiguration as a recursive temporal framing, unknowingly drawn from Christianity, in which a future radiates backwards on its past. Tracing prefiguration from the Church Fathers to politicised re-surfacings in the Diggers and the New Left, I associate it with Koselleck's 'process of reassurance' in a pre-ordained historical path. Contrasted to recursive prefiguration are the generative temporal framings couching defences of means-ends unity in the anarchist tradition. These emphasised the path dependency of revolutionary social transformation and the ethical underpinnings of anti-authoritarian politics. Misplaced recursive terminology, I argue, today conveniently distracts from the generative framing of means-ends unity, as the promise of revolution is replaced by that of environmental and industrial collapse. Instead of prefiguration, I suggest conceiving of means-ends unity in terms of Bloch's 'concrete utopia', and associating it with 'anxious' and 'catastrophic' forms of hope

    Order-of-magnitude speedup for steady states and traveling waves via Stokes preconditioning in Channelflow and Openpipeflow

    Full text link
    Steady states and traveling waves play a fundamental role in understanding hydrodynamic problems. Even when unstable, these states provide the bifurcation-theoretic explanation for the origin of the observed states. In turbulent wall-bounded shear flows, these states have been hypothesized to be saddle points organizing the trajectories within a chaotic attractor. These states must be computed with Newton's method or one of its generalizations, since time-integration cannot converge to unstable equilibria. The bottleneck is the solution of linear systems involving the Jacobian of the Navier-Stokes or Boussinesq equations. Originally such computations were carried out by constructing and directly inverting the Jacobian, but this is unfeasible for the matrices arising from three-dimensional hydrodynamic configurations in large domains. A popular method is to seek states that are invariant under numerical time integration. Surprisingly, equilibria may also be found by seeking flows that are invariant under a single very large Backwards-Euler Forwards-Euler timestep. We show that this method, called Stokes preconditioning, is 10 to 50 times faster at computing steady states in plane Couette flow and traveling waves in pipe flow. Moreover, it can be carried out using Channelflow (by Gibson) and Openpipeflow (by Willis) without any changes to these popular spectral codes. We explain the convergence rate as a function of the integration period and Reynolds number by computing the full spectra of the operators corresponding to the Jacobians of both methods.Comment: in Computational Modelling of Bifurcations and Instabilities in Fluid Dynamics, ed. Alexander Gelfgat (Springer, 2018
    • …
    corecore