Files in this item

FilesDescriptionFormat

application/pdf

application/pdf9411723.pdf (5MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Redundant Disk Arrays in Transaction Processing Systems
Author(s):Mourad, Antoine Nagib
Doctoral Committee Chair(s):Fuchs, W. Kent; Saab, Daniel G.
Department / Program:Electrical Engineering
Discipline:Electrical Engineering
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Engineering, Electronics and Electrical
Computer Science
Abstract:Disk arrays are a cost-effective approach for building large, reliable and high performance storage subsystems. They provide high transfer rates by striping data over multiple disks and use a parity scheme for recovering from any single disk failure. Transaction processing is a large and growing segment of commercial computing. There is a major need in that environment for large, highly available and fast I/O subsystems.
In this thesis, we address various issues dealing with the use of disk arrays in transaction processing environments. We look at the problem of transaction undo recovery and propose a scheme for using the redundancy in disk arrays to support undo recovery. The scheme uses twin page storage for the parity information in the array. It speeds up transaction processing by eliminating the need for undo logging for most transactions. The use of redundant arrays of distributed disks to provide recovery from disasters as well as temporary site failures and disk crashes is also studied. We investigate the problem of assigning the sites of a distributed storage system to redundant arrays in such a way that the cost of maintaining the redundant parity information is minimized. Heuristic algorithms for solving the site partitioning problem are proposed and their performance is evaluated using simulation. We also develop a heuristic for which an upper bound on the deviation from the optimal solution can be established.
Another part of the thesis focuses on the performance of various disk array organizations in transaction processing environments. Trace data from large scale commercial transaction processing sites are used to evaluate and compare the performance of those organizations. We investigate the use of a nonvolatile cache in the disk array controller to reduce the effect of the high cost of small writes. For noncached systems, we evaluate two redundant disk array organizations and compare them to mirrored disks and nonredundant, nonstriped organizations. For cached systems, we consider the above four organizations as well as a disk array organization that uses a dedicated disk for parity in each array and buffers parity updates in the controller cache before spooling them to the parity disk.
Issue Date:1993
Type:Text
Description:128 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.
URI:http://hdl.handle.net/2142/72019
Other Identifier(s):(UMI)AAI9411723
Date Available in IDEALS:2014-12-16
Date Deposited:1993


This item appears in the following Collection(s)

Item Statistics