Static Pattern-based Execution (SRE) in the Fault Tolerant Scheduler
In the FTS, using static patterns is a simple technique, which uses the concept of (m,k) requirements. We execute a pattern such as {1,1,0,1} . When there is a " 1 " in the pattern, the reliable version is executed, and when there is " 0 ", the unreliable version is executed. In this pattern, three out of four correct instances are executed, which complies to the (m,k) -requirement (3,4). This means that there will always be three correct executions in every four instances. There are two types of patterns available for the user, i.e. R-patterns and E-patterns [1] . An R-pattern contains all "0"s at the beginning and all " 1 "s at the end, such as in {0,0,0,1,1,1,1} . In E-patterns, the " 1 "s and " 0 "s are distributed evenly. The pattern's sufficient correctness proofs of complying to an (m,k) requirement can be read in [2] and [3]. The FTS executes this predefined pattern. The pattern is read by the FTS from left to...