Martin Korsgaard

Learn More
Multiprocessor systems are increasingly being used in real-time computing, and much research has been done on schedulability analysis of these systems. However, current schedulability analyses have only limited support for job-level parallelism (JLP): jobs are typically restricted to a simple parallel structure, and malleable jobs, where the number of(More)
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(More)
In real-time programming, correct timing is as important as correct computational results. However, most real-time programming languages focus on concurrency rather than timing, leaving timing as an indirect result of task priorities and process synchronization. The resulting systems often have high complexity and tend to obfuscate the intentions of the(More)
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(More)
  • 1