Calcul distribué

Résumé

Un calcul distribué, ou réparti ou encore partagé, est un calcul ou un traitement réparti sur plusieurs microprocesseurs et plus généralement sur plusieurs unités centrales informatiques, et on parle alors d'architecture distribuée ou de système distribué. Le calcul distribué est souvent réalisé sur des clusters de calcul spécialisés, mais peut aussi être réalisé sur des stations informatiques individuelles à plusieurs cœurs. La distribution d'un calcul est un domaine de recherche des sciences mathématiques et informatiques. Elle implique notamment la notion de calcul parallèle. Historique Le calcul réparti est un concept qui apparaît dans les années 1970, lorsque le réseau Cyclades français, poussé par la CII et sa Distributed System Architecture, basés sur le Datagramme, tentent de mettre en commun les ressources informatiques des centres universitaires et de grandes entreprises en forte croissance comme EDF ou le Commissariat à l'énergie atomique. Aux États-Unis, IBM et

Source officielle

https://fr.wikipedia.org/wiki/Calcul_distribu%C3%A9

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (100)

Publications associées

Chargement

Personnes associées (16)

Personnes associées

Chargement

Unités associées (12)

Unités associées

Chargement

Concepts associés (93)

Concepts associés

Chargement

Cours associés (43)

Cours associés

Chargement

Séances de cours associées (86)

Séances de cours associées

Chargement

ClaimChain: Improving the Security and Privacy of In-band Key Distribution for Messaging

Carmela González Troncoso, Bogdan Kulynych, Wouter Lueks

The social demand for email end-to-end encryption is barely supported by mainstream service providers. Autocrypt is a new community -driven open specification for e-mail encryption that attempts to respond to this demand. In Autocrypt the encryption keys are attached directly to messages, and thus the encryption can be implemented by email clients without any collaboration of the providers. The decentralized nature of this in-band key distribution, however, makes it prone to man-in-the-middle attacks and can leak the social graph of users. To address this problem we introduce ClaimChain, a cryptographic construction for privacy-preserving authentication of public keys. Users store claims about their identities and keys, as well as their beliefs about others, in ClaimChains. These chains form authenticated decentralized repositories that enable users to prove the authenticity of both their keys and the keys of their contacts. ClaimChains are encrypted, and therefore protect the stored information, such as keys and contact identities, from prying eyes. At the same time, ClaimChain implements mechanisms to provide strong non-equivocation properties, discouraging malicious actors from distributing conflicting or inauthentic claims. We implemented ClaimChain and we show that it offers reasonable performance, low overhead, and authenticity guarantees.

ACM2018

Chargement

The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single parities. We analyze the performance of these codes under message passing decoding by using an extended density evolution over erasure channels. Further, we provide an optimal instance of these codes having rates arbitrarily close to the capacity of any binary symmetric channel where a belief propagation algorithm is used for decoding. The relation to other similar constructions is discussed as well. In a similar approach, we introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. Unlike product codes, we do not require that all component row and column codes be the same. This relaxation offers additional flexibility and features such as allowing some regions of the codeword to be more error-resilient, providing a more refined spectrum of rates for finite lengths, and improved performance for some of these rates. We study these codes over erasure channels and prove that for many rate distributions on component row codes, there is a matching rate distribution on component column codes such that an irregular product code based on MDS codes with those rate distributions on the component codes has an optimal asymptotic rate. In the second part we consider two novel applications of Raptor codes. Raptor codes are a class of fountain codes which present excellent performance, flexibility, and low decoding complexity over erasure channels. The data synchronization in an IP multicasting scenario involves reflecting changes from a content on a server to multiple clients efficiently. All these clients possess a slightly different copy of the content on the server. Existing methods are a direct extension of the point-to-point setting which is not necessarily optimal in terms of the total bandwidth usage in the multicast setting. We review this problem and its related information theoretic bounds. We propose and analyze an algorithm using Raptor codes which takes advantage of the multicast protocol to address this problem effectively. This method is close to optimal in terms of the amount of required transmitted information and the network usage. In another application, we show how to make satellite Digital Video Broadcasting resilient to signal jamming by distributing programs over multiple satellite links. However, leasing extra bandwidth on satellite links incurs supplementary cost to the broadcasting operator. In our solution we employ Raptor codes to make the bandwidth usage efficient and adaptive according to the link conditions. The proposed solution is fully compatible with the existing standards and infrastructure.

EPFL2013

Chargement

Safety, Liveness and Parallelism in Concurrent Computing

Victor Bushkov

The correctness of a shared object, which can be accessed by several processes concurrently, is specified through two different kinds of properties - safety and liveness. When implementing a shared object it is important to specify its correctness in a such way that it should be feasible under given assumptions. In this work we study the question of implementability of shared objects that satisfy certain safety and liveness properties under certain assumptions. In particular, we study implementability of liveness properties of transactional memory (TM) shared objects with strict serializability, a strong safety property. TM allows a programmer to encapsulate pieces of sequential code within transactions that run concurrently and it ensures that transactions run in some consistent manner by committing or aborting them. First, we give a formal definition of a liveness property in the TM context. Then, we proceed to show that certain classes of liveness properties of TM can not be implemented with strict serializability in a system in which processes are prone to failures. We also show that, in general, we cannot find a weakest non-implementable (resp. strongest implementable) liveness of TM when we require some common safety property like strict serializability. Moreover, we generalize this result to other shared object types and give a characterization of safety properties for which we can find weakest non-implementable (resp. strongest implementable) liveness. In addition to correctness properties we study the limitations of parallelism which affects performance and scalability of implementations. Specifically, we show that we cannot implement a TM which guarantees disjoint-access parallelism, which say that transactions do not need to synchronize unless they access the same application objects, while guaranteeing very weak safety and the weakest non-blocking liveness.

EPFL2015

Chargement

EPFL2013