A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

Provably good multiprocessor scheduling with resource sharing

We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Scalable and Efficient Configuration of TimeDivision Multiplexed Resources

Consumer-electronics systems are becoming increasingly complex as the number of integrated applications is growing. Some of these applications have real-time requirements, while other non-real-time applications only require good average performance. For cost-efficient design, contemporary platforms feature an increasing number of cores that share resources, such as memories and interconnects. However, resource sharing causes contention that must be resolved by a resource arbiter, such as Time-Division Multiplexing. A key challenge is to configure this arbiter to satisfy the bandwidth and latency requirements of the real-time applications, while maximizing the slack capacity to improve performance of their non-real-time counterparts. As this configuration problem is NP-hard, a sophisticated automated configuration method is required to avoid negatively impacting design time. The main contributions of this article are: 1) An optimal approach that takes an existing integer linear programming (ILP) model addressing the problem and wraps it in a branch-and-price framework to improve scalability. 2) A faster heuristic algorithm that typically provides near-optimal solutions. 3) An experimental evaluation that quantitatively compares the branch-and-price approach to the previously formulated ILP model and the proposed heuristic. 4) A case study of an HD video and graphics processing system that demonstrates the practical applicability of the approach.

Relatório de estágio de qualificação profissional

Relatório EPE - Relatório de estágio em Educação Pré-Escolar:O relatório de estágio para a qualificação profissional foi realizado no âmbito da unidade curricular de Prática Pedagógica Supervisionada na Educação Pré-Escolar, sendo esta parte integrante do Mestrado em Educação Pré-Escolar e Ensino do 1º ciclo do Ensino Básico. Todo o trabalho desenvolvido no presente relatório teve como objetivo dar a conhecer, de forma crítica, reflexiva e sustentada, as experiências vividas pela formanda com o grupo de crianças que acompanhou, num total de 210 horas de estágio, iniciado em fevereiro e terminado em junho do presente ano. A prática pedagógica de um educador de infância influencia diretamente o desenvolvimento das crianças, bem como o desenvolvimento do próprio docente, contituindo para o desenvolvimento de competências fundamentais para a sua prática futura. Com vista a uma planificação focada nas necessidades e interesses evidenciados pelo grupo de crianças, o educador deve observar, planear, agir, avaliar, comunicar e articular, levando a cabo, paralelamente, a investigaçãoação como forma de refletir sobre a sua prática e sobre os efeitos da mesma, em si e nas crianças. Tendo por base estes pressupostos, foram observadas necessidades de desenvolvimento, interesses e resultados de aprendizagem, que permitiram a planificação de atividades a realizar, por forma a atingir os objetivos traçados para o desenvolvimento de capacidades nas crianças. Para isso, recorreu-se a estratégias inovadoras e diversificadas, suportadas pelos modelos curriculares High/Scope e Reggio Emilia, e também pela Metodologia de Trabalho de Projeto. O trabalho desenvolvido em torno da unidade curricular visa competências como a mobilização de saberes, a adoção de estratégias diferenciadas, a tomada de decisões conscientes e adequadas, o desenvolvimento de projetos de investigação e o desenvolvimento e consolidação de competências socioprofissionais e pessoais. Neste sentido, contribuiu para o desenvolvimento pessoal e para o crescimento profissional da mestranda, através das intervenções realizadas com o grupo de crianças. As diferentes etapas do processo educativo acompanharam afincadamente esta etapa, na medida em que contribuiram para um maior conhecimento da formanda quanto à ação e à planificação. Importa salientar que as atividades desenvolvidas ao longo deste período visaram o desenvolvimento de todas as áreas e domínios de conteúdo, nas crianças, com mais ênfase na área da formação pessoal e social e na área do conhecimento do mundo.