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

Article in Press, Corrected Proof

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.

Kdd, semma crisp-dm: a parallel overviee

In the last years there has been a huge growth and consolidation of the Data Mining field. Some efforts are being done that seek the establishment of standards in the area. Included on these efforts there can be enumerated SEMMA and CRISP-DM. Both grow as industrial standards and define a set of sequential steps that pretends to guide the implementation of data mining applications. The question of the existence of substantial differences between them and the traditional KDD process arose. In this paper, is pretended to establish a parallel between these and the KDD process as well as an understanding of the similarities between them.

KDD, SEMMA and CRISP-DM: a parallel overview

In the last years there has been a huge growth and consolidation of the Data Mining field. Some efforts are being done that seek the establishment of standards in the area. Included on these efforts there can be enumerated SEMMA and CRISP-DM. Both grow as industrial standards and define a set of sequential steps that pretends to guide the implementation of data mining applications. The question of the existence of substantial differences between them and the traditional KDD process arose. In this paper, is pretended to establish a parallel between these and the KDD process as well as an understanding of the similarities between them.

Polycyclic aromatic hydrocarbon levels in three pelagic fish species from Atlantic Ocean: inter-specific and inter-season comparisons and assessment of potential public health risks

The concentrations of 18 polycyclic aromatic hydrocarbons (PAHs) were determined in three commercially valuable fish species (sardine, Sardina pilchardus; chub mackerel, Scomber japonicus; and horse mackerel, Trachurus trachurus) from the Atlantic Ocean. Specimens were collected seasonally during 2007–2009. Only low molecular weight PAHs were detected, namely, naphthalene, acenaphthene, fluorene and phenanthrene. Chub mackerel (1.80–19.90 microg/kg ww) revealed to be significantly more contaminated than horse mackerel (2.73–10.0 microg/kg ww) and sardine (2.29–14.18 microg/kg ww). Inter-specific and inter-season comparisons of PAHs bioaccumulation were statistically assessed. The more relevant statistical correlations were observed between PAH amounts and total fat content (significant positive relationships, p < 0.05), and season (sardine displayed higher amounts in autumn–winter while the mackerel species showed globally the inverse behavior). The health risks by consumption of these species were assessed and shown to present no threat to public health concerning PAH intakes.

Evaluation of 99mTc-Sestamibi as a potential tool to investigate PgP activity in inflammation

Introduction: In the XXI Century ’s Society the scientific investigation process has been growing steadily , and the field of the pharmaceutical research is one of the most enthusiastic and relevant . Here, it is very important to correlate observed functional alterations with possibly modified drug bio distribution patterns . Cancer, inflammation and inf ection are processes that induce many molecular intermediates like cytokines, chemokines and other chemical complexes that can alter the pharmacokinetics of many drugs. One cause of such changes is thought to be the modulator action of these complexes in t he P - Glyco p rotein activity, because they can act like inducers/inhibitors of MDR - 1 expression. This protein results from the expression of MDR - 1 gene, and acts as an ATP energy - dependent efflux pump, with their substrates including many drugs , like antiretrovirals, anticancers, anti - infectives, immunosuppressants, steroids or opioids . Objectives: Because of the lack of methods to provide helpful information in the investigation of in vivo molecular changes in Pgp activity during infection/infl ammation processes, and its value in the explanation of the altered drug pharmacokinetic, this paper want to evaluate the potential utility of 99m Tc - Sestamibi scintigraphy during this kind of health sciences investigation. Although the a im is indeed to create a technique to the in vivo study of Pgp activity, this preliminary Project only reaches the in vitro study phase, assumed as the first step in a n evaluation period for a new tool development. Materials and Methods: For that reason , we are performing in vitro studies of influx and efflux of 99m Tc - Sestamibi ( that is a substrate of Pgp) in hepatocytes cell line (HepG2). We are interested in clarify the cellular behavior of this radiopharmaceutical in Lipopolysaccharide(LPS) stimulated cells ( well known in vitro model of inflammation) to possibly approve this methodology. To validate the results, the Pgp expression will be finally evaluated using Western Blot technique. Results: Up to this moment , we still don’t have the final results, but we have already enough data to let us believe that LPS stimulation induce a downregulation of MDR - 1, and consequently Pgp, which could conduce to a prolonged retention of 99m Tc - Sestamibi in the inflamed cells . Conclusions: If and when this methodology demonstrate the promising results we expect, one will be able to con clude that Nuclear Medicine is an important tool to help evidence based research also on this specific field .

188Re-PEI-MP as potential agent for metabolic radiotherapy

Introduction: 188Re is a promising radionuclide for metabolic therapy because of the emission of high energy beta-particles. The development of watersoluble bone-seeking polymers such as PEI-MP (polyethyleneimine, functionalised with methylphosphonate-groups) that might be labeled with 188Re are recent approaches, with a strong potential for bone cancer treatment. The aim of this study was to evaluate the efficacy of 188Re-PEI-MP, as therapeutic agent for osteosarcoma, through in vitro and in vivo models.

Exploring bioactive properties of marine cyanobacteria Isolated from the Portuguese coast: high potential as a source of anticancer compounds

The oceans remain a major source of natural compounds with potential in pharmacology. In particular, during the last few decades, marine cyanobacteria have been in focus as producers of interesting bioactive compounds, especially for the treatment of cancer. In this study, the anticancer potential of extracts from twenty eight marine cyanobacteria strains, belonging to the underexplored picoplanktonic genera, Cyanobium, Synechocystis and Synechococcus, and the filamentous genera, Nodosilinea, Leptolyngbya, Pseudanabaena and Romeria, were assessed in eight human tumor cell lines. First, a crude extract was obtained by dichloromethane:methanol extraction, and from it, three fractions were separated in a Si column chromatography. The crude extract and fractions were tested in eight human cancer cell lines for cell viability/toxicity, accessed with the 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyl tetrazolium bromide (MTT) and lactic dehydrogenase release (LDH) assays. Eight point nine percent of the strains revealed strong cytotoxicity; 17.8% showed moderate cytotoxicity, and 14.3% assays showed low toxicity. The results obtained revealed that the studied genera of marine cyanobacteria are a promising source of novel compounds with potential anticancer activity and highlight the interest in also exploring the smaller filamentous and picoplanktonic genera of cyanobacteria.

Assessment of the potential of tin sulphide thin films prepared by sulphurization of metallic precursors as cell absorbers

In this work, SnxSy thin films have been grown on soda-lime glass substrates by sulphurization of metallic precursors in a nitrogen plus sulphur vapour atmosphere. Different sulphurization temperatures were tested, ranging from 300 °C to 520 °C. The resulting phases were structurally investigated by X-Ray Diffraction and Raman spectroscopy. Composition was studied using Energy Dispersive Spectroscopy being then correlated with the sulphurization temperature. Optical measurements were performed to obtain transmittance and reflectance spectra, from which the energy band gaps, were estimated. The values obtained were 1.17 eV for the indirect transition and for the direct transition the values varied from 1.26 eV to 1.57 eV. Electrical characterization using Hot Point Probe showed that all samples were p-type semiconductors. Solar cells were built using the structure: SLG/Mo/SnxSy/CdS/ZnO:Ga and the best result for solar cell efficiency was 0.17%.

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.

Parallel real-time support for distributed adaptive embedded applications

Real-time embedded applications require to process large amounts of data within small time windows. Parallelize and distribute workloads adaptively is suitable solution for computational demanding applications. The purpose of the Parallel Real-Time Framework for distributed adaptive embedded systems is to guarantee local and distributed processing of real-time applications. This work identifies some promising research directions for parallel/distributed real-time embedded applications.

A framework for the development of parallel and distributed real-time embedded systems

Embedded real-time applications increasingly present high computation requirements, which need to be completed within specific deadlines, but that present highly variable patterns, depending on the set of data available in a determined instant. The current trend to provide parallel processing in the embedded domain allows providing higher processing power; however, it does not address the variability in the processing pattern. Dimensioning each device for its worst-case scenario implies lower average utilization, and increased available, but unusable, processing in the overall system. A solution for this problem is to extend the parallel execution of the applications, allowing networked nodes to distribute the workload, on peak situations, to neighbour nodes. In this context, this report proposes a framework to develop parallel and distributed real-time embedded applications, transparently using OpenMP and Message Passing Interface (MPI), within a programming model based on OpenMP. The technical report also devises an integrated timing model, which enables the structured reasoning on the timing behaviour of these hybrid architectures.

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.