Presentation is loading. Please wait.

Presentation is loading. Please wait.

The Impact of Soft Resource Allocation on n-tier Application Scalability Qingyang Wang, Simon Malkowski, Yasuhiko Kanemasa, Deepal Jayasinghe, Pengcheng.

Published byReilly Lansdowne Modified over 10 years ago

Similar presentations

Presentation on theme: "The Impact of Soft Resource Allocation on n-tier Application Scalability Qingyang Wang, Simon Malkowski, Yasuhiko Kanemasa, Deepal Jayasinghe, Pengcheng."— Presentation transcript:

1 The Impact of Soft Resource Allocation on n-tier Application Scalability Qingyang Wang, Simon Malkowski, Yasuhiko Kanemasa, Deepal Jayasinghe, Pengcheng Xiong, Motoyuki Kawaba, Lilian Harada, Calton Pu

2 22 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

3 33 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Cloud Computing Environment Good performance + Cost efficiency  Scaling applications on demand High throughput + low response time High resource utilization

4 44  Soft resources in n-tier systems  Threads, database connections, TCP connections, locks, etc. Soft Resource Allocation 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Is it okay to duplicate the same configuration of soft resource allocation?

5 55 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

6 66  RUBBoS benchmark  Bulletin board system like Slashdot (www.slashdot.org)www.slashdot.org  Typical 3-tier or 4-tier architecture  Two types of workload  Browsing only  Read/Write mix  24 web interactions  C-JDBC  Middleware for database scale-out  Read: act as a load-balancer  Write: send a request to all databases to keep consistency Experimental Environment (1) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011

7 77  Emulab (http://www.emulab.net)  Relatively modest testbed originally for network research  Virtual network & physical machines (not VM) Experimental Environment (2) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 HardwareSpecifications Server typePC3000 in Emulab ProcessorXeon 3GHz 64bit Memory2GB Network1Gbps Disk2 x 146GB 10,000rpm

8 88  Software setups Experimental Environment (3) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 FunctionSoftware Web serverApache 2.0.54 Application serverApache Tomcat 5.5.17 DB clustering middlewareC-JDBC 2.0.2 Database serverMySQL 5.0.51a JavaSun jdk1.6.0_14 Operating systemRedhat FC4 System MonitorSysstat 7.0.2

9 99  Notation Experimental Environment (4) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 400-6-200 1 / 3 / 1 / 2 configuration

10 10 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Result of Motivational Experiment Scale out

11 11 Hardware configuration 2 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Challenge Hardware configuration Soft resource allocation Hardware configuration 1 Soft resource allocation 1 Thread pool, DB connection pool Thread pool, DB connection pool Soft resource allocation 2 Good performance Bad performance Good performance Scale out How to choose a reasonable soft resource allocation to match the hardware configuration?

12 12  Evaluate two important soft resources  Threads  Database connections  Show their performance impact on n-tier applications  Over-allocation & under-allocation cases  Special case of under-allocation  Introduce a practical way to choose a reasonable allocation of soft resources Focus of This Paper 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011

13 13 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

14 14 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Performance Loss due to Soft Resource Over-allocation (1) 400-200-6 Sensitivity analysis: change DB Connection pool size in Tomcat

15 15 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 50 6 100 200 Performance degradation Goodput 1/4/1/4CPU utilization in CJDBC 6 200 Throughput with response time boundary Performance Loss due to Soft Resource Over-allocation (2) High allocation of DB connections in Tomcat degrades the system performance

16 16 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 JVM Garbage Collection Costs Over-allocation of soft resources causes waste of critical hardware resources 200 6 8% more time used for GC over experimental time JVM Garbage Collection in CJDBC

17 17 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

18 18 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Performance Loss due to Soft Resource Under-allocation (1) 400-6-200 Sensitivity analysis: change thread pool size in Tomcat

19 19 6 200 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Performance Loss due to Soft Resource Under-allocation (2) Goodput 1/2/1/2 20 10 CPU utilization of Tomcat 20 6 Under-allocation of soft resources causes inefficient utilization of hardware resources

20 20 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

21 21 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Special Case of Soft Resource Under- allocation 30-6-100 Sensitivity analysis: change thread pool size in Apache

22 22 30-6-100 400-6-100 50-6-100 100-6-100 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Performance Loss due to Under- allocation of Apache Threads Goodput 1/4/1/4 CPU utilization in CJDBC 30-6-100 400-6-100 Low allocation of Apache threads degrades the system performance

23 23 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Non-Trivial Correlation between Apache and Tomcat Threads (1) 30-6-100 30 > 6 * 4 Why are 30 threads in Apache not enough?

24 24 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Non-Trivial Correlation between Apache and Tomcat Threads (2) Waiting for TCP FIN reply from the client

25 25 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Non-Trivial Correlation between Apache and Tomcat Threads (3) The long waiting time for FIN reply from clients is unpredictable and frequently happens under high workload Waiting for TCP FIN reply from client

26 26 Concurrency for 30-6-100Concurrency for 400-6-100 Large number of soft resources in front tier acts as a buffer providing stable workload for lower tiers 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Concurrency of Apache Threads Connecting to Tomcat

27 27 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Summary of Experiments 1.Over-allocation of soft resources causes waste of critical hardware resources 2.Under-allocation of soft resources causes inefficient utilization of hardware resources 3.Large number of soft resources in front tier acts as a buffer providing stable workload for downstream tiers

28 28 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

29 29 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Soft Resource Allocation Algorithm  Key idea: allocating soft resources globally to utilize the critical hardware resource as efficiently as possible

30 30 1. Identifying the critical hardware resource first Soft Resource Allocation Algorithm (1) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 (1) Bottleneck server

31 31 1. Identifying the critical hardware resource first 2. Allocating proper soft resources for the bottleneck server Soft Resource Allocation Algorithm (2) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Throughput knee Minimum Saturation workload (2) Ave. number of active threads (1) Bottleneck server

32 32 (3) Dependency between current tier and bottleneck tier 1. Identifying the critical hardware resource first 2. Allocating proper soft resources for the bottleneck server 3. Allocating proper amount soft resources in other tiers Soft Resource Allocation Algorithm (3) 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 (2) Ave. number of active threads (1) Bottleneck server

33 33 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Outline  Background & Motivation  Background  Motivational experiment  Performance Impact of Soft Resource Allocation  Over-allocation of soft resources  Under-allocation of soft resources  Special case of under-allocation  Solution  A practical algorithm for good soft resource allocation  Conclusion & Future Works

34 34 Achieving good performance by scaling n-tier applications in Cloud requires a unified exploration of both hardware and software Contributions:  We showed allocation of soft resources has a big impact on the total performance of an N-tier system  We showed to decide a proper soft-resources allocation is a complex problem, especially in cloud environments which requires dynamic scaling-out/in  We gave a practical algorithm for proper soft resource allocation 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Conclusion

35 35 25th IEEE International Parallel & Distributed Processing Symposium 19 May 2011 Future Work  Explore more soft resources such as locks, buffer/queue  Explore more efficient ways to find proper soft resource allocation  Explore the impact of soft resource allocation in virtualized environment

36 Thank You. Any Questions? Qingyang Wang qywang @cc.gatech.edu

Download ppt "The Impact of Soft Resource Allocation on n-tier Application Scalability Qingyang Wang, Simon Malkowski, Yasuhiko Kanemasa, Deepal Jayasinghe, Pengcheng."

Similar presentations

Symantec 2010 Windows 7 Migration Global Results.

Symantec 2010 Windows 7 Migration Global Results.
Design and Evaluation of an Autonomic Workflow Engine Thomas Heinis, Cesare Pautasso, Gustavo Alsonso Dept. of Computer Science Swiss Federal Institute.

Design and Evaluation of an Autonomic Workflow Engine Thomas Heinis, Cesare Pautasso, Gustavo Alsonso Dept. of Computer Science Swiss Federal Institute.
AP STUDY SESSION 2.

AP STUDY SESSION 2.
1

1
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.

1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
& dding ubtracting ractions.

& dding ubtracting ractions.
Pricing for Utility-driven Resource Management and Allocation in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS)

Pricing for Utility-driven Resource Management and Allocation in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS)
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.

Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint

Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.

Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley

Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.

1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.

Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Multiplication X 1 1 x 1 = 1 2 x 1 = 2 3 x 1 = 3 4 x 1 = 4 5 x 1 = 5 6 x 1 = 6 7 x 1 = 7 8 x 1 = 8 9 x 1 = 9 10 x 1 = 10 11 x 1 = 11 12 x 1 = 12 X 2 1.

Multiplication X 1 1 x 1 = 1 2 x 1 = 2 3 x 1 = 3 4 x 1 = 4 5 x 1 = 5 6 x 1 = 6 7 x 1 = 7 8 x 1 = 8 9 x 1 = 9 10 x 1 = x 1 = x 1 = 12 X 2 1.
Division ÷ 1 1 ÷ 1 = 1 2 ÷ 1 = 2 3 ÷ 1 = 3 4 ÷ 1 = 4 5 ÷ 1 = 5 6 ÷ 1 = 6 7 ÷ 1 = 7 8 ÷ 1 = 8 9 ÷ 1 = 9 10 ÷ 1 = 10 11 ÷ 1 = 11 12 ÷ 1 = 12 ÷ 2 2 ÷ 2 =

Division ÷ 1 1 ÷ 1 = 1 2 ÷ 1 = 2 3 ÷ 1 = 3 4 ÷ 1 = 4 5 ÷ 1 = 5 6 ÷ 1 = 6 7 ÷ 1 = 7 8 ÷ 1 = 8 9 ÷ 1 = 9 10 ÷ 1 = ÷ 1 = ÷ 1 = 12 ÷ 2 2 ÷ 2 =
UNITED NATIONS Shipment Details Report – January 2006.

UNITED NATIONS Shipment Details Report – January 2006.
Towards Automating the Configuration of a Distributed Storage System Lauro B. Costa Matei Ripeanu {lauroc, NetSysLab University of British.

Towards Automating the Configuration of a Distributed Storage System Lauro B. Costa Matei Ripeanu {lauroc, NetSysLab University of British.
David Burdett May 11, 2004 Package Binding for WS CDL.

David Burdett May 11, 2004 Package Binding for WS CDL.
15.082 and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action 1 2 3 4 5 6 7 35 10 30 15 25 40 20 17 8 15 11 21 1 2 3 4 5 6 7.

and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.

1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.

Similar presentations

Ads by Google