%T Shared\-Memory Multi\-Processor Scheduling Algorithms for CCSP
%A Carl G. Ritson
%E Alistair A. McEwan, Steve Schneider, Wilson Ifill, Peter H. Welch
%B Communicating Process Architectures 2007
%X CCSP is a monolithic C library which acts as the run\-time
kernel for occam\- programs compiled with the Kent
Retargetable occam Compiler (KRoC). Over the past decade,
it has grown to encompass many new and powerful features to
support the occam\-pi language as that has evolved
&\[sh]8211; and continues to evolve &\[sh]8211; from
classical occam. However, despite this wealth of
development, the general methodology by which processes are
scheduled and executed has changed little from its
transputer inspired origins. This talk looks at applying
previous research and new ideas to the CCSP scheduler in an
effort to exploit fully the potential of new mass\-market
multicore processor systems. The key objective is to
introduce support for shared\-memory multicore systems,
whilst maintaining the low scheduling overheads that
occam\-pi users have come to expect. Fundamental to this
objective are wait\-free data\-structures, per\-processor
run\-queues, and a strong will to consolidate and simplify
the existing code base.
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.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org