Home > Articles

  • Print
  • + Share This
This chapter is from the book

3.3 Bounds on Performance

Upper bounds on throughput and lower bounds on response time can be obtained by considering the service demands only (i.e., without solving any underlying model). This type of bounding analysis can be quite useful since it provides the analyst with the best possible performance one could hope from a system. The bounding behavior of a computer system is determined by its bottleneck resource. The bottleneck of a system is that resource with the highest utilization (or, equivalently, the resource with the largest service demand).

Example 3.9.

Consider again the database server of Example 3.2 and the service demands for the CPU and the three disks computed in Example 3.4. The service demands were computed to be: DCPU = 0.092 sec, Ddisk1 = 0.079 sec, Ddisk2 = 0.108 sec, and Ddisk3 = 0.142 sec. Correspondingly, the utilization of these devices are 35%, 30%, 41%, and 54%, respectively (from Example 3.4 and Table 1.1). What is the maximum throughput 075fig01.gif of the database server?

Using the Service Demand Law, it follows that UCPU = DCPU × X0 = 0.092 × X0, Udisk1 = Ddisk1 × X0 = 0.079 × X0, Udisk2 = Ddisk2 × X0 = 0.108 × X0, and Udisk3 = Ddisk3 × X0 = 0.142 × X0. Since the service demands are constant (i.e., load-independent), they do not vary with the number of concurrent transactions in execution. The service demands do not include any queuing time, only the total service required by a transaction at the device. Therefore, as the load (i.e., as the throughput, X0) increases on the database server, each of the device utilizations also increases linearly as a function of their individual Di's. See Fig. 3.6. As indicated in the figure, the utilization of disk 3 will reach 100% before any other resource, because the utilization of this disk is always greater than that of other resources. That is, disk3 is the system's bottleneck. When the system load increases to a point where disk 3's utilization reaches 100%, the throughput cannot be increased any further. Since X0 = Udisk3/Ddisk3, X0 ≤ 1/Ddisk3. Therefore, the maximum throughput, 075fig01.gif = 1/Ddisk3 = 1/0.142 = 7.04 tps.

03fig06.gifFigure 3.6. Utilization vs. throughput for Example .

This example demonstrates that

Equation 3.3.17


The resource with the largest service demand will have the highest utilization and is, therefore, the system's bottleneck. This bottleneck device yields the lowest (upper bound) value for the ratio 1/Di. Therefore,

Equation 3.3.18


This relationship is known as the upper asymptotic bound on throughput under heavy load conditions [3].

Now consider Little's Law applied to the same database server and let N be the number of concurrent transactions in execution. Via Little's Law, N = R × X0. But, for a system with K resources, the response time R is at least equal to the sum of service demands, 077fig01.gif, when there is no queuing. Thus,

Equation 3.3.19


which can be rewritten as

Equation 3.3.20


This relationship is known as the upper asymptotic bound on throughput under light load conditions [3]. Combining Eqs. (3.3.18) and (3.3.20), the upper asymptotic bounds are:

Equation 3.3.21


To illustrate these bounds, consider the same database server in Examples 3.2 and 3.4. Consider the two lines (i.e., from Eq. (3.3.21)) that bound its throughput as shown in Fig. 3.7. The line that corresponds to the light load bound is the line N / 0.421 (solid line with solid diamonds). The horizontal line at 7.04 tps (solid line with unfilled diamonds) is the heavy load bound for this case. The actual throughput curve is shown in Fig. 3.7 as the dotted line with solid diamonds and lies below the two bounding lines. Consider now that the bottleneck resource, disk 3, is upgraded in such a way that its service demand is halved (i.e., by replacing it with a new disk that is twice as fast). Then, the sum of the service demands becomes 0.35 (= 0.092 + 0.079 + 0.108 + 0.071) sec. The maximum service demand is now that of disk 2, the new bottleneck, and the new heavy load bound (i.e., the inverse of the maximum service demand) is now 9.26 (= 1/0.108) tps. The solid lines with triangles show the bounds on throughput for the upgraded system. The actual throughput line (dashed line with triangles) is also shown.

03fig07.gifFigure 3.7. Bounds on throughput example.

Note that when the bottleneck resource was upgraded by a factor of two, the maximum throughput improved only by 32% (from 7.04 tps to 9.26 tps). This occurred because the upgrade to disk 3 was excessive. Disk 2 became the new bottleneck. It would have been sufficient to upgrade disk 3 by a factor of 1.32 (= 0.142/0.108) instead of 2 to make its service demand equal to that of disk 2. By using simple bottleneck analysis and performance bounds in this manner, performance can be improved for the least amount of cost.

Example 3.10.

Consider the same database server of Examples 3.2 and 3.4. Let the service demand at the CPU be fixed at 0.092 sec. What should be the values of the service demands of the three disks to obtain the maximum possible throughput, while maintaining constant the sum of the service demands at the three disks? Note that this is a load balancing problem (i.e., the goal is to maximize the throughput by simply shifting the load among the three disks).

As demonstrated, the maximum service demand determines the maximum throughput. In this example, since the CPU is not the bottleneck, the maximum throughput is obtained when the service demands on all three disks is the same and equal to the average of the three original values. This is the balanced disk solution. In other words, the optimal solution occurs when Ddisk1 = Ddisk2 = Ddisk3 = (0.079 + 0.108 + 0.142)/3 = 0.1097 sec. In this case, the maximum throughput is 9.12 (= 1/0.1097) tps. Therefore, the maximum throughput can be expanded to increase 29.5% (i.e., from 7.04 tps to 9.12 tps) simply by balancing the load on the three existing disks.

To be convinced that the balanced disk solution is the optimal solution, assume that all disks have a service demand equal to D seconds. Now, increase the service demand of one of them by ∊ seconds, for ∊ > 0. Since the sum of the service demands is to be kept constant, the service demand of at least one other disk has to be reduced in such a way that the sum remains the same. The disk that had its service demand increased will now have the largest service demand and becomes the bottleneck. The new maximum throughput would be 1/(D + ∊) < 1/D. Thus, by increasing the service demand on one of the disks the maximum throughput decreases. Similarly, suppose that the service demand of one of the disks is decreased. Then, the service demand of at least one of the other disks will have to increase so that the sum remains constant. The service demand of the disk that has the largest increase limits the throughput. Let D + δ, for δ > 0, be the service demand for the disk with the new largest demand. Then, the maximum throughput is now equal to 1/(D + δ) < 1/D. Either way, the maximum throughput decreases as one departs from the balanced case. Said differently, the natural (and obvious) rule of thumb is to keep all devices equally utilized. ▪

Now consider a lower bound on the response time. According to Little's Law, the response time R is related to the throughput as R = N/X0. By replacing X0 by its upper bound given in Eq. (3.3.21), the following lower bounds for the response time can be obtained.

Equation 3.3.22


Example 3.11.

Consider the same database server as before. What is the lower bound on response time?

The sum of the service demands is 0.421 (= 0.092+0.079+0.108+0.142) and the maximum service demand is 0.142 sec. Therefore, the response time bounds are given by

Equation 3.3.23


These bounds are illustrated in Fig. 3.8, which also shows the actual response time curve. As seen, as the load on the system increases, the actual response time approaches the heavy load response time bound quickly. The actual values of the response time are obtained by solving a closed QN model (see Chapter 12) with the help of the enclosed ClosedQN.XLS MS Excel workbook. ▪

03fig08.gifFigure 3.8. Bounds on response time example.

  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020