A major reason for the success of MPI as the standard for large-scale, distributed memory programming is the economy and orthogonality of key concepts. These very design principles suggest leaner and better support for stencil-like, sparse collective communication, while at the same time reducing significantly the number of concrete operation inter...
Because of the evolution of compute units, memory hetero-geneity is becoming popular in HPC systems. But dealing with such various memory levels often requires different approaches and interfaces. For this purpose, OpenMP 5.0 defines memory-management constructs to offer application developers the ability to tackle the issue of exploiting multiple ...
The paper details the first successful attempt at using model checking techniques to verify the correctness of distributed algorithms for robots evolving in a continuous environment. The study focuses on the problem of rendezvous of two robots with lights.There exist many different rendezvous algorithms that aim at finding the minimal number of col...
Anticipating the behavior of applications, studying, and designing algorithms are some of the most important purposes for the performance and correction studies about simulations and applications relating to intensive computing. Often studies that evaluate performance on a single-node of a simulation don’t consider Non-Uniform Memory Access (NUMA) ...
Fog computing has emerged as a strong distributed computation paradigm to support applications with stringent latency requirements. It offers almost ubiquitous computation capacities over a large geographical area. However, Fog systems are highly heterogeneous and dynamic which makes services placement decision quite challenging considering nodes m...
Over the past two decades, group signature schemes have been developed and used to enable authenticated and anonymous peer-to-peer communications. Initial protocols rely on two main authorities, Issuer and Opener, which are given substantial capabilities compared to (regular) participants, such as the ability to arbitrarily identify users. Building...
Many applications of physics modeling use regular meshes on whichcomputations of highly variable cost over time can occur. Distributing the un-derlying cells over manycore architectures is a critical load balancing step thatshould be performed the less frequently possible. Graph partitioning tools areknown to be very effective for such problems, bu...
The increasing scale and complexity of scientific applications are rapidly transforming the ecosystem of tools, methods, and workflows adopted by the high-performance computing (HPC) community. Big data analytics and deep learning are gaining traction as essential components in this ecosystem in a variety of scenarios, such as, steering of experime...
Energy consumption is currently highly regarded in computing systems for many reasons, such as improving the environmental impact and reducing operational costs considering the rising price of energy. Previous works have analyzed how to improve energy efficiency from the entire infrastructure down to individual computing instances (e.g., virtual ma...
This paper develops a generic approach to model control loops and their interac- tion within the Internet of Things (IoT) environments. We take advantage of MAPE-K loops to enable architectural self-adaptation. The system’s architectural setting is aligned with the adaptation goals and the components run-time situation and constraints. We introduce...
