The MARUTI hard real-time operating system
ACM SIGOPS Operating Systems Review
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Theoretical Computer Science
On the computational complexity of dynamic graph problems
Theoretical Computer Science
Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
Introduction to constraint databases
Introduction to constraint databases
Programming Languages: Principles and Practice
Programming Languages: Principles and Practice
Introduction to Algorithms
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Automatic Verification of Sequential Circuit Designs
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
The dynamic complexity of transitive closure is in DynTC0
Theoretical Computer Science - Database theory
The power of reachability testing for timed automata
Theoretical Computer Science
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Weakest-precondition of unstructured programs
PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
Incremental algorithms for inter-procedural analysis of safety properties
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Hi-index | 0.00 |
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 are 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.