There are many applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communication, and it can be very...
A Performance Prediction Framework for Grid-Based Data Mining Applications ∗ (2008)
Leonid Glimcher, Gagan Agrawal
For a grid middleware to perform resource allocation, prediction models are needed, which can determine how long an application will take for completion on a particular platform or configuration. In...
Parallelizing a Defect Detection and Categorization Application \Lambda (2008)
Leonid Glimcher, Gagan Agrawal, Sameep Mehta, Ruoming Jin, Raghu Machiraju
Abstract This paper presents a case study in creating a parallel and scalable implementation of a scientific data analysis application. We focus on a defect detection and categorization application...
Supporting a Real-Time Distributed Intrusion Detection Application on GATES (2008)
Qian Zhu, Liang Chen, Gagan Agrawal
Abstract. Increasingly, a number of applications across computer sciences
Qian Zhu, Gagan Agrawal, Benv R
This section describes two applications we are currently targeting. Both the applications require time-critical response to certain events. Volume Rendering involves interactively creates a 2D...
Runtime and Compiler Support for Programming in Adaptive (2008)
Parallel Environments, Guy Edjlali, Gagan Agrawal, Alan Sussman, Jim Humphries
Supporting a Visualization Application on a Self-Adapting Grid Middleware ABSTRACT (2008)
Liang Chen, Han-wei Shen, Gagan Agrawal
This paper describes how we have used a self-adapting middleware to implement a distributed and adaptive volume rendering application. The middleware we have used is GATES (Grid-based Adap-Tive...
Programming Interface, and Performance ∗ (2008)
With the availability of large datasets in application areas like bioinformatics, medical informatics, scientific data analysis, financial analysis, telecommunications, retailing, and marketing, it...
PERFORMANCE STUDIES OF THE PARALLELIZATION OF A CFD SOLVER ON THE ORIGIN 2000 (2008)
Ms. Dixie, M. Hisley, Dr. Gagan Agrawal, Assistant Professor
Weapon designers have typically run large-scale, computationally intensive numerical simulations for missile and projectile simulations on high-end supercomputing architectures. Recently, the...
Xingquan Zhu, Ruoming Jin, Gagan Agrawal
Copyright © 2007 by the Association for Computing Machinery, Inc (ACM). Permission to make digital or hard copies of portions of this work for personal or classroom use is granted without fee...
Code Transformations for One-Pass Analysis (2008)
Abstract. With the growing popularity of streaming data model, processing queries over streaming data has become an important topic. Streaming data has received attention in a number of communities,...
Liang Chen, Adviser Prof, Gagan Agrawal
Building high-performance computing systems to enable automated data analysis and computation for the emerging applications. Specifically,
Fast and exact out-of-core and distributed k-means clustering (2008)
Ruoming Jin, Anjan Goswami, Gagan Agrawal
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes on the entire...
ABSTRACT Accurate One Pass Decision Tree Construction (2008)
Ruoming Jin, Anjan Goswami, Gagan Agrawal
In mining continuous data streams, one popular paradigm is using sampling and having a one-pass algorithm with probabilistic bound on the accuracy. A key application of this approach is in decision...
Supporting Fault-Tolerance in Streaming Grid Applications (2008)
Qian Zhu, Liang Chen, Gagan Agrawal
This paper considers the problem of supporting and efficiently implementing fault-tolerance for tightly-coupled and pipelined applications, especially streaming applications, in a grid environment....
Abstract Automatic Compiler Techniques for Thread Coarsening for Multithreaded Architectures* (2008)
Multithreaded architectures are emerging as an important class of parallel machines. By allowing fast context switch-ing between threads on the same processor, these systems hide communication and...
A Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases (2008)
and iterative process. In order to support this process, one of the long-term goals of data mining research has been to build a Knowledge Discovery and Data Mining System (KDDMS). Along this line,...
Gagan Agrawal, Renato Ferreira, Joel Saltz, Ruoming Jin
Solving problems that have large computational and storage requirements is becoming increasingly critical for advances in many domains of science and engineering. By allowing algorithms for such...
Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel Saltz
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Renato Ferreira, Gagan Agrawal, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientic research. High-level language and compiler support for developing applications that...
Renato Ferreira, Gagan Agrawal, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. We are developing a compiler that processes data intensive applications...
Renato Ferreira, Gagan Agrawal, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. The complexity and irregularity of datasets in many domains make the task...
Renato Ferreira, Gagan Agrawal, Joel Saltz
Abstract---Processing and analyzing large volumes of data play an increasingly important role in many domains of scientific research. However, high-level language and compiler support for developing...
Exploiting Domain Specific High-level Runtime Support for Parallel Code Generation (2007)
Xiaogang Li, Ruoming Jin, Gagan Agrawal
Data mining techniques focus on finding novel and useful patterns or models from large datasets. Because of the volume of the data to be analyzed, the amount of computation involved, and the need for...
Ruoming Jin, Ge Yang, Gagan Agrawal
edu Data cube construction is a commonly used operation in data warehouses. Because of the volume of data that is stored and analyzed in a data warehouse and the amount of computation involved in...
Supporting High-level Abstractions through XML (2007)
Technology Xiaogang Li, Xiaogang Li, Gagan Agrawal
Development of applications that process large scientific datasets is often complicated by complex and specialized data storage formats. In this paper, we describe the use of XML technologies for...
Compiler and Middleware Support for Scalable Data Mining (2007)
Gagan Agrawal, Ruoming Jin, Xiaogang Li
High performance data mining is emerging as an important class of parallel applications. The expertise and effort currently required in implementing, maintaining, and performance tuning a parallel...
Compiler and Runtime Analysis for Efficient Communication in Data Intensive Applications (2007)
Renato Ferreira, Gagan Agrawal, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. We are developing a compiler that processes data intensive applications...
Supporting self-adaptation in streaming data mining applications (2006)
There are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time or interactive...
Efficient Evaluation of XQuery over Streaming Data (2005)
With the growing popularity of XML and emergence of streaming data model, processing queries over streaming XML has become an important topic. This paper presents a new framework and a set of...
New sampling-based estimators for olap queries (2005)
Ruoming Jin, Leo Glimcher, Chris Jermaine, Gagan Agrawal
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasible to collect...
Scaling and Parallelizing a Scientific Feature Mining Application Using a Cluster Middleware (2004)
Leonid Glimcher, Xuan Zhang, Gagan Agrawal
The main observations from our experimental results are as follows: 1) the overhead of using the middleware is quite small in most cases, 2) there is an overhead associated with breaking the datasets...
GATES: A Grid-Based Middleware for Processing Distributed Data Streams (2004)
Liang Chen, Kolagatla Reddy, Gagan Agrawal
Increasingly, a number of applications rely on, or can potentially benefit from, analysis and monitoring of data streams. Moreover, many of these applica-tions involve high volume data streams and...
Ruoming Jin, Ge Yang, Gagan Agrawal, Ieee Computer Society
With recent technological advances, shared memory parallel machines have become more scalable, and offer large main memories and high bus bandwidths. They are emerging as good platforms for data...
Supporting sql-3 aggregations on grid-based data repositories (2004)
Li Weng, Gagan Agrawal, Umit Catalyurek, Joel Saltz
Abstract. There is an increasing trends towards distributed and shared repositories for storing scientific datasets. Developing applications that retrieve and process data from such repositories...
Communication and Memory Efficient Parallel Decision Tree Construction (2003)
Decision tree construction is an important data mining problem. In this paper, we revisit this problem, with a new goal, i.e. Can we develop an efficient parallel algorithm for decision tree...
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data (2003)
has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major contributions. First, we present a one pass algorithm for frequent itemset...
Compiler Support for Efficient Processing of XML Datasets (2003)
Xiaogang Li, Renato Ferreira, Gagan Agrawal
are often successful in easing application development. In this paper, we report our experiences in compiling a recently developed XML Query Language, XQuery for applications that process scientific...
Efficient Decision Tree Construction on Streaming Data (2003)
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass algorithm for...
With recent technological advances, shared memory parallel machines have become more scalable, and oer large main memories and high bus bandwidths. They are emerging as good platforms for data...
As the amount of information available for analysis is increasing, data mining tasks are becoming an important application class for high performance computing. In this paper, we focus on shared...
this paper, we revisit the problem of performance prediction on shared memory parallel machines, motivated by the need for selecting parallelization strategy for random write reductions. Such...
Compiler and Runtime Support for Shared Memory Parallelization of Data Mining Algorithms (2002)
Xiaogang Li, Ruoming Jin, Gagan Agrawal
Data mining techniques focus on finding novel and useful patterns or models from large datasets. Because of the volume of the data to be analyzed, the amount of computation involved, and the need for...
Compiler and runtime support for irregular reductions on a multithreaded architecture (2002)
state.edu Computations from many scientific and engineering domains use irregular meshes and/or sparse matrices. The codes ex-pressing these computations involve irregular reductions. Ir-regular...
Compiler Supported High-level Abstractions for Sparse Disk-Resident Datasets (2001)
Ferreira, Renato, Agrawal, Gagan, Saltz, Joel
Processing and analysing large volumes of data plays an increasingly important role in many domains of scientific research. The complexity and irregularity of datasets in many domains make the task...
Compiler Supported High-level Abstractions for Sparse Disk-Resident Datasets (2001)
Ferreira, Renato, Agrawal, Gagan, Saltz, Joel
Processing and analysing large volumes of data plays an increasingly important role in many domains of scientific research. The complexity and irregularity of datasets in many domains make the task...
A middleware for developing parallel data mining implementations (2001)
Data mining is an interdisciplinary field, having applications in diverse areas like bioinformatics, medical informatics, scientific data analysis, financial analysis, consumer profiling, etc. In...
An Efficient Association Mining Implementation of Cluster of SMPs (2001)
Association mining is one of the most important data mining tasks. Over the last 6 years, several sequential and parallel algorithms have been developed for association mining. An excellent survey is...
A middleware for developing parallel data mining implementations (2001)
As the amount of information available for analysis is increasing, scalability of data mining applications is becoming a critical factor. To this end, parallel versions of most of the commonly used...
Evaluating Explicitly Context-Sensitive Program Slicing (2001)
One of the important issues in constructing interprocedural program slices is maintaining context-sensitivity or preserving calling context when a procedure is called at multiple call sites. Though a...
Compiling several classes of communication patterns on a multithreaded architecture (2001)
Rishi Kumar, Gagan Agrawal, Guang Gao
state.edu Communication optimizations play a crucial role in per-formance of parallel applications which are compiled and executed on distributed memory machines. Multithreaded architectures can...
Landing CG on EARTH: A case study of fine-grained multithreading on an evolutionary path (2000)
Kevin B. Theobald, Gagan Agrawal, Rishi Kumar
Abstract Obtaining high performance from communication intensive irregular applications has been one of the major hurdles in parallel scientific computing. This paper reports on our work in...
Automatic compiler techniques for thread coarsening for multithreaded architectures (2000)
Gagan Agrawal, Lori Pollock, Jose Nelson, Amaral Xinan, Tangy Guang Gao
Abstract Multithreaded architectures are emerging as an important class of parallel machines. By allowing fast context switching between threads on the same processor, these systems hide...
Compiling data intensive applications with spatial coordinates (2000)
Renato Ferreira, Gagan Agrawal, Ruoming Jin
Abstract. Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. We are developing a compiler which processes data intensive...
Compiling data intensive applications with spatial coordinates (2000)
Renato Ferreira, Gagan Agrawal, Ruoming Jin, Joel Saltz
Abstract. Processing and analyzing large volumes of data plays an increasingly important role in many domains of scienti c research. We are developing a compiler which processes data intensive...
Language extensions and compilation techniques for data intensive computations (2000)
Gagan Agrawal, Renato Ferreira, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. Typical examples of very large scientific datasets include long running...
Landing CG on EARTH: A case study of fine-grained multithreading on an evolutionary path (2000)
Kevin B. Theobald, Gagan Agrawal, Rishi Kumar, Gerd Heber, Guangr. Gao, Paul Stodghill, ...
We report on our work in developing a fine-grained multithreaded solution for the communicationintensive Conjugate Gradient (CG) problem. In our recent work, we developed a simple yet efficient...
Compiling Object-Oriented Data Intensive Applications (2000)
Renato Ferreira, Gagan Agrawal, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. High-level language and compiler support for developing applications that...
Landing CG on EARTH: A Case Study of Fine-Grained Multithreading on an Evolutionary Path (2000)
Kevin B. Theobald, Gagan Agrawal, Rishi Kumar, Gerd Heber, Guang R. Gao, Paul Stodghill, ...
Obtaining high performance from communication intensive irregular applications has been one of the major hurdles in parallel scientific computing. This paper reports on our work in developing a...
Language extensions and compilation techniques for data intensive computations (2000)
Gagan Agrawal, Renato Ferreira, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scienti c research. Typical examples of very large scienti c datasets include long running...
Agrawal, Gagan, Sussman, Alan, Saltz, Joel
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular...
The Economist Intelligence Unit (1998)
With a growing trend towards grid-based data repositories and data analysis services, scientific data analysis often involves accessing multiple data sources, and analyzing the data using a variety...
Compiler and runtime support for programming in adaptive parallel environments (1997)
Guy Edjlali, Gagan Agrawal, Alan Sussman, Jim Humphries, Joel Saltz
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Inter-procedural data flow based optimizations for distributed memory compilation (1997)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Runtime and Compiler Support for Programming in Adaptive Parallel Environments (1997)
Guy Edjlali, Gagan Agrawal, Alan Sussman, Jim Humphries, Joel Saltz
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Interprocedural code placement techniques and their applications /--by Gagan Agrawal. (1996)
Thesis research directed by Dept. of Computer Science.
An interprocedural framework for placement of asynchronous I/O operations (1996)
Gagan Agrawal, Anurag Acharya, Joel Saltz
Overlapping memory accesses with computations is a standard technique for improving performance on modern architectures, which have deep memory hierarchies. In this paper, we present a compiler...
An interprocedural framework for placement of asynchronous I/O operations (1996)
Gagan Agrawal, Anurag Acharya, Joel Saltz
Overlapping memory accesses with computations is a standard technique for improving performance on modern architectures, which have deep memory hierarchies. In this paper, we present a compiler...
Interprocedural Data Flow Based Optimizations for Distributed Memory Compilation (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
An Interprocedural Framework for Placement of Asychronous I/O Operations (1995)
Agrawal, Gagan, Acharya, Anurag, Saltz, Joel
Overlapping memory accesses with computations is a standard technique for improving performance on modern architectures, which have deep memory hierarchies. In this paper, we present a compiler...
Interprocedural Data Flow Based Optimizations for Distributed Memory Compilation (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
An Interprocedural Framework for Placement of Asychronous I/O Operations (1995)
Agrawal, Gagan, Acharya, Anurag, Saltz, Joel
Overlapping memory accesses with computations is a standard technique for improving performance on modern architectures, which have deep memory hierarchies. In this paper, we present a compiler...
Compiler and Runtime Support for Programming in Adaptive Parallel Environments (1995)
Edjlali, Guy, Agrawal, Gagan, Sussman, Alan, Humphries, Jim, Saltz, Joel
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Compiler and Runtime Support for Programming in Adaptive Parallel Environments (1995)
Edjlali, Guy, Agrawal, Gagan, Sussman, Alan, Humphries, Jim, Saltz, Joel
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Agrawal, Gagan, Saltz, Joel, Das, Raja
Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redundant code...
Interprocedural Compilation of Irregular Applications for Distributed Memory Machines (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Agrawal, Gagan, Saltz, Joel, Das, Raja
Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redundant code...
Interprocedural Compilation of Irregular Applications for Distributed Memory Machines (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Data parallel programming in an adaptive environment (1995)
Guy Edjlali, Gagan Agrawal, Alan Sussman Y, Joel Saltz Y
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Interprocedural compilation of irregular applications for distributed memory machines (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Gagan Agrawal, Joel Saltz, Raja Das
Partial Redundancy Elimination #PRE# is a general scheme for suppressing partial redundancies which encompasses traditional optimizations likeloopinvariant code motion and redundant code elimination....
Interprocedural Compilation of Irregular Applications for Distributed Memory Machines (1995)
Data parallel languages like High Performance Fortran #HPF# are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Data Parallel Programming in An Adaptive Environment (1995)
Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel Saltz
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Interprocedural Compilation of Irregular Applications for Distributed Memory Machines (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Gagan Agrawal, Alan Sussman, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular...
Gagan Agrawal, Alan Sussman, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular...
Gagan Agrawal, Joel Saltz, Raja Das
Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redundant code...
An Interprocedural Framework for Placement of Asynchronous I/O Operations (1995)
Gagan Agrawal, Anurag Acharya, Joel Saltz
Overlapping memory accesses with computations is a standard technique for improving performance on modern architectures, which have deep memory hierarchies. In this paper, we present a compiler...
Compiler and Runtime Support for Programming in Adaptive Parallel Environments (1995)
Guy Edjlali, Gagan Agrawal, Alan Sussman, Jim Humphries, Joel Saltz
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Coding Based Replication Schemes for Distributed Systems (1995)
Data is often replicated in distributed systems to improve availability and performance. This replication is expensive in terms of disk storage since the existing schemes generally require full files...
Interprocedural Compilation of Irregular Applications for Distributed Memory Machines (1995)
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Gagan Agrawal, Alan Sussman, Joel Saltz
In compiling applications for distributed memory machines, runtime analysis is required when data to be communicated cannot be determined at compile-time. One such class of applications requiring...
Interprocedural Compilation of Irregular Applications for Distributed Memory Machines (1995)
Gagan Agrawal, Gagan Agrawal, Joel Saltz, Joel Saltz
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the...
Data Parallel Programming in an Adaptive Environment (1994)
Edjlali, Guy, Agrawal, Gagan, Sussman, Alan, Saltz, Joel
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Data Parallel Programming in an Adaptive Environment (1994)
Edjlali, Guy, Agrawal, Gagan, Sussman, Alan, Saltz, Joel
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss...
Efficient Runtime Support for Parallelizing Block Structured Applications (1994)
Gagan Agrawal, Alan Sussman, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular...
Saltzg Cs Umd, Gagan Agrawal, Alan Sussman, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid or adaptive codes) and/or irregularly coupled(called Irregularly CoupledRegular...
Gagan Agrawal, Alan Sussman, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid or adaptive codes) and/or irregularly coupled ( called Multiblock Problems or...
Gagan Agrawal, Gagan Agrawal, Alan Sussman, Alan Sussman, Joel Saltz, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular...
Compiler and Runtime Support for Structured and Block Structured Applications (1993)
Gagan Agrawal, Alan Sussman, Joel Saltz
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid or adaptive codes) and/or irregularly coupled (called Irregularly Coupled Regular...
An Efficient Protocol for Voting in Distributed Systems (1992)
In distributed systems, data can be replicated to improve availability and performance. Many algorithms have been proposed to coordinate access to replicated data. Most of these algorithms require...
Using Coding to Support Data Resiliency in Distributed Systems (1992)
Data is often replicated in distributed systems to improve availability and performance. This replication is expensive in terms of disk storage since the existing schemes generally require full files...
Compiling Object-Oriented Data Intensive Applications
Renato Ferreira, Gagan Agrawal, Joel Saltz
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scienti#c research. High-level language and compiler support for developing applications that...
Availability of Coding Based Replication Schemes
Data is often replicated in distributed systems to improve availability and performance. This replication is expensive in terms of disk storage requirements since the existing schemes require full...