On Scheduling Policies for Streams of Structured Jobs

Abstract

Abstract. We study a class of scheduling problems which combines the structural aspects associated with task dependencies, with the dynamic aspects associated with ongoing streams of requests that arrive during execution. For this class of problems we develop a scheduling policy which can guarantee bounded accumulation of backlog for all admissible request streams. We show, nevertheless, that no such policy can guarantee bounded latency for all admissible request patterns, unless they admit some laxity.

Local quasi hidden variable modelling and violations of Bell-type inequalities by a multipartite quantum state

“…For bipartite and tripartite correlation scenarios with a finite number of outcomes at each site, the numerical estimates on the maximal Bell violations have been recently presented in Refs. [25][26][27][28][29] . The results of corollary 3 indicate.…”

“…Note that though, for correlation bipartite Bell-type inequalities, quantum violations are upper bounded 6 by the Grothendieck's constant 18 independently on a dimension of a bipartite quantum state and numbers of settings and outcomes at each site, this is not already the case for bipartite Bell-type inequalities on joint probabilities. Since Bell-type inequalities are now widely used in many quantum information tasks 22,23 , bounds on quantum violations of Bell-type inequalities have been recently intensively discussed in the literature both computationally 24 and theoretically [25][26][27][28][29] and it has been found 25 that some tripartite quantum states "can lead to arbitrarily large" violations of correlation Bell-type inequalities. For an N-partite quantum state, bounds on violation of a Bell-type inequality of an arbitrary type (either on correlation functions or on joint probabilities) have not been reported 30 in the literature.…”

Meeting Deadlines Cheaply

“…Let us mention also the recent work [13] which introduces a more general model where a dynamic scheduler has to cope with a stream of requests, chosen non-deterministically by a request generator from a finite sets of task graphs. The treatment of communication in the present paper suffers from two related shortcomings.…”

“…Finally we assumed full information and determinism in the durations of executions and communications and in arrival times. Variability in these parameters may benefit from more adaptive scheduling strategies [1,13] but the computational and observational overhead in implementing such strategies may turn out to be higher than their gains.…”

Formal and Informal Methods for Multi-Core Design Space Exploration

“…For generators of type 2 and 3 we also implemented a probabilistic semantics drawing uniformly from [t,t + J]. Other types of generators that can choose (non-deterministically or randomly) among different types of jobs [21] or stochastic generators with other distributions can be easily added. Technically, each instance of a job generates a new instance of the corresponding automaton and this may lead to an infinite-number of automata and global states.…”