Space-efficient scheduling of stochastically generated tasks
From MaRDI portal
Recommendations
- Space-efficient scheduling of stochastically generated tasks
- As soon as probable: optimal scheduling under stochastic uncertainty
- Stochastic Scheduling with Variable Profile and Precedence Constraints
- Performance evaluation of schedulers in a probabilistic setting
- scientific article; zbMATH DE number 96059
Cites work
- scientific article; zbMATH DE number 5485454 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3537035 (Why is no real title available?)
- scientific article; zbMATH DE number 3576493 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- scientific article; zbMATH DE number 5685899 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- scientific article; zbMATH DE number 3194856 (Why is no real title available?)
- A limit theorem for the maxima of the para-critical simple branching process
- A maximum sequence in a critical multitype branching process
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- An Extension of Newton’s Method to ω-Continuous Semirings
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
- Convergence thresholds of Newton's method for monotone polynomial equations
- Functionals of critical multitype branching processes
- Geometric algorithms and combinatorial optimization.
- Matrix Analysis
- Non-interleaving bisimulation equivalences on basic parallel processes
- On Fixed Point Equations over Commutative Semirings
- On distribution tails and expectations of maxima in critical branching processes
- On the maximum sequence in a critical branching process
- On the memory consumption of probabilistic pushdown automata
- Random walks with ``back buttons
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Scheduling multithreaded computations by work stealing
- Thread scheduling for multiprogrammed multiprocessors
- Undecidable equivalences for basic parallel processes
Cited in
(3)
This page was built for publication: Space-efficient scheduling of stochastically generated tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418125)