A hierarchic task-based programming model for distributed heterogeneous computing

Distributed computing platforms are evolving to heterogeneous ecosystems with Clusters, Grids and Clouds introducing in its computing nodes, processors with different core architectures, accelerators (i.e. GPUs, FPGAs), as well as different memories and storage devices in order to achieve better performance with lower energy consumption. As a consequence of this heterogeneity, programming applications for these distributed heterogeneous platforms becomes a complex task. Additionally to the complexity of developing an application for distributed platforms, developers must also deal now with the complexity of the different computing devices inside the node. In this article, we present a programming model that aims to facilitate the development and execution of applications in current and future distributed heterogeneous parallel architectures. This programming model is based on the hierarchical composition of the COMP Superscalar and Omp Superscalar programming models that allow developers to implement infrastructure-agnostic applications. The underlying runtime enables applications to adapt to the infrastructure without the need of maintaining different versions of the code. Our programming model proposal has been evaluated on real platforms, in terms of heterogeneous resource usage, performance and adaptation.This work has been supported by the European Commission through the Horizon 2020 Research and Innovation program under contract 687584 (TANGO project) by the Spanish Government under contract TIN2015-65316 and grant SEV-2015-0493 (Severo Ochoa Program) and by Generalitat de Catalunya under contracts 2014-SGR-1051 and 2014-SGR-1272.Peer ReviewedPostprint (author's final draft

Upscaling of Relative Permeability to Minimise Numerical Dispersion

Imperial Users onl

Microgrid - The microthreaded many-core architecture

Traditional processors use the von Neumann execution model, some other processors in the past have used the dataflow execution model. A combination of von Neuman model and dataflow model is also tried in the past and the resultant model is referred as hybrid dataflow execution model. We describe a hybrid dataflow model known as the microthreading. It provides constructs for creation, synchronization and communication between threads in an intermediate language. The microthreading model is an abstract programming and machine model for many-core architecture. A particular instance of this model is named as the microthreaded architecture or the Microgrid. This architecture implements all the concurrency constructs of the microthreading model in the hardware with the management of these constructs in the hardware.Comment: 30 pages, 16 figure

Characterizing The SINR in Poisson Network Using Factorial Moment

Usually, cellular networks are modeled by placingeach tier (e.g macro, pico and relay nodes) deterministicallyon a grid. When calculating the metric performances suchas coverage probability, these networks are idealized for notconsidering the interference. Overcoming such limitation byrealistic models is much appreciated. This paper considered two-tier two-hop cellular network, each tier is consisting of two-hoprelay transmission, relay nodes are relaying the message to theusers that are in the cell edge. In addition, the locations of therelays, base stations (BSs), and users nodes are modeled as a pointprocess on the plane to study the two hop downlink performance.Then, we obtain a tractable model for the k-coverage probabilityfor the heterogeneous network consisting of the two-tier network.Stochastic geometry and point process theory have deployed toinvestigate the proposed two-hop scheme. The obtained resultsdemonstrate the effectiveness and analytical tractability to studythe heterogeneous performance

Characterizing The SINR in Poisson Network Using Factorial Moment

Usually, cellular networks are modeled by placingeach tier (e.g macro, pico and relay nodes) deterministicallyon a grid. When calculating the metric performances suchas coverage probability, these networks are idealized for notconsidering the interference. Overcoming such limitation byrealistic models is much appreciated. This paper considered two-tier two-hop cellular network, each tier is consisting of two-hoprelay transmission, relay nodes are relaying the message to theusers that are in the cell edge. In addition, the locations of therelays, base stations (BSs), and users nodes are modeled as a pointprocess on the plane to study the two hop downlink performance.Then, we obtain a tractable model for the k-coverage probabilityfor the heterogeneous network consisting of the two-tier network.Stochastic geometry and point process theory have deployed toinvestigate the proposed two-hop scheme. The obtained resultsdemonstrate the effectiveness and analytical tractability to studythe heterogeneous performance