Adaptive Sector Grouping to Reduce False Sharing in Distributed RAID

  • Authors:

  • Hai Jin;Kai Hwang

  • Affiliations:

  • College of Computer, Hvazhong University of Science and Technology, Wuhan, 430074, China;Internet and Cluster Computing Laboratory, University of Southern California, Los Angeles, CA 90089, USA

  • Venue:
  • Cluster Computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed iredundant array of inexpensive disks (RAID) is often embedded in a cluster architecture. In a centralized RAID subsystem, the false sharing problem does not exist, because the disk array allows only mutually exclusive access by one user at a time. However, the problem does exist in a distributed RAID architecture, because multiple accesses may occur simultaneously in a distributed environment. This problem will seriously limit the effectiveness of collective I/O operations in network-based, cluster computing. Traditional accesses to disks in a RAID are done at block level. The block granularity is large, say 32 KB, often resulting in false sharing among fragments in the block. The false sharing problem becomes worse when the block size or the stripe unit becomes too large. To solve this problem, we propose an adaptive sector grouping approach to accessing a distributed RAID. Each sector has a fine grain of 512 B. Multiple sectors are grouped together to match with the data block size. The grouped sector has a variable size that can be adaptively adjusted by software. Benchmark experiments reveal the positive effects of this adaptive access scheme on the performance of a RAID. Our scheme can reduce the collective I/O access time without increasing the buffer size. Both theoretical analysis and experimental results demonstrate the performance gain in using grouped sectors for fast access of distributed RAID.