500 search results - page 22 / 100 » Process Scheduling for the Parallel Desktop |
IPCCC
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
OSDI
2000
ACM
13 years 10 months ago
2000
ACM
Pocket computers are beginning to emerge that provide sufficient processing capability and memory capacity to run traditional desktop applications and operating systems on them. T...
COR
2011
13 years 3 months ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di�...
COR
2006
13 years 8 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...