- Overview Of The Dynamic Cubes Architecture
- Collecting Information About Your Application
- High Level Sizing Recommendations For Individual Cubes
- Detailed Sizing Recommendations For Dynamic Cubes
- Disk Space Recommendations For Dynamic Cubes
- Recommended Hardware Sizing For Various Scenarios
- Appendix A
- Downloadable resources
Dynamic Cubes Hardware Sizing Recommendations for IBM Cognos 10.2
Product(s): IBM Cognos Dynamic Cubes; Area of Interest: Performance
This content is part # of # in the series: IBM Business Analytics Proven Practices
This content is part of the series:IBM Business Analytics Proven Practices
Stay tuned for additional content in this series.
The purpose of this document is to provide guidance for determining the minimum hardware requirements to provide an acceptable level of query performance from Dynamic Cubes. After a brief description of the Dynamic Cubes architecture, the document outlines the information that should be collected prior to determining the hardware requirements. It then provides a simple means of using this information to obtain the CPU core, memory and hard disk requirements for Dynamic Cubes.
This document also provides a detailed description of how hardware requirements can be more accurately computed for a particular application and provides additional background to assist in understanding the suggested guidance.
This document is intended only for IBM Cognos 10.2. This document is not intended for previous versions because Dynamic Cubes is only available as of 10.2. In addition, later versions may have different hardware requirements. For further assistance or clarification please contact your local IBM Services group for assistance in performing a proper requirements gathering.
Overview Of The Dynamic Cubes Architecture
Dynamic Cubes exist within the Dynamic Query Mode (DQM) server. Only a single DQM server may exist under a single Dispatcher and it services queries from all of the Report Servers that reside under the Dispatcher. All of the cubes that are configured to run on a single Dispatcher must have all of the necessary hardware resources (cores and memory) available to the DQM server for the cubes to operate efficiently.
With Dynamic Cubes, the DQM server in essence becomes an in-memory repository of data. Because of the volumes of data that the DQM server is required to store and process, additional CPU cores and memory are required to support Dynamic Cubes over and above what is typically required for a DQM server. A DQM server will make use of available cores to improve Dynamic Cube performance and will make use of available memory, though there may be practical limits to the amount of memory that can be effectively used for Dynamic Cubes. This will be discussed later in this document.
It is very important to note that the sizing recommendations here do not account for the resources required for the Dispatcher or the accompanying Report Server processes.
There are three pieces of hardware which need to be sized for Dynamic Cubes - CPU cores, memory, and hard disk space. CPU cores are required for two purposes - to support concurrent execution of user queries and to allow Dynamic Cubes to perform certain internal operations in parallel. Memory is required to contain all of the dimensional members of a cube in memory and to provide adequate space in memory to store data that is retained in its various caches. Finally, hard disk space is required for the result set cache associated with each cube.
Collecting Information About Your Application
Prior to estimating the hardware requirements for Dynamic Cubes, it would be helpful to gather the following information (listed in order of importance) or at least obtain estimates for each item below. If you need to estimate, it is usually better to over-estimate - if you under-estimate, performance could suffer.
- The total number of cubes being deployed. If possible, identify which cubes are virtual. If unsure, assume all the cubes are base cubes and none are virtual.
- For each cube, the number of named users granted access to the cube.
- For each cube, the number of members in total across the two largest dimensions.
- The number of rows in the fact table.
- The number of measures.
- The number of dimensions.
- If there are virtual cubes, determine if any of the cubes upon which they are based are directly accessible or not.
High Level Sizing Recommendations For Individual Cubes
If you need only to make a high level estimate of the hardware requirements for Dynamic Cubes or cannot perform more detailed estimates based on the information contained later in this document, estimates have been provided for four broad categories of cubes in the table below.
Table 1 - High level sizing recommendations
|Configuration||Description||Number of members in 2 largest dimensions||Number of named users|
|Small||Development environment scale or small Line Of Business application. Small number of concurrent users and small data volume.||600,000||100|
|Medium||Small to medium sized, enterprise-wide application.||3,000,000||1000|
|Large||Large enterprise, divisional application, accessing large data volumes.||15,000,000||5000|
|Extra large||Enterprise-wide user access, core application, accessing very large data volumes at day, consumer, product (SKU) level of data.||30,000,000||10,000|
Taking into account that the number of named users of an application and the amount of data within it are distinct from one another, the Table 2 provides a quick reference for the combination of small, medium, large, and extra large user and data volume combinations. For the purposes of the guidance provided here, the assumption is that a cube contains a total of 12 hierarchies.
Table 2 - CPU core, memory and disk space recommendations
|Small||1 - 4||3 GB||1 GB|
|Medium||4 - 8||12 GB||10 GB|
|Large||8 - 16||100 GB||50 GB|
|Extra Large||16 - 32||300 GB||100 GB|
Figure 1 is a graphical representation of the data in Table 2.
Figure 1 – CPU core, memory and disk space chart using the information from Table 2
Detailed Sizing Recommendations For Dynamic Cubes
Number of CPU Cores
The number of users can be expressed in three ways:
- Named users are all people who have access to the IBM Cognos 10 BI solution.
- Active users are a subset of the Named user community who are logged on to the system and may or may not be interacting with IBM Cognos 10 BI system at any given time.
- Concurrent users are a subset of Active user community who at a given time are either submitting a request or already have a request in progress.
For the basis of the document, the assumed relationship is that 100 named users equates to 10 active users which in turn equate to a single concurrent user. The notion of concurrent requests is discussed at the end of this document as way of more accurately estimating hardware requirements for Dynamic Cubes.
As the number of users increases, so does the number of CPU cores required to process queries concurrently. Dynamic Cubes can take advantage of additional cores to perform internal operations in parallel, the result of which is that individual queries perform faster. The following table outlines the suggested number of cores based on the number of named users.
Table 3 - Number of CPU cores based on named users
|Scenario||Number of named users||Number of CPU cores|
|Medium||100 - 1000||4 - 8|
|Large||1000 - 5000||8 - 16|
|Extra Large||5000 - 10000||16 - 32|
Scaling beyond 10,000 users, the general rule is to add a minimum of 1 core for each additional 1000 named users above the first 10,000 named users. For example, if there are 25,000 named users, this means 32 + 15 = 47 ~ 48 cores. In general, the more cores on your machine the better - cores will not be wasted. The cores which are not used to execute queries concurrently will be used by Dynamic Cubes to perform internal operations in parallel, which will improve individual query performance.
Figure 2 is a graphical representation of the data in Table 3.
Figure 2 - IBM Cognos 10.2 named user CPU core recommendations using the data from Table 3
One of the assumptions behind the recommendations above is that the volume of data processed by Dynamic Cubes itself remains relatively constant although the amount of data processed in the relational database may increase. If this assumption does not hold true, it may be prudent to add additional cores based on the size of the aggregate and data caches (see below), allotting an additional core for each 5 GB of memory of the combined size of both caches.
Dynamic Cubes uses memory for storing the members of all hierarchies, storing data in the data and aggregate caches, and providing temporary space for the execution of MDX queries within the DQM server. In order to compute the total amount of memory required for a cube, the following computation can be used:
<member cache size> + <data cache size> + <aggregate cache size> + <temporary query space> + <JVM adjustment>
Dynamic Cubes loads all of the members of a cube's hierarchies into memory when a cube is started. The intent of this is to provide fast access to member metadata, not just for populating the metadata browser in the various BI studios but also to provide the DQM server with fast access to members and member metadata during query planning and MDX query execution, and to the SQL generation component of Dynamic Cubes.
The estimated amount of memory required to store a member in a Dynamic Cube is 1440 bytes on a 64 bit Java Virtual Machine (JVM) and approximately 720 bytes on a 32 bit JVM (or a 64 bit JVM with compressed references). Compressed references in a 64 bit JVM are only applicable if the memory used does not exceed 32 GB. Since in most cases the largest two dimensions (hierarchies) dwarf the size of all other dimensions, the estimated size of the member cache is the sum of the number of members in all of the hierarchies of these two dimensions multiplied by 1440 bytes. This must be computed for each cube on a server whether it is a base or virtual cube. All hierarchies in the two largest dimensions which are of the same order of magnitude in size must be included in this computation as each hierarchy's members are stored separately from one another.
The 1440 bytes per member does not take into account the presence of additional member properties. Member properties are defined on a level-basis and consume approximately 2 bytes per character of each member property's value for each member. This should be taken into account when the largest dimensions contain additional properties. When calculating the amount of memory for the data cache, the member size of 1440 bytes should be used, regardless of the presence of member properties.
So, the following equation can be used to compute the amount of memory required for the member cache:
<# of members in the largest hierarchies> * 1440 bytes
Overview of the Data Cache
When estimating the amount of memory required for the data cache, what is most important is the number of possible data points in a dynamic cubes’ dimensional space warehouse and the manner in which those data points are accessed in reports and analyses.
Of all of the possible data points in a cube, it is expected that users as a whole will access a small common subset, and individuals will use smaller portions of the cube that are pertinent to their individual data exploration. This is important because a Dynamic Cube’s data cache only loads data on demand, and all detail facts, unless explicitly required by a query, remain in the relational database.
For example, if a fact table contained 10 billion rows of fact data for 10 years of data, and a query requests the annual sales totals for each year for 25 sales districts, a Dynamic Cube only stores 250 data points in its data cache, even though the database was required to read all data in the fact table.
It is typically only when queries filter large sets of members by their associated measure values that a large number of values are stored in the data cache.
From a reporting/analysis point of view, limiting the filtering of entire swathes of a leaf level of a large dimension can help in reducing the required size of the data cache – restricting such filter expressions by a member at a higher level can make a significant impact (e.g., filtering customers within a region as opposed to all customers of an entire organization).
It is also important to keep in mind that the data cache has a fixed size and will evict earlier query results if it approaches its maximum size. Dynamic Cubes use a heuristic to determine which query results it should evict from its cache. If data that was once retrieved is evicted, a subsequent request will cause the Dynamic Cube to re-retrieve the data from the underlying database.
Note that over the course of a business day, users may explore data, most likely making use of data previously retrieved by other users running the same or other related reports. During that time, some data will be viewed a number of times and then not examined again – it becomes stale and is an ideal candidate for eviction. The removal of these query results from the data cache do not impact performance, but do allow the data cache to provide space for subsequent queries retrieving previously unviewed data.
Computing Memory Requirements for the Data Cache
The size of the data cache depends on the number of cells required by reports, analyses, and dashboards, as well as the presence of an aggregate cache. Since it is difficult to forecast report/analysis behavior, the data cache size is estimated based on the size of the dimensional space, which is an estimate based on the size of the member cache. As the size of the dimensional space grows, so will the size of the data cache.
Note that each cell stored in a dynamic cube will consume 80 bytes in a 64 bit JVM. As a result, approximately each gigabyte of the Dynamic Cube's data cache will store 11 million to 12 million values.
In the calculation below, note that the presence of an aggregate cache reduces the amount of space required for the data cache (it needs to contain fewer values). The aggregate cache will be discussed in the next section. As well, each user is likely to retrieve some data which is specific to the report they are executing, even if they are possibly running the same report e.g. prompt values are different.
user factor = (# of named users * 200K)
In addition, every 5,000 named users require an additional 1 GB of memory.
If an aggregate cache is present then the minimum data cache size is:
The greater of (10% of the member cache size + user factor) or ((20% of the member cache size + user factor) - (size of the aggregate cache))
If an aggregate cache isn't present then the minimum data cache size is:
(20% of the member cache size) + user factor
Note that this is a minimum requirement - allotting more memory for the data cache will improve performance as the system gets used. If you want to widen the area of analysis by loading more leaf level data, you should consider increasing the data cache and scheduling cache-priming jobs on cube start.
Computing the Size of the Aggregate Cache
The aggregate cache contains a collection of measure values at the intersection of different combinations of levels from various hierarchies in a cube. The aggregate cache can satisfy many data requests without the need to retrieve values from the database which reduces the amount of data that needs to be stored in the data cache.
This is especially true since the aggregate cache's contents are based on user workload - the contents are tuned to maximize the use of the data in the aggregate cache. As a result, when an aggregate cache is present, it can make sense to reduce the size of the data cache.
The contents of the aggregate cache are intended to provide quick access to values computed at higher levels of aggregation in a cube. Though the number of values can grow as a cube's overall size increases, the amount of data required in the aggregate cache is not necessarily linearly correlated to the increase in cube's size. As a result, a sliding scale is used to compute the minimum size of the aggregate cache relative to the size of the member cache.
The aggregate cache is a case where "more is not necessarily better". The more aggregates that are defined mean more objects in the system, in addition to the additional work to load the aggregates. Given the amount of memory needed to hold the aggregates necessary for your workload, be wary of going beyond that number even if you have the memory space defined by the limits above.
It is recommended that the aggregate cache of a cube not exceed 30 GB. Table 4 provides estimates for the size of the aggregate cache based on a percentage of the member cache size.
Table 4 - Aggregate cache estimates based on member cache
|Configuration||Aggregate cache size as % of member cache|
Temporary Query Space
Each concurrent query executed against a Dynamic Cube requires space for the construction of intermediate result sets for use within the DQM MDX engine. In general, there is some overhead per query that needs to be accounted for, as well as space allotted for one or more queries which are atypical and may retrieve large volumes of data that require large amounts of memory to transfer the values within the engine.
On a server which hosts multiple cubes, the assumption is that a single user with access to multiple cubes executes a query on only one of those cubes at a time. Consequently, the amount of memory required for temporary query space is computed for each logical group of concurrent users and the cubes to which they have access. These individual values are added together to obtain the amount of memory required on the server to support concurrent queries across all the groups of users and the cubes to which they have access.
The calculation to compute the memory required for query processing for a group of users and the cubes to which they have access is as follows:
Concurrent query usage size = [size of max query memory usage] + [average memory usage per query] * (# of concurrent users - 1)
Note that the
average memory usage per query value does not include the size of the maximum query.
average memory usage per query is approximately 5% of
the size of the largest member cache amongst the cubes to which the group of users have
size of max query memory usage is approximately 450% of the size of this member cache.
JVM Garbage Collection Adjustment
With Java 6, the garbage collection (GC) cycle can spend considerable time analyzing the heap to identify the garbage which can be discarded by the JVM. In order to reduce the occurrence of the GC cycle, as well as the time spent performing the GC cycle, it is recommended that at least an additional 10% of the calculated memory requirements for a cube be available in memory and also assigned to the DQM JVM. This additional memory should not be required if you are making use of the 'balanced' GC mode available with the Java Runtime Environment (JRE) which ships with WebSphere 8.
Miscellaneous Adjustments to the Memory Requirements
If the member cache will be refreshed while a cube is available, then it is necessary to double the amount of memory required for the member cache because Dynamic Cubes will build the new member cache in the background while the current member cache is being used; for a short time both member caches are present in memory.
If a cube exists solely for use within a virtual cube and it is not accessible from any reporting packages, it may not be necessary to assign a data cache to a cube since data will be cached in the virtual cube which is being accessed directly by users. It is also not necessary to account for the user query space in intermediate cubes since they do not involve the MDX engine.
If a virtual cube is built to combine historic and recent data into a single cube, it may make sense to assign a data cache to the base cube as this will ensure fast query performance when the recent data cube is updated.
Disk Space Recommendations For Dynamic Cubes
The result set cache retains a copy of the result of MDX queries executed against a Dynamic Cube on disk in a binary format. Entries in the cache are identified by the MDX query and the combination of security views of the user who executed the query. This information is stored in a small, in-memory index that is used to quickly search for cache entries. The result set of a query is only added to the cache if it exceeds a predefined, minimum query execution time, to ensure the cache is not populated with the result of queries which execute quickly without an additional caching required. This value is configurable in the IBM Cognos Administration console on a per-cube basis.
The benefits of the result set cache are most obvious when a group of users are executing a common set of managed reports that have a limited number of prompts. The more opportunities there are for differences in a report's specification, the less often the result set cache will be used. Ad hoc analysis is unlikely to make much use of the result set cache, except in cases where a user drills up, in which case a previous analysis is re-executed and can make use of the result set cache. Consequently, the retention of an MDX result set in the cache does not necessarily benefit subsequent users, simply because there are limited chances that the exact same query will be executed in the future.
The size of the result set cache is tied to the number of active users - the more users, the larger the cache needs to be to retain MDX query result sets. Result sets are typically very small, approximately 10KB to 20KB in size. The average size is conservatively estimated at 50KB per result set, and each user is allotted 200 entries in the cache, which equates to 10 MB of disk space per active user (or 100K per named user). Table 5 provides a quick reference for disk space estimates.
Table 5 - Disk space estimates
|Configuration||Estimated disk space requirement|
|Extra Large||100 GB|
A result set cache is only required for cubes which are directly accessible by users, i.e., there is at least one published package which includes the cube as a data source.
Recommended Hardware Sizing For Various Scenarios
Table 6 provides the details behind the initial, high level sizing table earlier in this document. The calculations used to compute the values in the table are those described above. This is strictly meant as an example of how these values can be computed.
The Final Base JVM Heap Size column represents the amount of memory required for a Dynamic Cube, including the JVM adjustment discussed above.
As discussed earlier, the JVM Heap (member cache refresh support) column represents the amount of memory required for a Dynamic Cube for which member cache refresh will be performed. This value is computed as:
Final Base JVM Heap Size + Member Cache Size
Also, the JVM Heap (intermediate cube, no direct access, no member cache refresh) column denotes the amount of memory required for a cube that has no direct access and is used as the basis of a virtual cube. The value is computed as:
Final Base JVM Heap Size - Data Cache Size (base) - Data Cache Size (user adjustment)
The table below contains the values discussed earlier in this document as a single source reference.
Table 6 - All Sizing Estimates from Document
|Number of Named Users||100||1000||5000||10000|
|Number of Members in 2 Largest Dimensions||600,000||3,000,000||15,000,000||30,000,000|
|Member Cache Size||840 MB||4.22 GB||21.1 GB||42.2 GB|
|Data Cache Size (base)||84 MB||420 MB||2.11 GB||4.22 GB|
|Data Cache Size (user adjustment)||20 MB||200 MB||1 GB||2 GB|
|Aggregate Cache Size||500 MB||2.10 GB||5.3 GB||10.6 GB|
|Average Query Memory per User||42 MB||210 MB||1 GB||2.1 GB|
|Peak Query Memory||420 MB||2.1 GB||11 GB||21.1 GB|
|Concurrent User Query Memory||462 MB||4.2 GB||61 GB||231 GB|
|Base JVM Heap||1.91 GB||11.1 GB||90.5 GB||290 GB|
|JVM Heap Adjustment (GC avoidance)||191 MB||1.1 GB||9.1 GB||29 GB|
|Final Base JVM Heap Size||2.1 GB||12.2 GB||99.6 GB||319 GB|
|JVM Heap (member cache refresh support)||3.02 GB||16.9 GB||123 GB||365 GB|
|JVM Heap (intermediate cube, no direct access, no member refresh)||1.52 GB||9.22 GB||84 GB||289 GB|
|Hard Disk Space||1 GB||10 GB||50 GB||100 GB|
For more information on Dynamic Cubes see the IBM Cognos Dynamic Cubes Redbook at http://www.redbooks.ibm.com/abstracts/sg248064.html.