An efficient memory system to implement a multi-list, multi-priority task management scheme. In one embodiment, a single list which is dynamically partitioned among multiple priority levels and effectively implements multiple priority lists. This dynamic re-allocation of memory space available to each priority level is handled using a single write pointer and multiple read pointers. There are as many read pointers as there are desired priority levels. One application is scheduling tasks so that all pending tasks are performed at least n-1 times before any pending task is performed for the nth time. An example of a task that may be scheduled is the retransmission of data in a communication system.

 
Web www.patentalert.com

< Booting an operating system or running other pre-boot code from a file stored under a different operating system

< Locking and memory allocation in file system cache

> Data processing systems and method for batching tasks of the same type in an instruction cache

> Hierarchical affinity dispatcher for task management in a multiprocessor computer system

~ 00237