Accomplishing Approximate FCFS Fairness Without Queues

K. Subramani, Kamesh Madduri. Accomplishing Approximate FCFS Fairness Without Queues. In Srinivas Aluru, Manish Parashar, Ramamurthy Badrinath, Viktor K. Prasanna, editors, High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings. Volume 4873 of Lecture Notes in Computer Science, pages 540-551, Springer, 2007. [doi]

@inproceedings{SubramaniM07,
  title = {Accomplishing Approximate FCFS Fairness Without Queues},
  author = {K. Subramani and Kamesh Madduri},
  year = {2007},
  doi = {10.1007/978-3-540-77220-0_49},
  url = {http://dx.doi.org/10.1007/978-3-540-77220-0_49},
  researchr = {https://researchr.org/publication/SubramaniM07},
  cites = {0},
  citedby = {0},
  pages = {540-551},
  booktitle = {High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings},
  editor = {Srinivas Aluru and Manish Parashar and Ramamurthy Badrinath and Viktor K. Prasanna},
  volume = {4873},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-77219-4},
}