500 search results - page 69 / 100 » Process Scheduling for the Parallel Desktop |
ISPDC
2005
IEEE
14 years 2 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...
ICCAD
2003
IEEE
14 years 2 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 ...
ESA
2003
Springer
14 years 2 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...
ESA
2009
Springer
14 years 1 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...
CCGRID
2006
IEEE
14 years 3 months 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...