Online Admission of Parallel Real-Time Tasks

6th Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.

A Multi-DAG Model for Real-Time Parallel Applications with Conditional Execution

The 30th ACM/SIGAPP Symposium On Applied Computing (SAC 2015). 13 to 17, Apr, 2015, Embedded Systems. Salamanca, Spain.

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures supported by an FTT-SE Network

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

Estudo Comparativo, Aleatorizado, em Dupla Ocultação, de Orlistat Versus Placebo, de Eficácia e Segurança, em Doentes Obesos com Hipercolesterolemia Ligeira a Moderada

INTRODUCTION: Obesity is a chronic disease and a serious health problem that leads to increased prevalence of diabetes, hypertension, dyslipidemia and gallbladder disease. OBJECTIVE: To evaluate the efficacy of orlistat for weight loss and improved lipid profile compared to placebo in obese patients with hypercholesterolemia, treated over a period of 6 months. METHODOLOGY: In a 6-month, multicenter (10 centers in Portugal), double-blind, parallel, placebo-controlled study, 166 patients, aged 18-65 years, body mass index (BMI) > or = 27 kg/m2, LDL cholesterol > 155 mg/dl, were randomized to a reduced calorie diet (600 kcal/day deficit) plus orlistat three times a day or placebo. Exclusion criteria included triglycerides > 400 mg/dl, severe cardiovascular disease, uncontrolled hypertension, type 1 or 2 diabetes under pharmacological treatment, and gastrointestinal or pancreatic disease. RESULTS: The mean difference in weight from baseline was 5.9% (5.6 kg) in the orlistat group vs. 2.3% (2.2 kg) in the placebo group. In the orlistat group 49% of patients achieved 5-10% weight loss and 8.8% achieved > 10%. The orlistat group showed a significant reduction in total and LDL cholesterol, with similar changes for HDL in both treatment groups. The frequency of gastrointestinal adverse events was slightly higher in the orlistat group than in the placebo group, leading to discontinuation in 7 patients. CONCLUSION: Treatment with orlistat plus a reduced calorie diet for 6 months achieved significant reductions in weight, BMI and lipid parameters.

P-SOCRATES: A parallel software framework for time-critical many-core systems

Article in Press, Corrected Proof

Towards the Combination of Work-Stealing and Semi-Partitioned Scheduling for Parallel Tasks

Paper/Poster presented in Work in Progress Session, 28th GI/ITG International Conference on Architecture of Computing Systems (ARCS 2015). 24 to 26, Mar, 2015. Porto, Portugal.

Towards the Combination of Work-Stealing and Semi-Partitioned Scheduling for Parallel Tasks

Poster presented in Work in Progress Session, 28th GI/ITG International Conference on Architecture of Computing Systems (ARCS 2015). 24 to 26, Mar, 2015. Porto, Portugal.

Real-time Parallel Applications on Many-core Architectures

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

Parallel Software framework for time-critical many-core systems

The recent technological advancements and market trends are causing an interesting phenomenon towards the convergence of High-Performance Computing (HPC) and Embedded Computing (EC) domains. On one side, new kinds of HPC applications are being required by markets needing huge amounts of information to be processed within a bounded amount of time. On the other side, EC systems are increasingly concerned with providing higher performance in real-time, challenging the performance capabilities of current architectures. The advent of next-generation many-core embedded platforms has the chance of intercepting this converging need for predictable high-performance, allowing HPC and EC applications to be executed on efficient and powerful heterogeneous architectures integrating general-purpose processors with many-core computing fabrics. To this end, it is of paramount importance to develop new techniques for exploiting the massively parallel computation capabilities of such platforms in a predictable way. P-SOCRATES will tackle this important challenge by merging leading research groups from the HPC and EC communities. The time-criticality and parallelisation challenges common to both areas will be addressed by proposing an integrated framework for executing workload-intensive applications with real-time requirements on top of next-generation commercial-off-the-shelf (COTS) platforms based on many-core accelerated architectures. The project will investigate new HPC techniques that fulfil real-time requirements. The main sources of indeterminism will be identified, proposing efficient mapping and scheduling algorithms, along with the associated timing and schedulability analysis, to guarantee the real-time and performance requirements of the applications.

Parallel run-time for CO-OPN

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Parallel programming in biomedical signal processing

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Multicore Scheduling of Real-Time Irregular Parallel Algorithms in Linux

Face à estagnação da tecnologia uniprocessador registada na passada década, aos principais fabricantes de microprocessadores encontraram na tecnologia multi-core a resposta `as crescentes necessidades de processamento do mercado. Durante anos, os desenvolvedores de software viram as suas aplicações acompanhar os ganhos de performance conferidos por cada nova geração de processadores sequenciais, mas `a medida que a capacidade de processamento escala em função do número de processadores, a computação sequencial tem de ser decomposta em várias partes concorrentes que possam executar em paralelo, para que possam utilizar as unidades de processamento adicionais e completar mais rapidamente. A programação paralela implica um paradigma completamente distinto da programação sequencial. Ao contrário dos computadores sequenciais tipificados no modelo de Von Neumann, a heterogeneidade de arquiteturas paralelas requer modelos de programação paralela que abstraiam os programadores dos detalhes da arquitectura e simplifiquem o desenvolvimento de aplicações concorrentes. Os modelos de programação paralela mais populares incitam os programadores a identificar instruções concorrentes na sua lógica de programação, e a especificá-las sob a forma de tarefas que possam ser atribuídas a processadores distintos para executarem em simultâneo. Estas tarefas são tipicamente lançadas durante a execução, e atribuídas aos processadores pelo motor de execução subjacente. Como os requisitos de processamento costumam ser variáveis, e não são conhecidos a priori, o mapeamento de tarefas para processadores tem de ser determinado dinamicamente, em resposta a alterações imprevisíveis dos requisitos de execução. `A medida que o volume da computação cresce, torna-se cada vez menos viável garantir as suas restrições temporais em plataformas uniprocessador. Enquanto os sistemas de tempo real se começam a adaptar ao paradigma de computação paralela, há uma crescente aposta em integrar execuções de tempo real com aplicações interativas no mesmo hardware, num mundo em que a tecnologia se torna cada vez mais pequena, leve, ubíqua, e portável. Esta integração requer soluções de escalonamento que simultaneamente garantam os requisitos temporais das tarefas de tempo real e mantenham um nível aceitável de QoS para as restantes execuções. Para tal, torna-se imperativo que as aplicações de tempo real paralelizem, de forma a minimizar os seus tempos de resposta e maximizar a utilização dos recursos de processamento. Isto introduz uma nova dimensão ao problema do escalonamento, que tem de responder de forma correcta a novos requisitos de execução imprevisíveis e rapidamente conjeturar o mapeamento de tarefas que melhor beneficie os critérios de performance do sistema. A técnica de escalonamento baseado em servidores permite reservar uma fração da capacidade de processamento para a execução de tarefas de tempo real, e assegurar que os efeitos de latência na sua execução não afectam as reservas estipuladas para outras execuções. No caso de tarefas escalonadas pelo tempo de execução máximo, ou tarefas com tempos de execução variáveis, torna-se provável que a largura de banda estipulada não seja consumida por completo. Para melhorar a utilização do sistema, os algoritmos de partilha de largura de banda (capacity-sharing) doam a capacidade não utilizada para a execução de outras tarefas, mantendo as garantias de isolamento entre servidores. Com eficiência comprovada em termos de espaço, tempo, e comunicação, o mecanismo de work-stealing tem vindo a ganhar popularidade como metodologia para o escalonamento de tarefas com paralelismo dinâmico e irregular. O algoritmo p-CSWS combina escalonamento baseado em servidores com capacity-sharing e work-stealing para cobrir as necessidades de escalonamento dos sistemas abertos de tempo real. Enquanto o escalonamento em servidores permite partilhar os recursos de processamento sem interferências a nível dos atrasos, uma nova política de work-stealing que opera sobre o mecanismo de capacity-sharing aplica uma exploração de paralelismo que melhora os tempos de resposta das aplicações e melhora a utilização do sistema. Esta tese propõe uma implementação do algoritmo p-CSWS para o Linux. Em concordância com a estrutura modular do escalonador do Linux, ´e definida uma nova classe de escalonamento que visa avaliar a aplicabilidade da heurística p-CSWS em circunstâncias reais. Ultrapassados os obstáculos intrínsecos `a programação da kernel do Linux, os extensos testes experimentais provam que o p-CSWS ´e mais do que um conceito teórico atrativo, e que a exploração heurística de paralelismo proposta pelo algoritmo beneficia os tempos de resposta das aplicações de tempo real, bem como a performance e eficiência da plataforma multiprocessador.

Renal Disease in Madeira Islands: Twenty-Seven Years' Experience of Native Kidney Biopsies

Introduction: Renal biopsy plays an essential role either in the diagnosis or in the prognosis of patients with renal disease. In order to assess its epidemiology and evolution in Madeira Islands, we analysed twenty-seven years of native kidney biopsies. Methods: We performed a retrospective analysis of clinical records, including histological revision from 1986 to 2012, totalling 315 native kidney biopsies. They were assessed regarding the temporal evolution both for the quality/indications for renal biopsy and for the patterns of kidney disease. Results: A total of 315 native kidney biopsies were analysed. The patients’ mean age was of 40.8 ± 18.4 years and 50.5%(n = 159) were males. The most common indications for renal biopsy were nephrotic syndrome (36.2%, n = 114) and acute kidney injury (20.0%, n = 63). Among primary glomerular diseases (41.5%, n = 115) the most common were IgA nephropathy (26.1%, n = 30) and focal-segmental glomerulosclerosis (17.4%, n = 20) and among secondary glomerular diseases (31.4%, n = 87), lupus nephritis (51.7%, n = 45) and amyloidosis (20.7%, n = 18). Statistical analysis revealed significant correlation between gender and major pathological diagnosis (Fisher’s exact test, p <.01) and between indications for renal biopsy and major pathological diagnosis (χ2, p <.01). Regarding the temporal evolution, no statistically significant differences were found in the number of renal biopsies (χ2, p =.193), number of glomeruli per sample (Fisher’s exact test, p =.669), age (Kruskal-Wallis, p =.216), indications for renal biopsy (χ2, p =.106) or major pathological diagnosis groups (χ2,p =.649). However, considering the specific clinico-pathological diagnoses and their temporal variation, a statistically significant difference (Fisher’s exact test, p <.05) was found for lupus nephritis and membranous nephropathy with an increasing incidence and for amyloidosis with an opposite tendency. Discussion: The review of the native kidney biopsies from a population with particular characteristics, geographically isolated, such as those from Madeira Islands, showed parallel between epidemiological numbers referring to other European subpopulations, allowing simultaneously a comprehensive approach to our renal biopsy policies.

A system’s approach to cache hierarchy-aware decomposition of data-parallel computations

Dissertação para obtenção do Grau de Mestre em Engenharia Informática