Zobrazeno 1 - 10
of 254
pro vyhledávání: '"ALBERS, SUSANNE"'
We present several competitive ratios for the online busy time scheduling problem with flexible jobs. The busy time scheduling problem is a fundamental scheduling problem motivated by energy efficiency with the goal of minimizing the total time that
Externí odkaz:
http://arxiv.org/abs/2405.08595
Autor:
Albers, Susanne, Schubert, Sebastian
We study the $b$-matching problem in bipartite graphs $G=(S,R,E)$. Each vertex $s\in S$ is a server with individual capacity $b_s$. The vertices $r\in R$ are requests that arrive online and must be assigned instantly to an eligible server. The goal i
Externí odkaz:
http://arxiv.org/abs/2206.15336
In the Online Machine Covering problem jobs, defined by their sizes, arrive one by one and have to be assigned to $m$ parallel and identical machines, with the goal of maximizing the load of the least-loaded machine. In this work, we study the Machin
Externí odkaz:
http://arxiv.org/abs/2110.09161
Autor:
Albers, Susanne, Quedenfeld, Jens
Power consumption is a dominant and still growing cost factor in data centers. In time periods with low load, the energy consumption can be reduced by powering down unused servers. We resort to a model introduced by Lin, Wierman, Andrew and Thereska
Externí odkaz:
http://arxiv.org/abs/2107.14692
Autor:
Albers, Susanne, Quedenfeld, Jens
Power consumption is the major cost factor in data centers. It can be reduced by dynamically right-sizing the data center according to the currently arriving jobs. If there is a long period with low load, servers can be powered down to save energy. F
Externí odkaz:
http://arxiv.org/abs/2107.14672
Autor:
Albers, Susanne, Eckl, Alexander
Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration of a task. Jobs have an unknown processing time that can be explored
Externí odkaz:
http://arxiv.org/abs/2105.02052
Autor:
Albers, Susanne, Janke, Maximilian
This paper studies Makespan Minimization in the secretary model. Formally, jobs, specified by their processing times, are presented in a uniformly random order. An online algorithm has to assign each job permanently and irrevocably to one of m parall
Externí odkaz:
http://arxiv.org/abs/2103.16340
Best Fit is a well known online algorithm for the bin packing problem, where a collection of one-dimensional items has to be packed into a minimum number of unit-sized bins. In a seminal work, Kenyon [SODA 1996] introduced the (asymptotic) random ord
Externí odkaz:
http://arxiv.org/abs/2012.00511