Applying Attribute Level Locking to Decrease the Deadlock on Distributed Database
|
|
- Jennifer Jones
- 8 years ago
- Views:
Transcription
1 Applying Attribute Level Locking to Decrease the Deadlock on Distributed Database Dr. Khaled S. Maabreh* and Prof. Dr. Alaa Al-Hamami** * Faculty of Science and Information Technology, Zarqa University, Al Zarqa - Jordan kmaabreh@zpu.edu.jo ** Graduate College of Computer Studies, Amman Arab University, Amman Alaa-hamami@yahoo.com ABSTRACT In a distributed database, a transaction consists of several participants' or agents to execute over all sites; all participants must guarantee that any change to data will be permanent in order to commit the transaction. If any of participants fails to make this guarantee, the entire transaction fails and aborts. There are many approaches according to where the lock management is performed. One of them is the centralized locking, where one site is responsible for granting locks, because it s the only site that has a lock manager. This research applying a new method for reducing the size of lockable entities, it is possible to do that by increasing the granularity hierarchy tree one more down at the attributes, to allow several transactions to access the same raw simultaneously. The experimental results proved that, using Attribute locking will decrease the competition for acquiring the data and increases the concurrency control for the Distributed Database. Keywords: Distributed Database, Locking, Deadlocks, Concurrency Control, Performance. INTRODUCTION A distributed transaction is a set of operations, in which two or more network hosts are involved [, ]. Each host or computer has a local transaction manager responsible for interacting with other transaction managers via either a superior or subordinate relationship, in case of a transaction does work at multiple computers [,,, 8, 9]. When a transaction needs to lock a data item, it sends a request to the central site, whose determines if the lock can be granted, if so, it sends a message to the originated site, else it will wait. In case of read operations, the transaction perform its action from any site who has a copy of the required data item, whereas in a write case, all sites owning a copy must participate in this action [, ]. The simplicity in implementation and simplicity in deadlock handling are two factors considered in choosing the central locking approach, because we have not real data and not concerned with designing real distributed database system; rather we are concerned with measuring the attribute locking approach against system performance. The rest of the paper is organized as follows: Section states the problem with using row locking as a minimum lockable unit. Section states the proof of concepts, section presents the enhanced algorithm for field locking approach, experiments are drawn in section, analysis and conclusion are drawn in section.. THE PROBLEM The problem is due to the incremental number of users to database, and the competition for acquire a data items becomes very high []. This research aims to increase the granularity hierarchy tree [, ] one more down, to include the attribute, i.e. locking will be done at the attribute to allow several transactions to access the same row simultaneously. The suggested is expected to decrease the user competition for acquiring data items and to increase the performance of the database. However, this will increase the overhead on the database.. THE PROPOSED SOLUTION The proof of the enhanced procedure will be given by building a discrete events simulation program to generate transactions randomly, after building the hierarchy tree representing the database with new added (attributes), and by building a database lock manager [, ] responsible for coordination transactions execution, the program was built by using Java technology. Data will be gathered to measure system performance, system throughput, and locking overhead [, ], the proposed procedure will executes against the database row as the minimum lockable database unit, then it will executes to reflect the new added, comparing between two results
2 will be drawn. The proposed procedure is expected to increase the concurrency, reduce the deadlock problem occurrences [], and increase performance and system throughput. The simulation parameters (table ) will be used to generate multiple snapshots during progresses of a database, these parameters will be vary for each run in order to show the system behavior. The following assumptions are also considered: The time needed for setting and releasing locks is assumed to be ms. Input output time needed for each operation is assumed to be ms. needed to complete data processing is randomly selected between to ms. Communication delay is assumed to be negligible, because the communication performance is not considered to be measured here. Parameter num-table min-numtuples max-numtuples min-col max-col min-trans-size max-trans-size num_trans queue-len db-number num-sites Table. (Simulation parameters) Description Number of tables in a database Minimum number of tuples in each row Maximum number of tuples in each table Minimum number of columns in each table Maximum number of columns in each table Minimum transaction size (number of operations) Maximum transaction size (number of operations) Number of transactions in the system Maximum queue length Number of databases for each site Number of sites Value, Up to Read and writes sets in a transaction, are assumed to be equals, because of simplifying the analysis and we did not have an actual data that could serve as an indication of what would be realistic distribution of the size of the read or write sets.. THE ENHANCED ALGORITHM DESCRIPTION FOR LOCKING ATTRIBUTES The locking could be obtained on the entire database, entire table, page, row or attribute according to compatibility matrix for granularity hierarchy table. The transaction can lock a node in top-down order and unlock in bottom-up order by using the rules mentioned in [] in addition to:. The database row is considered as a node, and can be locked in an intention modes (IS or IX).. The key of the row must be locked in a Shared (S) mode, when the transaction does not need the whole row.. The locking of attributes as database nodes must be done according to database constraints.. Other attributes can be locked in S or X mode. When a conflict occurs, or when the transaction needs to read or update the whole row, it's locked as in row locking. Table. (Compatibility matrix) IS IX S SIX X IS T T T T F IX T T F F F S T F T F F SIX T F F F F X F F F F F The abbreviations S, X, IS, IX and SIX are stated for: shared locks (Read), exclusive locks (Write), intentionshared (i.e. explicit locking is being done at lower of the tree with shared mode locks), intention-exclusive (i.e. the explicit locking will be used at a lower of the tree with exclusive mode or shared-mode locks) and shared with intention-exclusive (i.e. the sub tree rooted by that node is locked explicitly in shared mode and explicit locking is being done at lower with exclusive-mode) respectively [, ]. Databases are assumed to be well normalized and have a set of assertions to satisfy its correct state [, ], for example, if a database has associates with such assertion (Z=X+Y). So, these items must locked together when using attribute locking, this is the responsibility of a database lock manager to
3 accomplish this task, in this example case, the transaction must lock both X and Y when it needs to lock Z.. EXPERIMENTAL WORK. PERFORMANCE EVALUATION OF ROW LEVEL LOCKING The results shown in table are presented to appear the behavior of the system during runs, (times are measured in seconds), we can see that, the system begin thrashes when the number of transactions entering the system becomes or higher Figure, which means that, the system does not complete all transactions entering the system, (i.e. the competition among transactions as well as the probability of conflict becomes high Number of Transactions Table. (Results of runs of simulation at row locking) Completed Transactions Simulation Mean Service Mean Waiting Mean Number of Operations Mean Number of locks Arrival rate System Begin Thrashes WorkLoad (Number of transactions) 8 9 Figure. (System at row locking) Mean service time and mean waiting time Figure, are increased when the number of transactions entering the system increased, Figure shows the mean number of locks needed by transactions at row locking. Mean Number of Locks 8 9 System oerformance 8 Workload (Number of Transactions) 9 Figure. (System performance at row locking) 8 9 Locking Overhead Mean Waiting Mean Service 8 9 Figure. (System locking overhead at row locking). Performance evaluation of field locking After modifying the hierarchy tree by adding the attributes to be locked, simulation is executes times on different workloads to show the system behavior, the results are presented in table. The new system (alternative two) executes up to 9 transactions successfully without deadlock, when the number of transactions becomes or higher, the system begin thrashes as shown in figure. The important thing is that, transactions are completed
4 successfully on alternative two (at field locking), while there are two transactions were deadlocked, when using the row as minimum lockable unit. Number of Transactions Table. (Results of runs of simulation at field locking) Completed Transactions Simulation Mean Service Mean Waiting Mean Number of Operations System Mean Number of locks Begin Thrashes WorkLoad (Number of transactions) Arrival rate 8 9 Figure. (System throughput at field locking) Mean service time and mean waiting time on alternative two, becomes less than those produced when using alternative one, figure shows this behavior, because the transaction does not need to waits for long time to get its lock. But unfortunately, the mean number of locks is increased figure. Mean Number of Locks System oerformance Workload (Number of Transactions) Mean Waiting Mean Service Figure. (System performance at row locking) 8 9 Locking Overhead 8 9 Figure. (System locking overhead at row locking). Comparing the two alternatives Table, shows mean service time, mean waiting time, throughput and the mean number of locks for the two alternatives, in order to compare between them. Number of Transactions Table. ( locking versus field locking performance) R o w l e v e l l o c k i n g Mean Service Mean Waiting Mean Number of Locks F i e l d l e v e l l o c k i n g Mean Service Mean Waiting Mean Number of locks
5 VS mean waiting time VS Begin Thrashes 8 9 Figure. ( for two alternatives) 8 9 Mean number of locks Workload (number of transactions) 8 9 Figure 9. (Mean waiting time for two alternatives) 8 9 VS locking overhead 8 9 Figure. (Locking overhead for two alternatives) The throughput for field locking is higher than for row locking as shown in figure, because the competitions among transactions becomes less due to increasing in a database size. Alternative one (row locking) becomes thrashes before alternative two (field locking). At the same time, the mean service time and mean waiting time in alternative two becomes less in general figures 8 and 9, because transactions can proceed immediately when no conflicts occur. The locking over head figure, increased because at field locking approach, the lock manager needs extra work to manage the locks needed. VS mean service time Figure 8. (Mean service time for two alternatives). CONCLUSION Simulation is implemented to prove the idea of obtaining a lock at attributes on a distributed database. The discussion presented in sections. through., shows that the system at field locking behave more better than at row locking, because multiple transactions can proceed at the same database row simultaneously, which decreases the mean service time as well as the mean waiting time, because transactions does not need to wait for a long time to get their locks, which increases the availability of data. Also alternative two executes more transactions than alternative one at a time unit before thrashing occurs, which means that, the deadlock occurrences becomes less.
6 REFERENCES. Bernstein P. A., Hadzilacos V., and Goodman N. "Concurrency Control and Recovery in Database Systems", Addison-Wesley, 98.. Bernstein P. and Newcomer E., "Principles of Transaction Processing for the Systems Professional", Bentham Press,.. Chandy K. M., Misra J. and Hass L.M., "Distributed Deadlock detection", ACM Transactions on Computer Systems, Vol., No., 98.. Coffman, E.G., Elphick M. J., and Shoshani A., "System Deadlocks", ACM Computing Surveys, Vol., No., PP: 8, 9.. Eswaran K. P., Gray J. N., Lorie R. A. and Traiger I. L., "The Notions of Consistency and Predicate Locks in a Database System", ACM archive, New York, Volume 9, Issue, 9.. Elmasri R. and Navathe S.B. "Fundamentals of Database Systems", th edition, Pearson Addison Wesley (Boston),.. Gary J. N., Lorie R. A., Putzolu G. R. and Traiger I. L., "Granularity of Locks and Degrees of Consistency in a Shared Data Base" In IFIP Working Conference on Modelling in Data Base Management Systems, pages --9, Ling Y., Chen S. and Chiang C.J., "On Optimal Deadlock Detection Scheduling", IEEE Transactions on Database, Vol., Issue: 9, PP: 8 8,. 9. MSDN (Microsoft Developer Network): Accessed on 9//8.. Ozsu M. T. and Valduriez P., "Principles of distributed database systems", nd edition, Prentice-Hall, Inc, New jersey99.. Silberschatz A., Korth H.F. and Sudarshan S. "Database System Concepts", th edition, McGraw-Hill, New York,.. Sinha M. K. " Constraints: consistency and integrity", ACM SIGMOD, Volume, Issue, New York, 98.. Weikum G. and Vossen G., "Transactional Information Systems, Theory, Algorithms and the Practice of Concurrency Control and recovery", Morgan Kaufman Publishers,. action_processing. Accessed on 9//8.. Wu H., Chin W. and Jaffar J., "An efficient distributed deadlock avoidance algorithm for the AND model", IEEE Transactions on Volume 8, Issue, PP: 8 9, Jan.. Yeung C., Hung S. and Lam K., "Performance evaluation of a new distributed deadlock detection algorithm", ACM SIGMOD, Volume, Issue, 99.. Wikipedia Encyclopedia:
Implementing New Approach for Enhancing Performance and Throughput in a Distributed Database
290 The International Arab Journal of Information Technology, Vol. 10, No. 3, May 2013 Implementing New Approach for Enhancing Performance and in a Distributed Database Khaled Maabreh 1 and Alaa Al-Hamami
More informationUdai Shankar 2 Deptt. of Computer Sc. & Engineering Madan Mohan Malaviya Engineering College, Gorakhpur, India
A Protocol for Concurrency Control in Real-Time Replicated Databases System Ashish Srivastava 1 College, Gorakhpur. India Udai Shankar 2 College, Gorakhpur, India Sanjay Kumar Tiwari 3 College, Gorakhpur,
More informationRoadmap. 15-721 DB Sys. Design & Impl. Detailed Roadmap. Paper. Transactions - dfn. Reminders: Locking and Consistency
15-721 DB Sys. Design & Impl. Locking and Consistency Christos Faloutsos www.cs.cmu.edu/~christos Roadmap 1) Roots: System R and Ingres 2) Implementation: buffering, indexing, q-opt 3) Transactions: locking,
More informationConcurrency Control. Chapter 17. Comp 521 Files and Databases Fall 2010 1
Concurrency Control Chapter 17 Comp 521 Files and Databases Fall 2010 1 Conflict Serializable Schedules Recall conflicts (WR, RW, WW) were the cause of sequential inconsistency Two schedules are conflict
More informationFragmentation and Data Allocation in the Distributed Environments
Annals of the University of Craiova, Mathematics and Computer Science Series Volume 38(3), 2011, Pages 76 83 ISSN: 1223-6934, Online 2246-9958 Fragmentation and Data Allocation in the Distributed Environments
More informationOptimizing Concurrent Processing of Write-then-Read Transactions
Optimizing Concurrent Processing of Write-then-Read Transactions c Alexander Kalinin Institute for System Programming of the Russian Academy of Sciences allex.kalinin@gmail.com Abstract Write-then-read
More informationPerformance evaluation of Web Information Retrieval Systems and its application to e-business
Performance evaluation of Web Information Retrieval Systems and its application to e-business Fidel Cacheda, Angel Viña Departament of Information and Comunications Technologies Facultad de Informática,
More informationTECHNIQUES FOR DATA REPLICATION ON DISTRIBUTED DATABASES
Constantin Brâncuşi University of Târgu Jiu ENGINEERING FACULTY SCIENTIFIC CONFERENCE 13 th edition with international participation November 07-08, 2008 Târgu Jiu TECHNIQUES FOR DATA REPLICATION ON DISTRIBUTED
More informationIT2304: Database Systems 1 (DBS 1)
: Database Systems 1 (DBS 1) (Compulsory) 1. OUTLINE OF SYLLABUS Topic Minimum number of hours Introduction to DBMS 07 Relational Data Model 03 Data manipulation using Relational Algebra 06 Data manipulation
More informationCity University of Hong Kong. Information on a Course offered by Department of Computer Science with effect from Semester A in 2014 / 2015
City University of Hong Kong Information on a Course offered by Department of Computer Science with effect from Semester A in 2014 / 2015 Part I Course Title: Database Systems Course Code: CS3402 Course
More informationLocality Based Protocol for MultiWriter Replication systems
Locality Based Protocol for MultiWriter Replication systems Lei Gao Department of Computer Science The University of Texas at Austin lgao@cs.utexas.edu One of the challenging problems in building replication
More informationConsistency Management for Multiple Perspective Software Development
Consistency Management for Multiple Perspective Software Development Wai Leung Poon Anthony Finkelstein Dept. of Computing, Dept. of Computer Science, Imperial College, City University, 180 Queen's Gate,
More informationPost-Intrusion Recovery Using Data Dependency Approach
T3A3 4:20 Proceedings of the 2001 IEEE Workshop on Information Assurance and Security United States Military Academy, West Point, NY, 5-6 June, 2001 Post-Intrusion Recovery Using Data Dependency Approach
More informationGRANULARITY OF LOCKS IN A SHARED DATA BASE. IBM Research Laboratory San Jose, California 95193
428 GRANULARITY OF LOCKS IN A SHARED DATA BASE by J.N. R.A. G.R. Gray Lorie Putzolu IBM Research Laboratory San Jose, California 95193 Abstract: This paper proposes a locking protocol which associates
More informationA Novel Cloud Computing Data Fragmentation Service Design for Distributed Systems
A Novel Cloud Computing Data Fragmentation Service Design for Distributed Systems Ismail Hababeh School of Computer Engineering and Information Technology, German-Jordanian University Amman, Jordan Abstract-
More informationLecture 7: Concurrency control. Rasmus Pagh
Lecture 7: Concurrency control Rasmus Pagh 1 Today s lecture Concurrency control basics Conflicts and serializability Locking Isolation levels in SQL Optimistic concurrency control Transaction tuning Transaction
More informationLossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding
Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding C. SARAVANAN cs@cc.nitdgp.ac.in Assistant Professor, Computer Centre, National Institute of Technology, Durgapur,WestBengal,
More informationAn Algorithmic Approach to Database Normalization
An Algorithmic Approach to Database Normalization M. Demba College of Computer Science and Information Aljouf University, Kingdom of Saudi Arabia bah.demba@ju.edu.sa ABSTRACT When an attempt is made to
More informationCS 525 Advanced Database Organization - Spring 2013 Mon + Wed 3:15-4:30 PM, Room: Wishnick Hall 113
CS 525 Advanced Database Organization - Spring 2013 Mon + Wed 3:15-4:30 PM, Room: Wishnick Hall 113 Instructor: Boris Glavic, Stuart Building 226 C, Phone: 312 567 5205, Email: bglavic@iit.edu Office Hours:
More informationIV Distributed Databases - Motivation & Introduction -
IV Distributed Databases - Motivation & Introduction - I OODBS II XML DB III Inf Retr DModel Motivation Expected Benefits Technical issues Types of distributed DBS 12 Rules of C. Date Parallel vs Distributed
More informationGrid Computing Approach for Dynamic Load Balancing
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-1 E-ISSN: 2347-2693 Grid Computing Approach for Dynamic Load Balancing Kapil B. Morey 1*, Sachin B. Jadhav
More informationLoad Balancing in Distributed Data Base and Distributed Computing System
Load Balancing in Distributed Data Base and Distributed Computing System Lovely Arya Research Scholar Dravidian University KUPPAM, ANDHRA PRADESH Abstract With a distributed system, data can be located
More informationConcurrency Control. Module 6, Lectures 1 and 2
Concurrency Control Module 6, Lectures 1 and 2 The controlling intelligence understands its own nature, and what it does, and whereon it works. -- Marcus Aurelius Antoninus, 121-180 A. D. Database Management
More informationConcurrency control. Concurrency problems. Database Management System
Concurrency control Transactions per second (tps) is the measure of the workload of a operational DBMS; if two transactions access concurrently to the same data there is a problem: the module who resolve
More informationSTUDY AND SIMULATION OF A DISTRIBUTED REAL-TIME FAULT-TOLERANCE WEB MONITORING SYSTEM
STUDY AND SIMULATION OF A DISTRIBUTED REAL-TIME FAULT-TOLERANCE WEB MONITORING SYSTEM Albert M. K. Cheng, Shaohong Fang Department of Computer Science University of Houston Houston, TX, 77204, USA http://www.cs.uh.edu
More informationA Security Approach in System Development Life Cycle
A Security Approach in System Development Life Cycle (1) P.Mahizharuvi, Research Scholar, Dept of MCA, Computer Center, Madurai Kamaraj University, Madurai. mahiconference@gmail.com (2) Dr.K.Alagarsamy,
More informationSmooth and Flexible ERP Migration between both Homogeneous and Heterogeneous ERP Systems/ERP Modules
28.8.2008 Smooth and Flexible ERP Migration between both Homogeneous and Heterogeneous ERP Systems/ERP Modules Lars Frank Department of Informatics, Copenhagen Business School, Howitzvej 60, DK-2000 Frederiksberg,
More informationLoad Balancing in cloud computing
Load Balancing in cloud computing 1 Foram F Kherani, 2 Prof.Jignesh Vania Department of computer engineering, Lok Jagruti Kendra Institute of Technology, India 1 kheraniforam@gmail.com, 2 jigumy@gmail.com
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Transaction Management in Homogenous Distributed Real-Time Replicated
More informationCS 245 Final Exam Winter 2013
CS 245 Final Exam Winter 2013 This exam is open book and notes. You can use a calculator and your laptop to access course notes and videos (but not to communicate with other people). You have 140 minutes
More informationImproved Aggressive Update Propagation Technique in Cloud Data Storage
Improved Aggressive Update Propagation Technique in Cloud Data Storage Mohammed Radi Computer science department, Faculty of applied science, Alaqsa University Gaza Abstract: Recently, cloud computing
More informationA Visualization System and Monitoring Tool to Measure Concurrency in MPICH Programs
A Visualization System and Monitoring Tool to Measure Concurrency in MPICH Programs Michael Scherger Department of Computer Science Texas Christian University Email: m.scherger@tcu.edu Zakir Hussain Syed
More informationContinuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information
Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering
More informationAn Overview of Distributed Databases
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 4, Number 2 (2014), pp. 207-214 International Research Publications House http://www. irphouse.com /ijict.htm An Overview
More informationMining Association Rules: A Database Perspective
IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008 69 Mining Association Rules: A Database Perspective Dr. Abdallah Alashqur Faculty of Information Technology
More informationSurvey on Comparative Analysis of Database Replication Techniques
72 Survey on Comparative Analysis of Database Replication Techniques Suchit Sapate, Student, Computer Science and Engineering, St. Vincent Pallotti College, Nagpur, India Minakshi Ramteke, Student, Computer
More informationUSING REPLICATED DATA TO REDUCE BACKUP COST IN DISTRIBUTED DATABASES
USING REPLICATED DATA TO REDUCE BACKUP COST IN DISTRIBUTED DATABASES 1 ALIREZA POORDAVOODI, 2 MOHAMMADREZA KHAYYAMBASHI, 3 JAFAR HAMIN 1, 3 M.Sc. Student, Computer Department, University of Sheikhbahaee,
More informationPerformance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow
International Journal of Soft Computing and Engineering (IJSCE) Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow Abdullah Al Masud, Hossain Md. Shamim, Amina Akhter
More informationDatabases. DSIC. Academic Year 2010-2011
Databases DSIC. Academic Year 2010-2011 1 Lecturer José Hernández-Orallo Office 236, 2nd floor DSIC. Email: jorallo@dsic.upv.es http://www.dsic.upv.es/~jorallo/docent/bda/bdaeng.html Attention hours On
More informationEvaluation of Lump-sum Update Methods for Nonstop Service System
International Journal of Informatics Society, VOL.5, NO.1 (2013) 21-27 21 Evaluation of Lump-sum Update Methods for Nonstop Service System Tsukasa Kudo, Yui Takeda, Masahiko Ishino*, Kenji Saotome**, and
More informationAn Atomic Web-Service Transaction Protocol for Mobile Environments
An Atomic Web-Service Transaction Protocol for Mobile Environments Stefan Böttcher 1, Le Gruenwald 2, and Sebastian Obermeier 1 1 University of Paderborn, Computer Science Fürstenallee 11; 33102 Paderborn;
More informationIT2305 Database Systems I (Compulsory)
Database Systems I (Compulsory) INTRODUCTION This is one of the 4 modules designed for Semester 2 of Bachelor of Information Technology Degree program. CREDITS: 04 LEARNING OUTCOMES On completion of this
More informationHomework 8. Revision : 2015/04/14 08:13
Carnegie Mellon University Department of Computer Science 15-415/615- Database Applications C. Faloutsos & A. Pavlo, Spring 2015 Prepared by Hong Bin Shim DUE DATE: Thu, 4/23/2015, 1:30pm Homework 8 IMPORTANT
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume, Issue, March 201 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient Approach
More informationKey Words: Dynamic Load Balancing, and Distributed System
DYNAMIC ROTATING LOAD BALANCING ALGORITHM IN DISTRIBUTED SYSTEMS ROSE SULEIMAN AL DAHOUD ALI ISSA OTOUM Al-Zaytoonah University Al-Zaytoonah University Neelain University rosesuleiman@yahoo.com aldahoud@alzaytoonah.edu.jo
More informationDeadlock Detection and Recovery!
Deadlock Detection and Recovery! Richard M. Fujimoto! Professor!! Computational Science and Engineering Division! College of Computing! Georgia Institute of Technology! Atlanta, GA 30332-0765, USA!! http://www.cc.gatech.edu/~fujimoto/!
More informationProposed Pricing Model for Cloud Computing
Computer Science and Information Technology 2(4): 211-218, 2014 DOI: 10.13189/csit.2014.020405 http://www.hrpub.org Proposed Pricing Model for Cloud Computing Muhammad Adeel Javaid Member Vendor Advisory
More informationDatabase Application Developer Tools Using Static Analysis and Dynamic Profiling
Database Application Developer Tools Using Static Analysis and Dynamic Profiling Surajit Chaudhuri, Vivek Narasayya, Manoj Syamala Microsoft Research {surajitc,viveknar,manojsy}@microsoft.com Abstract
More informationWireless Sensor Networks Database: Data Management and Implementation
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Wireless Sensor Networks Database: Data Management and Implementation Ping Liu Computer and Information Engineering Institute,
More informationPerformance Analysis of Naive Bayes and J48 Classification Algorithm for Data Classification
Performance Analysis of Naive Bayes and J48 Classification Algorithm for Data Classification Tina R. Patil, Mrs. S. S. Sherekar Sant Gadgebaba Amravati University, Amravati tnpatil2@gmail.com, ss_sherekar@rediffmail.com
More informationPerformance Targets for Developers
Performance Targets for Developers Nov 2011 Performance targets are usually given at the end user or overall system level, such as an end to end response time target or an overall throughput target. After
More informationPostgreSQL Concurrency Issues
PostgreSQL Concurrency Issues 1 PostgreSQL Concurrency Issues Tom Lane Red Hat Database Group Red Hat, Inc. PostgreSQL Concurrency Issues 2 Introduction What I want to tell you about today: How PostgreSQL
More informationA SIMULATOR FOR LOAD BALANCING ANALYSIS IN DISTRIBUTED SYSTEMS
Mihai Horia Zaharia, Florin Leon, Dan Galea (3) A Simulator for Load Balancing Analysis in Distributed Systems in A. Valachi, D. Galea, A. M. Florea, M. Craus (eds.) - Tehnologii informationale, Editura
More informationMapReduce With Columnar Storage
SEMINAR: COLUMNAR DATABASES 1 MapReduce With Columnar Storage Peitsa Lähteenmäki Abstract The MapReduce programming paradigm has achieved more popularity over the last few years as an option to distributed
More informationDatabase Replication with Oracle 11g and MS SQL Server 2008
Database Replication with Oracle 11g and MS SQL Server 2008 Flavio Bolfing Software and Systems University of Applied Sciences Chur, Switzerland www.hsr.ch/mse Abstract Database replication is used widely
More informationAn Approach to Load Balancing In Cloud Computing
An Approach to Load Balancing In Cloud Computing Radha Ramani Malladi Visiting Faculty, Martins Academy, Bangalore, India ABSTRACT: Cloud computing is a structured model that defines computing services,
More information應 用 測 試 於 軟 體 發 展 生 命 週 期. Testing In The Software Development Life Cycle
The Second Management Innovation and Practices Conference, Tamsui, Taiwan, April 2001,Volume 2, pp59-68 應 用 測 試 於 軟 體 發 展 生 命 週 期 Testing In The Software Development Life Cycle 蔡 博 元 莊 立 文 真 理 大 學 資 訊
More informationOptical interconnection networks with time slot routing
Theoretical and Applied Informatics ISSN 896 5 Vol. x 00x, no. x pp. x x Optical interconnection networks with time slot routing IRENEUSZ SZCZEŚNIAK AND ROMAN WYRZYKOWSKI a a Institute of Computer and
More informationAtomic Commitment in Grid Database Systems
Atomic Commitment in Grid Database Systems Sushant Goel 1 Hema Sharda 2 David Taniar 3 1,2 School of Electrical and Computer Systems Engineering, Royal Melbourne Institute of Technology, Australia 1 s2013070@student.rmit.edu.au
More informationA Comparison of Dynamic Load Balancing Algorithms
A Comparison of Dynamic Load Balancing Algorithms Toufik Taibi 1, Abdelouahab Abid 2 and Engku Fariez Engku Azahan 2 1 College of Information Technology, United Arab Emirates University, P.O. Box 17555,
More informationKeywords: Regression testing, database applications, and impact analysis. Abstract. 1 Introduction
Regression Testing of Database Applications Bassel Daou, Ramzi A. Haraty, Nash at Mansour Lebanese American University P.O. Box 13-5053 Beirut, Lebanon Email: rharaty, nmansour@lau.edu.lb Keywords: Regression
More informationSteps to System Reconfiguration in a Distributed Database System: A Fault-tolerant Approach
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 6, Ver. VIII (Nov Dec. 2014), PP 32-38 Steps to System Reconfiguration in a Distributed Database System:
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 7, July 23 ISSN: 2277 28X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Greedy Algorithm:
More informationLoad Distribution in Large Scale Network Monitoring Infrastructures
Load Distribution in Large Scale Network Monitoring Infrastructures Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Gianluca Iannaccone, and Josep Solé-Pareta Universitat Politècnica de Catalunya (UPC) {jsanjuas,pbarlet,pareta}@ac.upc.edu
More informationLecture Outline Overview of real-time scheduling algorithms Outline relative strengths, weaknesses
Overview of Real-Time Scheduling Embedded Real-Time Software Lecture 3 Lecture Outline Overview of real-time scheduling algorithms Clock-driven Weighted round-robin Priority-driven Dynamic vs. static Deadline
More informationSCHEDULING IN CLOUD COMPUTING
SCHEDULING IN CLOUD COMPUTING Lipsa Tripathy, Rasmi Ranjan Patra CSA,CPGS,OUAT,Bhubaneswar,Odisha Abstract Cloud computing is an emerging technology. It process huge amount of data so scheduling mechanism
More informationA Replication Protocol for Real Time database System
International Journal of Electronics and Computer Science Engineering 1602 Available Online at www.ijecse.org ISSN- 2277-1956 A Replication Protocol for Real Time database System Ashish Srivastava 1 Udai
More informationStorage of Simulation and Entities History in discrete models
Storage of Simulation and Entities History in discrete models De Giusti Marisa Raquel*, Lira Ariel Jorge, Villarreal, Gonzalo Luján **. * PrEBi UNLP and Comisión de Investigaciones Científicas (CIC) de
More informationProceedings of the International MultiConference of Engineers and Computer Scientists 2013 Vol I, IMECS 2013, March 13-15, 2013, Hong Kong
, March 13-15, 2013, Hong Kong Risk Assessment for Relational Database Schema-based Constraint Using Machine Diagram Kanjana Eiamsaard 1, Nakornthip Prompoon 2 Abstract Information is a critical asset
More informationA Middleware Strategy to Survive Compute Peak Loads in Cloud
A Middleware Strategy to Survive Compute Peak Loads in Cloud Sasko Ristov Ss. Cyril and Methodius University Faculty of Information Sciences and Computer Engineering Skopje, Macedonia Email: sashko.ristov@finki.ukim.mk
More informationExtending Multidatabase Transaction Management Techniques to Software Development Environments
Purdue University Purdue e-pubs Computer Science Technical Reports Department of Computer Science 1993 Extending Multidatabase Transaction Management Techniques to Software Development Environments Aidong
More informationA Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters
A Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters Abhijit A. Rajguru, S.S. Apte Abstract - A distributed system can be viewed as a collection
More informationHorizontal Aggregations In SQL To Generate Data Sets For Data Mining Analysis In An Optimized Manner
24 Horizontal Aggregations In SQL To Generate Data Sets For Data Mining Analysis In An Optimized Manner Rekha S. Nyaykhor M. Tech, Dept. Of CSE, Priyadarshini Bhagwati College of Engineering, Nagpur, India
More informationData Management in the Cloud
Data Management in the Cloud Ryan Stern stern@cs.colostate.edu : Advanced Topics in Distributed Systems Department of Computer Science Colorado State University Outline Today Microsoft Cloud SQL Server
More informationA Case Study Research on Software Cost Estimation Using Experts Estimates, Wideband Delphi, and Planning Poker Technique
, pp. 173-182 http://dx.doi.org/10.14257/ijseia.2014.8.11.16 A Case Study Research on Software Cost Estimation Using Experts Estimates, Wideband Delphi, and Planning Poker Technique Taghi Javdani Gandomani
More informationTwo Approaches to Internet Traffic Engineering for End-to-End Quality of Service Provisioning
Two Approaches to Internet Engineering for End-to-End Quality of Service Provisioning Kin-Hon Ho, Michael Howarth, Ning Wang, George Pavlou and Stylianos Georgoulas Centre for Communication Systems Research,
More informationKEYWORD SEARCH IN RELATIONAL DATABASES
KEYWORD SEARCH IN RELATIONAL DATABASES N.Divya Bharathi 1 1 PG Scholar, Department of Computer Science and Engineering, ABSTRACT Adhiyamaan College of Engineering, Hosur, (India). Data mining refers to
More informationTHE IMPACT OF INHERITANCE ON SECURITY IN OBJECT-ORIENTED DATABASE SYSTEMS
THE IMPACT OF INHERITANCE ON SECURITY IN OBJECT-ORIENTED DATABASE SYSTEMS David L. Spooner Computer Science Department Rensselaer Polytechnic Institute Troy, New York 12180 The object-oriented programming
More informationA Rule-Oriented Concurrent Architecture to Effect Adaptiveness for Integrated Manufacturing Enterprises
A Rule-Oriented Concurrent Architecture to Effect Adaptiveness for Integrated Manufacturing Enterprises Cheng Hsu and Gilbert Babin Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute,
More informationDevelopment models. 1 Introduction. 2 Analyzing development models. R. Kuiper and E.J. Luit
Development models R. Kuiper and E.J. Luit 1 Introduction We reconsider the classical development models: the Waterfall Model [Bo76], the V-Model [Ro86], the Spiral Model [Bo88], together with the further
More informationPerformance Comparison of Database Access over the Internet - Java Servlets vs CGI. T. Andrew Yang Ralph F. Grove
Performance Comparison of Database Access over the Internet - Java Servlets vs CGI Corresponding Author: T. Andrew Yang T. Andrew Yang Ralph F. Grove yang@grove.iup.edu rfgrove@computer.org Indiana University
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More information1. Comments on reviews a. Need to avoid just summarizing web page asks you for:
1. Comments on reviews a. Need to avoid just summarizing web page asks you for: i. A one or two sentence summary of the paper ii. A description of the problem they were trying to solve iii. A summary of
More informationIMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 6 June, 2013 Page No. 1914-1919 IMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES Ms.
More information18-742 Lecture 4. Parallel Programming II. Homework & Reading. Page 1. Projects handout On Friday Form teams, groups of two
age 1 18-742 Lecture 4 arallel rogramming II Spring 2005 rof. Babak Falsafi http://www.ece.cmu.edu/~ece742 write X Memory send X Memory read X Memory Slides developed in part by rofs. Adve, Falsafi, Hill,
More informationM. Sugumaran / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (3), 2011, 1001-1006
A Design of Centralized Meeting Scheduler with Distance Metrics M. Sugumaran Department of Computer Science and Engineering,Pondicherry Engineering College, Puducherry, India. Abstract Meeting scheduling
More informationHow To Compare Load Sharing And Job Scheduling In A Network Of Workstations
A COMPARISON OF LOAD SHARING AND JOB SCHEDULING IN A NETWORK OF WORKSTATIONS HELEN D. KARATZA Department of Informatics Aristotle University of Thessaloniki 546 Thessaloniki, GREECE Email: karatza@csd.auth.gr
More informationApplication of Predictive Analytics for Better Alignment of Business and IT
Application of Predictive Analytics for Better Alignment of Business and IT Boris Zibitsker, PhD bzibitsker@beznext.com July 25, 2014 Big Data Summit - Riga, Latvia About the Presenter Boris Zibitsker
More informationResource Allocation Schemes for Gang Scheduling
Resource Allocation Schemes for Gang Scheduling B. B. Zhou School of Computing and Mathematics Deakin University Geelong, VIC 327, Australia D. Walsh R. P. Brent Department of Computer Science Australian
More informationLayered Approach to Development of OO War Game Models Using DEVS Framework
Layered Approach to Development of OO War Game Models Using DEVS Framework Chang Ho Sung*, Su-Youn Hong**, and Tag Gon Kim*** Department of EECS KAIST 373-1 Kusong-dong, Yusong-gu Taejeon, Korea 305-701
More informationCRASH RECOVERY FOR REAL-TIME MAIN MEMORY DATABASE SYSTEMS
CRASH RECOVERY FOR REAL-TIME MAIN MEMORY DATABASE SYSTEMS Jing Huang Le Gruenwald School of Computer Science The University of Oklahoma Norman, OK 73019 Email: gruenwal@mailhost.ecn.uoknor.edu Keywords:
More informationLoad Balancing in Distributed System. Prof. Ananthanarayana V.S. Dept. Of Information Technology N.I.T.K., Surathkal
Load Balancing in Distributed System Prof. Ananthanarayana V.S. Dept. Of Information Technology N.I.T.K., Surathkal Objectives of This Module Show the differences between the terms CPU scheduling, Job
More informationComparative Study of Load Balancing Algorithms
IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 3 (Mar. 2013), V2 PP 45-50 Comparative Study of Load Balancing Algorithms Jyoti Vashistha 1, Anant Kumar Jayswal
More informationSix Strategies for Building High Performance SOA Applications
Six Strategies for Building High Performance SOA Applications Uwe Breitenbücher, Oliver Kopp, Frank Leymann, Michael Reiter, Dieter Roller, and Tobias Unger University of Stuttgart, Institute of Architecture
More informationNew Matrix Approach to Improve Apriori Algorithm
New Matrix Approach to Improve Apriori Algorithm A. Rehab H. Alwa, B. Anasuya V Patil Associate Prof., IT Faculty, Majan College-University College Muscat, Oman, rehab.alwan@majancolleg.edu.om Associate
More informationJoint ITU-T/IEEE Workshop on Carrier-class Ethernet
Joint ITU-T/IEEE Workshop on Carrier-class Ethernet Quality of Service for unbounded data streams Reactive Congestion Management (proposals considered in IEE802.1Qau) Hugh Barrass (Cisco) 1 IEEE 802.1Qau
More informationSCHEDULING IN CONCURRENT PASCAL * F. B. Schneider A. J. Bernstein Department of Computer Science S.U.N.Y. at Stony Brook Stony Brook, New York, 11794
SCHEDULING IN CONCURRENT PASCAL * F. B. Schneider A. J. Bernstein Department of Computer Science S.U.N.Y. at Stony Brook Stony Brook, New York, 11794 Introduction The monitor construct [H74] [B75] and
More informationDetecting Multiple Selfish Attack Nodes Using Replica Allocation in Cognitive Radio Ad-Hoc Networks
Detecting Multiple Selfish Attack Nodes Using Replica Allocation in Cognitive Radio Ad-Hoc Networks Kiruthiga S PG student, Coimbatore Institute of Engineering and Technology Anna University, Chennai,
More information