Prefetching and caching for query scheduling in a special class of distributed applications

Proceedings of the International Conference on Parallel Processing

Volumn 3, Issue , 1996, Pages 95-102

  Sinha, A ^a   Chase, C ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; QUERY LANGUAGES; QUERY PROCESSING; SCHEDULING;

ABSTRACT MODELING; DISTRIBUTED APPLICATIONS; DISTRIBUTED PROCESSING; DISTRIBUTED SYSTEMS; ESSENTIAL ELEMENTS; EXTENSIVE SIMULATIONS; INTER-NODE COMMUNICATION; VERY LARGE DATABASE;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0038545579     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1996.538564     Document Type: Conference Paper

References (20)

1. Robert Abbot and Hector Garcia-Molina. Scheduling real-time transactions with disk resident data. In Proceeding of the Fifteenth International Conference on Very Large Data Bases, pages 385-395, 1989.
2. Dimitri Bertsekas and Robert Gallager. Data Networks. Prentice Hall, 1987.
3. Jacek Blazewicz. Selected topics in scheduling theory. Annals of Discrete Mathematics, 31:1-59, 1987.
4. J. Bruno, E. G. Coffman, andR. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), July 1974.
5. Pei Cao, Edward W. Felten, Anna R. Karlin, and Kai Li. A study of integrated prefetching and caching strategies. In SIGMETRICS'95, 1995.
6. Cheng-Shang Chang, Randolph Nelson, and David D. Yao. Optimal task scheduling on distributed parallel processors. Performance Evaluation, 20:207-221, 1994.
7. A. Dan, D. Sitaram, and P. Shahabuddin. Scheduling policies for an on-demand video server with batching. In ACM, Multimedia'94, 1994.
8. Asit Dan and Dinkar Sitaram. An online video placement policy based on bandwidth to space ratio. In ACM, SIGMOD'95, 1995.
9. Jianzhong Du and Joseph Y-T Leung. Complexity of scheduling parallel task systems. SIAM Journal of Discrete Math, 2:473-487, November 1989.
10. Michael R. Garey and David S. Johnson. Complexity results for multiprocessor scheduling under resourceconstraints. SIAM Journal of Computing, 4(4):397-411, December 1975.
11. Michael R. Garey and David S. Johnson. Computers and Intractability-A Guide to the Theory ofNP-Completeness. W. H. Freeman and Company, New York, 1979.
12. S. Ghandeharizadeh and C. Shahabi. On multimedia repositories, personal computers, and hierarchical storage systems. In ACM, Multimedia'94, 1994.
13. Ben Kao and Hector Garcia Molina. Subtask deadline assignment for complex distributed soft real-time tasks. In 14th International Conference on Distributed Computing Systems, pages 172-181, 1994.
14. E.L. Lawler, J.K. Lenstra, and A. H. G. Rinnooy Kan. Recent developments in deterministic and stochastic scheduling: A survey. In Deterministic and Stochastic Scheduling: Proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, 1982.
15. Michael Pinedo. Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs, New Jersey, 1995.
16. A. Ricciardi, M. Ogg, andE. Rothfus. Thenile system architecture: Fault-tolerant wide-area access to computing and data resources. In 6th Computing in High Energy Physics, 1995.
17. Aman Sinha and Craig Chase. Exploiting data locality for multiprocessor query scheduling. Technical Report TR-PDS-1996-009, Parallel and Distributed Systems Laboratory, University of Texas at Austin, 1996.
18. Joseph D. Touch. Defining high-speed protocols: Five challenges and an example that survives the challenges. IEEE Journal on Selected Areas in Communications, pages 828-835, June 1995.
19. John Turek, Uwe Schwiegelshohn, Joel L. Wolf, and Philip S. Yu. Scheduling parallel tasks to minimize average response time. In Proceedings of 5th ACM-SIAM Symposium on Discrete Algorithms, pages 112-121, 1994.
20. W. Zhao, K. Ramamritham, and J. A. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, pages 949-960, August 1987.