Method and apparatus for determining volume swaps

A method executed in a computer system for matching at least one logical volume with a unique alternate storage location comprising:

• representing each of said at least one logical volume and each of at least one alternate storage location as a vertex in a graph;
• determining which of said at least one alternate storage location are candidates for each of said at least one logical volume and representing a relationship between said each logical volume and each of said at least one alternate storage location as an edge in said graph;
• determining, using a bipartite graph matching technique for each of said at least one logical volume, a unique one of said at least one alternate storage location;
• and
• wherein said at least one logical volume is a plurality of logical volumes, and said at least one alternate storage location is a plurality of alternate storage locations;
• and
• the method further comprising:
• using a maximum flow technique for matching each of said plurality of logical volumes to a unique one of said plurality of alternate storage locations.

A computer readable medium for storing computer executable code for matching at least one logical volume with a unique alternate storage location comprising:

• computer executable code for representing each of said at least one logical volume and each of at least one alternate storage location as a vertex in a graph;
• computer executable code for determining which of said at least one alternate storage location are candidates for each of said at least one logical volume and representing a relationship between said each logical volume and each of said at least one alternate storage locations identified as a candidate for said each logical volume as an edge in said graph;
• and
• computer executable code for determining, from said candidates and using a bipartite graph matching technique for each of said at least one logical volume, a unique one of said at least one alternate storage locations.

A computer readable medium for storing computer executable code for matching at least one logical volume with a unique alternate storage location comprising:

• computer executable code for representing each of said at least one logical volume and each of at least one alternate storage location as a vertex in a graph;
• computer executable code for determining which of said at least one alternate storage location are candidates for each of said at least one logical volume and representing a relationship between said each logical volume and each of said at least one alternate storage locations as an edge in said graph;
• computer executable code for determining, using a bipartite graph matching technique for each of said at least one logical volume, a unique one of said at least one alternate storage locations;
• and
• wherein said at least one logical volume is a plurality of logical volumes, and said at least one alternate storage location is a plurality of alternate storage locations;
• and
• the computer program product further comprising:
• computer executable code for executing a maximum flow technique for matching each of said plurality of logical volumes to a unique one of said plurality of storage locations.