Accomplishing approximate FCFS fairness without queues

K. Subramani, Kamesh Madduri

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

Abstract

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
Pages540-551
Number of pages12
StatePublished - Dec 1 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

Other

Other14th International Conference on High-Performance Computing, HiPC 2007
CountryIndia
CityGoa
Period12/18/0712/21/07

Fingerprint

Fairness
Queue
Program Verification
Scheduling
Model checking
Static analysis
Data structures
Scalability
Software engineering
Breadth-first Search
Incremental Algorithm
Shortest Path Problem
Distributed Networks
Network protocols
Static Analysis
Software Engineering
Operating Systems
Shortest path
Model Checking
Search Algorithm

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Subramani, K., & Madduri, K. (2007). Accomplishing approximate FCFS fairness without queues. In High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings (pp. 540-551). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4873 LNCS).
Subramani, K. ; Madduri, Kamesh. / Accomplishing approximate FCFS fairness without queues. High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. 2007. pp. 540-551 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{877c019ff9c14f38a69a12d69c6bf8e2,
title = "Accomplishing approximate FCFS fairness without queues",
abstract = "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.",
author = "K. Subramani and Kamesh Madduri",
year = "2007",
month = "12",
day = "1",
language = "English (US)",
isbn = "9783540772194",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "540--551",
booktitle = "High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings",

}

Subramani, K & Madduri, K 2007, Accomplishing approximate FCFS fairness without queues. in High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4873 LNCS, pp. 540-551, 14th International Conference on High-Performance Computing, HiPC 2007, Goa, India, 12/18/07.

Accomplishing approximate FCFS fairness without queues. / Subramani, K.; Madduri, Kamesh.

High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. 2007. p. 540-551 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4873 LNCS).

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

TY - GEN

T1 - Accomplishing approximate FCFS fairness without queues

AU - Subramani, K.

AU - Madduri, Kamesh

PY - 2007/12/1

Y1 - 2007/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=38349048706&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38349048706&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38349048706

SN - 9783540772194

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 540

EP - 551

BT - High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings

ER -

Subramani K, Madduri K. Accomplishing approximate FCFS fairness without queues. In High Performance Computing - HiPC 2007 - 14th International Conference, Proceedings. 2007. p. 540-551. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).