Concept

Network block device

Publications associées (7)

Estimating network travel time reliability with network partitioning

Nikolaos Geroliminis, Mohammadreza Saeedmanesh

Network travel time reliability can be represented by a relationship between network space-mean travel time and the standard deviation of network travel time. The primary objective of this paper is to improve estimation of the network travel time reliabili ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Rebasing I/O for Scientific Computing: Leveraging Storage Class Memory in an IBM BlueGene/Q Supercomputer

Felix Schürmann, Pramod Shivaji Kumbhar, Miguel Angel Gila Arrondo, Davide Tacchella, Alessandro Curioni, Fabien Jonathan Delalondre, John Anthony Biddiscombe, Peter Morjan, Blake Fitch, Bernard Metzler, Lars Schneidenbach, Robert Germain

Storage class memory is receiving increasing attention for use in HPC systems for the acceleration of intensive IO operations. We report a particular instance using SLC FLASH memory integrated with an IBM BlueGene/Q supercomputer at scale (Blue Gene Active ...

Springer2014

The challenges of merging two similar structured overlays: A tale of two networks

Karl Aberer, Anwitaman Datta

Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network partitioning or (more likely) because different groups of peers build such o ...

Springer2006

Matching Database Access Patterns to Storage Characteristics

Anastasia Ailamaki

Today’s storage interfaces hide device-specific details, simplifying system development and device interoperability. However, they prevent database systems from exploiting devices’ unique performance characteristics. Abstract and device-independent annotat ...

2003

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Fault tolerance can be achieved in distributed systems by replication. However, Fischer, Lynch and Paterson have proven an impossibility result about consensus in the asynchronous system model. Similar impossibility results have been established for atomic ...

2001

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Peter Urban, Xavier Defago and Andre Schiper: Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be? Keywords: replication, atomic broadcast, consensus, measurements, robustness, high load, LAN, FLP impossibility Abstra ...

2001

Concepts et mécanismes pour la mise en oeuvre d'un environnement d'édition coopérative sur un réseau à grande échelle

The following dissertation addresses one aspect of cooperative editing which has not been well examined until now : the consideration of hardware limitations imposed by a large scale distributed system (namely the Internet). This system model implies heter ...

EPFL1995

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