2226 search results - page 299 / 446 » Fault-Tolerant Parallel Applications with Dynamic Parallel S... |
SAGT
2009
Springer
15 years 4 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 ...
FOCS
1994
IEEE
15 years 2 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
ICPADS
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...