Sciweavers

494 search results - page 90 / 99
» Optimal Carpet Cutting
Sort
View
JSSPP
2004
Springer
14 years 22 days ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
WG
2004
Springer
14 years 21 days ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
MICRO
2002
IEEE
159views Hardware» more  MICRO 2002»
14 years 8 days ago
Master/slave speculative parallelization
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
Craig B. Zilles, Gurindar S. Sohi
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
13 years 11 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
FOCS
1997
IEEE
13 years 11 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao