๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Quasi-static scheduling of communicating tasks

โœ Scribed by Philippe Darondeau; Blaise Genest; P.S. Thiagarajan; Shaofa Yang

Book ID
113641877
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
786 KB
Volume
208
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Static priority scheduling of aperiodic
Static priority scheduling of aperiodic real-time tasks
โœ Ulrich Schmid ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 525 KB

We investigate deadline meeting properties of the well-known preemptive ลฝ . static priority scheduling SPS algorithm, which is widespreadly used in commercial real-time operating system kernels. A discrete-time single server queueing system employing SPS for scheduling probabilistically arriving tas

Unconstrained static scheduling with com
Unconstrained static scheduling with communication weights
โœ Vivek Sarkar ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 179 KB

In this paper, we present some new theoretical results for unconstrained static scheduling with communication weights, i.e. multiprocessor scheduling of tasks with no precedence constraints, but with arbitrary communication and computation weights. The results are obtained for a cost function that e