[Lustre-devel] create performance
adilger at sun.com
Wed Jun 3 02:50:47 PDT 2009
On Jun 02, 2009 14:38 -0500, Nicolas Williams wrote:
> On Mon, Mar 09, 2009 at 12:05:34AM -0600, 'Andreas Dilger' wrote:
> > On Mar 06, 2009 13:25 +0000, Eric Barton wrote:
> > > OST object placement is a hard problem with conflicting requirements
> > > including...
> > >
> > > 1. Even server space balance
> > > 2. Even server load balance
> > > 3. Minimal network congestion
> > > 4. Scalable ultra-wide file layout descriptor
> > > 5. Scalable placement algorithm
> > >
> > > Implementing a placement algorithm with a centralized server clearly
> > > isn't scalable and will have to be reworked for CMD. A starting
> > > point might be to explore how to ensure CROW goes some way to
> > > satisfy requirements 1-3 above.
> CROW should satisfy #4 easily because it would allow us to have the same
> OST-side FID for all stripes of a file, which combined with a
> compression of the stripe configuration of the file (the ordered list of
> OSTs) should result in fixed-sized FID for all files. (For compat,
> small FIDs can be expanded when talking to old clients.)
CROW itself isn't required for wide striping. It is possible to allocate
FID sequences to OSTs in a manner that will allow widely striped files
to be specified in a compact manner.
The main problem with widely-striped files is that they add overhead to
file IO operations, because the client might potentially have to get
hundreds or thousands of locks per file.
> CROW should be mostly orthogonal to #1-3 and #5 though, except that a
> good compression technique for the stripe configuration might make it
> easier to get even server space and load balance. Imagine an algorithm
> that takes a list of OSTs, stripe count and index as inputs and quickly
> outputs an ordered list of <strip-count> OSTs, such that for each index
> value you get a pseudo-random permutation of a pseudo-randomly picked
> combination of <strip-count> OSTs. Then we could monotonically
> increment that index as a way to generate the next new file's placement.
> For this use an LFSR would be a perfect way to get pseudo-randomness (we
> don't need cryptographic strength for this purpose). The index becomes
> a seed for the LFSR. We might need two indexes, actually, one for the
> combination of OSTs and one for the permutation thereof. With a
> pseudo-random distribution of combinations and permutations we ought to
> get a fair distribution of data and load.
In our previous testing, any kind of random OST selection is sub-optimal
compared to round robin. The problem is that RNG/PRNG OST selection,
while uniform on average, is definitely non-uniform locally, and this
results in non-uniform OST selection and clients competing for OSS/OST
For example, if 100 MPI clients are creating 100 files on 100 OSTs, then
on average there would be 1 file/OST, but typically some OSTs will have 2
or 3 OSTs, while others are idle. This will result in IO being 2-3x
slower on those OSTs, and often result in the entire IO being slower 2-3x.
While we do something similar to this for the case of unbalanced OSTs,
we want to move to a round-robin scheme even in the case of unbalanced
OSTs. This would use an "freespace accumulator" similar to a Bresenham
line algorithm, so that OSTs which are below the average freespace will
be skipped until their "accumulated freespace" is temporarily above average.
> > > BTW, I've long believed that it's a mistake not to give Lustre any
> > > inkling that all the creates done by a FPP parallel application are
> > > somehow related - e.g. via a cluster-wide job identifier. Surely
> > > file-per-process placement is very close to shared file placement
> > > (minus extent locking conflicts :)?
> > Yes, I agree. In theory it should be possible to extract this kind
> > of information from the client processes themselves, either by
> > examining the process environment (some MPI job launchers store the
> > MPI rank there for pre-launch shell scripts) or by comparing the
> > filenames being created by the clients. Any file-per-process job
> > will invariably create filenames with the rank in the filename.
> Sounds like a good idea, and configurable via regexes (ick, I know).
> Even better would be a way to associate a cluster job ID with a set of
> processes. This could be done via Linux keyrings, say.
This is probably easiest to start with MPI-IO ADIO ioctls directly to
Lustre. Once we know it helps we can look at other mechanisms to get
this information from applications that don't use MPI-IO.
Sr. Staff Engineer, Lustre Group
Sun Microsystems of Canada, Inc.
More information about the lustre-devel