Abstract
In this paper, we present some of the fault tolerance management mechanisntv being implemented in the Multi-/z architecture, namely ira support for replica non-determinism. In thia architecture, fault tolerance is achieved by node active replication, with software based replica management and fault tolerance transparent algorithms. A software layer implemented between the application and the real-time kernel, the Fault Tolerance Manager (FTManager), is the responsible for the transparent incorporation of the fault tolerance mechanisms The active replication model can be implemented either imposing replica determinism or keeping replica consistency at critical points, by means of interactive agreement mechanisms. One of the Multi-I~ architecture goals is to identify such critical points, relieving the underlying system from performing the interactive agreement in every Ada dispatching point. © ACM 1999.

Abstract
A new time-scale expansion algorithm based on a frequency-scale modification approach combined with tame interpolation is presented. The algorithm is noniterative and is constrained to a blind modification of the magnitudes and phases of the relevant spectral components of the signal, on a frame-by-frame basis. The resulting advantages and limitations are discussed. A few simplified models for signal analysis/synthesis are developed, the most critical of which concern phase and frequency estimation beyond the frequency resolution of the filterbank, The structure of the algorithm is described and its performance is illustrated with both synthetic and natural audio signals.

Abstract

Abstract
The paper concerns a flexible flowline scheduling problem, which arises in the footwear industry. Flexibility of the line allows for manufacturing simultaneously more products in lower quantities, but it also increases the complexity of the task of balancing the line, specially because the mix of products changes everyday. A simulation model to deal with the flexible line is developed and several job sequencing rules and different part input criteria are implemented. The impact of each rule on the quality of the schedules is measured, namely, according to makespan, productivity and average machine utilisation. Computational results concerning a real application are also presented. SIMPLE++ is the simulation language used.

Abstract
Byte-code representation has been used to implement several programming languages such as Lisp, ML, Prolog, or Java. In this work, we discuss the impact of several emulator optimisations for the Prolog system YAP YAP obtains performance comparable or exceeding well-known Prolog systems by applying several different styles of optimisations, such as improving the emulation mechanism, exploiting the characteristics of the underlying hardware, and improving the abstract machine itself. We give throughout a detailed performance analysis, demonstrating that low-level optimisations can have a very significant impact on the whole system and across a range of architectures.

Abstract
This paper provides a comprehensive study on how to support time critical distributed applications using PROFIBUS. We show that, despite the absence of synchronous bandwidth allocation, it is possible to guarantee real-time behaviour for the high-priority traffic in PROFIBUS networks. The main contribution of this paper is to give a methodology for the setting of the T-TR parameter, by proper analysis of the worst-case real token rotation time (T-RR).