Sciweavers

473 search results - page 8 / 95
» Early-release fair scheduling
Sort
View
MICRO
2011
IEEE
407views Hardware» more  MICRO 2011»
13 years 1 months ago
Thread Cluster Memory Scheduling
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...
COORDINATION
2009
Springer
14 years 1 months ago
Fairness for Chorded Languages
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...
Alexis Petrounias, Susan Eisenbach
HASE
2007
IEEE
14 years 1 months ago
Design of a Fairness Guarantee Mechanism Based on Network Measurement
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...
Xin Wang, Xiaochen Zhang, Shuang Yang, Xiangyang X...
PE
2007
Springer
95views Optimization» more  PE 2007»
13 years 6 months ago
SQF: A slowdown queueing fairness measure
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...
Benjamin Avi-Itzhak, Eli Brosh, Hanoch Levy
ICDCS
2009
IEEE
14 years 4 months ago
On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving
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...
Matthew Lang, Paolo A. G. Sivilotti