Performance Trade-offs in Dynamic Backup Scheduling
2015-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Performance Trade-offs in Dynamic Backup Scheduling
Authors
Published Date
2015-05
Publisher
Type
Thesis or Dissertation
Abstract
Recently the amount of data generated and stored on computers has seen outrageous growth and the trend will only continue. With the 24 hour global business structure being the way it is now, backup windows are shrinking and/or data is expected to be available at all times. Because of this, having effective and efficient data protection has become increasingly important. It is therefore necessary to move past the outdated static backup configurations and adopt intelligent dynamic backup systems. With that in mind we introduce the Affinity dynamic backup scheduling algorithm. Using a dynamic backup simulator we examine this algorithm as well as others and examine the performance trade-offs between these algorithms. Using this algorithm we have seen incremental improvements in the three primary metrics of Storage Throughput Utilization, Storage Distribution and Backup Time Consistency. With the insight gained from our simulation we discuss the benefits and trade-offs of dynamic scheduling algorithms and also dive into ideas and changes important to the future of backup systems.
Keywords
Description
University of Minnesota M.S.E.C.E. thesis. May 2015. Major: Electrical Engineering. Advisor: David Lilja. 1 computer file (PDF); viii, 58 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Hoffmann, Brandon. (2015). Performance Trade-offs in Dynamic Backup Scheduling. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/174781.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.