| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 96.21 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
Multiprocessors, particularly in the form of multicores, are becoming
standard building blocks for executing reliable software. But their use for
applications with hard real-time requirements is non-trivial. Well-known realtime
scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or
Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this
reason the scientific community in the area of real-time systems has produced
new algorithms specifically for multiprocessors. In the meanwhile, a proposal
[2] exists for extending the Ada language with new basic constructs which can
be used for implementing new algorithms for real-time scheduling; the family
of task splitting algorithms is one of them which was emphasized in the
proposal [2]. Consequently, assessing whether existing task splitting
multiprocessor scheduling algorithms can be implemented with these constructs
is paramount. In this paper we present a list of state-of-art task-splitting
multiprocessor scheduling algorithms and, for each of them, we present detailed
Ada code that uses the new constructs.
Description
Keywords
Ada Multiprocessors Multicores Real-time scheduling
Citation
Publisher
Springer