Milev, Aleksandar; Vasileva, Svetlana
July 2013
Journal Scientific & Applied Research;2013, Vol. 4, p66
Academic Journal
This paper presents an algorithm for two-phase locking (2PL) in which deadlocks of distributed transactions for distributed database management systems (DDBMS) are avoided. The method of timestamps is chosen for solving deadlocks and the centralized 2PL algorithm is implemented in DDBMS. The „wait - die" strategy of timestamps mechanism for deadlocks avoiding is presented in this paper. The simulation results of modeling "wait-die" algorithm are given by using GPSS World Personal Version for two and three elements length of distributed transaction.


Related Articles

  • IMPLEMENTATION OF A MODIFIED PUSHOUT MECHANISM IN ATM NETWORKS. Hristov, Valentin Panchev // Proceedings of the International Conference on Systems for Autom;2005, p90 

    The aim of this paper is to propose improved approach to PUSHOUT based on the analysis of various packet discard policies, and create a simulation model in GPSS (General Purpose Simulation System) in order to evaluate its data performance. It provides a step-by-step description of the design of...

  • Stationary characteristics of M/M/1 systems with hysteretic switching of the service intensity. Zhernovyi, Yu. // Journal of Communications Technology & Electronics;Jun2013, Vol. 58 Issue 6, p613 

    An M/M/1 queueing system with two-threshold hysteretic switching of the service intensity at the instants when the number of customers exceeds h and, then, decreases to the value h < h and the same system with the threshold locking of a flow of customers are considered. An algorithm is proposed...

  • An M/G/1 system with hysteretic switching of the service intensity. Zhernovyi, K.; Zhernovyi, Yu. // Journal of Communications Technology & Electronics;Jun2013, Vol. 58 Issue 6, p602 

    For an M/G/1 system, two-basic and post-threshold-service modes with distribution functions F( x) and $\tilde F$( x) of the service time are applied. The post-threshold mode starts functioning if, at instant t of the beginning of the current customer service, number ξ( t) of customers in the...

  • M/G/1/ m and M/G/1 queues with operating parameters depending on the queue length. Zhernovyi, K.; Zhernovyi, Yu. // Journal of Communications Technology & Electronics;Jun2014, Vol. 59 Issue 6, p605 

    M/G/1/ m and M/G/1 queues are considered in the case when the service time and input flow parameters depend on the queue length and are determined at the instants of completion of the service of customers. With the help of an approach based on the idea of Korolyuk's potential method, the Laplace...

  • The simplest models of queue control at nodes of packet-switched networks. Zhernovyi, Yu. // Journal of Communications Technology & Electronics;Dec2014, Vol. 59 Issue 12, p1475 

    Queueing systems simulating the operation of nodes of packet data transmission networks using probabilistic algorithms of packet dropping -namely, a single-channel system with a finite buffer and a multichannel system with an unlimited queue-are considered. An input flow is simulated with the...

  • Efficient modeling, simulation and coarse-graining of biological complexity with NFsim. Sneddon, Michael W.; Faeder, James R.; Emonet, Thierry // Nature Methods;Feb2011, Vol. 8 Issue 2, p177 

    Managing the overwhelming numbers of molecular states and interactions is a fundamental obstacle to building predictive models of biological systems. Here we introduce the Network-Free Stochastic Simulator (NFsim), a general-purpose modeling platform that overcomes the combinatorial nature of...

  • Minimizing makespan for a no-wait flowshop using genetic algorithm. CHAUDHRY, IMRAN; KHAN, ABDUL // Sadhana;Dec2012, Vol. 37 Issue 6, p695 

    This paper explains minimization of makespan or total completion time for n-jobs, m-machine, no-wait flowshop problem (NW-FSSP). A spread sheet based general purpose genetic algorithm is proposed for the NW-FSSP. The example analysis shows that the proposed approach produces results are...

  • Parallel Algorithm for Generation of Test Recommended Path using CUDA. Zhao Yu; Jae-Han Cho; Byoung-Woo Oh; Lee-Sub Lee // International Journal of Engineering Science & Technology;Feb/Mar2013, Vol. 5 Issue 1, p438 

    Software testing of an application makes the user to find defect. The users, called testers, should test the various situations with test cases. In order to make test cases, many states and events have to be considered. It takes much time to create test cases with many states and events. Instead...

  • Realizing the Benefits of Affordable Tflop-capable Hardware. Farber, Rob // Scientific Computing;May2010, Vol. 27 Issue 3, p21 

    The article discusses the benefits of teraflop-capable general-purpose computation graphics processing units (GPGPUs) on several organizations. It states that the GPGPU technology can increase the magnitude performance of various algorithms including Metropolis and Monte Carlo methods. It notes...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics