The Experts below are selected from a list of 156 Experts worldwide ranked by ideXlab platform

A L N Reddy - One of the best experts on this subject based on the ideXlab platform.

  • user centric data migration in Networked Storage systems
    International Parallel and Distributed Processing Symposium, 2008
    Co-Authors: Sukwoo Kang, A L N Reddy
    Abstract:

    This paper considers the problem of balancing locality and load in Networked Storage systems with multiple Storage devices (or bricks). Data distribution affects locality and load balance across the devices in a Networked Storage system. This paper proposes a user-centric data migration scheme which tries to balance locality and load in such Networked Storage systems. The presented approach automatically and transparently manages migration of data blocks among disks as data access patterns and loads change over time. We implemented a prototype system, embodying our ideas, on PCs running Linux. This paper presents the design of user-centric migration and an evaluation of it through realistic experiments.

  • IPDPS - User-centric data migration in Networked Storage systems
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Sukwoo Kang, A L N Reddy
    Abstract:

    This paper considers the problem of balancing locality and load in Networked Storage systems with multiple Storage devices (or bricks). Data distribution affects locality and load balance across the devices in a Networked Storage system. This paper proposes a user-centric data migration scheme which tries to balance locality and load in such Networked Storage systems. The presented approach automatically and transparently manages migration of data blocks among disks as data access patterns and loads change over time. We implemented a prototype system, embodying our ideas, on PCs running Linux. This paper presents the design of user-centric migration and an evaluation of it through realistic experiments.

Chuanyi Liu - One of the best experts on this subject based on the ideXlab platform.

  • performance comparison of ip Networked Storage
    Tsinghua Science & Technology, 2009
    Co-Authors: Chuanyi Liu, Dongsheng Wang, Hong Liu, Zhizhong Tang
    Abstract:

    Abstract Dramatically increasing amounts of digital data are placing huge requirements on Storage systems. IP-Networked Storage systems, such as the network file system (NFS)-based network-attached Storage (NAS) systems and the iSCSI-Storage area network (SAN) systems, have become increasingly common in today's local area network (LAN) environments. The emergence of new Storage techniques, such as object-based Storage (OBS) and content aware Storage (CAS), significantly improves the functionality of Storage devices to meet further needs for Storage sub-systems. However, these may impact system performance. This paper compares the performance of NFS, iSCSI Storage, object-based Storage devices (OSDs), and CAS-based Storage systems in an environment with no data sharing across host machines. A gigabit ethernet network is used as the Storage network. Test results demonstrate that the performances of these systems are comparable with CAS being much better than the others for write operations. The performance bottlenecks in these systems are analyzed to provide insight into how future Storage systems may be improved and possible optimization methods. The analysis shows how the I/O interfaces in these systems affect the application performance and that network-based Storage systems require optimized I/O latency and reduced network and buffer processing in the servers.

  • qos scheduling for Networked Storage system
    International Conference on Distributed Computing Systems, 2008
    Co-Authors: Chuanyi Liu, Xianbo Zhang
    Abstract:

    Networked Storage incorporates networking technology and Storage technology, greatly extending the reach of the Storage subsystem. In this paper, we present a novel Quality of Service (QoS) scheduling scheme to satisfy the requirements of different QoS requests for access to the Networked Storage system. Our key ideas include breaking down the requests into appropriate chunks of smaller sizes and taking the network characteristics into consideration such that 1) each session channel has smoother data access, 2) resource requirements such as buffer usage are reduced, and 3) more urgent requests can preempt a less urgent request. Our experimental results show that our scheme is effective in obtaining these goals.

  • ICDCS - QoS Scheduling for Networked Storage System
    2008 The 28th International Conference on Distributed Computing Systems, 2008
    Co-Authors: Chuanyi Liu, Xianbo Zhang
    Abstract:

    Networked Storage incorporates networking technology and Storage technology, greatly extending the reach of the Storage subsystem. In this paper, we present a novel Quality of Service (QoS) scheduling scheme to satisfy the requirements of different QoS requests for access to the Networked Storage system. Our key ideas include breaking down the requests into appropriate chunks of smaller sizes and taking the network characteristics into consideration such that 1) each session channel has smoother data access, 2) resource requirements such as buffer usage are reduced, and 3) more urgent requests can preempt a less urgent request. Our experimental results show that our scheme is effective in obtaining these goals.

Xianbo Zhang - One of the best experts on this subject based on the ideXlab platform.

  • qos scheduling for Networked Storage system
    International Conference on Distributed Computing Systems, 2008
    Co-Authors: Chuanyi Liu, Xianbo Zhang
    Abstract:

    Networked Storage incorporates networking technology and Storage technology, greatly extending the reach of the Storage subsystem. In this paper, we present a novel Quality of Service (QoS) scheduling scheme to satisfy the requirements of different QoS requests for access to the Networked Storage system. Our key ideas include breaking down the requests into appropriate chunks of smaller sizes and taking the network characteristics into consideration such that 1) each session channel has smoother data access, 2) resource requirements such as buffer usage are reduced, and 3) more urgent requests can preempt a less urgent request. Our experimental results show that our scheme is effective in obtaining these goals.

  • ICDCS - QoS Scheduling for Networked Storage System
    2008 The 28th International Conference on Distributed Computing Systems, 2008
    Co-Authors: Chuanyi Liu, Xianbo Zhang
    Abstract:

    Networked Storage incorporates networking technology and Storage technology, greatly extending the reach of the Storage subsystem. In this paper, we present a novel Quality of Service (QoS) scheduling scheme to satisfy the requirements of different QoS requests for access to the Networked Storage system. Our key ideas include breaking down the requests into appropriate chunks of smaller sizes and taking the network characteristics into consideration such that 1) each session channel has smoother data access, 2) resource requirements such as buffer usage are reduced, and 3) more urgent requests can preempt a less urgent request. Our experimental results show that our scheme is effective in obtaining these goals.

Kannan Ramchandran - One of the best experts on this subject based on the ideXlab platform.

  • decentralized erasure codes for distributed Networked Storage
    arXiv: Information Theory, 2006
    Co-Authors: Alexandros G Dimakis, Vinod M Prabhakaran, Kannan Ramchandran
    Abstract:

    We consider the problem of constructing an erasure code for Storage over a network when the data sources are distributed. Specifically, we assume that there are n Storage nodes with limited memory and kStorage nodes and be able to retrieve the data. We introduce Decentralized Erasure Codes, which are linear codes with a specific randomized structure inspired by network coding on random bipartite graphs. We show that decentralized erasure codes are optimally sparse, and lead to reduced communication, Storage and computation cost over random linear coding.

  • decentralized erasure codes for distributed Networked Storage
    IEEE Transactions on Information Theory, 2006
    Co-Authors: Alexandros G Dimakis, Vinod M Prabhakaran, Kannan Ramchandran
    Abstract:

    In this correspondence, we consider the problem of constructing an erasure code for Storage over a network when the data sources are distributed. Specifically, we assume that there are n Storage nodes with limited memory and k < n sources generating the data. We want a data collector, who can appear anywhere in the network, to query any k Storage nodes and be able to retrieve the data. We introduce decentralized erasure codes, which are linear codes with a specific randomized structure inspired by network coding on random bipartite graphs. We show that decentralized erasure codes are optimally sparse, and lead to reduced communication, Storage and computation cost over random linear coding.

  • distributed fountain codes for Networked Storage
    International Conference on Acoustics Speech and Signal Processing, 2006
    Co-Authors: Alexandros G Dimakis, Vinod M Prabhakaran, Kannan Ramchandran
    Abstract:

    We investigate the problem of constructing fountain codes for distributed Storage in sensor networks. Specifically, we assume that there are n Storage nodes with limited memory and k < n data nodes generating the data by sensing the environment. We want a data collector who can appear anywhere in the network, to query any k + epsi Storage nodes and be able to retrieve almost all the data packets. We demonstrate how it is possible to solve this problem by using a specific kind of fountain code that requires only linear communication and decoding complexity. Further, for a grid topology, we propose a randomized algorithm that constructs the fountain code over a network using only geographical knowledge and local decisions. A key step in the analysis of our algorithm is a novel result concerning random walks on finite grids with traps

Sukwoo Kang - One of the best experts on this subject based on the ideXlab platform.

  • user centric data migration in Networked Storage systems
    International Parallel and Distributed Processing Symposium, 2008
    Co-Authors: Sukwoo Kang, A L N Reddy
    Abstract:

    This paper considers the problem of balancing locality and load in Networked Storage systems with multiple Storage devices (or bricks). Data distribution affects locality and load balance across the devices in a Networked Storage system. This paper proposes a user-centric data migration scheme which tries to balance locality and load in such Networked Storage systems. The presented approach automatically and transparently manages migration of data blocks among disks as data access patterns and loads change over time. We implemented a prototype system, embodying our ideas, on PCs running Linux. This paper presents the design of user-centric migration and an evaluation of it through realistic experiments.

  • IPDPS - User-centric data migration in Networked Storage systems
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Sukwoo Kang, A L N Reddy
    Abstract:

    This paper considers the problem of balancing locality and load in Networked Storage systems with multiple Storage devices (or bricks). Data distribution affects locality and load balance across the devices in a Networked Storage system. This paper proposes a user-centric data migration scheme which tries to balance locality and load in such Networked Storage systems. The presented approach automatically and transparently manages migration of data blocks among disks as data access patterns and loads change over time. We implemented a prototype system, embodying our ideas, on PCs running Linux. This paper presents the design of user-centric migration and an evaluation of it through realistic experiments.