Disk array is a high performance storage system for exploiting intra-request concurrence and inter-request parallelism.Load balance among disks is necessary for better inter-request parallelism

and an I/O request should be served by multiple disks for intra-request concurrence.This can be achieved for optimal data placement.But file access pattern is changing.System should redistribute data blocks adaptively.In this paper

we present a strategy of balanced hypergraph-based adaptive data placement

and give two objective functions for the optimization of both load balance and intra-request concurrence.We have done lots of simulations to evaluate our method and compare it with traditional optimization strategies such as adaptive load-balance and hyper-graph placement for intra-request concurrency.The result manifests that our strategy is a useful one.