Accomplishing approximate FCFS fairness without queues

K. Subramani, K. Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution


First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web requests, and so on. We also have orthogonal applications of FCFS policies in proving correctness of search algorithms such as Breadth-First Search, the Bellman-Ford FIFO implementation for finding single-source shortest paths, program verification and static analysis. The data structure used to implementing FCFS policies, the queue, suffers from two principal drawbacks, viz., non-trivial verifiability and lack of scalability. In case of large distributed networks, maintaining an explicit queue to enforce FCFS is prohibitively expensive. The question of interest then, is whether queues axe required to implement FCFS policies; this paper provides empirical evidence answering this question in the negative. The principal contribution of this paper is the design and analysis of a randomized protocol to implement approximate FCFS policies without queues. From the Software Engineering perspective, the techniques that are developed find direct applications in program verification, model checking, in the implementation of distributed queues and in the design of incremental algorithms for Shortest path problems.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing - HiPC 2007 - 14th International Conference, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540772194
StatePublished - 2007
Event14th International Conference on High-Performance Computing, HiPC 2007 - Goa, India
Duration: Dec 18 2007Dec 21 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4873 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other14th International Conference on High-Performance Computing, HiPC 2007

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Accomplishing approximate FCFS fairness without queues'. Together they form a unique fingerprint.

Cite this