Shared Memory Contention and Its Impact on Multi-processor Call Control Throughput

Authors:
T. Drwiega
Affiliations:
-
Venue:
Performance Engineering, State of the Art and Current Trends
Year:
2001

Citing 4
Cited 0

A mean value performance model for locking in databases: the no-waiting case

Journal of the ACM (JACM)
Performance Evaluation of Centralized Databases with Static Locking

IEEE Transactions on Software Engineering
Two-phase locking performance and its thrashing behavior

ACM Transactions on Database Systems (TODS)
On a More Realistic Lock Contention Model and Its Analysis

Proceedings of the Tenth International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Shared-Memory Multi-Processor Call Control (SMMPCC) is described when the executing transactions contend for access to shared memory addresses. First, memory contention is characterized, then the system throughput is modelled analytically. Based on the model, bounds for the throughput are found. Also shown are how the throughput depends on the number of processors, contention level and on how far into transaction execution a contention on memory access happens.