db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
@InProceedings{KorsgaardHendseth09,
title = "{D}esign {P}atterns for {C}ommunicating {S}ystems with {D}eadline {P}ropagation",
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
author= "Korsgaard, Martin and Hendseth, Sverre",
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
editor= "Welch, Peter H. and Roebbers, Herman and Broenink, Jan F. and Barnes, Frederick R. M. and Ritson, Carl G. and Sampson, Adam T. and Stiles, G. S. and Vinter, Brian",
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
pages = "349--361",
booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2009",
isbn= "978-1-60750-065-0",
year= "2009",
month= "nov",
abstract= "Toc is an experimental programming language based on occam
that
combines CSP-based concurrency with integrated
specification of timing
requirements. In contrast to occam
with strict round-robin scheduling,
the Toc scheduler is
lazy and does not run a process unless there is a
deadline
associated with its execution. Channels propagate
deadlines
to dependent tasks. These differences from occam
necessitate a
different approach to programming, where a new
concern is to avoid
dependencies and conflicts between
timing requirements. This paper
introduces client-server
design patterns for Toc that allow the
programmer precise
control of timing. It is shown that if these
patterns are
used, the deadline propagation graph can be used to
provide
sufficient conditions for schedulability. An
alternative
definition of deadlock in deadline-driven
systems is given, and it is
demonstrated how the use of the
suggested design patterns allow the
absence of deadlock to
be proven in Toc programs. The introduction of
extended
rendezvous into Toc is shown to be essential to
these
patterns."
}