Performance of an OLTP application on symmetry multiprocessor system

  title={Performance of an OLTP application on symmetry multiprocessor system},
  author={Shreekant S. Thakkar and Mark Sweiger},
  booktitle={ISCA '90},
Sequent's Symmetry Series is a bus-based shared-memory multiprocessor. System performance in an OLTP relational database application was investigated using the TP1 benchmark. System performance was tested with fully-cached benchmarks and with scaled benchmarks. In fully-cached tests, the entire database fits inside main memory. In scaled tests, the database is larger than available memory. In the fully-cached benchmark, performance was initially limited by bus saturation. The cause was the… 

Figures from this paper

Improving the performance of OLTP workloads on SMP computer systems by limiting modified cache lines
A variety of experiments indicate that the original limiting queue (OLQ) is a simple, but effective, mechanism to enhance the performance of OLTP applications on SMP systems.
Memory System Performance of a Database in a Shared-memory Multiprocessor
Examining the memory performance of a multiprocessor emulation of Postgres95, a public-domain database, reveals a synchronization overhead equal to 29% of the time, which can be partially removed with ner-grained locks and a stall due to I/O system calls.
An analysis of database workload performance on simultaneous multithreaded processors
Examining database performance on SMT processors using traces of the Oracle database management system characterizes the memory-system behavior of database systems running on-line transaction processing and decision support system workloads and shows that SMT's latency tolerance is highly effective for database applications.
An analysis of database workload performance on simultaneous multithreaded processors
Examination of database performance on SMT processors using traces of the Oracle database management system shows that while DBMS workloads have large memory footprints, there is substantial data reuse in a small, cacheable "critical" working set.
Efficient Scheduling on Multiprogrammed Shared-Memory Multiprocessors
This thesis explores the problem of developing more sophisticated scheduling systems to avoid the performance problems raised by running parallel applications in a multiprogrammed environment and presents the design, implementation, and performance of a novel approach that offers high performance by combining the techniques of process control and processor partitioning.
Performance of database workloads on shared-memory systems with out-of-order processors
The results show that the combination of out-of-order execution and multiple instruction issue is effective in improving performance of database workloads, providing gains of 1.5 and 2.6 times over an in-order single-issue processor for OLTP and DSS, respectively.
Architectural Effects of Symmetric Multiprocessors on TPC-C Commercial Workload
The feasibility of using queuing network models with the support of simulation to study the SMP architectural impacts on the performance of commercial workloads on SMPs is investigated and it is complementary to the measurement-based experimental approaches.
Evaluating the Performance of Cache-Affinity Scheduling in Shared-Memory Multiprocessors
This paper explores affinity scheduling, a technique that helps reduce cache misses by preferentially scheduling a process on a processor where it has run recently, and shows that it is extremely simple to add to existing schedulers.
Main Memory Database TPC-H Workload Characterization on Modern Processor
The execution time breakdown of DRDB and MMDB is compared, and an optimize strategy to optimize the memory resident aggregate is proposed, and the difference between column-oriented and row-oriented storage models in CPU and cache utilization is explored.
Parallel Database Systems: New Issues
It is still an open issue to decide which of the various architectures among shared- memory, shared-disk, and shared-nothing, is best for database management under various conditions.


Synchronization algorithms for shared-memory multiprocessors
A performance evaluation of the Symmetry multiprocessor system revealed that the synchronization mechanism did not perform well for highly contested locks, like those found in certain parallel
Performance of Symmetry Multiprocessor System
The performance characteristics of three members of the Sequent Symmetry series of parallel processors, including Butterfly Network Simulator and Parallel Linpack, are presented.
Cache coherence protocols: evaluation using a multiprocessor simulation model
The magnitude of the potential performance difference between the various approaches indicates that the choice of coherence solution is very important in the design of an efficient shared-bus multiprocessor, since it may limit the number of processors in the system.
A measure of transaction processing power
These benchmarks measure the performance of diverse transaction processing systems and a standard system cost measure is stated and used to define price/performance metrics.
The Symmetry Multiprocessor System
An Analysis of Synchronization Algorithms for Shared-Memory Multiprocessors
  • IEEE Cornqm,
  • 1990
A low-overhead coherence solution for multiprocessors with private cache memories
This paper presents a cache coherence solution for multiprocessors organized around a single time-shared bus. The solution aims at reducing bus traffic and hence bus wait time. This in turn increases