| A modeling study of the TPC-C benchmark |
| Full text |
Pdf
(1.13 MB)
|
| Source
|
International Conference on Management of Data
archive
Proceedings of the 1993 ACM SIGMOD international conference on Management of data
table of contents
Washington, D.C., United States
Pages: 22 - 31
Year of Publication: 1993
ISBN:0-89791-592-5
Also published in ...
|
|
Authors
|
|
Scott T. Leutenegger
|
ICASE: Institute for Computer Applications in Science and Engineering, Mail Stop 132c, NASA Langley Research Center, Hampton, VA
|
|
Daniel Dias
|
IBM Research Division, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 12, Downloads (12 Months): 101, Citation Count: 15
|
|
|
ABSTRACT
The TPC-C benchmark is a new benchmark approved by the TPC council intended for comparing database platforms running a medium complexity transaction processing workload. Some key aspects in which this new benchmark differs from the TPC-A benchmark are in having several transaction types, some of which are more complex than that in TPC-A, and in having data access skew. In this paper we present results from a modelling study of the TPC-C benchmark for both single node and distributed database management systems. We simulate the TPC-C workload to determine expected buffer miss rates assuming an LRU buffer management policy. These miss rates are then used as inputs to a throughput model. From these models we show the following: (i) We quantify the data access skew as specified in the benchmark and show what fraction of the accesses go to what fraction of the data. (ii) We quantify the resulting buffer hit ratios for each relation as a function of buffer size. (iii) We show that close to linear scale-up (about 3% from the ideal) can be achieved in a distributed system, assuming replication of a read-only table. (iv) We examine the effect of packing hot tuples into pages and show that significant price/performance benefit can be thus achieved. (v) Finally, by coupling the buffer simulations with the throughput model, we examine typical disk/memory configurations that maximize the overall price/performance.
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
|
|
| |
4
|
Dan, A., Yu, P.S, and Chung, J.Y., "Characterization of Database Access Skew of a Transaction Processing Environment,", IBM Research Report RC 17436, 1991.
|
| |
5
|
|
| |
6
|
|
| |
7
|
Kohler, W., Shah, A., Raab, F., "Overview of TPC Benchmark C: The Order-Entry Benchmark," technical report, Transaction Processing Performance Council, December 23, 1991.
|
| |
8
|
Leutenegger, S., Dias, D., "A Modeling Study of the TPC-C Benchmark," ICASE Report, number 93-12.
|
| |
9
|
Leutenneger, S., and Dias, D., "A Modeling Study of the TPC-C Benchmark," IBM Technical Report (in preparation).
|
| |
10
|
McNutt, B., "DASD Configuration Planning: Three Simple Checks", CMG Conference Proceedings, 1988.
|
| |
11
|
Transaction Processing Performance Council, "TPC Benchmark C, Standard Specification, Revision 1.0", Edited by Francois Raab, August 13, 1992.
|
CITED BY 15
|
|
|
|
|
Gerolf Hoflehner , Knud Kirkegaard , Rod Skinner , Daniel Lavery , Yong-fong Lee , Wei Li, Compiler Optimizations for Transaction Processing Workloads on Itanium® Linux Systems, Proceedings of the 37th annual IEEE/ACM International Symposium on Microarchitecture, p.294-303, December 04-08, 2004, Portland, Oregon
|
|
|
|
|
|
|
|
|
Xiaoyi Xu , Patrick Martin , Wendy Powley, Configuring buffer pools in DB2 UDB, Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research, p.13, September 30-October 03, 2002, Toronto, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|