blob: 08d4c4e68758ee1d6260eefb96026f4f3e650eb9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
+++
title = "Short Static Region Heuristic"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["2b1d", "1c2h"]
forwardlinks = ["2b1a", "1c2h", "2b1d2"]
zettelid = "2b1d1"
+++
This strategy involves only converting small regions to reduce the
length of phi-chains in the case of phi-predication ([\#2b1a]). This
means that regions are only formed if these only take four clock cycles
to execute, for example. One can also put the restriction on the longest
and the shortest path to keep these as close as possible, meaning that
the difference between the shortest and the longest path is three
cycles. More heuristics can be found in ([\#1c2h]).
[\#2b1a]: /zettel/2b1a
[\#1c2h]: /zettel/1c2h
|
