Fair-Priority-Expression-Based burst scheduling to enhance performance and fairness of shared dram systems

Abstract

Many algorithms ofmemory access scheduling have been studied to attack the well-known memory-wall. However, some of them introduce unfairness problem in Chip-Multi-Processor (CMP) systems. Therefore a new approach called Fair-Priority-Expression-Based (FairPEB) burst scheduling is proposed in this paper to address both performance and unfairness problems. Experiment results show that this method improves data bus utilization of memory system by 15.4% and 31.87% over conventional First-Ready First-Come-First-Service (FR-FCFS) and original burst scheduling. Furthermore it keeps memory accesses of different applications fair.