But what if I don't want to wait forever?

We present an abstract model of the leader election protocol used in the IEEE 1394 High Performance Serial Bus standard. The model is expressed in the probabilistic Guarded Command Language. By formal reasoning based on this description, we establish the probability of the root contention part of the protocol successfully terminating in terms of the number of attempts to do so. Some simple calculations then allow us to establish an upper bound on the time taken for those attempts.

A review of drainage and spontaneous rupture in free standing thin films with tangentially immobile interfaces

A review of spontaneous rupture in thin films with tangentially immobile interfaces is presented that emphasizes the theoretical developments of film drainage and corrugation growth through the linearization of lubrication theory in a cylindrical geometry. Spontaneous rupture occurs when corrugations from adjacent interfaces become unstable and grow to a critical thickness. A corrugated interface is composed of a number of waveforms and each waveform becomes unstable at a unique transition thickness. The onset of instability occurs at the maximum transition thickness, and it is shown that only upper and lower bounds of this thickness can be predicted from linear stability analysis. The upper bound is equivalent to the Freakel criterion and is obtained from the zeroth order approximation of the H-3 term in the evolution equation. This criterion is determined solely by the film radius, interfacial tension and Hamaker constant. The lower bound is obtained from the first order approximation of the H-3 term in the evolution equation and is dependent on the film thinning velocity A semi-empirical equation, referred to as the MTR equation, is obtained by combining the drainage theory of Manev et al. [J. Dispersion Sci. Technol., 18 (1997) 769] and the experimental measurements of Radoev et al. [J. Colloid Interface Sci. 95 (1983) 254] and is shown to provide accurate predictions of film thinning velocity near the critical thickness of rupture. The MTR equation permits the prediction of the lower bound of the maximum transition thickness based entirely on film radius, Plateau border radius, interfacial tension, temperature and Hamaker constant. The MTR equation extrapolates to Reynolds equation under conditions when the Plateau border pressure is small, which provides a lower bound for the maximum transition thickness that is equivalent to the criterion of Gumerman and Homsy [Chem. Eng. Commun. 2 (1975) 27]. The relative accuracy of either bound is thought to be dependent on the amplitude of the hydrodynamic corrugations, and a semiempirical correlation is also obtained that permits the amplitude to be calculated as a function of the upper and lower bound of the maximum transition thickness. The relationship between the evolving theoretical developments is demonstrated by three film thickness master curves, which reduce to simple analytical expressions under limiting conditions when the drainage pressure drop is controlled by either the Plateau border capillary pressure or the van der Waals disjoining pressure. The master curves simplify solution of the various theoretical predictions enormously over the entire range of the linear approximation. Finally, it is shown that when the Frenkel criterion is used to assess film stability, recent studies reach conclusions that are contrary to the relevance of spontaneous rupture as a cell-opening mechanism in foams. (C) 2003 Elsevier Science B.V. All rights reserved.

Supporting real-time distributed computer-controlled systems with multi-hop P-NET networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a fieldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-run-time schedulability conditions for supporting real-time traffic with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can significantly reduce the end-to-end communication delays for messages with stringent timing requirements.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

WiDom: a dominance protocol for wireless medium access

In this paper, we address the problem of sharing a wireless channel among a set of sporadic message streams where a message stream issues transmission requests with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements static-priority scheduling, supports a large number of priority levels and is fully distributed. It is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But, unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. The evaluation of the protocol with real embedded computing platforms is presented to show that the proposed protocol is in fact collision-free and prioritized. We measure the response times of our implementation and show that the response-time analysis developed for the protocol offers an upper bound on the response times.

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.

Delay-bounded medium access for unidirectional wireless links

Consider a wireless network where links may be unidirectional, that is, a computer node A can broadcast a message and computer node B will receive this message but if B broadcasts then A will not receive it. Assume that messages have deadlines. We propose a medium access control (MAC) protocol which replicates a message in time with carefully selected pauses between replicas, and in this way it guarantees that for every message at least one replica of that message is transmitted without collision. The protocol ensures this with no knowledge of the network topology and it requires neither synchronized clocks nor carrier sensing capabilities. We believe this result is significant because it is the only MAC protocol that offers an upper bound on the message queuing delay for unidirectional links without relying on synchronized clocks.

Implementation of a dominance protocol for wireless medium access

Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (MAC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We implement and evaluate it to find that the implementation indeed is collision-free and prioritized. This allows us to develop schedulability analysis for the implementation. We measure the response times of messages in our implementation and find that our new response-time analysis indeed offers an upper bound on the response times. This enables a new class of wireless real-time systems with timeliness guarantees for sporadic messages and it opens-up a new research area: schedulability analysis for wireless networks.

H → Zr in the complex two Higgs doublet model

The latest LHC data confirmed the existence of a Higgs-like particle and made interesting measurements on its decays into gamma gamma, ZZ*, WW*, tau(+)tau(-), and b (b) over bar. It is expected that a decay into Z gamma might be measured at the next LHC round, for which there already exists an upper bound. The Higgs-like particle could be a mixture of scalar with a relatively large component of pseudoscalar. We compute the decay of such a mixed state into Z gamma, and we study its properties in the context of the complex two Higgs doublet model, analysing the effect of the current measurements on the four versions of this model. We show that a measurement of the h -> Z gamma rate at a level consistent with the SM can be used to place interesting constraints on the pseudoscalar component. We also comment on the issue of a wrong sign Yukawa coupling for the bottom in Type II models.

The norm of the K- Th derivative of the X-symmetric power of an operator

In this paper, the exact value for the norm of directional derivatives, of all orders, for symmetric tensor powers of operators on finite dimensional vector spaces is presented. Using this result, an upper bound for the norm of all directional derivatives of immanants is obtained.

Methodologies for the WCET Analysis of Parallel Applications on Many-core Architectures

Euromicro Conference on Digital System Design (DSD 2015), Funchal, Portugal.

A system model and stack for the parallelization of time-critical applications on many-core architectures

3rd Workshop on High-performance and Real-time Embedded Systems (HIRES 2015). 21, Jan, 2015. Amsterdam, Netherlands.

Real-time Parallel Applications on Many-core Architectures

Presented at INForum - Simpósio de Informática (INFORUM 2015). 7 to 8, Sep, 2015. Portugal.

Numerical and experimental analysis of full scale arches reinforced with GFRP materials

In this contribution, original limit analysis numerical results are presented dealing with some reinforced masonry arches tested at the University of Minho-UMinho, PT. Twelve in-scale circular masonry arches were considered, reinforced in various ways at the intrados or at the extrados. GFRP reinforcements were applied either on undamaged or on previously damaged elements, in order to assess the role of external reinforcements even in repairing interventions. The experimental results were critically discussed at the light of limit analysis predictions, based on a 3D FE heterogeneous upper bound approach. Satisfactory agreement was found between experimental evidences and the numerical results, in terms of failure mechanisms and peak load.