|ISMM 2007||START Conference Manager|
In this paper, we introduce two new scheduling strategies, MQRR (memory-quantum round robin) and LARF (lower allocation rate first), designed to be allocation-phase aware. Both schemes assign higher execution priority to threads in computation-oriented phases so more objects can die. We have simulated the proposed algorithms and evaluated their performances. The results show that when a generational schemes are used, the reductions of the garbage collection time of can range from 0\%-16\% and 0\%-27\% when LARF and MQRR are used, respectively. The reductions of the overall execution time range from
-0.1\%-3\% for both LARF and MQRR. The reductions of the average thread turn-around time range from -0.1\%-12\% for LARF and 0.1\%-13\% for MQRR. Our results also show that LARF and MQRR achieve much smaller improvement when used with non-generational collectors.
|START Conference Manager (V2.54.5)|