86 search results - page 12 / 18 » An Antisocial Strategy for Scheduling Mechanisms |
HPDC
2010
IEEE
15 years 23 days ago
2010
IEEE
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
MAGS
2008
14 years 11 months ago
2008
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has been shown to scale well on multiple cores when the d...
97
Voted
SAGT
2009
Springer
15 years 6 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
83
Voted
ICNS
2007
IEEE
15 years 6 months ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...