TATP Benchmark

The Telecommunication Application Transaction Processing Benchmark (TATP) is a benchmark designed to measure performance of in-memory database transaction systems.

As database and microprocessor architectures change, so must the benchmarks that are employed to measure the combined performance of these critical components. While other industry standard throughput workloads already exist, none was designed specifically to exercise the relationship between in-memory database software and the memory processing subsystem in which it transacts. The Telecommunication Application Transaction Processing (TATP) Benchmark is a new open source workload designed specifically for high-throughout applications, well suited for in-memory database performance analysis and system comparison.

The TATP benchmark simulates a typical Home Location Register (HLR) database used by a mobile carrier. The HLR is an application mobile network operators use to store all relevant information about valid subscribers, including the mobile phone number, the services to which they have subscribed, access privileges, and the current location of the subscriber's handset. Every call to and from a mobile phone involves look ups against the HLRs of both parties, making it is a perfect example of a demanding, high-throughput environment where the workloads are pertinent to all applications requiring extreme speed: telecommunications, financial services, gaming, event processing and alerting, reservation systems, software as a service (SaaS), and so on.

The benchmark generates a flooding load on a database server. This means that the load is generated up to the maximum throughput point that the server can sustain. The load is generated by issuing pre-defined transactions run against a specified target database. The target database schema is made to resemble a typical HLR database in a mobile phone network. The algorithm of what is known as the TATP Benchmark was originally published in a Master's Thesis.[1] The benchmark was modeled after a real test program that was used by a telecom equipment manufacturer to evaluate the applicability of various relational database systems to service control programming in mobile networks. Another derivative of the original test is the Network Database Benchmark.[2] TATP executes seven pre-defined transactions that insert, update, delete and query the data in the database. The TATP results show Mean Qualified Throughput (MQTh) of the target database system, and the response time distributions per transaction types for all seven types of transactions.

The TATP benchmark has been used in industry[3] and research.[4][5][6][7][8]

References
  1. Toni Strandell: "Open Source Database Systems: Systems study, Performance and Scalability". Master's Thesis, University of Helsinki, Department of Computer Science, May 2003, 54 p, at: http://ethesis.helsinki.fi/julkaisut/mat/tieto/pg/strandell/
  2. "Network Database Benchmark", an open-source project, at: http://sourceforge.net/projects/ndbb/
  3. Intel and IBM Collaborate to Double In-Memory Database Performance, Intel 2009 http://communities.intel.com/docs/DOC-2985
  4. Ippokratis Pandis, Ryan Johnson, Nikos Hardavellas, Anastasia Ailamaki: Data-Oriented Transaction Execution. PVLDB, 3(1), 2010.
  5. Ru Fang, Hui-I Hsiao, Bin He, C. Mohan , Yun Wang: A Novel Design of Database Logging System using Storage Class Memory. Proc. International Conference on Data Engineering (ICDE 2011), Hannover, Germany April 11–16, 2011.
  6. Kishore Kumar Pusukuri, Rajiv Gupta, Laxmi N. Bhuyan: No More Backstabbing... A Faithful Scheduling Policy for Multithreaded Programs. Proc. Parallel Architectures and Compilation Techniques (PACT 2011), Galveston Island, Texas, USA, October 10–14, 2011.
  7. Ryan Johnson, Ippokratis Pandis, Radu Stoica, Manos Athanassoulis, Anastasia Ailamaki: Scalability of write-ahead logging on multicore and multisocket hardware. VLDB Journal 21(2), 2011: 239-263.
  8. Per-Ã…ke Larson, Spyros Blanas, Cristian Diaconu, Craig Freedman, Jignesh M. Patel, Mike Zwilling: High-Performance Concurrency Control Mechanisms for Main-Memory Databases. Proc. VLDB 2012 Conference, Istambul, Turkey, Aug. 28-30, 2012, pp. 298-309.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.