Concept

Implementation

Related publications (170)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II

Daniel Kressner

This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stabilit ...

Association for Computing Machinery2006

Dependable Systems

André Schiper

Improving the dependability of computer systems is a critical and essential task. In this context, the paper surveys techniques that allow to achieve fault tolerance in distributed systems by replication. The main replication techniques are first explained ...

Springer Berlin Heidelberg2006

STMBench7: A Benchmark for Software Transactional Memory

Rachid Guerraoui, Michal Kapalka

Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than coarse-grained locking and easier to use than fine-grained locks. However, STM implementatio ...

2006

Active, a platform for building intelligent software

Charles Baur

Computer systems keep growing in complexity, processing power and inter-connectivity. To leverage this rich environment and better assist users, a new type of intelligent assistant software is required. Building intelligent assistants is a difficult task t ...

2006

Computing with Reads and Writes in the Absence of Step Contention

Rachid Guerraoui

This paper studies implementations of concurrent objects that exploit the absence of step contention. These implementations use only reads and writes when a process is running solo. The other processes might be busy with other objects, swapped-out, failed, ...

2005

liblaiogen, a generic LAIO implementation

Olivier Crameri

This thesis introduces a new implementation of the LAIO api, liblaiogen. LAIO stands for Lazy Asynchronous I/O. It is an api for performing asynchronous I/O. Among several benefits, one of the most important is that LAIO is lazy, in the sense that it creat ...

2005

Reference current generator, and method of programming, adjusting and/or operating same

Maher Kayal, Michel Declercq, Marc Pastre, Marija Blagojevic, Lionel Portmann

There are many inventions described and illustrated herein. In a first aspect, the present invention is a technique and circuitry for reading data that is stored in memory cells. In one embodiment of this aspect, the present invention is a technique and ci ...

2005

Compiling scala for the Java virtual machine

Michel Schinz

Scala is a new programming language developed at EPFL and incorporating the most important concepts of object-oriented and functional languages. It aims at integrating well with the Java and .NET platforms: their respective libraries are accessible without ...

EPFL2005

VR haptic interfaces for teleoperation: an evaluation study

Daniel Thalmann, Frédéric Vexo, Renaud Ott

We present the results of an evaluation study in the framework of user interfaces for teleoperation of vehicles. We developed a virtual cockpit with haptic feedback provided by a Haptic Workstation™. Four alternative teleoperation interfaces were implement ...

2005

How fast can a distributed atomic read be?

Rachid Guerraoui, Ron Levy, Partha Dutta, Arindam Chakraborty

This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case of ...

2004