Paper Details

@InProceedings{TeigVannebo09,
  title = "{N}ew {ALT} for {A}pplication {T}imers and {S}ynchronisation {P}oint {S}cheduling",
  author= "Teig, Øyvind and Vannebo, Per Johan",
  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",
  pages = "135--144",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2009",
  isbn= "978-1-60750-065-0",
  year= "2009",
  month= "nov",
  abstract= "During the design of a small channel-based concurrency
     runtime system (ChanSched, written in ANSI C), we saw that
     application timers (which we call egg and repeat timers)
     could be part of its supported ALT construct, even if their
     states live through several ALTs. There are no side effects
     into the ALT semantics, which enable waiting for channels,
     channel timeout and, now, the new application
     timers. Application timers are no longer busy polled for
     timeout by the process. We show how the classical occam
     language may benefit from a spin-off of this same idea.
     Secondly, we wanted application programmers to be freed from
     their earlier practice of explicitly coding communication
     states at channel synchronisation points, which was needed
     by a layered in-house scheduler. This led us to develop
     an alternative to the non-ANSI C ''computed goto'' (found in
     gcc). Instead, we use a switch/case with goto
     line-number-tags in a synch-point-table for scheduling. We
     call this table, one for each process, a proctor table. The
     programmer does not need to manage this table, which
     is generated with a script, and hidden within an \#include
     file."
}

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.