EP0623877A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
System and method for storing persistent and non-persistent queued data
Assignee: International Business Machines Corp
•
Filing: 1994-03-29
•
Granted: —
•
Expires: 2014-03-29
Abstract
Abstract Disclosed is a method for the storage of data which is required to survive a system failure (persistent data) and data which is not required to survive a system failure (non-persistent data) on a single queue. Individual pages of memory are allocated to the storage of non-persistent data only or persistent data only. Details of changes made to persistent data only are recorded in a log. In the event of a system failure, the queue can have the persistent data only recovered by checking individual pages, without the necessity of scanning individual entries within those pages.
Inventors
- 👤 Richard Dievendorff
- 👤 Chandrasekaran Mohan
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-02 18:10
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/546; G06F11/00; G06F11/07; G06F11/14; G06F11/1402; G06F11/1415; G06F11/1441; G06F5/00; G06F5/06; G06F5/065
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
84 words
A method for the storage of persistent and non-persistent data arranged as a queue comprising the steps of: receiving persistent and non-persistent data to be stored in the queue; marking the data in time sequence order; storing said persistent data in a first set of pages and said non-persistent data in a second set of pages; on receiving a request for removal of data from said queue, checking both said first and second sets of pages; and removing the data in time sequence order.
Claim 2
Dependent Claim
51 words
A method as claimed in claim 1 including the steps of: allocating storage for said first and second sets of pages; creating first and second lists of pages corresponding to said first and second sets of pages; and updating said first and second lists.after said steps of storing or removing data.
Claim 3
Independent Claim
61 words
A method as claimed in any preceding claim further comprising the steps of: creating a log to enable recovery in the event of failure and restart of the queue; and when receiving and when removing persistent data to be stored in and to be removed from the queue, respectively, making entries in said log of changes to the persistent data only.
Claim 4
Independent Claim
82 words
A method as claimed in any preceding claim further comprising the steps of: before the step of receiving data, creating a table indicating which pages available in storage are free, which are allocated for persistent data and which are allocated for non-persistent data; after said steps of receiving data and removing data, updating said table; and in the event of a failure and restart of the queue, scanning and updating said table to indicate that all. pages containing non-persistent data are free.
Claim 5
Dependent Claim
133 words
A data processing system for the storage of persistent and non-persistent data in a queue comprising: a data manager for allocating one or more pages of storage (710, 720, 730) for storing persistent data; one or more pages of storage (710, 720, 730) for storing non-persistent data; means (600) for pointing (620, 622) to the pages (710, 720, 730) storing persistent data and to the pages (710, 720, 730) storing non-persistent data, thereby to define a queue; connection management means (350) for receiving persistent and non-persistent data to be stored and for receiving requests for the removal of data; and message management means (310) for storing the received persistent and non-persistent data in respective pages of said pointing means (600) and for marking said data as it is stored in time sequence order.
Claim 6
Dependent Claim
51 words
A system as claimed in claim 5 further comprising: log means (320) comprising entries made when persistent data is received or removed from the queue; and recovery management means (340) for restoring the contents of the queue in the event of a system failure by reference to said log means (320).
Claim 7
Dependent Claim
92 words
A system as claimed in either claim 5 or claim 6 further comprising: a table having an entry for each page (710, 720, 730) of storage, the entry indicating whether said page of storage is free, allocated to persistent data or allocated to non-persistent data; and wherein, in the event of a failure and restart of the queue, the recovery management means (340) scans and changes all entries in the table which indicate that a page of storage is allocated to non-persistent data to indicate that those pages of storage are free.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.