On multisystem coupling through function request shipping
IEEE Transactions on Software Engineering
Integrated Concurrency-Coherency Controls for Multisystem Data Sharing
IEEE Transactions on Software Engineering
Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Analytical modelling of a hierarchical buffer for a data sharing environment
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment
IEEE Transactions on Software Engineering
On Workload Characterization of Relational Database Environments
IEEE Transactions on Software Engineering
Performance analysis of data sharing environments
Performance analysis of data sharing environments
On the analytical modeling of database concurrency control
Journal of the ACM (JACM)
VAXcluster: a closely-coupled distributed system
ACM Transactions on Computer Systems (TOCS)
Prototyping Bubba, A Highly Parallel Database System
IEEE Transactions on Knowledge and Data Engineering
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment
IEEE Transactions on Parallel and Distributed Systems
An Analysis of Three Transaction Processing Architectures
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
The Effect of Skewed Data Access on Buffer Hits and Data Contention an a Data Sharing Environment
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Asymptotic performance of a buffer model in a data sharing environment
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
IEEE Transactions on Computers
Recovery protocols for shared memory database systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Recovery Analysis of Data Sharing Systems under Deferred Dirty Page Propagation Policies
IEEE Transactions on Parallel and Distributed Systems
Cluster architectures and S/390 Parallel Sysplex scalability
IBM Systems Journal
Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture
IEEE Transactions on Knowledge and Data Engineering
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Dynamic Affinity Cluster Allocation in a Shared Disks Cluster
The Journal of Supercomputing
Transaction routing in real-time shared disks clusters
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Priority conscious transaction routing in a real-time shared disks cluster
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Feasibility and performance study of a shared disks cluster for real-time processing
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
| Hi-index | 0.00 |
As the demand for high volume transaction processing grows, coupling multiple computing nodes becomes increasingly attractive. This paper presents a comparison on the resilience of the performance to system dynamics of three architectures for transaction processing. In the shared nothing (SN) architecture, neither disks nor memory is shared. In the shared disk (SD) architecture, all disks are accessible to all nodes while in the shared intermediate memory (SIM) architecture, a shared intermediate level of memory is introduced. A transaction processing system needs to be configured with enough capacity to cope with the dynamic variation of load or with a node failure. Three specific scenarios are considered: 1) a sudden surge in load of one transaction class, 2) varying transaction rates for all transaction classes, and 3) failure of a single processing node. We find that the different architectures require different amounts of capacity to be reserved to cope with these dynamic situations. We further show that the data sharingarchitecture, especially in the case with shared intermediate memory, is more resilient tosystem dynamics and requires far less contingency capacity compared to the SNarchitecture.