An Approach ForDesigning Distributed Real TimeDatabase
Dr. Dhuha Basheer AbdullahComputer Sciences Dept./Computers Sciences andMathematics College /Mosul UniversityMosul- IraqAmmar Thaher YaseenComputer Sciences Dept./Computers Sciences andMathematics College /Mosul UniversityMosul- Iraq
Abstract- A distributed Real Time database system is atransaction processing system that is designed to handleworkloads where transactions have service deadlines. Theemphasis here is on satisfying the timing constraint of transactions(meet these deadlines, that is to process transactions before theirdeadlines expire) and investigating the distributed databases. Thispaper produces a proposed system named ADRTDBS.In this work a prototype of client/server module andserver/server module for distributed real time database has beendesigned. Server gets the data from direct user or a group of clients connected with it, analyze the request; and broad updatingto all servers using 2PC (Two Phase Commit) and executing thedemand by using 2PL (Two Phase Locking). The proposed modeldoes not concern with data only, but provide a synchronizereplication, so the updating on any server is not saved unlessbroadening the updating on all servers by using 2PC, and 2PLprotocols. The database on this proposed system is homogenousand depend on full replication to satisfy real time requirements.The transactions have been scheduled on the server by using aproposed algorithm named EDTDF (Earliest Data or TransactionDeadline First). This algorithm works to execute transactions thathave smallest deadline at the beginning, either this deadlinespecific to the data or to the transaction itself. Implementing thisalgorithm helps to execute greater rate of transactions before theirdeadlines.In this work two measures of performance for this system(proposed model) were been conducted; first, computing the MissRatio (rate of no. of executing transactions that miss theirdeadline); second, computing the CPU utilization (CPU utilizationrate), by executing a set of transactions in many sessions.
Keywords: real time, databases, distributed, replication, Scheduling
I. INTRODUCTIONAccording to the definition provided by Coulouris,Dollimore & Kindberg , a distributed system consists of a setof autonomous processing elements that are connected via acommunication network and interact via message passing.A database is a structured set of data maintained by adatabase management system (DBMS) that interfaces with a setof applications or clients that access and modify the data. In adistributed database system, the data is distributed amongautonomous DBMS instances (nodes or sites) that communicatevia a network. The nodes, potentially along with a centralcoordinator, are collectively referred to as a distributeddatabase management system (DDBMS) [1,7,8,15].In a distributed database, replication of data objects(Theterm object is used for the unit of replication; this could just aswell be a table in a relational database as an object) is oftenused to improve fault tolerance and availability in the systemby maintaining several copies of data objects and placing thosecopies close to the clients that want to use them .In a real-time system (RTS), the value of a performed task depends not only on its functional correctness, but also on thetime at which it is produced. For example, when anautonomous vehicle detects an obstacle in its intended path, it iscrucial that it changes its path before a collision occurs. Real-time systems are often embedded, meaning that they are a partof (and interact heavily with) a physical environment.Typically, embedded systems use specific-purpose rather thangeneral-purpose computers, such as in the embedded systemcontrolling fuel injection in a car engine [6,20].It is paramount that real-time systems have predictable,bounded and sufficiently low requirements on resources such asmemory, network bandwidth and processor execution time,since failures due to unpredictable behavior and/or overconsumption of available resources may cause unacceptabledamage to humans or equipment. Real-time systems also needto be highly and predictably available, meaning that when arequest is made to the system, it can be guaranteed that thesystem is available to service that request within a predictableand bounded time.A distributed real-time system (DRTS) combinescharacteristics of distributed and real-time systems. This meansthat in such a system, issues related to distribution (such asexecution of distributed algorithms and network communication) must be addressed with real-time requirementsin mind.Real-time database systems (RTDBS) are often used tomanage data in real-time systems, since traditional databasescannot meet the timeliness and predictability requirements of aRTS. As many embedded applications with real-timerequirements are inherently distributed, RTDBS are oftendistributed over a set of autonomous nodes, creating a need fordistributed real-time database systems (DRTDBS) [10,14,16].
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 6, September 201078http://sites.google.com/site/ijcsis/ISSN 1947-5500