System and method for reduced lock contention and improved performance
A method, computer program product, and computer system for setting a preferred alignment value to a size of an address space mapped by one or more root pages. An allocation request may be received for the address space. A binary buddy allocation scheme may be executed to allocate an extent for the allocation request based upon, at least in part, the preferred alignment value.
1. A computer-implemented method comprising:
setting a preferred alignment value to a size of an address space mapped by one or more root pages, wherein the address space includes one or more volumes, and wherein each volume of the one or more volumes is distributed to a different root indirect block page of the one or more root pages based upon, at least in part, the preferred alignment value being set to the size of the address space mapped by the one or more root pages;
receiving an allocation request for the address space; and
executing a binary buddy allocation scheme to allocate an extent for the allocation request based upon, at least in part, the preferred alignment value, wherein executing the binary buddy allocation scheme includes
searching allocatable blocks in the address space to determine if the extent matches the preferred alignment value.
2. The computer-implemented method of claim 1 wherein a remainder of the address space associated with the extent is freed.
3. The computer-implemented method of claim 1 further comprising one of iteratively splitting the extent into smaller blocks when the extent matches the preferred alignment value and iteratively splitting a larger extent with a larger alignment value into smaller blocks when the extent does not match the preferred alignment value.
4. The computer-implemented method of claim 1 further comprising utilizing a next smaller power of the preferred alignment value when the extent does not match the preferred alignment value.
5. The computer-implemented method of claim 1 further comprising adding additional volumes to the one or more volumes, wherein the additional volumes created in the address space are spread uniformly through the one or more root pages.
6. A computer program product residing on a non-transitory computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, causes at least a portion of the one or more processors to perform operations comprising:
setting a preferred alignment value to a size of an address space mapped by one or more root pages, wherein the address space includes one or more volumes, and wherein each volume of the one or more volumes is distributed to a different root indirect block page of the one or more root pages based upon, at least in part, the preferred alignment value being set to the size of the address space mapped by the one or more root pages;
receiving an allocation request for the address space; and
executing a binary buddy allocation scheme to allocate an extent for the allocation request based upon, at least in part, the preferred alignment value, wherein executing the binary buddy allocation scheme includes
searching allocatable blocks in the address space to determine if the extent matches the preferred alignment value.
7. The computer program product of claim 6 wherein a remainder of the address space associated with the extent is freed.
8. The computer program product of claim 6 wherein the operations further comprise one of iteratively splitting the extent into smaller blocks when the extent matches the preferred alignment value and iteratively splitting a larger extent with a larger alignment value into smaller blocks when the extent does not match the preferred alignment value.
9. The computer program product of claim 6 wherein the operations further comprise utilizing a next smaller power of the preferred alignment value when the extent does not match the preferred alignment value.
10. The computer program product of claim 6 further comprising adding additional volumes to the one or more volumes, wherein the additional volumes created in the address space are spread uniformly through the one or more root pages.
11. A computing system including one or more processors and one or more memories configured to perform operations comprising:
setting a preferred alignment value to a size of an address space mapped by one or more root pages, wherein the address space includes one or more volumes, and wherein each volume of the one or more volumes is distributed to a different root indirect block page of the one or more root pages based upon, at least in part, the preferred alignment value being set to the size of the address space mapped by the one or more root pages;
receiving an allocation request for the address space; and
executing a binary buddy allocation scheme to allocate an extent for the allocation request based upon, at least in part, the preferred alignment value, wherein executing the binary buddy allocation scheme includes
searching allocatable blocks in the address space to determine if the extent matches the preferred alignment value.
12. The computing system of claim 11 wherein a remainder of the address space associated with the extent is freed.
13. The computing system of claim 11 wherein the operations further comprise one of iteratively splitting the extent into smaller blocks when the extent matches the preferred alignment value and iteratively splitting a larger extent with a larger alignment value into smaller blocks when the extent does not match the preferred alignment value.
14. The computing system of claim 11 wherein the operations further comprise utilizing a next smaller power of the preferred alignment value when the extent does not match the preferred alignment value.
15. The computing system of claim 11 wherein the operations further comprise adding additional volumes to the one or more volumes, wherein the additional volumes created in the address space are spread uniformly through the one or more root pages.