Space-efficient scheduling of stochastically generated tasks

Authors:
Tomáš Brázdil;Javier Esparza;Stefan Kiefer;Michael Luttenberger
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic;Institut für Informatik, Technische Universität München, Germany;Oxford University, Computing Laboratory, UK;Institut für Informatik, Technische Universität München, Germany
Venue:
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Year:
2010

Citing 11
Cited 0

Randomized parallel algorithms for backtrack search and branch-and-bound computation

Journal of the ACM (JACM)
Complexity and real computation

Complexity and real computation
Space-efficient scheduling of nested parallelism

ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling multithreaded computations by work stealing

Journal of the ACM (JACM)
Model Checking Probabilistic Pushdown Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On the convergence of Newton's method for monotone systems of polynomial equations

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Adaptive work-stealing with parallelism feedback

ACM Transactions on Computer Systems (TOCS)
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Journal of the ACM (JACM)
On fixed point equations over commutative semirings

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An extension of Newton's method to ω-continuous semirings

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fixed, known probability of generating other tasks. We present results on the random variable Sσ modeling the maximal space needed by the processor to store the currently active tasks when acting under the scheduler σ. We obtain tail bounds for the distribution of Sσ for both offline and online schedulers, and investigate the expected value E[Sσ].