Concept

Priority queue

Related publications (62)

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.

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

A Fully Dynamic Universal Accumulator

Serge Vaudenay, Atefeh Mashatan

A dynamic universal accumulator is an accumulator that allows one to efficiently compute both membership and nonmembership witnesses in a dynamic way. It was first defined and instantiated by Li et al., based on the Strong RSA problem, building on the dyna ...

2013

Join-Idle-Queue: A Novel Load Balancing Algorithm for Dynamically Scalable Web Services

James Richard Larus, Yi Lu

The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balan ...

2011

On Decision Procedures for Ordered Collections

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

We describe a decision procedure for a logic that supports 1) finite collections of elements (sets or multisets), 2) the cardinality operator, 3) a total order relation on elements, and 4) min and max operators on entire collections. Among the applications ...

2010

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

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 ...

2010

Deployment of job priority mechanisms in the Italian Cloud of the ATLAS experiment

Alessandro Barchiesi, Simone Campana

An optimized use of the Grid computing resources in the ATLAS experiment requires the enforcement of a mechanism of job priorities and of resource sharing among the different activities inside the ATLAS VO. This mechanism has been implemented through the V ...

2010

A Cost-Effective Method for the Detection of Queue Lengths at Traffic Lights

Currently, the comparatively young floating car technology is mostly used to get information about travel times which however are more attractive to navigation and route guidance. Concerning traffic management applications such as traffic light control, it ...

Springer2010

Estimating Daily Curves of Queue Length at Traffic Signals using Floating Car Data

It is a well-known fact that nowadays reliable traffic data are an indispensable prerequisite for efficient traffic control and planning. Nevertheless, traffic monitoring in urban areas is still difficult and expensive due to complex traffic dynamics and r ...

2010

Priority scheduling of distributed systems based on model checking

Joseph Sifakis

Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is hard to find efficient implementations for priorities; because they express ...

2009