Publications related to Deadlock

DG-Mix: Domain Generalization for Anomalous Sound Detection Based on Self-Supervised Learning

Olga Fink, Ismail Nejjar, Gaëtan Michel Frusque

Detecting anomalies in sound data has recently received significant attention due to the increasing number of implementations of sound condition monitoring solutions for critical assets. In this context, changing operating conditions impose significant dom ...

2022

High-Level Synthesis of Dynamically Scheduled Circuits

Lana Josipovic

High-Level Synthesis (HLS) tools generate hardware designs from high-level programming languages. These tools almost universally build datapaths that are controlled using a centralized controller which relies on a static, compile-time schedule to determine ...

EPFL2021

OneFile: A Wait-free Persistent Transactional Memory

Nachshon Cohen, Pascal Felber

A persistent transactional memory (PTM) library provides an easy-to-use interface to programmers for using byte-addressable non-volatile memory (NVM). Previously proposed PTMs have, so far, been blocking. We present OneFile, the first wait-free PTM with in ...

IEEE COMPUTER SOC2019

Optimized Quantization in Distributed Graph Signal Processing

Pascal Frossard, Isabela Cunha Maia Nobre

Distributed graph signal processing methods require that the graph nodes communicate by exchanging messages. These messages have a finite precision in a realistic network, which may necessitate to implement quantization. Quantization, in turn, generates er ...

IEEE2019

Priority coordination of fiber positioners in multi-objects spectrographs

Denis Gillet, Jean-Paul Richard Kneib, Mohamed Bouri, Laleh Makarem

Projects such as "The Dark Energy Spectroscopic Instrument" (DESI) [1] or "The Multi Object Optical and Near-infrared Spectrograph" (MOONS) [5] are developing spectrographs, composed of more than thousand of optical fibers in a confined hexagonal focal pla ...

SPIE-INT SOC OPTICAL ENGINEERING2018

Universally Scalable Concurrent Data Structures

Tudor Alexandru David

The increase in the number of cores in processors has been an important trend over the past decade. In order to be able to efficiently use such architectures, modern software must be scalable: performance should increase proportionally to the number of all ...

EPFL2017

MOOLs for MOOCs: A first edX scalable implementation

Denis Gillet, Christophe Salzmann, Yves Henri Philippe Piguet

Deploying remote laboratories at a large scale is the next challenge in remote experimentation. It is referred as Massive Open Online Labs (MOOLs). Being able to sustain a massive number of users accessing a specific resource concurrently is a complex task ...

IEEE2016

Optimistic Concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...

ACM Press2016

Distributed Deconfliction Algorithm for Unmanned Aerial Vehicles with Limited Range and Field of View Sensors

Denis Gillet, Alcherio Martinoli, Steven Adriaan Roelofsen

This paper proposes a novel approach for collision avoidance between Unmanned Aerial Vehicles (UAVs) with limited range and field of view sensors. The algorithm is designed for unicycle vehicles that need to fly above a specific minimal speed to maintain f ...

2015

A Methodology For Optimizing Buffer Sizes Of Dynamic Dataflow Fpgas Implementations

Marco Mattavelli, Claudio Paolo Alberti, Simone Casale Brunet, Ab Al Hadi Bin Ab Rahman

Minimizing buffer sizes of dynamic dataflow implementations without introducing deadlocks or reducing the design performance is in general an important and useful design objective. Indeed, buffer sizes that are too small causing a system to deadlock during ...

Ieee2014

From A to E: Analyzing TPC’s OLTP Benchmarks -- The obsolete, the ubiquitous, the unexplored

Anastasia Ailamaki, Pinar Tözün, Ippokratis Pandis, Ilknur Cansu Kaynak, Dorde Jevdic

Introduced in 2007, TPC-E is the most recently standardized OLTP benchmark by TPC. Even though TPC-E has already been around for six years, it has not gained the popularity of its predecessor TPC-C: all the published results for TPC-E use a single database ...

2013

Scalability of write-ahead logging on multicore and multisocket hardware

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica, Ippokratis Pandis

The shift to multi-core and multi-socket hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization ba ...

2012

CoRD: A Collaborative Framework for Distributed Data Race Detection

George Candea, Cristian Zamfir, Baris Can Cengiz Kasikci

Modern concurrent software is riddled with data races and these races constitute the source of many problems. Data races are hard to detect accurately before software is shipped and, once they cause failures in production, developers find it challenging to ...

Usenix2012

Communix: A Framework for Collaborative Deadlock Immunity

George Candea, Horatiu Jula, Pinar Tözün

We present Communix, a collaborative deadlock immunity framework for Java programs. Deadlock immunity enables applications to avoid deadlocks that they previously encountered. Dimmunix [1], our deadlock immunity system, detects deadlocks and saves their si ...

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

Deadlock Immunity : Enabling General-Purpose Software to Defend Itself against Deadlocks

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

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Collision-Free Intersection Crossing of Mobile Robots Using Decentralized Navigation Functions on Predefined Paths

Denis Gillet, Laleh Makarem, Benjamin Fankhauser

This paper deals with the coordination of a group of mobile robots at an intersection. It focusses on decentralized navigation functions (DNFs) to achieve efficient traffic control. The main challenge is to define virtual potentials, which are used by dece ...

2011

A Method to Remove Deadlocks in Networks-on-Chips with Wormhole Flow Control

Giovanni De Micheli, Luca Benini, Srinivasan Murali, Ciprian Seiculescu

Networks-on-Chip (NoCs) are a promising interconnect paradigm to address the communication bottleneck of Systems-on-Chip (SoCs). Wormhole flow control is widely used as the transmission protocol in NoCs, as it offers high throughput and low latency. To mat ...

2010

Aether: A scalable approach to logging

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica, Ippokratis Pandis

The shift to multi-core hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization barriers serialize ...

2010

Swarm-bots to the Rescue

Francesco Mondada, Michael Bonani, Roderich Gross

We explore the problem of resource allocation in a system made up of autonomous agents that can either carry out tasks individually or, when necessary, cooperate by forming physical connections with each other. We consider a group transport scenario that i ...

Springer Verlag2009