ABSTRACT
The correct and effcient management of data in distributed databases or mobile computing environments is diffcult. Communication disruptions within such systems render the execution of database transactions problematic due to difficulties in atomic commitment strategies. A previously proposed non-traditional system for data and operators, with single site transaction executions and decentralized commitment [9], is useful in specific applications. For this approach, we use some simple analytical and simulation models to assess performance, and provide our findings for straightforward demand-driven and periodic re-allocation strategies.
- {1} P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, 1987. Google ScholarDigital Library
- {2} S. Davidson et al. Consistency in partitioned networks. ACM Computing Surveys , 17(3):341-370, September 1985. Google ScholarDigital Library
- {3} L. Dowdey and C. Lowery. P.S. to Operating Systems. Prentice Hall, New Jersey, 1993. Google ScholarDigital Library
- {4} M. R. Garey and D. S. Johnson. Computers and Intractability.W. H. Freeman and Company, New York, 1979. Google ScholarDigital Library
- {5} T. Imielinski and B. R. Badrinth. Mobile wireless computing: Challenges in data management. Communications of the ACM, October 1994. Google ScholarDigital Library
- {6} V. Mendiratta. A dynamic optimization model of the empty rail car distribution process. 1994.Google Scholar
- {7} A. Silberschatz, J. Peterson, and P. Galvin. Operating System Concepts. Addison-Wesley Publishing Co., 1991. Third edition. Google ScholarDigital Library
- {8} D. Skeen. Crash recovery in a distributed database system. Ph.D. dissertation. Department of Electrical Engin. & Computer Sci., University of California, Berkeley, May 1982.Google Scholar
- {9} N. R. Soparkar and A. Silberschatz. Data-value partitioning and virtual messages. In Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, pages 357-367, April 1990. Google ScholarDigital Library
- {10} M. P. Wellman. A market-oriented programming environment and its application to distributed multicommodity flow problems. Journal of Artificial Intelligence Research 1, 1-23, 1993.Google ScholarDigital Library
Index Terms
- Performance aspects of dynamic re-allocation for partitioned data
Recommendations
On high performance distributed transactional data structures
MiddlewareDPT '13: Proceedings Demo & Poster Track of ACM/IFIP/USENIX International Middleware ConferenceWe present three protocols for developing high performance distributed transactional data structures. Our first protocol, QR-ON, incorporates the open nesting transactional model into QR, a quorum-based protocol for managing concurrency on distributed ...
Performance Analysis of Dynamic Locking with the No-Waiting Policy
A transaction processing system with two-phase dynamic locking with the no waiting policy (DLNW) for concurrency control is considered. In this method, transactions making conflicting lock requests are aborted and restarted rather than blocked, thereby ...
Lock allocation
Proceedings of the 2007 POPL ConferenceWe introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assignment from global variables to locks and a lock instrumentation that ...
Comments