4 citations · 6 across the 3 of their papers we have counts for
3 papers
The k-Server with Preferences Problem
Jannik Castenow, Björn Feldkord, Till Knollmann +2
The -Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. We present a model generalizing the -Ser…
Cost-efficient Scheduling on Machines from the Cloud
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine…
Online Top-k-Position Monitoring of Distributed Data Streams
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide
Consider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k node…