Performance analysis of the send-on-demand: A distributed database concurrency control protocol for high-speed networks

Banerjee, Sujata; Li, Victor Ok; Wang, Chihping

doi:10.1016/0140-3664(94)90005-1

Cited by 7 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this restricts all requests to having the same exponentially distributed service time. More generally, some studies modeled the local databases as M/G/1/FCFS [15] and M/G/1/RR [16] queues with generally distributed service time. However, most of these models are based on the homogeneity assumption where all database sites and their respective workload are identical [8].…”

Section: Related Work On Performance Modeling and Analysismentioning

confidence: 99%

Modeling and analysis of a multilevel caching in distributed database systems

Zanfaly¹,

Ammar

Eldin³

2004

Proceedings. ISCC 2004. Ninth International Symposium on Computers and Communications (IEEE Cat. No.04TH8769)

View full text Add to dashboard Cite

-Caching frequently asked queries is an effective way to improve the performance of both centralized and distributed database systems. Intensive works have been done in this area to propose different query caching techniques and to evaluate their performance. However, most of these works were confined to caching previous query results in a single-level caching architecture. Evaluations of these works were based on simulations. In [1], we proposed a new query caching technique for caching both query results and execution plans in a multi-level caching architecture. The centralized version of this technique was evaluated and the results were reported in [2]. In this paper, we present an analytical model to evaluate the performance of the proposed technique in distributed database systems.

show abstract

Section: Related Work On Performance Modeling and Analysismentioning

confidence: 99%

Modeling and analysis of a multilevel caching in distributed database systems

Zanfaly¹,

Ammar

Eldin³

2004

Proceedings. ISCC 2004. Ninth International Symposium on Computers and Communications (IEEE Cat. No.04TH8769)

View full text Add to dashboard Cite

show abstract

“…Most authors also assume uniformly distributed data access, i.e. each data item is accessed with equal probability [14,28,10,5,23,18,29,21,20,3]. Non-uniform data access is more realistic but modeled in very few analytical studies [31,16].…”

Section: General Modeling Concepts and Communicationmentioning

confidence: 99%

“…However, this still restricts all transactions to have the same exponentially distributed service times. More general, [5,16] model the local databases as M/G/1 queues with arbitrarily distributed service times, while [13,20] use networks of M/H 2 /1 systems with 2-phase hyper-exponentially distributed service times to assign different exponentially distributed service times to read-only transactions and updates. Nevertheless, such models do not allow to evaluate realworld systems with more than two transaction types.…”

Section: General Modeling Concepts and Communicationmentioning

confidence: 99%

Increasing the Expressiveness of Analytical Performance Models for Replicated Databases

Nicola

Jarke

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The vast number of design options in replicated databases requires efficient analytical performance evaluations so that the considerable overhead of simulations or measurements can be focused on a few promising options. A review of existing analytical models in terms of their modeling assumptions, replication schemata considered, and network properties captured, shows that data replication and intersite communication as well as workload patterns should be modeled more accurately. Based on this analysis, we define a new modeling approach named 2RC (2-dimensional replication model with integrated communication). We derive a complete analytical queueing model for 2RC and demonstrate that it is of higher expressiveness than existing models. 2RC also yields a novel bottleneck analysis and permits to evaluate the trade-off between throughput and availability.

show abstract

“…The studies in [37,38,73,103] [13], and using an M/G/l/RR queueing model in [138]. Constant ex ecution demands for the lock request are used in [20] to analyze the distributed database at the level of lock requests.…”

Section: Modeling Replication In Queueing Networkmentioning

confidence: 99%

“…13 shows a PDF for the delay of thread 1, that executes activity a1 inFigure 5.11, with y l = 2, C x i = 15. y2 = 2, Cx2 = 5, and with geoemtric requests. The PDFs are obtained from the simulation run, and from fitting the delay to the closed-form Reproduced with permission of the copyright owner.…”

mentioning

confidence: 99%

Performance modeling of replication techniques in parallel and distributed layered service architectures

Al-Omari¹

View full text Add to dashboard Cite

Replication is a technique that maintains and allows access to copies of data and ser vices on multiple servers. It is usually used in multi-tier architecture systems, as found in distributed software systems, to increase performance, reliability, and availability.The growing complexity of modern software systems, especially very large distributed systems, increases the difficulty of achieving performance objectives. A designer needs a high-level analytic tool to consistently compare the performance patterns of different replication techniques for a very large multi-tier replicated system. Analytic tools enable the designer to rapidly compute the relevant performance measures at an early stage of the design. This enables the designer to gain a competitive advantage by delivering his product in time, and at a lower cost.The Layered Queueing Network (LQN) is the formalism selected in this thesis, as it is designed for performance modeling of software and hardware systems with a multi-tier (layered) architecture. The Layered Queueing Network Solver (LQNS) is an analytic tool used for performance analysis. This thesis describes new analytic algorithms implemented in the LQNS to compute relevant performance measures for parallel and distributed sys tems with replication. The contributions of the thesis are as follows. First, replication performance patterns are identified and classified. Second, a general quorum pattern is in corporated in the LQN formalism to model and compute the performance measures of a replication model with a quorum consensus protocol. Third, the accuracy of the LQNS is improved by introducing new closed-form formulas for the thread delay distribution. The iii Reproduced with permission of the copyright owner. Further reproduction prohibited without permission.ABSTRACT iv distribution is used to compute the service time of a client when the client has a quorum pattern. Finally, algorithms that exploit the symmetry in a system with replicated com ponents are designed and implemented to hasten model solution time. Those replication components can contain internal parallelism.The results of this research are used to study the performance of an Air Traffic Control system and an Industrial Information Management system. The LQNS solutions for these large systems are rapid, and the accuracy of the solutions is adequate for most purposes during the early stage of system modeling.Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. DedicationI dedicate this thesis to my parents. VReproduced with permission of the copyright owner. Further reproduction prohibited without permission.

show abstract

Performance analysis of the send-on-demand: A distributed database concurrency control protocol for high-speed networks

Cited by 7 publications

References 18 publications

Modeling and analysis of a multilevel caching in distributed database systems

Modeling and analysis of a multilevel caching in distributed database systems

Increasing the Expressiveness of Analytical Performance Models for Replicated Databases

Performance modeling of replication techniques in parallel and distributed layered service architectures

Contact Info

Product

Resources

About