(1) For the inter-process grammar compression algorithm, the last Sequitur pass will not apply the twins-removal rule, as that rule makes it difficult for the decoder to restore the original rules.
(2) A simple mini-app generator has been implemented. Some simple patterns are supported:
a. nested loops
b. ranks with identical grammars
c. waitall()
The generator has not been extensively tested yet.
(1) For the inter-process grammar compression algorithm, the last Sequitur pass will not apply the twins-removal rule, as that rule makes it difficult for the decoder to restore the original rules.
(2) A simple mini-app generator has been implemented. Some simple patterns are supported: a. nested loops b. ranks with identical grammars c. waitall()
The generator has not been extensively tested yet.