33 search results - page 3 / 7 » Cost Sharing Methods for Makespan and Completion Time Schedu... |
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Scheduling of delay-tolerant jobs has been proposed as a mechanism to alleviate pressure on congested network resources. However, when multiple competing users share these resource...
COLCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— While multicast has been studied extensively in many domains such as content streaming and file sharing, there is little research applying it to synchronous collaborations invo...
DAGSTUHL
2007
14 years 11 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...