INCREASED PARALLELIZATION EFFICIENCY IN TIERING ENVIRONMENTS

• US 20200133872A1
• Filed: 01/02/2020
• Published: 04/30/2020
• Est. Priority Date: 09/12/2018
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Gokhale, Amey, Nair, Ranjith R., Patil, Sandeep R., Eda, Sasikanth
• Granted Patent: US 11,194,727 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 11/1448 Management of the data involved in backup or backup restore
• CPC Class Codes: G06F 11/1461 Backup scheduling policy
• CPC Class Codes: G06F 12/02 Addressing or allocation; Relocation program address sequencing G06F9/00; arrangements for selecting an address in a digital store G11C8/00
• CPC Class Codes: G06F 12/06 Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication G06F12/08 takes precedence
• CPC Class Codes: G06F 12/08 in hierarchically structured memory systems, e.g. virtual memory systems
• CPC Class Codes: G06F 12/0884 Parallel mode, e.g. in parallel with main memory or CPU
• CPC Class Codes: G06F 12/0897 with two or more cache hierarchy levels with multilevel cache hierarchies G06F12/0811
• CPC Class Codes: G06F 2201/825 the problem or solution involving locking
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/0685 Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays

Abstract

A computer-implemented method, according to one embodiment, includes: identifying block addresses which are associated with a given object, and combining the block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses. A first portion of the block addresses is transitioned to a second set, where the first portion includes ones of the block addresses determined as having a token currently issued thereon. Moreover, a second portion of the block addresses is divided into equal chunks, where the second portion includes the block addresses remaining in the first set. The chunks in the first set are allocated across two or more parallelization units. Furthermore, the block addresses in the second set are divided into equal chunks, and the chunks in the second set are allocated to at least one dedicated parallelization unit.

Claims

1. A computer-implemented method, comprising:

identifying block addresses which are associated with a given object;

combining the block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses;

transitioning a first portion of the block addresses to a second set, wherein the first portion includes ones of the block addresses determined as having a token currently issued thereon;

dividing a second portion of the block addresses into equal chunks, wherein the second portion includes the block addresses remaining in the first set;

allocating the chunks in the first set across two or more parallelization units;

dividing the block addresses in the second set into equal chunks; and

allocating the chunks in the second set to at least one dedicated parallelization unit.

2. The computer-implemented method of claim 1, comprising:

dividing the identified block addresses into equal chunks in response to determining that tokens are not currently issued on any of the identified block addresses; and

allocating the chunks across the two or more parallelization units and the at least one dedicated parallelization unit.

3. The computer-implemented method of claim 1, wherein tokens are issued on block addresses by one or more selected nodes, wherein the one or more nodes are selected from nodes that have been designated as managers.

4. The computer-implemented method of claim 1, wherein the given object corresponds to a data access request received from a remote storage location.

5. The computer-implemented method of claim 4, wherein each of the two or more parallelization units perform a portion of the data access request which corresponds to the chunks of the given object allocated thereto, in parallel.

6. The computer-implemented method of claim 1, wherein the token is a byte-range lock or a Portable Operating System Interface (POSIX) lock.

7. The computer-implemented method of claim 1, wherein the operations are performed by a processor included at a cloud storage location of a cloud tiering environment.

8. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable and/or executable by a processor to cause the processor to perform a method comprising:

identifying, by the processor, block addresses which are associated with a given object;

combining, by the processor, the block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses;

transitioning, by the processor, a first portion of the block addresses to a second set, wherein the first portion includes ones of the block addresses determined as having a token currently issued thereon;

dividing, by the processor, a second portion of the block addresses into equal chunks, wherein the second portion includes the block addresses remaining in the first set;

allocating, by the processor, the chunks in the first set across two or more parallelization units;

dividing, by the processor, the block addresses in the second set into equal chunks; and

allocating, by the processor, the chunks in the second set to at least one dedicated parallelization unit.

9. The computer program product of claim 8, the program instructions readable and/or executable by the processor to cause the processor to perform the method comprising:

dividing, by the processor, the identified block addresses into equal chunks in response to determining that tokens are not currently issued on any of the identified block addresses; and

allocating, by the processor, the chunks across the two or more parallelization units and the at least one dedicated parallelization unit.

10. The computer program product of claim 8, wherein tokens are issued on block addresses by one or more selected nodes, wherein the one or more nodes are selected from nodes that have been designated as managers.

11. The computer program product of claim 8, wherein the given object corresponds to a data access request received from a remote storage location.

12. The computer program product of claim 11, wherein each of the two or more parallelization units perform a portion of the data access request which corresponds to the chunks of the given object allocated thereto, in parallel.

13. The computer program product of claim 8, wherein the token is a byte-range lock or a Portable Operating System Interface (POSIX) lock.

14. The computer program product of claim 8, wherein the processor is included at a cloud storage location of a cloud tiering environment.

15. A system, comprising:

a processor; and

logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to;

identify, by the processor, block addresses which are associated with a given file;

combine, by the processor, the block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses;

transition, by the processor, a first portion of the block addresses to a second set, wherein the first portion includes ones of the block addresses determined as having a token currently issued thereon;

divide, by the processor, a second portion of the block addresses into equal chunks, wherein the second portion includes the block addresses remaining in the first set;

allocate, by the processor, the chunks in the first set across two or more parallelization units;

divide, by the processor, the block addresses in the second set into equal chunks; and

allocate, by the processor, the chunks in the second set to at least one dedicated parallelization unit.

16. The system of claim 15, the logic being configured to:

divide, by the processor, the identified block addresses into equal chunks in response to determining that tokens are not currently issued on any of the identified block addresses; and

allocate, by the processor, the chunks across the two or more parallelization units and the at least one dedicated parallelization unit.

17. The system of claim 15, wherein tokens are issued on block addresses by one or more selected nodes, wherein the one or more nodes are selected from nodes that have been designated as managers.

18. The system of claim 15, wherein the given file corresponds to a data access request received from a remote storage location.

19. The system of claim 18, wherein each of the two or more parallelization units perform a portion of the data access request which corresponds to the chunks of the given file allocated thereto, in parallel.

20. The system of claim 15, wherein the token is a byte-range lock or a Portable Operating System Interface (POSIX) lock.