Paper Reading Summary: Remus: High Availability via Asynchronous Virtual Machine Replication

This is a paper summary for “Remus: High Availability via Asynchronous Virtual Machine Replication” from University of Britishi Columbia

The paper question is

The Remus paper’s Figure 6 suggests that less frequent checkpoints can lead to better performance. Of course, checkpointing only every X milliseconds means that up to X milliseconds of work are lost if the primary crashes. Suppose it was OK to lose an entire second of work if the primary crashed. Explain why checkpointing every second would lead to terrible performance if the application running on Remus were a Web server.

My Question for the paper is

The paper summary through 7 key questions

  1. Focus / Problem to be solved
  2. Importance
  3. Method
  4. Context
  5. Results
  6. Unique contributions
  7. Possible applications
Advertisements
This entry was posted in Paper Summary. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s