Sciweavers

457 search results - page 41 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 7 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
ORL
2006
116views more  ORL 2006»
13 years 7 months ago
Greedy multiprocessor server scheduling
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
Carl Bussema, Eric Torng
IJCSA
2007
110views more  IJCSA 2007»
13 years 7 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari