Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Priority queue

Related publications (23)

Perimeter Control and Route Guidance of Multi-Region MFD Systems With Boundary Queues Using Colored Petri Nets

Nikolaos Geroliminis, Anastasios Kouvelas

Perimeter control based on Macroscopic Fundamental Diagram (MFD) aims to meter the number of transferring vehicles at the periphery of the protected urban region in order to obtain the desired number of vehicles in that region. The advantage of perimeter c ...

IEEE Institute of Electrical and Electronics Engineers2022

Content Based Status Updates

Emre Telatar, Rajai Nasser, Elie Najm

Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted through a network to a monitor. However, the transmission policy of each pack ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Can Dynamic Priority Be Pareto Improving?

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

Traditional priority schemes reduce delays for some by increasing those of others. Yet, this might not be a necessity. Several works published over the last two decades have shown for a stylized set-up with homogeneous users that dynamic priority scheme ma ...

2020

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

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

Limitations of Partial Compaction: Towards Practical Bounds

Nachshon Cohen

Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation provided ...

Assoc Computing Machinery2017

3D dynamic fragmentation with parallel dynamic insertion of cohesive elements

Jean-François Molinari, Nicolas Richart, Marco Vocialta

Dynamic fragmentation is a rapid and catastrophic failure of a material. During this process, the nucleation, propagation, branching, and coalescence of cracks results in the formation of fragments. The numerical modeling of this phenomenon is challenging ...

Wiley2017

Elastic transactions

Rachid Guerraoui, Vincent Gramoli

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

Improved Utility-based Congestion Control for Low-Delay Communication

Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...

Ieee-Inst Electrical Electronics Engineers Inc2017

The roles of coupling and the deviation matrix in determining the value of capacity in M/M/1/C queues

Sophie Myriam Hautphenne

In an M/M/1/C queue, customers are lost when they arrive to find C customers already present. Assuming that each arriving customer brings a certain amount of revenue, we are interested in calculating the value of an extra waiting place in terms of the expe ...

Springer Verlag2016

Non-Rigid Graph Registration using Active Testing Search

Pascal Fua, Raphael Sznitman, Jan Kybic

We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance similarity nor does require a good init ...

Institute of Electrical and Electronics Engineers2015

Energy Proportionality and Workload Consolidation for Latency-Critical Applications

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Mia Primorac

Energy proportionality and workload consolidation are important objectives towards increasing efficiency in large-scale datacenters. Our work focuses on achieving these goals in the presence of applications with microsecond-scale tail latency requirements. ...

2015

Parallel symbolic execution on cluster of commodity hardware

George Candea, Cristian Zamfir, Stefan Bucur

A symbolic execution task is dynamically divided among multiple computing nodes. Each of the multiple computing nodes explores a different portion of a same symbolic execution tree independently of other computing nodes. Workload status updates are receive ...

2014

On The Queue Number Of Planar Graphs

János Pach, Fabrizio Frati

We prove that planar graphs have O(log(2) n) queue number, thus improving upon the previous O(root n) upper bound. Consequently, planar graphs admit three-dimensional straight-line crossing-free grid drawings in O(n log(8) n) volume, thus improving upon th ...

Siam Publications2013

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2011

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010

Agent-Based Routing in Queueing Systems

Olivier Gallay

Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of uni ...

EPFL2010

Forward Error Correction for Multipath Media Streaming

Pascal Frossard, Aleksandar Jovanovic, Dan Jurca

We address the problem of joint optimal rate allocation and scheduling between media source rate and error protection rate in scalable streaming applications over lossy multipath networks. Starting from a distortion representation of the received media inf ...

Institute of Electrical and Electronics Engineers2009

Heterogeneous Gossip

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distribut ...

Springer2009