Concept

Double-ended queue

Related publications (33)

The splay-list: a distribution-adaptive concurrent skip-list

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

SPRINGER2023

Efficient Max-Pressure Traffic Management for Large-Scale Congested Urban Networks

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

Traffic responsive signal control systems bear high potential in reducing delays in congested networks due to their ability of dynamically adjusting right-of-way assignment among conflicting movements, based on real-time traffic measurements. In this work, ...

2022

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

2022

Three-dimensional electrodes for dielectrophoretic applications

Kevin Keim

This thesis reports the use of metal-coated three-dimensional SU-8 electrodes for dielectrophoretic bio sensing and particle manipulation applications. Placing free standing three-dimensional electrodes in microfluidic channels, electric fields can be appl ...

EPFL2020

Distributed Computing with Modern Shared Memory

Mihail Igor Zablotchi

In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...

EPFL2020

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Jasmina Malicevic

Graph processing systems are used in a wide variety of fields, ranging from biology to social networks. Algorithms to mine graphs incur many random accesses, and the sparse nature of the graphs of interest, exacerbates this. As DRAM sustains high bandwidt ...

EPFL2019

A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators

Jean-Yves Le Boudec

We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang's max-plus g-regulation, and also includes new types of regulation, such as packet rate limitations. We provide a new exa ...

2018

Numerical analysis of fragmentation in tempered glass with parallel dynamic insertion of cohesive elements

Jean-François Molinari, Mauro Corrado, Marco Vocialta

Tempered glass panes are subjected to high eigenstresses that induce a state of compression along the surfaces and a state of tension in the inner part. Whenever a crack reaches the tensile region, it rapidly propagates and branches in all directions drive ...

2018

A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators

Jean-Yves Le Boudec

We define the minimal interleaved regulator, which generalizes the Urgency Based Shaper that was recently proposed by Specht and Samii as a simpler alternative to per-flow reshaping in deterministic networks with aggregate scheduling. With this regulator, ...

Arxiv2018

Elastic transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

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.