Publications associées à High-availability cluster

Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining

Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision while preserving graph topological structures and node attributive features. Previous Graph Neural Networks (GNN) require a large number of labeled ...

Assoc Computing Machinery2023

GOGREEN: A critical assessment of environmental trends in cosmological hydrodynamical simulations at z approximate to 1

Pascale Jablonka, Hung-Hsu Chan

Recent observations have shown that the environmental quenching of galaxies at z & SIM; 1 is qualitatively different to that in the local Universe. However, the physical origin of these differences has not yet been elucidated. In addition, while low-redshi ...

OXFORD UNIV PRESS2023

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Florent Gérard Krzakala, Lenka Zdeborová, Luca Pesce, Bruno Loureiro, Bruno Loureiro

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

2022

System Support for Robust Distributed Learning

Arsany Hany Abdelmessih Guirguis

Machine learning (ML) applications are ubiquitous. They run in different environments such as datacenters, the cloud, and even on edge devices. Despite where they run, distributing ML training seems the only way to attain scalable, high-quality learning. B ...

EPFL2022

Cluster Catalysis with Lattice Oxygen: Tracing Oxygen Transport from a Magnetite (001) Support onto Small Pt Clusters

Wolfgang Harbich, Giulia Elisabetta Pacchioni, Ke Zhang

Oxidation catalysis on reducible oxide-supported small metal clusters often involves lattice oxygen. The present work aims at differentiating whether the reaction takes place at the cluster/support interface or on the cluster. To that purpose, we trace the ...

AMER CHEMICAL SOC2021

Straight to the Point: Intra- and Intercluster LUT Connections to Mitigate the Delay of Programmable Routing

Paolo Ienne, Grace Zgheib, Stefan Nikolic

Technology scaling makes metal delay ever more problematic, but routing between Look-Up Tables (LUTs) still passes through a series of transistors. It seems wise to avoid the corresponding delay whenever possible. Direct connections between LUTs, both with ...

ASSOC COMPUTING MACHINERY2020

The BUFFALO HST Survey

Jean-Paul Richard Kneib, Pascale Jablonka, David Richard Harvey, Benjamin Yvan Alexandre Clement, Mathilde Jauzac, Huanyuan Shan, Hakim Atek, Anja Von der Linden, Matthieu Schaller, Céline Tchernin, Richard Massey, Johan Richard

The Beyond Ultra-deep Frontier Fields and Legacy Observations (BUFFALO) is a 101 orbit + 101 parallel Cycle 25 Hubble Space Telescope (HST) Treasury program taking data from 2018 to 2020. BUFFALO will expand existing coverage of the Hubble Frontier Fields ...

IOP PUBLISHING LTD2020

An Architecture for Load Balance in Computer Cluster Applications

Laurent Bindschaedler

Amid a data revolution that is transforming industries around the globe, computing systems have undergone a paradigm shift where many applications are scaled out to run on multiple computers in a computing cluster. As the storage and processing capabilitie ...

EPFL2020

Searching for multiple populations in the integrated light of the young and extremely massive clusters in the merger remnant NGC 7252

Carmela Lardo

Recent work has shown that the properties of multiple populations (MPs) within massive stellar clusters (i.e. in the extent of their abundance variations as well as the fraction of stars that show the anomalous chemistry) depend on the mass as well as the ...

OXFORD UNIV PRESS2020

Finding a Needle in the Haystack of Hardened Interconnect Patterns

Paolo Ienne, Grace Zgheib, Stefan Nikolic

Circuits naturally exhibit recurring patterns of local interconnect. Hardening those patterns when designing Field Programmable Gate Array (FPGA) clusters can both eliminate slow programmable connections from the critical path and remove the need for trans ...

IEEE2019

SixTrack V and runtime environment

Igor Zacharov, Giovanni Iadarola, Riccardo De Maria, Dario Pellegrini, Massimo Giovannozzi

SixTrack is a single-particle tracking code for high-energy circular accelerators routinely used at CERN for the Large Hadron Collider (LHC), its luminosity upgrade (HL-LHC), the Future Circular Collider (FCC) and the Super Proton Synchrotron (SPS) simulat ...

2019

Increasing Availability in Distributed Storage Systems via Clustering

Michael Christoph Gastpar, Saeid Sahraei

We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS) that achieves a small repair bandwidth while guaranteeing a high availability. Specifically, we partition the set of servers in a DSS into s c ...

2018

Decentralized clustering for node-variant graph filtering with graph diffusion LMS

Ali H. Sayed, Roula Nassif

In this work, we consider the problem of estimating the coefficients of linear shift-invariant FIR graph filters. We assume hybrid node-varying graph filters where the network is decomposed into clusters of nodes and, within each cluster, all nodes have th ...

IEEE2018

Micro-flock patterns and macro-clusters in chiral active Brownian disks

Chiral active particles (or self-propelled circle swimmers) feature a rich collective behavior, comprising rotating macro-clusters and micro-flock patterns which consist of phase-synchronized rotating clusters with a characteristic self-limited size. These ...

2018

Water soluble derivatives of platinum carbonyl Chini clusters: synthesis, molecular structures and cytotoxicity of [Pt-12(CO)(20)(PTA)(4)](2-) and [Pt-15(CO)(25)(PTA)(5)](2-)

Paul Joseph Dyson, Lucinda Kate Batchelor, Silvia Ruggieri

The reactions of Pt-3n(CO)(6n) (n = 2-5) homoleptic Chini-type clusters with increasing amounts of 1,3,5-triaza-7-phosphaadamantane (PTA) result in the stepwise substitution of one terminal CO ligand per Pt-3 triangular unit up to the formation of [P ...

2018

The mouse genome displays highly dynamic populations of KRAB-zinc finger protein genes and related genetic units

Didier Trono, Julien Léonard Duc, Gabriela Ecco, Marco Cassano, Annamaria Kauzlaric, Michaël Imbeault

KRAB-containing poly-zinc finger proteins (KZFPs) constitute the largest family of transcription factors encoded by mammalian genomes, and growing evidence indicates that they fulfill functions critical to both embryonic development and maintenance of adul ...

Public Library of Science2017

Alignment and Assembly : Inferring Networks from Noisy Observations

Lyudmila Yartseva

Over recent years, many large network datasets become available, giving rise to novel and valuable applications of data mining and machine learning techniques. These datasets include social networks, the structure of the Internet, and protein-interaction n ...

EPFL2017

Mechanism of Shiga Toxin Clustering on Membranes

Julian Charles Shillcock

The bacterial Shiga toxin interacts with its cellular receptor, the glycosphingolipid globotriaosylceramide (Gb3 or CD77), as a first step to entering target cells. Previous studies have shown that toxin molecules cluster on the plasma membrane, despite th ...

2017

Evolving Takagi-Sugeno model based on online Gustafson-Kessel algorithm and kernel recursive least square method

Soroosh Shafieezadeh Abadeh

In this paper, we introduce an evolving system utilizing sparse weighted kernel least square as local models and online Gustafson-Kessel clustering algorithm for structure identification. Our proposed online clustering algorithm forms elliptical clusters w ...

2016

Job-aware Scheduling in Eagle: Divide and Stick to Your Probes

Willy Zwaenepoel, Pamela Isabel Delgado Borda, Diego Didona, Florin Dinu

We present Eagle, a new hybrid data center scheduler for data-parallel programs. Eagle dynamically divides the nodes of the data center in partitions for the execution of long and short jobs, thereby avoiding head-of-line blocking. Furthermore, it provides ...

ACM2016