7577690

Managing Checkpoint Queues in a Multiple Node System

PublishedAugust 18, 2009
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
6 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method for coordinating writing of data items to persistent storage, the method comprising the steps of: maintaining within a first node a first queue for dirty data items that need to be written to persistent storage; maintaining within the first node a second queue for dirty data items that need to be written to persistent storage; moving entries from said first queue to said second queue when the dirty data items corresponding to the entries need to be transferred for use by a second node; when selecting which data items to write to persistent storage, assigning priority to data items that correspond to entries in said second queue over data items that correspond to entries in said first queue; and after selecting which data items to write to persistent storage, writing the selected items to persistent storage.

2

2. The method of claim 1 wherein the step of moving entries includes moving an entry from said first queue to said second queue in response to a message received by said first node, wherein said message indicates that another node has requested the data item that corresponds to said entry.

3

3. A method for coordinating writing of data items to persistent storage, the method comprising the steps of: maintaining a forced-write count for each of said data items; incrementing the forced-write count of a data item whenever the data item is written to persistent storage by one node for transfer of the data item to another node; selecting which dirty data items to write to persistent storage based on the write counts associated with the data items; after selecting which dirty data items to write to persistent storage, writing the selected items to persistent storage; storing dirty data items that have forced-write counts at or above a certain threshold in a particular queue; and when selecting dirty data items to write to persistent storage, giving priority to data items stored in said particular queue.

4

4. A computer-readable storage medium carrying instructions for coordinating writing of data items to persistent storage, the instructions when executed cause the comprising computer to perform the steps of: maintaining within a first node a first queue for dirty data items that need to be written to persistent storage; maintaining within the first node a second queue for dirty data items that need to be written to persistent storage; moving entries from said first queue to said second queue when the dirty data items corresponding to the entries need to be transferred for use by a second node; when selecting which data items to write to persistent storage, assigning priority to data items that correspond to entries in said second queue over data items that correspond to entries in said first queue; and after selecting which data items to write to persistent storage, writing the selected items to persistent storage.

5

5. The computer-readable storage medium of claim 4 wherein the step of moving entries includes moving an entry from said first queue to said second queue in response to a message received by said first node, wherein said message indicates that another node has requested the data item that corresponds to said entry.

6

6. A computer-readable storage medium carrying instructions for coordinating writing of data items to persistent storage, the instructions when executed cause the computer to perform the steps of: maintaining a forced-write count for each of said data items; incrementing the forced-write count of a data item whenever the data item is written to persistent storage by one node for transfer of the data item to another node; selecting which dirty data items to write to persistent storage based on the write counts associated with the data items; after selecting which dirty data items to write to persistent storage, writing the selected items to persistent storage; storing dirty data items that have forced-write counts at or above a certain threshold in a particular queue; and when selecting dirty data items to write to persistent storage, giving priority to data items stored in said particular queue.

Patent Metadata

Filing Date

Unknown

Publication Date

August 18, 2009

Inventors

Sashikanth Chandrasekaran
Roger J. Bamford
William H. Bridge
David Brower
Neil MacNaughton
Wilson Wai Shun Chan
Vinay Srihari

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “MANAGING CHECKPOINT QUEUES IN A MULTIPLE NODE SYSTEM” (7577690). https://patentable.app/patents/7577690

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.