Book: Touchup README and preface

README.md

@@ -1,11 +1,11 @@
 # Real-Time Interrupt-driven Concurrency
 
+> The hardware accelerated Rust RTOS
+
 A concurrency framework for building real-time systems.
 
-Formerly known as Real-Time For the Masses.
+[![crates.io](https://img.shields.io/crates/v/rtic)](https://crates.io/crates/rtic)
-
+[![docs.rs](https://docs.rs/rtic/badge.svg)](https://docs.rs/rtic)
-[![crates.io](https://img.shields.io/crates/v/cortex-m-rtic)](https://crates.io/crates/cortex-m-rtic)
-[![docs.rs](https://docs.rs/cortex-m-rtic/badge.svg)](https://docs.rs/cortex-m-rtic)
 [![book](https://img.shields.io/badge/web-rtic.rs-red.svg?style=flat&label=book&colorB=d33847)](https://rtic.rs/)
 [![matrix](https://img.shields.io/matrix/rtic:matrix.org)](https://matrix.to/#/#rtic:matrix.org)
 [![Meeting notes](https://hackmd.io/badge.svg)](https://hackmd.io/@xmis9JvZT8Gvo9lOEKyZ4Q/SkBJKsjuH)
@@ -24,7 +24,7 @@ Formerly known as Real-Time For the Masses.
 
 - Support for prioritization of tasks and, thus, **preemptive multitasking**.
 
-- **Efficient and data race free memory sharing** through fine grained *priority
+- **Efficient and data race free memory sharing** through fine-grained *priority
   based* critical sections [^1].
 
 - **Deadlock free execution** guaranteed at compile time. This is a stronger
@@ -44,16 +44,6 @@ Formerly known as Real-Time For the Masses.
 - This task model is amenable to known WCET (Worst Case Execution Time) analysis
   and scheduling analysis techniques.
 
-### Crate `cortex-m` 0.6 vs 0.7 in RTIC 0.5.x
-
-The crate `cortex-m` 0.7 started using trait `InterruptNumber` for interrupts instead of `Nr` from `bare-metal`. In order to preserve backwards compatibility, RTIC 0.5.x will keep using `cortex-m` 0.6 by default. `cortex-m` 0.7 can be enabled using the feature `cortex-m-7` and disabling default features:
-
-```
-cortex-m-rtic = { version = "0.5.8", default-features = false, features = ["cortex-m-7"] }
-```
-
-RTIC 1.0.0 already uses `cortex-m` 0.7 by default.
-
 ## [User documentation](https://rtic.rs)
 
 Documentation for the [development version](https://rtic.rs/dev).
@@ -68,10 +58,10 @@ Documentation for the [development version](https://rtic.rs/dev).
 
 Join us and talk about RTIC in the [Matrix room][matrix-room].
 
-Weekly meeting notes can be found over at [HackMD][hackmd]
+Weekly meeting minutes can be found over at [RTIC HackMD][hackmd]
 
 [matrix-room]: https://matrix.to/#/#rtic:matrix.org
-[hackmd]: https://hackmd.io/@xmis9JvZT8Gvo9lOEKyZ4Q/SkBJKsjuH
+[hackmd]: rtic.rs/meeting
 
 ## Contributing
 

book/en/src/preface.md

@@ -10,14 +10,22 @@
 This book contains user level documentation for the Real-Time Interrupt-driven Concurrency
 (RTIC) framework. The API reference is available [here](../../api/).
 
-<!-- Formerly known as Real-Time For the Masses. -->
-
-<!--There is a translation of this book in [Russian].-->
-
-<!--[Russian]: ../ru/index.html-->
-
 This is the documentation for RTIC v2.x. 
 
+{{#include ../../../README.md:59}} 
+
+Older releases:
+[RTIC v1.x](/1.0) | [RTIC v0.5.x (unsupported)](/0.5) | [RTFM v0.4.x (unsupported)](/0.4) 
+
+{{#include ../../../README.md:7:12}}
+
+## Is RTIC an RTOS?
+
+A common question is whether RTIC is an RTOS or not, and depending on your background the answer may vary. From RTIC's developers point of view; RTIC is a hardware accelerated RTOS that utilizes the hardware such as the NVIC on Cortex-M MCUs, CLIC on RISC-V etc. to perform scheduling, rather than the more classical software kernel.
+
+Another common view from the community is that RTIC is a concurrency framework as there
+is no software kernel and that it relies on external HALs.
+
 ## RTIC - The Past, current and Future
 
 This section gives a background to the RTIC model. Feel free to skip to section [RTIC the model](preface.md#rtic-the-model) for a TL;DR.
@@ -40,7 +48,7 @@ The RTIC framework takes the outset from real-time systems research at Luleå Un
 - predictable scheduling, with bounded priority inversion by a single (named) critical section
 - theoretical underpinning amenable to static analysis (e.g., for task response times and overall schedulability)
 
-SRP comes with a set of system wide requirements:
+SRP comes with a set of system-wide requirements:
 - each task is associated a static priority,
 - tasks execute on a single-core,  
 - tasks must be run-to-completion, and
@@ -122,21 +130,21 @@ In this way RTIC fuses SRP based preemptive scheduling with a zero-cost hardware
 
 Given that the approach is dead simple, how come SRP and hardware accelerated scheduling is not adopted by any other mainstream RTOS?
 
-The answer is simple, the commonly adopted threading model does not lend itself well to static analysis - there is no known way to extract the task/resource dependencies from the source code at compile time (thus ceilings cannot be efficiently computed and the LIFO resource locking requirement cannot be ensured). Thus SRP based scheduling is in the general case out of reach for any thread based RTOS. 
+The answer is simple, the commonly adopted threading model does not lend itself well to static analysis - there is no known way to extract the task/resource dependencies from the source code at compile time (thus ceilings cannot be efficiently computed and the LIFO resource locking requirement cannot be ensured). Thus, SRP based scheduling is in the general case out of reach for any thread based RTOS. 
 
 ## RTIC into the Future
 
 Asynchronous programming in various forms are getting increased popularity and language support. Rust natively provides an `async`/`await` API for cooperative multitasking and the compiler generates the necessary boilerplate for storing and retrieving execution contexts (i.e., managing the set of local variables that spans each `await`). 
 
-The Rust standard library provides collections for dynamically allocated data-structures (useful to manage execution contexts at run-time. However, in the setting of resource constrained real-time systems, dynamic allocations are problematic (both regarding performance and reliability - Rust runs into a *panic* on an out-of-memory condition). Thus, static allocation is king!
+The Rust standard library provides collections for dynamically allocated data-structures which are useful to manage execution contexts at run-time. However, in the setting of resource constrained real-time systems, dynamic allocations are problematic (both regarding performance and reliability - Rust runs into a *panic* on an out-of-memory condition). Thus, static allocation is the preferable approach!
 
-RTIC provides a mechanism for `async`/`await` that relies solely on static allocations. However, the implementation relies on the `#![feature(type_alias_impl_trait)]` (TAIT) which is undergoing stabilization (thus RTIC 2.0.x currently requires a *nightly* toolchain). Technically, using TAIT, the compiler determines the size of each execution context allowing static allocation.
+RTIC provides a mechanism for `async`/`await` that relies solely on static allocations. However, the implementation relies on the `#![feature(type_alias_impl_trait)]` (TAIT) which is undergoing stabilization (thus RTIC v2.x currently requires a *nightly* toolchain). Technically, using TAIT, the compiler determines the size of each execution context allowing static allocation.
 
 From a modelling perspective `async/await` lifts the run-to-completion requirement of SRP, and each section of code between two yield points (`await`s) can be seen as an individual task. The compiler will reject any attempt to `await` while holding a resource (not doing so would break the strict LIFO requirement on resource usage under SRP).
 
-So with the technical stuff out of the way, what does `async/await` bring to the RTIC table?
+So with the technical stuff out of the way, what does `async/await` bring to the table?
 
-The answer is - improved ergonomics! In cases you want a task to perform a sequence of requests (and await their results in order to progress). Without `async`/`await` the programmer would be forced to split the task into individual sub-tasks and maintain some sort of state encoding (and manually progress by selecting sub-task). Using `async/await` each yield point (`await`) essentially represents a state, and the progression mechanism is built automatically for you at compile time by means of `Futures`. 
+The answer is - improved ergonomics! A recurring use case is to have task perform a sequence of requests and then await their results in order to progress. Without `async`/`await` the programmer would be forced to split the task into individual sub-tasks and maintain some sort of state encoding (and manually progress by selecting sub-task). Using `async/await` each yield point (`await`) essentially represents a state, and the progression mechanism is built automatically for you at compile time by means of `Futures`. 
 
 Rust `async`/`await` support is still incomplete and/or under development (e.g., there are no stable way to express `async` closures, precluding use in iterator patterns). Nevertheless, Rust `async`/`await` is production ready and covers most common use cases. 
 
@@ -152,18 +160,4 @@ At compile time the task/resource model is analyzed under SRP and executable cod
   - hardware task scheduling is performed directly by the hardware, and
   - software task scheduling is performed by auto generated async executors tailored to the application.
 
-The RTIC API design ensures that both SRP requirements and Rust soundness rules are upheld at all times, thus the executable model is correct by construction. Overall, the generated code infers no additional overhead in comparison to a hand-written implementation, thus in Rust terms RTIC offers a zero-cost abstraction to concurrency.
+The RTIC API design ensures that both SRP requirements and Rust soundness rules are upheld at all times, thus the executable model is correct by construction. Overall, the generated code infers no additional overhead in comparison to a handwritten implementation, thus in Rust terms RTIC offers a zero-cost abstraction to concurrency.
-
-<!--
-
-For the documentation older versions, see;
-
-* v1.0.x go [here](/1.0).
-* v0.5.x go [here](/0.5).
-* v0.4.x go [here](/0.4). -->
-
-<!-- 
-{{#include ../../../README.md:7:47}}
-
-{{#include ../../../README.md:48:}} 
--->