Space-efficient scheduling of stochastically generated tasks

DOI10.1016/j.ic.2011.10.005zbMath1285.68020OpenAlexW2004788404MaRDI QIDQ418125

Tomáš Brázdil, Michael Luttenberger, Stefan Kiefer, Javier Esparza

Publication date: 24 May 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.10.005

zbMATH Keywords

branching processesstochastic modelsmultithreaded programsspace-efficient scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-interleaving bisimulation equivalences on basic parallel processes
• On the maximum sequence in a critical branching process
• Geometric algorithms and combinatorial optimization.
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Functionals of critical multitype branching processes
• Random walks with ``back buttons
• Undecidable equivalences for basic parallel processes
• On the memory consumption of probabilistic pushdown automata
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Scheduling multithreaded computations by work stealing
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• On Fixed Point Equations over Commutative Semirings
• Matrix Analysis
• A maximum sequence in a critical multitype branching process
• A limit theorem for the maxima of the para-critical simple branching process
• On distribution tails and expectations of maxima in critical branching processes
• Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
• An Extension of Newton’s Method to ω-Continuous Semirings
• Thread scheduling for multiprogrammed multiprocessors

This page was built for publication: Space-efficient scheduling of stochastically generated tasks