Quincy
- 11 October 2009
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Scheduling shared scans of large data filesProceedings of the VLDB Endowment, 2008
- MapReduceCommunications of the ACM, 2008
- DryadPublished by Association for Computing Machinery (ACM) ,2007
- An Efficient Implementation of a Scaling Minimum-Cost Flow AlgorithmJournal of Algorithms, 1997
- Effective distributed scheduling of parallel workloadsACM SIGMETRICS Performance Evaluation Review, 1996
- Models of machines and computation for mapping in multicomputersACM Computing Surveys, 1993
- A Faster Strongly Polynomial Minimum Cost Flow AlgorithmOperations Research, 1993
- Gang scheduling performance benefits for fine-grain synchronizationJournal of Parallel and Distributed Computing, 1992
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- A fair share schedulerCommunications of the ACM, 1988