Supporti alla Programmazione Grid-Aware: Implementazione del Sistema di Controllo dell'Adattività su Grid di Applicazioni ASSIST

Le piattaforme Grid mettono a disposizione grandi quantità di risorse computazionali fornendo un’astrazione per la loro gestione e il loro accesso in modo unificante a fronte della loro eterogeneità, dinamicità, autonomia e grado di utilizzazione. Le problematiche di ricerca che si presentano su tali piattaforme riguardano la natura dinamica della disponibilità delle risorse: non viene garantito né un livello minimo di performance dei nodi di elaborazione né la loro effettiva disponibilità a determinati istanti nel tempo. Un'applicazione che utilizzi le risorse di una piattaforma Grid deve essere capace di affrontare queste problematiche per garantire un livello minimo di performance, detto contratto di performance. Questo vale ancora di più se si tratta di applicazioni high-performance, cioè applicazioni che devono fornire un alto livello di performance. In questa tesi si estende l’ambiente di programmazione alla base del progetto Grid.it con un Sistema per il Controllo dell’Adattività di applicazioni ASSIST. Tale sistema implementa i meccanismi necessari a garantire la soddisfazione dei contratti di performance. La tesi comprende la descrizione di un’architettura software del sistema e una sua possibile implementazione. Infine vengono presentati i risultati del testing di tale sistema su alcune applicazioni ASSIST. Grid platforms are composed of a large number of computing resources, providing applications with abstractions for using and accessing them in a unified fashion. This is done in the face of resource heterogeneity, dynamicity, autonomy and degree of utilization. One of the main issue for these platforms is represented by their dynamic nature: it is not guaranteed neither a minimum level of performance of computing nodes, nor of their actual availability. An application for Grid platforms must be able to adapt itself to guarantee a minimum degree of performance, also called performance contract. This is even more strict in the case of High-Performance applications. In this thesis we extend the ASSIST programming environment, research base of the Grid.it project, with a system for the adaptivity control. This system implements the needed mechanisms for applications to guarantee performance contracts. The thesis includes also a description of a software architecture of the system and a prototype implementation. Finally, also experimental results for notable ASSIST applications are presented

Fault Tolerance for High-Performance Applications Using Structured Parallelism Models

In the last years parallel computing has increasingly exploited the high-level models of structured parallel programming, an example of which are algorithmic skeletons. This trend has been motivated by the properties featuring structured parallelism models, which can be used to derive several (static and dynamic) optimizations at various implementation levels. In this thesis we study the properties of structured parallel models useful for attacking the issue of providing a fault tolerance support oriented towards High-Performance applications. This issue has been traditionally faced in two ways: (i) in the context of unstructured parallelism models (e.g. MPI), which computation model is essentially based on a distributed set of processes communicating through message-passing, with an approach based on checkpointing and rollback recovery or software replication; (ii) in the context of high-level models, based on a specific parallelism model (e.g. data-flow) and/or an implementation model (e.g. master-slave), by introducing specific techniques based on the properties of the programming and computation models themselves. In this thesis we make a step towards a more abstract viewpoint and we highlight the properties of structured parallel models interesting for fault tolerance purposes. We consider two classes of parallel programs (namely task parallel and data parallel) and we introduce a fault tolerance support based on checkpointing and rollback recovery. The support is derived according to the high-level properties of the parallel models: we call this derivation specialization of fault tolerance techniques, highlighting the difference with classical solutions supporting structure-unaware computations. As a consequence of this specialization, the introduced fault tolerance techniques can be configured and optimized to meet specific needs at different implementation levels. That is, the supports we present do not target a single computing platform or a specific class of them. Indeed the specializations are the mechanism to target specific issues of the exploited environment and of the implemented applications, as proper choices of the protocols and their configurations

Pointers inside lambda closure objects in OpenMP target offload regions

With the diversification of HPC architectures beyond traditional CPU-based clusters, a number of new frameworks for performance portability across architectures have arisen. One way of implementing such frameworks is to use C++ templates and lambda expressions to design loop-like functions. However, lower level programming APIs that these implementations must use are often designed with C in mind and do not specify how they interact with C++ features such as lambda expressions. This paper discusses a change to the behavior of the OpenMP specification with respect to lambda expressions such that when functions generated by lambda expressions are called inside GPU regions, any pointers used in the lambda expression correctly refer to device pointers. This change has been implemented in a branch of the Clang C++ compiler and demonstrated with two representative codes. This change has also been accepted into the draft OpenMP specification for inclusion in OpenMP 5. Our results show that the implicit mapping of lambda expressions always exhibits identical performance to an explicit mapping but without breaking the abstraction provided by the high level frameworks

Implicit mapping of pointers inside C++ Lambda closure objects in OpenMP target offload regions

With the diversification of HPC architectures beyond traditional CPU-based clusters, a number of new frameworks for performance portability across architectures have arisen. One way of implementing such frameworks is to use C++ templates and lambda expressions to design loop-like functions. However, lower level programming APIs that these implementations must use are often designed with C in mind and do not specify how they interact with C++ features such as lambda expressions. This paper proposes a change to the behavior of the OpenMP specification with respect to lambda expressions such that when functions generated by lambda expressions are called inside GPU regions, any pointers used in the lambda expression correctly refer to device pointers. This change has been implemented in a branch of the Clang C++ compiler and demonstrated with two representative codes. Our results show that the implicit mapping of lambda expressions always exhibits identical performance to an explicit mapping but without breaking the abstraction provided by the high level frameworks, and therefore also reduces the burden on the application developer

Notulae to the Italian alien vascular flora: 1

In this contribution, new data concerning the Italian distribution of alien vascular flora are presented. It includes new records, exclusions, and confirmations for Italy or for Italian administrative regions for taxa in the genera Agave, Arctotheca, Berberis, Bidens, Cardamine, Catalpa, Cordyline, Cotoneaster, Dichondra, Elaeagnus, Eragrostis, Impatiens, Iris, Koelreuteria, Lamiastrum, Lantana, Ligustrum, Limnophila, Lonicera, Lycianthes, Maclura, Mazus, Paspalum, Pelargonium, Phyllanthus, Pyracantha, Ruellia, Sorghum, Symphyotrichum, Triticum, Tulbaghia and Youngia

Combined fit to the spectrum and composition data measured by the Pierre Auger Observatory including magnetic horizon effects

The measurements by the Pierre Auger Observatory of the energy spectrum and mass composition of cosmic rays can be interpreted assuming the presence of two extragalactic source populations, one dominating the flux at energies above a few EeV and the other below. To fit the data ignoring magnetic field effects, the high-energy population needs to accelerate a mixture of nuclei with very hard spectra, at odds with the approximate E$^{-2}$ shape expected from diffusive shock acceleration. The presence of turbulent extragalactic magnetic fields in the region between the closest sources and the Earth can significantly modify the observed CR spectrum with respect to that emitted by the sources, reducing the flux of low-rigidity particles that reach the Earth. We here take into account this magnetic horizon effect in the combined fit of the spectrum and shower depth distributions, exploring the possibility that a spectrum for the high-energy population sources with a shape closer to E$^{-2}$ be able to explain the observations

Studies of the mass composition of cosmic rays and proton-proton interaction cross-sections at ultra-high energies with the Pierre Auger Observatory

In this work, we present an estimate of the cosmic-ray mass composition from the distributions of the depth of the shower maximum (Xmax) measured by the fluorescence detector of the Pierre Auger Observatory. We discuss the sensitivity of the mass composition measurements to the uncertainties in the properties of the hadronic interactions, particularly in the predictions of the particle interaction cross-sections. For this purpose, we adjust the fractions of cosmic-ray mass groups to fit the data with Xmax distributions from air shower simulations. We modify the proton-proton cross-sections at ultra-high energies, and the corresponding air shower simulations with rescaled nucleus-air cross-sections are obtained via Glauber theory. We compare the energy-dependent composition of ultra-high-energy cosmic rays obtained for the different extrapolations of the proton-proton cross-sections from low-energy accelerator data

Study of downward Terrestrial Gamma-ray Flashes with the surface detector of the Pierre Auger Observatory

The surface detector (SD) of the Pierre Auger Observatory, consisting of 1660 water-Cherenkov detectors (WCDs), covers 3000 km2 in the Argentinian pampa. Thanks to the high efficiency of WCDs in detecting gamma rays, it represents a unique instrument for studying downward Terrestrial Gamma-ray Flashes (TGFs) over a large area. Peculiar events, likely related to downward TGFs, were detected at the Auger Observatory. Their experimental signature and time evolution are very different from those of a shower produced by an ultrahigh-energy cosmic ray. They happen in coincidence with low thunderclouds and lightning, and their large deposited energy at the ground is compatible with that of a standard downward TGF with the source a few kilometers above the ground. A new trigger algorithm to increase the TGF-like event statistics was installed in the whole array. The study of the performance of the new trigger system during the lightning season is ongoing and will provide a handle to develop improved algorithms to implement in the Auger upgraded electronic boards. The available data sample, even if small, can give important clues about the TGF production models, in particular, the shape of WCD signals. Moreover, the SD allows us to observe more than one point in the TGF beam, providing information on the emission angle