(R) Prefetching and Caching for Query Scheduling in a Special Class of Distributed Applications

Authors:
Affiliations:
Venue:
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
Year:
1996

Citing 0
Cited 4

Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching

Proceedings of the eleventh international conference on Information and knowledge management
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Active semantic caching to optimize multidimensional data analysis in parallel and distributed environments

Parallel Computing
Multiple query scheduling for distributed semantic caches

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We analyze the scheduling aspects of database queries submitted to an abstract model of a very large distributed system. The essential elements of this model are: (a) a finite number of identical processing nodes with limited storage capacity, (b) a finite number of queries to be serviced, (c) a very large read-only data set that is shared by all queries and (d) a fixed inter-node communication latency. This framework models an important class of applications that use distributed processing of very large data sets. Examples of these applications exist in the very large database and multimedia problem domains. To meet the objective of minimizing flow time of queries while exploiting inter-query locality, various heuristics are proposed and evaluated through extensive simulation.