WCET analysis considering contention on memory bus in COTS-based multicores

The usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providing realtime guarantees at design-time is a pre-requisite to deploy real-time systems on these multicores. This necessitates the consideration of the impact of the contention due to shared low-level hardware resources on the Worst-Case Execution Time (WCET) of the tasks. As a step towards this aim, this paper first identifies the different factors that make the WCET analysis a challenging problem in a typical COTS-based multicore system. Then, we propose and prove, a mathematically correct method to determine tight upper bounds on the WCET of the tasks, when they are co-scheduled on different cores.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

Faunes ichthyologiques du Néogène Supérieur d’Angola, leur âge, remarques sur le Pliocène marin en Afrique Australe

This note is concerned with fish remains from Upper Neogene beds at Farol das Lagostas (and nearby quarry of SECIL) and Baía Farta, mainly recovered by the author in 1960, 1961, 1963 and 1967. For further data see ANTUNES, 1964, pp. 213-215. All the forms identified until now (many of them for the first time) are show in «tableau I». Smaller ones are poorly represented. I. benedeni is provisorily accepted as a distinct species, though it may correspond to a dental morphotype that does exist equally in the extant I. oxyrhinchus (see text): therefore I. benedeni from Farol das Lagostas may after all represent only some dental variations that really belong in the form described as I. cf. oxyrhinchus. The presence of Aprionodon and Hypoprion could not be ascertained: Procarcharodon megalodon, Carcharodon carcharias, Isurus benedeni. Galeocerdo cuvieri, and Carcharhinus sp. I and sp. II are specially discussed. The whole fauna does not correspond either to a very shallow and coastal environment, or to deep waters far away from the coast. It clearly points out to warm waters: an acceptable model would be the fauna from the tropical Atlantic between Northern Angola and Senegal-Cape Verde. The age of this fauna was long regarded as Burdigalian. The data formerly presented (ANTUNES, 1963) that allowed us to ascribe a pliocene age to the uppermost Neogene beds of Farol das Lagostas (Neogene III, ANTUNES, 1964) are reviewed and developed in this paper. This view is corroborated by planctonic foraminifera and stratigraphical data which provide further evidence to prove the presence of miocene beds much younger than Burdigalian, and that some deposits previously correlated to this stage have instead a Plio-Pleistocene age. Fish fauna from Farol das Lagostas is very characteristic, with giant P. megalodon in association with C. carcharias (which predominates, and whose stratigraphical distribution is particularly discussed), and with other very advanced forms like the extant tiger shark, G. cuvieri, enormous I. Benedeni, Hemipristis, and Carcharhinus (whose size largely exceeds the maximum observed with miocene material). With the exception of P. megalodon (extinct) all the other forms show very close affinities, or even identity with modern species. Comparisons with very similar faunas from some South African localities that may also have a Pliocene age are also presented.

Scalable and efficient data processing in networked control systems

Network control systems (NCSs) are spatially distributed systems in which the communication between sensors, actuators and controllers occurs through a shared band-limited digital communication network. However, the use of a shared communication network, in contrast to using several dedicated independent connections, introduces new challenges which are even more acute in large scale and dense networked control systems. In this paper we investigate a recently introduced technique of gathering information from a dense sensor network to be used in networked control applications. Obtaining efficiently an approximate interpolation of the sensed data is exploited as offering a good tradeoff between accuracy in the measurement of the input signals and the delay to the actuation. These are important aspects to take into account for the quality of control. We introduce a variation to the state-of-the-art algorithms which we prove to perform relatively better because it takes into account the changes over time of the input signal within the process of obtaining an approximate interpolation.

Depreciação dos ativos fixos tangíveis : o novo referencial contabilístico alterou os hábitos instalados em Portugal?

Mestrado em Auditoria

The utilization bound of non-preemptive rate-monotonic scheduling in controller area networks is 25%

Consider a distributed computer system comprising many computer nodes, each interconnected with a controller area network (CAN) bus. We prove that if priorities to message streams are assigned using rate-monotonic (RM) and if the requested capacity of the CAN bus does not exceed 25% then all deadlines are met.

Multiprocessor real-time scheduling considering concurrency and urgency

It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors:inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a schedulability condition for general task systems under our scheduling policy.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.

Efficient aggregate computations in large-scale dense WSN

We focus on large-scale and dense deeply embedded systems where, due to the large amount of information generated by all nodes, even simple aggregate computations such as the minimum value (MIN) of the sensor readings become notoriously expensive to obtain. Recent research has exploited a dominance-based medium access control(MAC) protocol, the CAN bus, for computing aggregated quantities in wired systems. For example, MIN can be computed efficiently and an interpolation function which approximates sensor data in an area can be obtained efficiently as well. Dominance-based MAC protocols have recently been proposed for wireless channels and these protocols can be expected to be used for achieving highly scalable aggregate computations in wireless systems. But no experimental demonstration is currently available in the research literature. In this paper, we demonstrate that highly scalable aggregate computations in wireless networks are possible. We do so by (i) building a new wireless hardware platform with appropriate characteristics for making dominance-based MAC protocols efficient, (ii) implementing dominance-based MAC protocols on this platform, (iii) implementing distributed algorithms for aggregate computations (MIN, MAX, Interpolation) using the new implementation of the dominance-based MAC protocol and (iv) performing experiments to prove that such highly scalable aggregate computations in wireless networks are possible.

Two protocols without periodicity for the global and preemptive scheduling problem of multi-mode real-time systems upon multiprocessor Platforms

We consider the problem of scheduling a multi-mode real-time system upon identical multiprocessor platforms. Since it is a multi-mode system, the system can change from one mode to another such that the current task set is replaced with a new task set. Ensuring that deadlines are met requires not only that a schedulability test is performed on tasks in each mode but also that (i) a protocol for transitioning from one mode to another is specified and (ii) a schedulability test for each transition is performed. We propose two protocols which ensure that all the expected requirements are met during every transition between every pair of operating modes of the system. Moreover, we prove the correctness of our proposed algorithms by extending the theory about the makespan determination problem.

Bilirubin directly disrupts membrane lipid polarity and fluidity, protein order, and redox status in rat mitochondria

Background/Aims: Unconjugated bilirubin (UCB) impairs crucial aspects of cell function and induces apoptosis in primary cultured neurones. While mechanisms of cytotoxicity begin to unfold, mitochondria appear as potential primary targets. Methods: We used electron paramagnetic resonance spectroscopy analysis of isolated rat mitochondria to test the hypothesis that UCB physically interacts with mitochondria to induce structural membrane perturbation, leading to increased permeability, and subsequent release of apoptotic factors. Results: Our data demonstrate profound changes on mitochondrial membrane properties during incubation with UCB, including modified membrane lipid polarity and fluidity (P , 0:01), as well as disrupted protein mobility(P , 0:001). Consistent with increased permeability, cytochrome c was released from the intermembrane space(P , 0:01), perhaps uncoupling the respiratory chain and further increasing oxidative stress (P , 0:01). Both ursodeoxycholate, a mitochondrial-membrane stabilising agent, and cyclosporine A, an inhibitor of the permeability transition, almost completely abrogated UCB-induced perturbation. Conclusions: UCB directly interacts with mitochondria influencing membrane lipid and protein properties, redox status, and cytochrome c content. Thus, apoptosis induced by UCB may be mediated, at least in part, by physical perturbation of the mitochondrial membrane. These novel findings should ultimately prove useful to our evolving understanding of UCB cytotoxicity.

Effects of team task structure on team climate for innovation and team outcomes

In this cross-sectional study we analyzed, whether team climate for innovation mediates the relationship between team task structure and innovative behavior, job satisfaction, affective organizational commitment, and work stress. 310 employees in 20 work teams of an automotive company participated in this study. 10 teams had been changed from a restrictive to a more self-regulating team model by providing task variety, autonomy, team-specific goals, and feedback in order to increase team effectiveness. Data support the supposed causal chain, although only with respect to team innovative behavior all required effects were statistically significant. Longitudinal designs and larger samples are needed to prove the assumed causal relationships, but results indicate that implementing self-regulating teams might be an effective strategy for improving innovative behavior and thus team and company effectiveness.

The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%

Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.

The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.