The Algebra of Multi-tasking

Modelling multi-tasking behaviour is an important phase of real-time system design. It is shown how task scheduling principles can be captured in a CCS-based process algebra via extensions for both asymmetric interleaving, to model intraprocessor scheduling decisions, and for asynchronous communication, to model interprocessor precedence constraints. Examples are given of task preemption, blocking on shared resources, and multi-task transactions.

• Type: Conference
• Year: 2000
• Where: AMAST
• Authors: Colin J. Fidge
• Keywords: AMAST 2000, Interprocessor Precedence Constraints, Intraprocessor Scheduling Decisions, Software Engineering, Task Scheduling Principles