Stream processing is a new memory computing paradigm that deals with dynamic data
streams efficiently. Storm is one of the stream processing frameworks, but the default stream …

In sensitive applications, machines need to be periodically calibrated to ensure that they run
to high standards. Creating an efficient schedule on these machines requires attention to …

Consider a set of jobs connected to a directed acyclic task graph with a fixed source and
sink. The edges of this graph model precedence constraints and the jobs have to be …

The scheduling problem with calibrations was introduced by Bender et al.(SPAA 2013). In
sensitive applications, machines need to be periodically calibrated to ensure that they run …

In this paper we study some generalizations of the parking permit problem (Meyerson,
FOCS'05), in which we are given a demand rt∈{0, 1} for instant of time t= 0,…, T− 1, along …

Consider a set of jobs connected to a directed acyclic task graph with a fixed source and
sink. The edges of this graph model precedence constraints and the jobs have to be …

Scheduling is one of the most fundamental problems in computer science. A set of jobs has
to be assigned to a set of machines in order to optimize some utility function, often the …

OTF computing is exploring ways to provide people with more customized, on-demand
software services that meet their needs. Similar to using a search engine, users should be …

Abstract Machines usually require maintenance after a fixed period. We need to perform a
calibration before using the machine again. Such an operation requires a non-negligible …

OTF compute centers are intended to exploit and support the characteristics of OTF services.
They also are expected to exist at various scale, ranging from full-fledged data centers down …