For fully populated levels of hierarchy, {HEAD ~ a new queue} might typically be inserted to {TAIL ~ the scheduling hierarchy} at the lowest level  
typically be inserted to
For fully populated levels of hierarchy , { HEAD ~ a new queue } might typically be inserted to { TAIL ~ the scheduling hierarchy } at the lowest level
OTH OTH OTH OTH OTH OTH OTH HEAD HEAD HEAD HEAD HEAD HEAD HEAD OTH REL REL REL REL TAIL TAIL TAIL TAIL TAIL TAIL TAIL OTH OTH OTH OTH OTH