Managing a finite queue

1. 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.

2. The method of claim 1 , wherein the refresh-all operation is to be performed by a sink process.

3. The method of claim 1 , wherein when the queue is not full, an update-component message is written to the queue.

4. The method of claim 3 , wherein the update-component message indicates that an update-component operation should be performed.

5. The method of claim 1 , wherein the queue is a finite queue.

6. The method of claim 1 , wherein the refresh-all message is written to the queue by a source process.

7. The method of claim 6 , wherein source process includes a database manager.

8. 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.

9. The program product of claim 8 , wherein the refresh-all operation is to be performed by a sink process.

10. The program product of claim 8 , 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.

11. The program product of claim 10 , wherein the update-component message indicates that an update-component operation should be performed.

12. The program product of claim 8 , wherein the queue is a finite queue.

13. The program product of claim 8 , wherein the refresh-all message is written to the queue by a source process.

14. The program product of claim 13 , wherein source process includes a database manager.

15. 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.

16. The line interface unit of claim 15 , wherein the refresh-all operation is to be performed by a sink process.

17. The line interface unit of claim 15 , wherein when the queue is not full, an update-component message is written to the queue.

18. The line interface unit of claim 17 , wherein the update-component message indicates that an update-component operation should be performed.

19. The line interface unit of claim 15 , wherein the queue is a finite queue.

20. The line interface unit of claim 15 , wherein the refresh-all message is written to the queue by a source process.

21. The line interface unit of claim 20 , wherein source process includes a database manager.

22. The line interface card of claim 15 , wherein the upstream communication link is a DSX-1 link and the upstream interface includes:

a T 1 framer in communication with the downstream interface and to communicate with the DSX-1 link; and

a pre-equalizer coupled to the T 1 framer and the downstream interface and to communicate with the DSX-1 link.

23. The line interface card of claim 15 , wherein the downstream communication link is an HDSL2 link and the downstream interface includes:

an HDSL2 framer in communication with the upstream interface and to communicate with the HDSL2 link; and

an HDSL2 transceiver coupled to the HDSL2 framer and to communicate with the HDSL2 link.

24. 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.

25. 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.

26. 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.

27. 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.