Sciweavers

472 search results - page 64 / 95
» Quick-release Fair Scheduling
Sort
View
AAAI
2008
13 years 11 months ago
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
Yaad Blum, Jeffrey S. Rosenschein
WSS
2001
111views Control Systems» more  WSS 2001»
13 years 10 months ago
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
HIPEAC
2010
Springer
14 years 5 months ago
Combining Locality Analysis with Online Proactive Job Co-scheduling in Chip Multiprocessors
Abstract. The shared-cache contention on Chip Multiprocessors causes performance degradation to applications and hurts system fairness. Many previously proposed solutions schedule ...
Yunlian Jiang, Kai Tian, Xipeng Shen
ICCD
2005
IEEE
108views Hardware» more  ICCD 2005»
14 years 5 months ago
Methods for Modeling Resource Contention on Simultaneous Multithreading Processors
Simultaneous multithreading (SMT) seeks to improve the computation throughput of a processor core by sharing primary resources such as functional units, issue bandwidth, and cache...
Tipp Moseley, Dirk Grunwald, Joshua L. Kihm, Danie...
INFOCOM
2008
IEEE
14 years 3 months ago
On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
Ulas C. Kozat