Scheduling shared scans of large data files

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 958-969

  Agrawal, Parag ^a   Kifer, Daniel ^b   Olston, Christopher ^b  

^a STANFORD UNIVERSITY   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; SCHEDULING;

ARRIVAL RATES; PERFORMANCE GAIN; PROCESSING ENVIRONMENTS; REAL WORKLOADS; SCHEDULING POLICIES; SCHEDULING PROBLEM; SCHEDULING TECHNIQUES; SHARED SCANS;

BATCH DATA PROCESSING;

EID: 72249107952     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453960     Document Type: Article

References (21)

1. R. H. Arpaci-Dusseau. Run-time adaptation in River. ACM Trans. on Computing Systems, 21(1):36-86, Feb. 2003.
2. P. Billingsley. Probability and Measure. John Wiley & Sons, Inc., New York, 3nd edition, 1995.
3. M. C. Chou, H. Liu, M. Queyranne, and D. Simchi-Levi. On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions. Operations Research, 54(3):464-474, 2006.
4. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proc. OSDI, 2004.
5. S. Divakaran and M. Saks. Online scheduling with release times and set-ups. Technical Report 2001-50, DIMACS, 2001.
6. P. M. Fernandez. Red brick warehouse: A read-mostly RDBMS for open SMP platforms. In Proc. ACM SIGMOD, 1994.
7. A. Gupta, S. Sudarshan, and S. Vishwanathan. Query scheduling in multiquery optimization. In International Symposium on Database Engineering and Applications (IDEAS), 2001.
8. S. Harizopoulos, V. Shkapenyuk, and A. Ailamaki. QPipe: A simultaneously pipelined relational query engine. In Proc. ACM SIGMOD, 2005.
9. H. Hoogeveen. Multicriteria scheduling. European Journal of Operational Research, 167(3):592-623, 2005.
10. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed data-parallel programs from sequential building blocks. In Proc. European Conference on Computer Systems (EuroSys), 2007.
11. D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In M. J. Atallah, editor, Handbook of Algorithms and Theory of Computation. CRC Press, 1997.
12. E. L. Lawler. Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5):544-546, 1973.
13. J. Lenstra, A. R. Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
14. N. Megow, M. Uetz, and T. Vredeveld. Models and algorithms for stochastic online scheduling. Mathematics of Operations Research, 31(3), 2006.
15. R. H. Möhring, F. J. Radermacher, and G. Weiss. Stochastic scheduling problems I - general strategies. Mathematical Methods of Operations Research, 28(7):193-260, 1984.
16. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. In Proc. SODA Conference, pages 422-431, 1993.
17. S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. E. Gehrke. Online scheduling to minimize average stretch. In Proc. FOCS Conference, 1999.
18. K. Pruhs, J. Sgall, and E. Torng. Online scheduling, chapter 15. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall/CRC, 2004.
19. A. S. Schulz. New old algorithms for stochastic scheduling. In Algorithms for Optimization with Incomplete Information, Dagstuhl Seminar Proceedings, 2005.
20. J. Sgall. Online scheduling - a survey. In On-Line Algorithms, Lecture Notes in Computer Science. Springer-Verlag, 1997.
21. M. Zukowski, S. Heman, N. Nes, and P. Boncz. Cooperative scans: Dynamic bandwidth sharing in a DBMS. In Proc. VLDB Conference, 2007.