ACM Home Page
Please provide us with feedback. Feedback
Enforcing time-constraints effectively for QoS-aware servers
Full text PdfPdf (623 KB)
Source
ACM International Conference Proceeding Series; Vol. 299 archive
Proceedings of the 2008 international symposium on Database engineering & applications table of contents
Coimbra, Portugal
SESSION: Real-time database systems table of contents
Pages 39-47  
Year of Publication: 2008
ISBN:978-1-60558-188-0
Author
Pedro Furtado  University of Coimbra, Coimbra
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

One of the relevant Quality-of-Service (QoS) issues in web service provider infrastructures (Web-servers, web-services and backend database-servers) is how well they are able to handle congestion, while still meeting time-constraints for accepted transactions. There are many works proposing admission control mechanisms, but their focus is on throughput maximization under miss ratio constraints. These metrics are misleading -- at maximum service rate, throughput can only be improved by accepting small transactions while starving long ones. In this paper we investigate whether admission control based on time-constraints may be a more suitable solution, and analyze the hypothesis by means of simulation. We show that time-based control works well. These conclusions are a basis for our future work within the Adapt-DB project on: alternative time-bounding based control approaches; effective control of starving with best throughput; and especially on SLA-targets tracking and feedback control, all of them using timing control as a basis.


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.

1
 
2
 
3
Bhatti N. and R. Friedrich. Web server support for tiered services. IEEE Network, Vol. 13(5) (1999) 64--71.
 
4
Bhoj, Rmanathan, and Singhal. Web2K: Bringing QoS to Web servers. Tech. Rep. HPL-2000-61, HP Labs, (2000).
5
 
6
7
 
8
 
9
 
10
 
11
Haritsa, J., Livny and M. Carey:"Earliest Deadline Scheduling for Real-Time Database Systems", Proc. IEEE Real-Time Syst. Symp, pp 232--242, IEEE, Los Alamitos, CA, 1991.
 
12
 
13
Kanodia V. and E. W. Knightly. Ensuring latency targets in multiclass Web servers. IEEE Requests on Parallel and Distributed Systems, Vol. 13(10) (2002).
 
14
Little, J. D. C. "A Proof of the Queueing Formula L = λ W" Operations Research, 9, 383--387 (1961).
 
15
Krishna C., Shin, Kang, "Real-Time Systems", McGraw-Hill 1997, ISBN 0-07-057043-4.
 
16
 
17
Menasce, Bennani, "On the Use of Performance Models to Design Self-Managing Computer Systems", Proc. 2003 Comp. Measur. Group Conf., Dallas, TX, Dec. 7--12, 2003.
18
 
19
Pang H., Livny M., Carey M.: "Transaction Scheduling in Multiclass Real-Time Database Systems", Proc. IEEE Real-Time Systems Symposium, pp 22--34, IEEE, Los Alamitos, CA, (1992).
 
20
Pradhan P., R. Tewari, S. Sahu, A. Chandra, and P. Shenoy. An observation-based approach towards self managing Web servers. In International Workshop on Quality of Service, Miami Beach, FL, (2002).
 
21
 
22
Stankovic J., C. Lu, S. Son, and G. Tao, The Case for Feedback Control Real-Time Scheduling, EuroMicro Conference on Real-Time Systems (1999).
 
23
TPCC: www.tpc.org.