Publication

High-Performance RMA-Based Broadcast on the Intel SCC

Publications associées (48)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

3D Thermal-Aware Floorplanner for Many-Core Single-Chip Systems

David Atienza Alonso, José Luis Ayala Rodrigo

Heat removal and power density distribution delivery have become two major reliability concerns in 3D stacked technology. In this paper, we propose a thermal-driven 3D floorplanner. Our contributions include: (1) a novel multi-objective formulation to cons ...

IEEE Press2011

Thermal-Aware System-Level Modeling and Management for Multi-Processor Systems-on-Chip

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Francesco Zanini

Multi-Processor Systems-on-Chip (MPSoCs) are penetrating the electronics market as a powerful, yet commercially viable, solution to answer the strong and steadily growing demand for scalable and high performance systems, at limited design complexity. Howev ...

IEEE Press2011

Model Checking of Distributed Algorithm Implementations

Maysam Yabandeh

It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from ...

EPFL2011

PaxosInside

Rachid Guerraoui, Maysam Yabandeh

Amodernmanycore architecture can be viewed as a distributed system with explicit message passing to communicate between cores. Ensuring the consistency of shared state replicated over several cores is the key to the well functioning of such a system. Yet, ...

2010

JErlang: Erlang with Joins

Hubert Plociniczak

ERLANG is an industrially successful functional language that uses the Actor model for concurrency. It supports the message-passing paradigm by providing pattern-matching over received messages. Unfortunately coding synchronisation between multiple process ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

A Novel Parallel QR Algorithm For Hybrid Distributed Memory HPC Systems

Daniel Kressner, Bo Kågström

A novel variant of the parallel QR algorithm for solving dense nonsymmetric eigenvalue problems on hybrid distributed high performance computing systems is presented. For this purpose, we introduce the concept of multiwindow bulge chain chasing and paralle ...

2010

Performance prediction and race detection in message-passing parallel applications

Basile Schäli

The combination of low cost clusters and multicore processors lowers the barrier for accessing massive amounts of computing power. As computational sciences advance, the use of in silico simulations to complement in vivo experiments promises parallel progr ...

EPFL2009

TMunit: Testing Transactional Memories

Vincent Gramoli, Pascal Felber

Transactional memory (TM) is expected to become a widely used parallel programming paradigm for multi-core architectures. To reach this goal, we need tools that do not only help develop TMs, but also test them and evaluate them on a wide range of workloads ...

2009

A new parallelized 3D SPH model: resolution of water entry problems ans scalability study

Pierre Maruzewski

The parallelized model is first presented and a scalability study is achieved. For computational time saving and memory requirement reasons, the implementation of a three dimensional SPH code implies the need for its parallelization, in order to make possi ...

2008

The Weakest Failure Detector for Message Passing Set-Agreement

Rachid Guerraoui

In the set-agreement problem, n processes seek to agree on at most n−1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, calle ...

2008