Sciweavers

2714 search results - page 103 / 543
» Approximation Schemes for Scheduling
Sort
View
ARITH
2005
IEEE
15 years 12 months ago
Low Latency Pipelined Circular CORDIC
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...
Elisardo Antelo, Julio Villalba
WG
2004
Springer
15 years 11 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
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...
Tim Nieberg, Johann Hurink, Walter Kern
CLUSTER
2006
IEEE
16 years 11 days ago
SLA-Based Coordinated Superscheduling Scheme for Computational Grids
The Service Level Agreement (SLA) based grid superscheduling approach promotes coordinated resource sharing. Superscheduling is facilitated between administratively and topologica...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
PDPTA
2008
15 years 7 months ago
A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
- 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...
Bibhudatta Sahoo, Sudipta Mohapatra, Sanjay Kumar ...
ICS
1995
Tsinghua U.
15 years 10 months ago
Run-Time Methods for Parallelizing Partially Parallel Loops
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...
Lawrence Rauchwerger, Nancy M. Amato, David A. Pad...