Now showing items 1-7 of 7

    • Analysis of simple randomized buffer management for parallel I/O 

      Kallahalla, Mahesh; Varman, Peter J. (2004-04)
      Buffer management for a D-disk parallel I/O system is considered in the context of randomized placement of data on the disks. A simple prefetching and caching algorithm PHASE-LRU using bounded lookahead is described and ...
    • ASP: Adaptive Online Parallel Disk Scheduling 

      Kallahalla, Mahesh; Varman, Peter J. (1999)
      In this work we address the problems of prefetching and I/O scheduling for read-once reference strings in a parallel I/O system. We use the standard parallel disk model with D disks a shared I/O bu er of sizeM. We ...
    • Competitive Parallel Disk Prefetching and Buffer Management1 

      Barve, Rakesh; Kallahalla, Mahesh; Varman, Peter J. (2000)
      We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel IrO systems, using a read-once model of block references. This has widespread applicability to key IrO-bound ...
    • Competitive prefetching and buffer management for parallel I/O systems 

      Kallahalla, Mahesh (1997)
      In this thesis we study prefetching and buffer management algorithms for parallel I/O systems. Two models of lookahead, global and local, which give limited information regarding future accesses are introduced. Two ...
    • PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems 

      Kallahalla, Mahesh; Varman, Peter J. (2002-11)
      Abstract—We address the problem of prefetching and caching in a parallel I/O system and present a new algorithm for parallel disk scheduling. Traditional buffer management algorithms that minimize the number of block misses ...
    • Prefetching and buffer management for parallel I/O systems 

      Kallahalla, Mahesh (2000)
      In parallel I/O systems the I/O buffer can be used to improve I/O parallelism by improving I/O latency by caching blocks to avoid repeated disk accesses for the same block, and also by buffering prefetched blocks and making ...
    • Randomized Parallel Prefetching and Buffer Management 

      Kallahalla, Mahesh; Varman, Peter J. (1999)
      We show that deterministic algorithms using bounded lookahead cannot fully exploit the potential of a parallel I/O system. Randomization can be used to significantly improve the performance of parallel prefetching and ...