04/13

Ready list:

1. heap:
   
   • ins: O(logn)
   • del: O(logn)
   • min: O(1)
     
2. uC/OSII:
   
   • ins: O(1)
   • del: O(1)
   • min: O(1)

如果有了task的priority, 如何求出他在OSRdyTbl[]所在的位置:
若OSRdyTbl[]為n*n, n一定為2的power,
則x=priority/n, y=priority%n