Real-Time Interrupt-driven Concurrency (RTIC) framework for ARM Cortex-M microcontrollers
Find a file
2019-02-08 23:18:51 +03:00
.cargo v0.4.0 2018-11-03 17:16:55 +01:00
.github v0.4.0 2018-11-03 17:16:55 +01:00
book skeleton for the Russian translation of the book 2019-02-08 19:58:55 +01:00
ci skeleton for the Russian translation of the book 2019-02-08 19:58:55 +01:00
examples book: add an example of conditional compilation of resources and tasks 2018-12-16 20:57:04 +01:00
macros Fix build on recent nightlies. 2019-01-17 10:55:21 -08:00
ru russian translation 2019-02-08 23:18:51 +03:00
src impl Default for Duration 2019-02-08 11:54:41 +01:00
tests properly handle #[cfg] (conditional compilation) on tasks 2018-12-16 19:10:36 +01:00
.gitignore skeleton for the Russian translation of the book 2019-02-08 19:58:55 +01:00
.travis.yml don't pin to an older nightly 2018-12-16 22:05:32 +01:00
build.rs note that the timer queue is not supported on ARMv6-M 2018-12-16 19:38:22 +01:00
Cargo.toml make docs.rs build docs with +timer-queue 2018-12-17 01:42:53 +01:00
CHANGELOG.md Absolute link to the book so it works on crates.io 2019-01-09 01:56:21 +02:00
LICENSE-APACHE initial commit 2017-03-05 00:29:08 -05:00
LICENSE-CC-BY-SA v0.4.0 2018-11-03 17:16:55 +01:00
LICENSE-MIT v0.4.0 2018-11-03 17:16:55 +01:00
README.md v0.4.0 2018-12-16 21:19:19 +01:00

Real Time For the Masses

A concurrency framework for building real time systems.

Features

  • Tasks as the unit of concurrency 1. Tasks can be event triggered (fired in response to asynchronous stimuli) or spawned by the application on demand.

  • Message passing between tasks. Specifically, messages can be passed to software tasks at spawn time.

  • A timer queue 2. Software tasks can be scheduled to run at some time in the future. This feature can be used to implement periodic tasks.

  • Support for prioritization of tasks and, thus, preemptive multitasking.

  • Efficient and data race free memory sharing through fine grained priority based critical sections 1.

  • Deadlock free execution guaranteed at compile time. This is an stronger guarantee than what's provided by the standard Mutex abstraction.

  • Minimal scheduling overhead. The task scheduler has minimal software footprint; the hardware does the bulk of the scheduling.

  • Highly efficient memory usage: All the tasks share a single call stack and there's no hard dependency on a dynamic memory allocator.

  • All Cortex-M devices are supported. The core features of RTFM are supported on all Cortex-M devices. The timer queue is currently only supported on ARMv7-M devices.

  • This task model is amenable to known WCET (Worst Case Execution Time) analysis and scheduling analysis techniques. (Though we haven't yet developed Rust friendly tooling for that.)

Requirements

  • Rust 1.31.0+

  • Applications must be written using the 2018 edition.

User documentation

API reference

Acknowledgments

This crate is based on the RTFM language created by the Embedded Systems group at Luleå University of Technology, led by Prof. Per Lindgren.

References

License

All source code (including code snippets) is licensed under either of

at your option.

The written prose contained within the book is licensed under the terms of the Creative Commons CC-BY-SA v4.0 license (LICENSE-CC-BY-SA or https://creativecommons.org/licenses/by-sa/4.0/legalcode).

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be licensed as above, without any additional terms or conditions.


  1. Eriksson, J., Häggström, F., Aittamaa, S., Kruglyak, A., & Lindgren, P. (2013, June). Real-time for the masses, step 1: Programming API and static priority SRP kernel primitives. In Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on (pp. 110-113). IEEE. ↩︎

  2. Lindgren, P., Fresk, E., Lindner, M., Lindner, A., Pereira, D., & Pinho, L. M. (2016). Abstract timers and their implementation onto the arm cortex-m family of mcus. ACM SIGBED Review, 13(1), 48-53. ↩︎