Managing access to shared resources

A system for managing access to shared resources, comprising:

• a processor configured to:
• receive a request indicating that an operation requires access a specific shared resource of a first category and a minimum number of shared resource of a second category, the minimum number being at least one, wherein the operation is decomposed into a plurality of tasks;
• associate the operation with a lock in a lock queue that is associated with the specific shared resource of the first category;
• and
• determine whether the specific shared resource of the first category is accessible to the operation;
• and
• determine whether the operation is ready to be executed, the determination being based at least in part on whether the minimum number of shared resources of the second category are accessible to the operation;
• in the event that the specific shared resource of the first category is available, gain access to the minimum number of shared resources of the second category;
• begin to execute at least one of the plurality of tasks once the minimum number of shared resources of the second category become available to the operation;
• and
• compete for additional shared resources of the second category beyond the minimum number and up to a maximum allowed number to be used by successive tasks;
• and
• a memory coupled to the processor, configured to provide the processor with instructions.

A computer program product for managing access to shared resources, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for:

• receiving a request indicating that an operation requires access to a specific shared resource of a first category and a minimum number of shared resources of a second category, the minimum number being at least one, wherein the operation is decomposed into a plurality of tasks;
• associating the operation with a lock in a lock queue that is associated with the specific shared resource of the first category;
• determining whether the specific shared resource of the first category is accessible to the operation;
• and
• determining whether the operation is ready to be executed, the determination being based at least in part on whether the minimum number of shared resources of the second category are accessible to the operation;
• in the event that the specific shared resource of the first category is available, gaining access to the minimum number of shared resources of the second category;
• beginning to execute at least one of the plurality of tasks once the minimum number of shared resources of the second category become available to the operation;
• and
• competing for additional shared resources of the second category beyond the minimum number and up to a maximum allowed number to be used by successive tasks.