Top Journal

International Journal of Architectural, Civil and Construction Sciences International Journal of Biological, Life and Agricultural Sciences International Journal of Chemical, Materials and Biomolecular Sciences International Journal of Business, Human and Social Sciences International Journal of Earth, Energy and Environmental Sciences International Journal of Electrical, Electronic and Communication Sciences International Journal of Engineering, Mathematical and Physical Sciences International Journal of Medical, Medicine and Health Sciences International Journal of Mechanical, Industrial and Aerospace Sciences International Journal of Information, Control and Computer Sciences

SUGGEST A JOURNAL

Join Scholarly today, and help us improve Open Access Journal database.

+ Sign Up

Advanced Search

Ensuring Consistency under the Snapshot Isolation

Year: 2014 Volume: 8 Issue: 7 1150 - 1156 Pages

Abstract: By running transactions under the SNAPSHOT isolation we can achieve a good level of concurrency, specially in databases with high-intensive read workloads. However, SNAPSHOT is not immune to all the problems that arise from competing transactions and therefore no serialization warranty exists. We propose in this paper a technique to obtain data consistency with SNAPSHOT by using some special triggers that we named DAEMON TRIGGERS. Besides keeping the benefits of the SNAPSHOT isolation, the technique is specially useful for those database systems that do not have an isolation level that ensures serializability, like Firebird and Oracle. We describe all the anomalies that might arise when using the SNAPSHOT isolation and show how to preclude them with DAEMON TRIGGERS. Based on the methodology presented here, it is also proposed the creation of a new isolation level: DAEMON SNAPSHOT.

A Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists

Year: 2009 Volume: 3 Issue: 11 1058 - 1067 Pages

Abstract: In this paper, we consider the problem of Popular Matching of strictly ordered preference lists. A Popular Matching is not guaranteed to exist in any network. We propose an IDbased, constant space, self-stabilizing algorithm that converges to a Maximum Popular Matching an optimum solution, if one exist. We show that the algorithm stabilizes in O(n5) moves under any scheduler (daemon).

Daemon- Based Distributed Deadlock Detection and Resolution

Year: 2010 Volume: 4 Issue: 3 596 - 601 Pages

Abstract: detecting the deadlock is one of the important problems in distributed systems and different solutions have been proposed for it. Among the many deadlock detection algorithms, Edge-chasing has been the most widely used. In Edge-chasing algorithm, a special message called probe is made and sent along dependency edges. When the initiator of a probe receives the probe back the existence of a deadlock is revealed. But these algorithms are not problem-free. One of the problems associated with them is that they cannot detect some deadlocks and they even identify false deadlocks. A key point not mentioned in the literature is that when the process is waiting to obtain the required resources and its execution has been blocked, how it can actually respond to probe messages in the system. Also the question of 'which process should be victimized in order to achieve a better performance when multiple cycles exist within one single process in the system' has received little attention. In this paper, one of the basic concepts of the operating system - daemon - will be used to solve the problems mentioned. The proposed Algorithm becomes engaged in sending probe messages to the mandatory daemons and collects enough information to effectively identify and resolve multi-cycle deadlocks in distributed systems.