Argamassas e betões geopoliméricos: estado da arte e potencial de industrialização em Portugal

Dissertação para obtenção do grau de Mestre em Engenharia Civil

Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with a smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, little work has been made to illuminate its characteristics upon multiprocessor platforms. In this paper, we identify the dynamics of laxity from the system’s viewpoint and translate the dynamics into LLF multiprocessor schedulability analysis. More specifically, we first characterize laxity properties under LLF scheduling, focusing on laxity dynamics associated with a deadline miss. These laxity dynamics describe a lower bound, which leads to the deadline miss, on the number of tasks of certain laxity values at certain time instants. This lower bound is significant because it represents invariants for highly dynamic system parameters (laxity values). Since the laxity of a task is dependent of the amount of interference of higher-priority tasks, we can then derive a set of conditions to check whether a given task system can go into the laxity dynamics towards a deadline miss. This way, to the author’s best knowledge, we propose the first LLF multiprocessor schedulability test based on its own laxity properties. We also develop an improved schedulability test that exploits slack values. We mathematically prove that the proposed LLF tests dominate the state-of-the-art EDZL tests. We also present simulation results to evaluate schedulability performance of both the original and improved LLF tests in a quantitative manner.

Integrating inaccessibility in response time analysis of CAN networks

Controller Area Network (CAN) is a fieldbus network suitable for small-scale Distributed Computer Controlled Systems, being appropriate for transferring short real-time messages. Nevertheless, it must be understood that the continuity of service is not fully guaranteed, since it may be disturbed by temporary periods of network inaccessibility [1]. In this paper, such temporary periods of network inaccessibility are integrated in the response time analysis of CAN networks. The achieved results emphasise that, in the presence of temporary periods of network inaccessibility, a CAN network is not able to provide different integrity levels to the supported applications, since errors in low priority messages interfere with the response time of higher priority message streams.

Non pre-emptive scheduling of messages on SMTV token-passing networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, a single message per token visit (SMTV). In this paper, we establish an analogy between non-preemptive task scheduling in single processors and the scheduling of messages on SMTV token-passing networks. Moreover, we clearly show that concepts such as blocking and interference in non-preemptive task scheduling have their counterparts in the scheduling of messages on SMTV token-passing networks. Based on this task/message scheduling analogy, we provide pre-run-time schedulability conditions for supporting real-time messages with SMTV token-passing networks. We provide both utilisation-based and response time tests to perform the pre-run-time schedulability analysis of real-time messages on SMTV token-passing networks, considering RM/DM (rate monotonic/deadline monotonic) and EDF (earliest deadline first) priority assignment schemes

Real-time fieldbus communications using Profibus networks

This paper provides a comprehensive study on how to use Profibus fieldbus networks to support real-time industrial communications, that is, on how to ensure the transmission of real-time messages within a maximum bound time. Profibus is base on a simplified timed token (TT) protocol, which is a well-proved solution for real-time communication systems. However, Profibus differs with respect to the TT protocol, thus preventing the application of the usual TT protocol real-time analysis. In fact, real-time solutions for networks based on the TT protocol rely on the possibility of allocating specific bandwidth for the real-time traffic. This means that a minimum amount of time is always available, at each token visit, to transmit real-time messages, transversely, with the Profibus protocol, in the worst case, only one real-time message is processed per token visit. The authors propose two approaches to guarantee the real-time behavior of the Profibus protocol: (1) an unconstrained low-priority traffic profile; and (2) a constrained low-priority traffic profile. The proposed analysis shows that the first profile is a suitable approach for more responsive systems (tighter deadlines), while the second allows for increased nonreal-time traffic throughput

Scheduling real-time communications with P-NET

In this paper we address the P-NET Medium Access Control (MAC) ability to schedule traffic according to its real-time requirements, in order to support real-time distributed applications. We provide a schedulability analysis based on the P-NET standard, and propose mechanisms to overcome priority inversion problems resulting from the use of FIFO outgoing buffers

Guaranteeing real-time message deadlines in PROFIBUS networks

The paper provides a comprehensive study on how to use Profibus networks to support real time communications, that is, ensuring the transmission of the real time messages before their deadlines. Profibus is based on a simplified Timed Token (TT) protocol, which is a well proved solution for real time communication systems. However, Profibus differences from the TT protocol prevent the application of the usual TT analysis. The main reason is that, conversely to the TT protocol, in the worst case, only one high priority message is processed per token visit. The major contribution of the paper is to prove that, despite this shortcoming, it is possible to guarantee communication real time behaviour with the Profibus protocol

Liderança em agrupamentos de territórios de intervenção prioritária: imperativos, contingências e lógicas de acção

Centrado na acção de liderança, este estudo propôs-se identificar as contingências e imperativos inerentes ao processo de implementação do programa TEIP num agrupamento de escolas. Especificamente, pretendeu-se captar a heterogeneidade das lógicas de mudança e identificar modos de apropriação subjectiva da liderança pedagógica e organizacional. Os resultados reforçam a ideia de que implementar um programa novo é construção de complexidade holística, implicando a conjunção integrada de múltiplas estratégias de liderança. Discutem-se os resultados à luz das teorizações iniciais, com relevo para as lógicas de prestação de contas e alguns sinais de „balcanização‟ organizacional.

Implementação de uma marca de produção e distribuição de citrinos biológicos: Orange made in Algarve

Trabalho de projeto apresentado à Escola Superior de Comunicação Social como parte dos requisitos para obtenção de grau de mestre em Publicidade e Marketing.

Response time analysis of slotted WiDom in noisy wireless channels

WiDom is a wireless prioritized medium access control protocol which offers very large number of priority levels. Hence, it brings the potential to employ non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. Recent research has created a new version of WiDom (we call it: Slotted WiDom) which offers lower overhead compared to the previous version. In this paper we propose a new schedulability analysis for slotted WiDom and extend it to work for message streams with release jitter. Furthermore, to provide an accurate timing analysis, we must include the effect of transmission faults on message latencies. Thus, in the proposed analysis we consider the existence of different noise sources and develop the analysis for the case where messages are transmitted under noisy wireless channels. Evaluation of the proposed analysis is done by testing the slotted WiDom in two different modes on a real test-bed. The results from the experiments provide a firm validation on our findings.

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

O ditado como estratégia de aprendizagem

O ensino da escrita é uma questão que tem estado presente nas preocupações dos decisores políticos e dos investigadores em Portugal. O ensino e aprendizagem da ortografia, não tem sido objecto privilegiado na investigação, observando-se na maioria das salas de aula práticas que apelam exclusivamente à memorização. Neste artigo, propõe-se uma reflexão sobre ensino da ortografia, apresentando alguns dados de um projeto em curso em sala de aula com o propósito de melhorar as práticas de ensino da ortografia.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Dinossáurios Eocretácicos de Lagosteiros

According to an ancient folkloric legend, Our Lady, stepping down from the sea, would have rided on a mule to the platform above the cliffs named Pedra da Mua at Lagosteiros'bay, near Espichel cape. Mule's footprints, regarded by fishermen as evidence, would be clearly recognizable on exposed surfaces of the rocks. Indeed there are footprints but from Dinosaurs of latest Jurassic, Portlandian age, this spectacular locality being specially rich in giant Sauropod tracks (that have seldom been found elsewhere in Europe). As we proceeded to its study, another locality with Dinosaur footprints, Lower Cretaceous (Hauterivian) in age, was found on the northern cliffs at Lagosteiros. It is probably the richest one in european Lower Cretaceous and the only of this age known in Portugal, so we decided to give priority to its study. Dinosaur tracks have been printed on calciclastic sands in a lagoonal environment protected by fringing coral reefs. There have been emersion episodes; beaches were frequented by Dinosaurs. Later on, the marine barremian ingression restablished a gulf and such animals could not come here any more. Under a paleogeographical viewpoint, the evidence of a marine regression near the end of Hauterivian is to be remarked. Five types of tracks and footprints have been recognized: - Neosauropus lagosteirensis, new morphogenus and species, tracks from a giant Sauropod, perhaps from Camarasaurus; with its proportions the total length of the author would be about 15,5 m. These are the only Sauropod tracks known till now in Europe's Lower Cretaceous. - tracks from a not so big quadruped, maybe a Sauropod (young individual?); however it is not impossible that they were produced by Stegosaurians or Ankylosaurians. -Megalosauropus (?Eutynichnium) gomesi new morphospecies, four Theropod tracks most probably produced by megalosaurs. - Iguanodon sp., represented by some footprints and specially by a set corresponding to the feet and tail from an individual standing in a rest position. - problematical, quite small-sized biped (maybe an Ornithopod related to Camptosaurus). Evidence points to a richer fauna than that known in barremian "Dinosaur sandstones" from a nearby locality, Boca do Chapim. Lagosteiros' association clearly indicates the predominance of herbivores, which required large amounts of vegetable food in the neighbourhood. This is an indirect evidence of the vegetal wealth, also suggested by associations of plant macrofossils, polen and spores found in early Cretaceous sediments at the same region. The relatively high proportion of Theropoda is related to the wealth of the whole fauna, which comprised a lot of the prey needed by such powerful flesh-eaters. The evidence, as a whole, points out to a warm and moist climate. All the tracks whose direction could be measured are directed to the southern quadrants, this being confirmed by the approximative direction of other footprints. Massive displacements (migration?) could take place during a brief emersion episode. This may result from the ingression of barremian seas, flooding the region and restablishing here a small gulf. Even if the arrival of the waters damaged certain footprints it has not destroyed them completely, thus allowing the preservation of such evidence from a remote past.