Paper Details

%T The Computation Time Process Model
%A Martin Korsgaard, Sverre Hendseth
%E Peter H. Welch, Adam T. Sampson, Jan Bækgaard Pedersen, Jon Kerridge, Jan F. Broenink, Frederick R. M. Barnes
%B Communicating Process Architectures 2011
%X In traditional real\-time multiprocessor schedulability
   analysis it is required that all tasks are entirely serial.
   This implies that if a task is written in a parallel
   language such as occam, all parallelism in the task must be
   suppressed to enable schedulability analysis. Part of the
   reason for this restriction is the difficulty in analysing
   execution times of programs with a complex parallel
   structure. In this paper we introduce an abstract model for
   reasoning about the temporal properties of such programs.
   Within this model, we define what it means for a process to
   be easier to schedule than another, and the notion of
   upper bounds on execution times. Counterintuitive temporal
   behaviour is demonstrated to be inherent in all systems
   where processes are allowed an arbitrary parallel structure.
   For example, there exist processes that are guaranteed to
   complete on some schedule, that may not complete
   if executing less than the expected amount of computation.
   Not all processes exhibit such counterintuitive behaviour,
   and we identify a subset of processes that are well\-behaved
   in this respect. The results from this paper is a necessary
   prerequisite for a complete schedulability analysis of
   systems with an arbitrary parallel structure.

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.