Sciweavers

375 search results - page 49 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
SPAA
2010
ACM
13 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 9 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
SPAA
2006
ACM
14 years 1 months ago
On the price of heterogeneity in parallel systems
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
Brighten Godfrey, Richard M. Karp
CCGRID
2009
IEEE
14 years 13 days ago
Dynamic Provisioning of Virtual Organization Clusters
Virtual Organization Clusters are systems comprised of virtual machines that provide dedicated computing clusters for each individual Virtual Organization. The design of these clu...
Michael A. Murphy, Brandon Kagey, Michael Fenn, Se...
IPCCC
2006
IEEE
14 years 1 months ago
SHARP: a new real-time scheduling algorithm to improve security of parallel applications on heterogeneous clusters
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
Tao Xie 0004, Xiao Qin, Mais Nijim