Concept

Bibliothèque standard du C

Publications associées (35)

Distributed digital real-time control system for TCV tokamak

Olivier Sauter, Basil Duval, Stefano Coda, Jean-Marc Moret, Federico Alberto Alfredo Felici, Damien Fasel, Philippe Marmillod, James Paley, Hoang Bao Le

A new digital feedback control system (named the SCD "Systeme de Controle Distribue") has been developed, integrated and used successfully to control TCV (Tokamak a Configuration Variable) plasmas. The system is designed to be modular, distributed, and sca ...

Elsevier Science Sa2014

turboTDDFT 2.0 Hybrid functionals and new algorithms within time-dependent density-functional perturbation theory

We present a new release of the turboTDDFT code featuring an implementation of hybrid functionals, a recently introduced pseudo-Hermitian variant of the Liouville-Lanczos approach to time-dependent density-functional perturbation theory, and a newly develo ...

Elsevier Science Bv2014

Secure Computing with the MPEG RVC Framework

Marco Mattavelli, Richard Thavot, Junaid Jameel Ahmad

Recently, ISO/IEC standardized a dataflow-programming framework called Reconfigurable Video Coding (RVC) for the specification of video codecs. The RVC framework aims at providing the specification of a system at a high abstraction level so that the functi ...

Elsevier Science Bv2013

Multi-Lane FlowPools: A Detailed Look

Martin Odersky, Philipp Haller, Aleksandar Prokopec, Tobias Schlatter

FlowPools, proposed by are a powerful way to express dataflow logic in highly parallelized applications. The original paper proposes two ways of implementing a FlowPool: Single-Lane FlowPools (SLFP) and Multi-Lane FlowPools (MLFP). While SLFPs showed decen ...

2012

Deprecating the Observer Pattern with Scala.React

Martin Odersky, Ingo Maier

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We show how to integrate different reactive programming abstractions into a single framework ...

2012

A Speculation-Friendly Binary Search Tree

Vincent Gramoli

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate t ...

Assoc Computing Machinery2012

On Interactive Synthesis of Code Snippets

Viktor Kuncak, Tihomir Gvero, Ruzica Piskac

We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. Our approach takes into account polymorphic type constraints as well as code behavior. We have found our system to be useful for synth ...

2011

RRB-Trees: Efficient Immutable Vectors

Tiark Rompf

Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allow ...

2011

Studying Application–Library Interaction and Behavior with LibTrac

George Candea, Paul Dan Marinescu, Eric Bisolfati

The boundary between programs and libraries is an appealing location for injecting faults during testing: the cost of doing so is low, and one can emulate a wide range of errors. Several tools exist, but using them faces the challenge of deciding exactly w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Deprecating the Observer Pattern

Martin Odersky, Tiark Rompf, Ingo Maier

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We present an approach to gradually deprecate observers in favor of reactive programming abst ...

2010

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