US 8,027,346 B1 · Method and system for scheduler dominated merge of state changes

Abstract

A method and system schedule data for dequeuing in a communication network. The communication network includes an eligible scheduling node, a scheduling context structure, and an existence of data structure. In response to determining that an eligible scheduling node does not contain at least one child identifier in the scheduling context structure, an eligible child is selected for dequeue from the existence of data structure. At least one eligible child from the existence of data structure is absorbed into the scheduling context structure. The at least one eligible child includes the child selected for dequeue. Absorbing a child includes removing the child identifier from the existence of data queue and adding the child identifier to the scheduling context structure.

Claims17

Dependent claims

A method for scheduling data for dequeuing in a communication network having a hierarchy of interacting scheduling nodes including a child scheduling node and parent scheduling node, the child scheduling node being an eligible scheduling node, the eligible scheduling node having a scheduling context structure, an existence of data structure, and a data queue associated therewith, the method comprising:

responsive to determining that the eligible scheduling node does not contain at least one child identifier in the scheduling context structure and that an eligible child exists in the existence of data structure:
forwarding a message from the eligible scheduling node to the parent scheduling node, the message indicating the existence of an eligible child in the existence of data structure;
and
and after forwarding the message, absorbing at least one eligible child from the existence of data structure into the scheduling context structure, absorbing the at least one eligible child including:
removing the child identifier from the existence of data structure;
and
adding the child identifier to the scheduling context structure.

4 more elements

A method for scheduling data for dequeuing in a communication network having a hierarchy of interacting scheduling nodes including a child scheduling node and a parent scheduling node, the method comprising:

determining that one of the child scheduling node and a data queue is eligible for dequeuing;
setting an eligibility state for the one of the child scheduling node and the data queue to eligible;
determining whether an existence of data structure of the parent scheduling node for the one of the child scheduling node and the data queue is empty;
and
responsive to determining that the existence of data structure of the parent scheduling node for the one of the child scheduling node and the data queue is not empty, adding an identifier for the one of the child scheduling node and a data queue to the existence of data structure of the parent scheduling node.

2 more elements

A system for scheduling data for dequeuing in a communication network having a hierarchy of interacting scheduling nodes including a child scheduling node and a parent scheduling node, the system comprising:

at least one data queue containing data for dequeuing;
at least one child communicatively coupled to the at least one data queue, the at least one child being one of a data queue and a child scheduling node;
at least one parent scheduling node communicatively coupled to the at least one child, the at least one parent scheduling node including:
a scheduling context structure;
and
an existence of data structure;
and
an eligibility updater communicatively coupled to the at least one data queue, the at least one child, and the at least one parent scheduling node, the eligibility updater operable to:
determine an eligibility state for a child;
responsive to determining that the eligibility state is eligible, set an eligibility state for the child to eligible;
and
responsive to determining that the existence of data structure of the parent scheduling node is not empty, appending an identifier for the eligible child to the existence of data structure.

9 more elements

Dependencies are inferred from the claim text.

Method and system for scheduler dominated merge of state changes

Life of this patent

Method and system for scheduler dominated merge of state changes

Life of this patent

Abstract

Claims17