500 search results - page 69 / 100 » Process Scheduling for the Parallel Desktop |
185
click to vote
ISPDC
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
294
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
While performance, area, and power constraints have been the driving force in designing current communication-enabled embedded systems, post-fabrication and run-time adaptability ...
140
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
162
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
174
click to vote
CCGRID
2006
IEEE
16 years 14 hour ago
2006
IEEE
One of the key requirement for Grid infrastructures is the ability to share resources with nontrivial qualities of service. However, resource management in a decentralized infrast...