ACM Home Page
Please provide us with feedback. Feedback
Token transactions: managing fine-grained migration of data
Full text PdfPdf (1.26 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Nashville, Tennessee, United States
Pages: 344 - 356  
Year of Publication: 1990
ISBN:0-89791-352-3
Authors
Va-On Tam  Aiken Computation Lab, Harvard University, Cambridge, MA
Meichun Hsu  Aiken Computation Lab, Harvard University, Cambridge, MA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 18,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/298514.298586
What is a DOI?

ABSTRACT

Executing a transaction in a conventional distributed database system involves the execution of several subtransactions, each at a remote site where the data reside and running a two-phase commit protocol at the end of the transaction. With the advent of fast communication networks, we consider an alternative paradigm where the remote data being accessed are dynamically migrated to the initiation site of the transaction. One example of such a system is a distributed shared virtual memory system. In this paper, we examine the problem of recovery from system failure in data migration systems. Most data migration systems use the notion of tokens for the access rights a site has on the data elements it caches. Our goal is to recover the site's knowledge of the set of tokens it owned when a system failure occurred. Our approach is to consider the token knowledge at each site as a fragment of a global token database and the data migration activities as token transactions that update this distributed database. We have developed a unique commit protocol for token transactions, called unilateral commit (UCP), that efficiently achieves consistency and recoverability of the token state. The correctness of UCP with respect to the two-phase commit protocol is also presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Bellew et.al. 90
 
Bernstein et.al. 87
 
Delp 88
Delp, G. S., The Architecture and Ira. plementation of Memnet: a High-Speed Shared.Memory Computer Communication Network. Technical Report 88-05- 1. Department of Electrical Engineering, University of Delaware, May 1988.
 
Forin et.al. 89
Forin, A., Barrera, J., and Sanzi, R., The Shared Memory Server. Proceedings of USENIX Winter Conference. January 1989.
 
Gray 78
 
Hsu et.al. 89
Hsu, M., and Tam, V., Transaction Synchronization in Distributed Virtual Memory Systems. Proceeding of 13th Computer Software ~~ Applications Conference. September 1989.
 
Hsu et.al. 89a
Hsu, M., and Tam, V., Conflict Resolution of Token Transfers in Data Mi. gration Systems. In preparation.
Jul et.al. 88
 
Li 86
 
Minoura et.al.82
Minoura, T. and Wiederhold, G. Resilient Extended True-Copy Token Scheme for a Distributed Database System. ~ IEEE Transactions on Software En. gineering, Vol SE-8, No. 3, May 1982.
 
Nelson 81
 
Ramachandran et.al. 88
Ramachandran, U., Ahamad, M., and Khalidi, M. Y. A., Unifying Synchronization and Data Transfer in Maintaining Coherence of Distributed Shared Memory. Technical Report Girl'. ICS-88/23, School of Information and Computer Science, Georgia Institute of Technology. June 1988.