Abstract: A method and apparatus for balancing processing loads to avoid starvation of threads is described. A method of load balancing evaluates the load and state of multiple processors. If at least one processor is in a source state and at least one processor is in a sink state, the processing load is balanced to avoid starvation. A thread is transferred from the heaviest loaded, source state processor to the least loaded, sink state processor. Each processor load and state is then reevaluated and, if needed, the load balancing with starvation avoidance repeated.

Abstract: A method of allocating memory and a memory allocation apparatus are described. The method comprises allocating a set of memory locations for at least a portion of a data structure, wherein the allocated set comprises memory space storing a counter corresponding to each memory location in the set. A method of traversing a data structure is described. The method comprises incrementing, by a predetermined value, a reference address of a pointer to a first data structure of a portion of a set of allocated memory locations to obtain a reference address to a second data structure in the portion of the set. The portion of the set of allocated memory locations comprises a counter for each allocated memory location.

Abstract: A method and apparatus for balancing processing loads to avoid starvation of threads is described. A method of load balancing evaluates the load and state of multiple processors. If at least one processor is in a source state and at least one processor is in a sink state, the processing load is balanced to avoid starvation. A thread is transferred from the heaviest loaded, source state processor to the least loaded, sink state processor. Each processor load and state is then reevaluated and, if needed, the load balancing with starvation avoidance repeated.