Concept

DragonFly BSD

Publications associées (28)

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

Deadlock Immunity

Horatiu Jula

Deadlock immunity is a property by which programs, once afflicted by a deadlock, develop resistance against future occurrences of that deadlock. We enable real applications to automatically achieve immunity against deadlock bugs involving mutex locks, sema ...

EPFL2011

MEMS for pico- to micro-satellites

Herbert Shea

MEMS sensors, actuators, and sub-systems can enable an important reduction in the size and mass of spacecrafts, first by replacing larger and heavier components, then by replacing entire subsystems, and finally by enabling the microfabrication of highly in ...

2009

Designing Routing and Message-Dependent Deadlock Free Networks on Chips

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali, Federico Angiolini

Networks on Chip (NoC) has emerged as the paradigm for designing scalable communication architecture for Systems on Chips (SoCs). Avoiding the conditions that can lead to deadlocks in the network is critical for using NoCs in real designs. Methods that can ...

Springer2008

Implementing Joins using Extensible Pattern Matching

Philipp Haller

Join patterns are an attractive declarative way to synchronize both threads and asynchronous distributed computations. We explore joins in the context of extensible pattern matching that recently appeared in languages such as F# and Scala. Our implementati ...

Springer2008

Temporal streams in commercial server applications

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman

Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, and long chains of dependant misses. To improve memory system performance des ...

2008

Deadlock Immunity: Enabling Systems To Defend Against Deadlocks

George Candea, Cristian Zamfir, Horatiu Jula, Daniel Tralamazza

Deadlock immunity is a property by which programs, once afflicted by a given deadlock, develop resistance against future occurrences of that and similar deadlocks. We describe a technique that enables programs to automatically gain such immunity without as ...

2008

Near-obstacle flight with small UAVs

Dario Floreano, Jean-Christophe Zufferey, Antoine Beyeler

Autonomous flight in confined or cluttered environments such as houses or urban canyons requires high manoeuvrability, fast mapping from sensors to actuators and very limited overall system weight. Although flying animals are well capable of solving this p ...

Springer Verlag2008

Optic flow to control small UAVs

Dario Floreano, Jean-Christophe Zufferey, Antoine Beyeler

2008

Implementing Joins using Extensible Pattern Matching

Philipp Haller

2007

Fault-tolerant parallel applications with dynamic parallel schedules

Roger Hersch, Sebastian Gerlach

Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore drive the MTBF of such clusters to unacceptable levels. The software framewo ...

Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States2005