Circumventing queue downtime in a queue damage scenario
AssigneeInternational Business Machines Corporation
InventorsMaya Anilson, Vasu Gajendran, Savitha Joshi, Abhilash Divakaran Pillai
Life of this patent
Estimating the term…
Abstract
An approach is provided where a put request is received to put a data entry into a queue. A detection is made that a primary queue data structure corresponding to the queue is damaged. If an alternate queue data structure corresponding to the queue has not yet been created, then the alternate queue data structure is dynamically created. The data entry is then stored in the alternate queue data structure.
Claims20
A computer implemented method comprising:
- receiving a put request to put a data entry into a queue;
- detecting that a primary queue data structure corresponding to the queue is damaged;
- in response to detecting that the primary queue data structure is damaged, determining whether an alternate queue data structure has been created that corresponds to the queue, wherein the alternate queue data structure is different than the primary queue data structure;
- in response to the determination being that the alternate queue data structure is nonexistent:
- dynamically creating the alternate queue data structure;
- and
- storing the data entry in the dynamically created alternate queue data structure;
- and
- in response to the determination being that the alternate queue data structure already exists:
- storing the data entry in the alternate queue data structure.
An information handling system comprising:
- one or more processors;
- a memory coupled to at least one of the processors;
- a set of instructions stored in the memory and executed by at least one of the processors in order to perform actions of:
- receiving a put request to put a data entry into a queue;
- detecting that a primary queue data structure corresponding to the queue is damaged;
- in response to detecting that the primary queue data structure is damaged, determining whether an alternate queue data structure has been created that corresponds to the queue, wherein the alternate queue data structure is different than the primary queue data structure;
- in response to the determination being that the alternate queue data structure is nonexistent:
- dynamically creating the alternate queue data structure;
- and
- storing the data entry in the dynamically created alternate queue data structure;
- and
- in response to the determination being that the alternate queue data structure already exists:
- storing the data entry in the alternate queue data structure.
A computer program product stored in a computer readable storage device, comprising functional descriptive material that, when executed by an information handling system, causes the information handling system to perform actions that include:
- receiving a put request to put a data entry into a queue;
- detecting that a primary queue data structure corresponding to the queue is damaged;
- in response to detecting that the primary queue data structure is damaged, determining whether an alternate queue data structure has been created that corresponds to the queue, wherein the alternate queue data structure is different than the primary queue data structure;
- in response to the determination being that the alternate queue data structure is nonexistent:
- dynamically creating the alternate queue data structure;
- and
- storing the data entry in the dynamically created alternate queue data structure;
- and
- in response to the determination being that the alternate queue data structure already exists:
- storing the data entry in the alternate queue data structure.
Dependencies are inferred from the claim text.