Managing a finite queue
AssigneeADC DSL Systems, Inc.
InventorDavid J. Kasper, II
Life of this patent
Estimating the term…
Abstract
A source process communicates with a sink process by writing messages to a finite queue. The source process determines whether the finite queue is full. If the source process determines that the finite queue is full, the finite queue is emptied and a refresh-all message is written to the finite the queue. When the sink process reads a refresh-all message from the finite queue, the sink process performs a refresh-all operation in which a refresh operation is performed for each member of a set of objects.
Claims27
A method of managing a queue, comprising:
- when the queue is full:
- emptying the queue;
- and
- writing a refresh-all message into the queue;
- wherein the refresh-all message indicates that a refresh-all operation should be performed;
- wherein the refresh-all operation causes a refresh operation to be performed for each member of a set of objects;
- wherein the set of objects includes a set of components of a user interface;
- and
- wherein the refresh-all operation is performed by updating and displaying each member of the set of components of the user interface.
A program product comprising a storage medium tangibly embodying program instructions for managing a queue used for storing messages, the program instructions including instructions operable to cause at least one programmable processor to:
- when the queue is full:
- empty the queue;
- and
- write a refresh-all message into the queue;
- wherein the refresh-all message indicates that a refresh-all operation should be performed;
- wherein the refresh-all operation causes a refresh operation to be performed for each member of a set of objects;
- wherein the set of objects includes a set of components of a user interface;
- and
- wherein the refresh-all operation is performed by updating and displaying each member of the set of components of the user interface.
A line interface unit, comprising:
- an upstream interface to couple the line interface unit to an upstream communication link;
- a downstream interface to couple the line interface unit to a downstream communication link;
- an input-output interface to couple the line interface unit to an external device;
- a programmable processor coupled to the upstream interface, the downstream interface, and the input-output interface;
- and
- a storage medium coupled to the programmable processor, tangibly embodying program instructions;
- wherein the program instructions include instructions operable to cause the programmable processor to:
- when a queue is full:
- empty the queue;
- and
- write a refresh-all message into the queue;
- wherein the refresh-all message indicates that a refresh-all operation should be performed;
- wherein the refresh-all operation causes a refresh operation to be performed for each member of a set of objects.
- wherein the set of objects includes a set of components of a user interface;
- and
- wherein the refresh-all operation is performed by updating and displaying each member of the set of components of the user interface.
A system, comprising:
- a source process;
- a sink process;
- and
- a queue coupled to the source process and the sink process;
- wherein the source process, when the queue is full, empties the queue and writes a refresh-all message to queue;
- and
- wherein the sink process reads the refresh-all message from the queue and performs a refresh-all operation in response to refresh-all message.
- wherein the refresh-all message indicates that a refresh-all operation should be performed;
- wherein the refresh-all operation causes a refresh operation to be performed for each member of a set of objects;
- wherein the set of objects includes a set of components of a user interface;
- and
- wherein the refresh-all operation is performed by updating and displaying each member of the set of components of the user interface.
A method of managing a queue, comprising:
- when the queue is full:
- emptying the queue;
- and
- writing a refresh-all message into the queue;
- wherein when the queue is not full, an update-component message is written to the queue;
- and
- wherein the update-component message indicates that an update-component operation should be performed.
A program product comprising a storage medium tangibly embodying program instructions for managing a queue used for storing messages, the program instructions including instructions operable to cause at least one programmable processor to:
- when the queue is full:
- empty the queue;
- and
- write a refresh-all message into the queue;
- wherein the program instruction further include program instruction operable to cause the programmable process to, when the queue is not full, write an update-component message to the queue;
- and
- wherein the update-component message indicates that an update-component operation should be performed.
A line interface unit, comprising:
- an upstream interface to couple the line interface unit to an upstream communication link;
- a downstream interface to couple the line interface unit to a downstream communication link;
- an input-output interface to couple the line interface unit to an external device;
- a programmable processor coupled to the upstream interface, the downstream interface, and the input-output interface;
- and
- a storage medium coupled to the programmable processor, tangibly embodying program instructions;
- wherein the program instructions include instructions operable to cause the programmable processor to:
- when a queue is full:
- empty the queue;
- and
- write a refresh-all message into the queue;
- wherein when the queue is not full, an update-component message is written to the queue;
- and
- wherein the update-component message indicates that an update-component operation should be performed.
Dependencies are inferred from the claim text.