Experiments conducted on a database testbed at Princeton indicate excessive page-table I/O is the major performance drawback of shadow recovery. In light of this, a method for parameterizing shadow recovery that minimize page-table I/O without sacrificing to much disk utilization is proposed. Using a simple model, the mechanism is analyzed and evaluated, comparing it to two conventional ones.>

Article Free Access Share on An experimental evaluation of crash recovery machanisms Authors: Jack Kent View Profile , Hector Garcia-Molina View Profile , Jae Chung View Profile Authors Info & Claims PODS '85: Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systemsMarch 1985 Pages 113–122https://doi.org/10.1145/325405.325419Online:25 March 1985Publication History 7citation97DownloadsMetricsTotal Citations7Total Downloads97Last 12 Months8Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

This paper presents an evaluation technique which is useful for studying both the performance and the reliability of a distributed computing system. The distributed system is evaluated the point of view of a user who submits a request for service. Our technique computes the average time to successful completion of this request, taking into account the system failures or repairs which may occur before the request is completed. Given a model of the system and its failures, the performance-reliability measures are computed in an automatic numerical fashion. The technique is computationally intensive, so it is limited to relatively small systems. However, it can produce results for many interesting cases without an inordinate amount of computation.