ACM Home Page
Please provide us with feedback. Feedback
Dynamic resource brokering for multi-user query execution
Full text PdfPdf (1.57 MB)
Source International Conference on Management of Data archive
Proceedings of the 1995 ACM SIGMOD international conference on Management of data table of contents
San Jose, California, United States
Pages: 281 - 292  
Year of Publication: 1995
ISBN:0-89791-731-6
Also published in ...
Authors
Diane L. Davison  Informix Software, Inc.
Goetz Graefe  Microsoft Corp.
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 41,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/223784.223845
What is a DOI?

ABSTRACT

We propose a new framework for resource allocation based on concepts from microeconomics. Specifically, we address the difficult problem of managing resources in a multiple-query environment composed of queries with widely varying resource requirements. The central element of the framework is a resource broker that realizes a profit by "selling" resources to competing operators using a performance-based "currency." The guiding principle for brokering resources is profit maximization. In other words, since the currency is derived from the performance objective, the broker can achieve the best performance by making the scheduling and resource allocation decisions that maximize profit. Moreover, the broker employs dynamic techniques and adapts by changing previous allocation decisions while queries are executing. In a first validation study of the framework, we developed a prototype broker that manages memory and disk bandwidth for a multi-user query workload. The performance objective for the prototype broker is to minimize slowdown with the constraint of fairness. Slowdown measures how much higher the response time is in a multi-user environment than a single-user environment, and fairness measures how even is the degradation in response time among all queries as the system load increases, Our simulation results show the viability of the broker framework and the effectiveness of our query admission and resource allocation policies for multi-user workloads.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BiG88
 
BMC94
 
CLL85
M.J. Carey, M. Livny, and H. Lu, Dynamic Task Allocation in a Distributed Database System, in Proc. 5th Int'l. Conf. in Distr Computing Sys., IEEE Computer Society, 1985, 282.
CoG94
 
DaG94
 
Dav95
 
DGS90
 
FNS91
 
FYN88
D. Ferguson, Y. Yemini, and C. Nikolaou, Microeconomic Algorithms for Load Balancing in Distributed Computer Systems, Proc. 8th IEEE Int'l. Conf. on Distr. Computing Sys., San Jose, CA, June 1988.
 
GlL89
E R. Glahe and D. R. Lee, Microeconomics Theory and Applications, Harcourt Brace Jovanovich, 1989.
 
GrD93
 
Gru91
D. Grunwald, A Users Guide to AWESIME: An Object Oriented Parallel Programming and Simulation System, Univ. of Colorado Tech. Rep. Univ. of Colorado at Boulder-Comp. Sci.-552-91, Boulder, CO, November 1991.
 
MeD93a
 
MeD93b
M. Mehta and D. DeWitt, Dynamic Memory Allocation for Multiple-Query Workloads, Univ. of Wisconsin - Madison Comp. Sci. Tech. Rep. 1151, 1993.
NF91
 
PCL93a
PCL93b
PCL94
 
SDK94
 
WHH92
 
Yu93

CITED BY  7

Collaborative Colleagues:
Diane L. Davison: colleagues
Goetz Graefe: colleagues