2714 search results - page 103 / 543 » Approximation Schemes for Scheduling |
82
Voted
ARITH
2005
IEEE
15 years 6 months ago
2005
IEEE
The pipelined CORDIC with linear approximation to rotation has been proposed to achieve reductions in delay, power and area; however, the schemes for rotation (multiplication) and...
156
Voted
WG
2004
Springer
15 years 6 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
122
click to vote
CLUSTER
2006
IEEE
15 years 6 months ago
2006
IEEE
The Service Level Agreement (SLA) based grid superscheduling approach promotes coordinated resource sharing. Superscheduling is facilitated between administratively and topologica...
176
click to vote
PDPTA
2008
15 years 2 months ago
2008
- Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to e...
108
Voted
ICS
1995
Tsinghua U.
15 years 4 months ago
1995
Tsinghua U.
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...