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

Pre-run-time schedulability analysis of P-NET fieldbus networks

P-NET is a fieldbus industrial communication standard, which uses a Virtual Token Passing MAC mechanism. In this paper we establish pre-run-time schedulability conditions for supporting real-time traffic with P-NET. Essentially we provide formulae to evaluate the minimum message deadline, ensuring the transmission of real-time messages within a maximum time bound

A communication support for real-time distributed computer controlled systems

In this paper, we analyse the ability of P-NET [1] fieldbus to cope with the timing requirements of a Distributed Computer Control System (DCCS), where messages associated to discrete events should be made available within a maximum bound time. The main objective of this work is to analyse how the network access and queueing delays, imposed by P-NET’s virtual token Medium Access Control (MAC) mechanism, affect the realtime behaviour of the supported DCCS.

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.

Marketing móvel: where is... the hapiness: campanha aplicada à Coca-Cola Brasil

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.

Campanha de comunicação de Ambient Media para a marca Leroy Merlin

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.

A feedback-based decentralised coordination model for distributed open real-time systems

Moving towards autonomous operation and management of increasingly complex open distributed real-time systems poses very significant challenges. This is particularly true when reaction to events must be done in a timely and predictable manner while guaranteeing Quality of Service (QoS) constraints imposed by users, the environment, or applications. In these scenarios, the system should be able to maintain a global feasible QoS level while allowing individual nodes to autonomously adapt under different constraints of resource availability and input quality. This paper shows how decentralised coordination of a group of autonomous interdependent nodes can emerge with little communication, based on the robust self-organising principles of feedback. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes. The proposed protocol is general enough to be used in a wide range of scenarios characterised by a high degree of openness and dynamism where coordination tasks need to be time dependent. As the reported results demonstrate, it requires less messages to be exchanged and it is faster to achieve a globally acceptable near-optimal solution than other available approaches.

LNT: a logical neighbor tree secure group communication scheme for wireless sensor networks

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

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.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

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.