Comparing job allocation schemes where service demand is unknown

DOI10.1016/J.JCSS.2007.07.009zbMath1154.68349OpenAlexW2038494909MaRDI QIDQ941461

Nigel Thomas

Publication date: 1 September 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.07.009

zbMATH Keywords

schedulingload balancingstochastic process algebraperformance modelling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) 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

• EMpht
• Dizzy

Cites Work

• Analysis of a Multimedia Stream using Stochastic Process Algebra
• Task assignment with unknown duration
• Unnamed Item

This page was built for publication: Comparing job allocation schemes where service demand is unknown