Concurrent Probabilistic Programs, Or: How to Schedule If You Must

DOI10.1137/0214070zbMATH Open0569.68018OpenAlexW2054940841MaRDI QIDQ3686020

Sergiu Hart, Micha Sharir

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214070

zbMATH Keywords

fairnessMarkov chainsschedulerprogram terminationconcurrent probabilistic program

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (3)

Title not available (Why is that?) ⋮ A probabilistic analysis of multiprocessor list scheduling: the erlang case ⋮ Linear Structures for Concurrency in Probabilistic Programming Languages

This page was built for publication: Concurrent Probabilistic Programs, Or: How to Schedule If You Must

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686020)