Sciweavers

188 search results - page 36 / 38
» Regret Minimization and Job Scheduling
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
WG
2009
Springer
14 years 2 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
IPPS
2000
IEEE
14 years 2 days ago
Enhancing NWS for Use in an SNMP Managed Internetwork
The Network Weather Service NWS is a distributed resource monitoring and utilization prediction system, employed as an aid to scheduling jobs in a metacomputing environment 9, 1...
Robert E. Busby Jr., Mitchell L. Neilsen, Daniel A...
ASPDAC
2010
ACM
168views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Hybrid dynamic energy and thermal management in heterogeneous embedded multiprocessor SoCs
Heterogeneous multiprocessor system-on-chips (MPSoCs) which consist of cores with various power and performance characteristics can customize their configuration to achieve higher ...
Shervin Sharifi, Ayse Kivilcim Coskun, Tajana Simu...
ANOR
2010
153views more  ANOR 2010»
13 years 5 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant