Concept

Système de fichiers

Publications associées (218)

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

An Extensible and Personalized Approach to QoS-enabled Semantic Web Service Discovery

Karl Aberer, Manfred Hauswirth

We present a framework for the autonomous discovery and selection of Semantic Web services based on their QoS properties. The novelty of our approach is the wide use of semantic technologies for a customizable discovery, which enables both the service user ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

The paper presents a primary-backup protocol to manage replicated in-memory database systems (IMDBs). The protocol exploits two features of IMDBs: coarse-grain concurrency control and deferred disk writes. Primary crashes are quickly detected by backups an ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

2006

Solving Atomic Broadcast with Indirect Consensus

André Schiper, Nils Richard Ekwall

In previous work, it has been shown how to solve atomic broadcast by reduction to consensus on messages. While this solution is theoretically correct, it has its limitations in practice, since executing consensus on large messages can quickly saturate the ...

2006

Solving Atomic Broadcast with Indirect Consensus

André Schiper, Nils Richard Ekwall

2006

Burrows-Wheeler text compression with fountain codes

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

This paper presents an algorithm in a purely lossless text compression setting based on fountain codes and the Burrows-Wheeler transform (BWT). The scheme consists of five stages, each of which is briefly described in the paper. The algorithm offers encour ...

2006

Transactional Memory

James Richard Larus

The advent of multicore processors has renewed interest in the idea of incorporating transactions into the programming model used to write parallel programs. This approach, known as transactional memory, offers an alternative, and hopefully better, way to ...

Morgan & Claypool2006

PocketFactory : a modular and miniature assembly chain including a clean environment

Reymond Clavel, Irène Verettas

The manipulation and assembly of microsystems (MEMS) require accurate robots operating in a clean room environment. Available systems require usually large ground surface for small components and are bulky. Furthermore it is difficult to move it to another ...

2006

Maintaining high bandwidth under dynamic network conditions

Dejan Kostic

The need to distribute large files across multiple wide-area sites is becoming increasingly common, for instance, in support of scientific computing, configuring distributed systems, distributing software updates such as open source ISOs or Windows patches ...

2005

Denial-of-service resilience in peer-to-peer file sharing systems

Willy Zwaenepoel, Dan Mihai Dumitriu

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immun ...

2005