In a modern chip-multiprocessor system, memory is a shared resource among multiple concurrently executing threads. The memory scheduling algorithm should resolve memory contention...
Yoongu Kim, Michael Papamichael, Onur Mutlu, Mor H...
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...
In this paper we discuss the problem of network fairness. Traditional network fairness focuses on treating uneven resource (such as bandwidth) allocation in TCP congestion control...
Expected slowdown has been proposed as a criterion to evaluate queue fairness. In this work we examine how the constant slowdown principle can be used as a basis for a queueing fa...
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...