ACM Home Page
Please provide us with feedback. Feedback
The SMART way to migrate replicated stateful services
Full text PdfPdf (2.03 MB)
Source European Conference on Computer Systems archive
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 table of contents
Leuven, Belgium
SESSION: Replication table of contents
Pages: 103 - 115  
Year of Publication: 2006
ISBN:1-59593-322-0
Also published in ...
Authors
Jacob R. Lorch  Microsoft Research
Atul Adya  Microsoft Research
William J. Bolosky  Microsoft Research
Ronnie Chaiken  Microsoft Research
John R. Douceur  Microsoft Research
Jon Howell  Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 46,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This paper describes SMART, a new technique for changing the set of machines where such a service runs, i.e., migrating the service. SMART improves upon existing techniques in three important ways. First, SMART allows migrations that replace non-failed machines. Thus, SMART enables load balancing and lets an automated system replace failed machines. Such autonomic migration is an important step toward full autonomic operation, in which administrators play a minor role and need not be available twenty-four hours a day, seven days a week. Second, SMART can pipeline concurrent requests, a useful performance optimization. Third, prior published migration techniques are described in insufficient detail to admit implementation, whereas our description of SMART is complete. In addition to describing SMART, we also demonstrate its practicality by implementing it, evaluating our implementation's performance, and using it to build a consistent, replicated, migratable file system. Our experiments demonstrate the performance advantage of pipelining concurrent requests, and show that migration has only a minor and temporary effect on performance.


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.

1
2
 
3
4
 
5
6
7
 
8
9
 
10
 
11
J. Howell and J. Douceur. Replicated virtual machines. Technical report MSR-TR-2005-119, Microsoft Research, 2005.
 
12
J. Howell, J. R. Lorch, and J. Douceur. Correctness of Paxos with replica-set-specific views. Technical report MSR-TR-2004-45, Microsoft Research, 2004.
13
 
14
L. Lamport. Paxos made simple. ACM SIGACT News, 32(4):18--25, Dec. 2001.
 
15
16
 
17
 
18
J. MacCormick, N. Murphy, M. Najork, C. A. Thekkath, and L. Zhou. Boxwood: Abstractions as the foundation for storage infrastructure. In Proc. 6th OSDI, pages 105--120, San Francisco, CA, Dec. 2004.
 
19
 
20
21
22
 
23
C. A. Thekkath. Personal communication. 2005.
 
24
R. van Renesse and F. B. Schneider. Chain replication for supporting high throughput and availability. In Proc. 6th OSDI, pages 91--104, San Francisco, CA, Dec. 2004.
25
 
26
H. Yu and A. Vahdat. Consistent and automatic replica regeneration. In Proc. 1st NSDI, pages 323--336, San Francisco, CA, Mar. 2004.


Collaborative Colleagues:
Jacob R. Lorch: colleagues
Atul Adya: colleagues
William J. Bolosky: colleagues
Ronnie Chaiken: colleagues
John R. Douceur: colleagues
Jon Howell: colleagues