ichthyo/LUMIERA.clone
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Scheduler-test: simplify graph generation yet more

Browse source 
Initially the model was that of a single graph starting
with one seed node and joining all chains into a single exit node.

This however is not well suited to simulate realistic calculations,
and thus the ability for injecting additional seeds and to randomly
sever some chains was added -- which overthrows the assumption of
a single exit node at the end, where the final hash can be retrieved.

The topology generation used to pick up all open ends, in order to
join them explicitly into a reserved last node; in the light of the
above changes, this seems like an superfluous complexity, and adds
a lot of redundant checks to the code, since the main body of the
algorithm, in its current form, already does all the necessary
bound checks. It suffices thus to just terminate the processing
when the complete node space is visited and wired.

Unfortunately this requires to fix basically all node hashes
and a lot of the statistics values of the test; yet overall
the generated graphs are much more logical; so this change
is deemed worth the effort.
This commit is contained in:
Fischlurch 2024-03-10 02:47:32 +01:00
parent d8eb334b17
commit a983a506b0
3 changed files with 200 additions and 226 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

304
tests/vault/gear/test-chain-load-test.cpp
View file

@ -103,7 +103,7 @@ namespace test {
.buildTopology(); .buildTopology();
// while building the graph, node hashes are computed // while building the graph, node hashes are computed
CHECK (testLoad.getHash() == 0x439FD852C19E2D68); CHECK (testLoad.getHash() == 0x554F5086DE5B0861);
BlockFlowAlloc bFlow; BlockFlowAlloc bFlow;
@ -114,7 +114,7 @@ namespace test {
.launch_and_wait(); .launch_and_wait();
// invocation through Scheduler has reproduced all node hashes // invocation through Scheduler has reproduced all node hashes
CHECK (testLoad.getHash() == 0x439FD852C19E2D68); CHECK (testLoad.getHash() == 0x554F5086DE5B0861);
} }
@ -296,15 +296,16 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x9E0C7D98B61E1789); CHECK (graph.getHash() == 0x710D010554FEA614);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 8); // expands faster, with only 8 levels CHECK (stat.levels == 7); // expands faster, with only 7 levels
CHECK (stat.indicators[STAT_NODE].pL == 4); // this time ∅ 4 Nodes / level CHECK (stat.indicators[STAT_NODE].pL == "4.5714286"_expect); // this time ∅ 4.6 Nodes / level
CHECK (stat.indicators[STAT_FORK].cnt == 7); // 7 »Fork« events CHECK (stat.indicators[STAT_FORK].cnt == 7); // 7 »Fork« events
CHECK (stat.indicators[STAT_JOIN].cnt == 2); // but also 2 »Join« nodes... CHECK (stat.indicators[STAT_EXIT].cnt == 10); // but 10 »Exit« nodes....
CHECK (stat.indicators[STAT_JOIN].cL == "0.92857143"_expect); // which are totally concentrated towards end CHECK (stat.indicators[STAT_JOIN].cnt == 1); // and even one »Join« node....
CHECK (stat.indicators[STAT_EXIT].cnt == 1); // finally to connect to the single exit CHECK (stat.indicators[STAT_EXIT].cL == 1); // which are totally concentrated towards end
CHECK (stat.indicators[STAT_JOIN].cL == 1); // when nodes are exhausted
// if the generation is allowed to run for longer, // if the generation is allowed to run for longer,
@ -315,14 +316,16 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (gra_2.getHash() == 0x28B121BE7F1F7362); CHECK (gra_2.getHash() == 0x619491B22C3F8A6F);
stat = gra_2.computeGraphStatistics(); stat = gra_2.computeGraphStatistics();
CHECK (stat.levels == 37); // much more levels, as can be expected CHECK (stat.levels == 36); // much more levels, as can be expected
CHECK (stat.indicators[STAT_NODE].pL == "6.9189189"_expect); // ∅ 7 Nodes per level CHECK (stat.indicators[STAT_NODE].pL == "7.1111111"_expect); // ∅ 7 Nodes per level
CHECK (stat.indicators[STAT_JOIN].pL == "0.78378378"_expect); // but also almost one join per level to deal with the limitation CHECK (stat.indicators[STAT_JOIN].pL == "0.77777778"_expect); // but also almost one join per level to deal with the limitation
CHECK (stat.indicators[STAT_FORK].frac == "0.24609375"_expect); // 25% forks (there is just not enough room for more forks) CHECK (stat.indicators[STAT_FORK].frac == "0.24609375"_expect); // 25% forks (there is just not enough room for more forks)
CHECK (stat.indicators[STAT_JOIN].frac == "0.11328125"_expect); // and 11% joins CHECK (stat.indicators[STAT_JOIN].frac == "0.109375"_expect); // and 10% joins
CHECK (stat.indicators[STAT_EXIT].cnt == 3); // ...leading to 3 »Exit« nodes
CHECK (stat.indicators[STAT_EXIT].cL == 1); // ....located at the very end
} }
@ -347,14 +350,14 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x1D201B70F18E995A); CHECK (graph.getHash() == 0x3E9BFAE5E686BEB4);
auto stat = graph.computeGraphStatistics(); auto stat = graph.computeGraphStatistics();
CHECK (stat.levels == 9); // This connection pattern filled 9 levels CHECK (stat.levels == 8); // This connection pattern filled 8 levels
CHECK (stat.indicators[STAT_JOIN].cnt == 4); // we got 4 »Join« events (reductions= CHECK (stat.indicators[STAT_JOIN].cnt == 4); // we got 4 »Join« events (reductions=
CHECK (stat.indicators[STAT_FORK].cnt == 1); // and the single expansion/fork CHECK (stat.indicators[STAT_FORK].cnt == 1); // and the single expansion/fork
CHECK (stat.indicators[STAT_FORK].cL == 0.0); // ...sitting right at the beginning CHECK (stat.indicators[STAT_FORK].cL == 0.0); // ...sitting right at the beginning
CHECK (stat.indicators[STAT_NODE].cL == "0.37890625"_expect); // Nodes are concentrated towards the beginning CHECK (stat.indicators[STAT_NODE].cL == "0.42857143"_expect); // Nodes are concentrated towards the beginning
// expansion and reduction can counterbalance each other // expansion and reduction can counterbalance each other
@ -364,15 +367,15 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x8AF4BDAE5AA6880C); CHECK (graph.getHash() == 0xB0335595D34F1D8D);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 12); // This example runs a bit longer CHECK (stat.levels == 11); // This example runs a bit longer
CHECK (stat.indicators[STAT_NODE].pL == "2.6666667"_expect); // in the middle threading 3-5 Nodes per Level CHECK (stat.indicators[STAT_NODE].pL == "2.9090909"_expect); // in the middle threading 3-5 Nodes per Level
CHECK (stat.indicators[STAT_FORK].cnt == 5); // with 5 expansions CHECK (stat.indicators[STAT_FORK].cnt == 5); // with 5 expansions
CHECK (stat.indicators[STAT_JOIN].cnt == 3); // and 3 reductions CHECK (stat.indicators[STAT_JOIN].cnt == 3); // and 3 reductions
CHECK (stat.indicators[STAT_FORK].cL == "0.45454545"_expect); // forks dominating earlier CHECK (stat.indicators[STAT_FORK].cL == 0.5); // forks dominating earlier
CHECK (stat.indicators[STAT_JOIN].cL == "0.66666667"_expect); // while joins need forks as prerequisite CHECK (stat.indicators[STAT_JOIN].cL == "0.73333333"_expect); // while joins need forks as prerequisite
// expansion bursts can be balanced with a heightened reduction intensity // expansion bursts can be balanced with a heightened reduction intensity
@ -415,18 +418,18 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x11BB1409A61A9B78); CHECK (graph.getHash() == 0xBC35A96B3CE1F39F);
auto stat = graph.computeGraphStatistics(); auto stat = graph.computeGraphStatistics();
CHECK (stat.levels == 8); // 8 Levels... CHECK (stat.levels == 7); // 7 Levels...
CHECK (stat.indicators[STAT_SEED].cnt == 11); // overall 11 »Seed« events generated several ongoing chains CHECK (stat.indicators[STAT_SEED].cnt == 12); // overall 12 »Seed« events generated several ongoing chains
CHECK (stat.indicators[STAT_FORK].cnt == 0); // yet no branching/expanding CHECK (stat.indicators[STAT_FORK].cnt == 0); // yet no branching/expanding
CHECK (stat.indicators[STAT_LINK].cnt == 19); // thus more and more chains were just carried on CHECK (stat.indicators[STAT_LINK].cnt == 14); // thus more and more chains were just carried on
CHECK (stat.indicators[STAT_LINK].pL == 2.375); // on average 2-3 per level are continuations CHECK (stat.indicators[STAT_LINK].pL == 2); // on average 2-3 per level are continuations
CHECK (stat.indicators[STAT_NODE].pL == 4); // leading to ∅ 4 Nodes per level CHECK (stat.indicators[STAT_NODE].pL == "4.5714286"_expect); // leading to ∅ 4.5 Nodes per level
CHECK (stat.indicators[STAT_NODE].cL == "0.63392857"_expect); // with nodes amassing towards the end CHECK (stat.indicators[STAT_NODE].cL == "0.734375"_expect); // with nodes amassing towards the end
CHECK (stat.indicators[STAT_LINK].cL == "0.63157895"_expect); // because there are increasingly more links to carry-on CHECK (stat.indicators[STAT_LINK].cL == "0.64285714"_expect); // because there are increasingly more links to carry-on
CHECK (stat.indicators[STAT_JOIN].cL == "0.92857143"_expect); // while joining only happens at the end when connecting to exit CHECK (stat.indicators[STAT_JOIN].cL == 1); // while joining only happens at the very end
// combining random seed nodes with reduction leads to a processing pattern // combining random seed nodes with reduction leads to a processing pattern
@ -492,21 +495,20 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0xAF4204DD69BB467C); CHECK (graph.getHash() == 0x1D0A7C39647340AA);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 15); // CHECK (stat.levels == 14); //
CHECK (stat.segments == 5); // this time the graph is segregated into 5 parts CHECK (stat.segments == 5); // this time the graph is segregated into 5 parts
CHECK (stat.indicators[STAT_NODE].pS == 6.4); // with 4 Nodes per segment CHECK (stat.indicators[STAT_NODE].pS == "6.4"_expect); // with 4 Nodes per segment
CHECK (stat.indicators[STAT_FORK].sL == 0.0); // where »Fork« is always placed at the beginning of each segment CHECK (stat.indicators[STAT_FORK].sL == "0"_expect); // where »Fork« is always placed at the beginning of each segment
CHECK (stat.indicators[STAT_LINK].sL == 0.5); // carry-on »Link« nodes in the very middle of the segment CHECK (stat.indicators[STAT_EXIT].sL == "1"_expect); // and several »Exit« at the end
CHECK (stat.indicators[STAT_EXIT].sL == 1.0); // and several »Exit« at the end CHECK (stat.indicators[STAT_EXIT].pS == "3"_expect); // with always 3 exits per segment
CHECK (stat.indicators[STAT_EXIT].pS == 2.6); // averaging 2.6 exits per segment (4·3 + 1)/5 CHECK (stat.indicators[STAT_SEED].cnt == 5); // so overall we get 5 »Seed« nodes
CHECK (stat.indicators[STAT_SEED].cnt == 5); // so overall we get 8 »Seed« nodes
CHECK (stat.indicators[STAT_FORK].cnt == 5); // 5 »Fork« nodes CHECK (stat.indicators[STAT_FORK].cnt == 5); // 5 »Fork« nodes
CHECK (stat.indicators[STAT_EXIT].cnt == 13); // 13 »Exit« nodes CHECK (stat.indicators[STAT_EXIT].cnt == 15); // 15 »Exit« nodes
CHECK (stat.indicators[STAT_LINK].cnt == 14); // and 14 interconnecting links CHECK (stat.indicators[STAT_LINK].cnt == 12); // and 12 interconnecting links
CHECK (stat.indicators[STAT_NODE].pL == "2.1333333"_expect); // leading to ∅ ~2 Nodes per level CHECK (stat.indicators[STAT_NODE].pL == "2.2857143"_expect); // leading to ∅ ~2 Nodes per level
// however, by chance, with more randomised pruning points... // however, by chance, with more randomised pruning points...
@ -517,14 +519,14 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0xF14A09EEFFEC7B18); CHECK (graph.getHash() == 0x12BB22F76ECC5C1B);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.segments == 1); // ...the graph can evade severing altogether CHECK (stat.segments == 1); // ...the graph can evade severing altogether
CHECK (stat.indicators[STAT_FORK].cnt == 2); // with overall 2 »Fork« CHECK (stat.indicators[STAT_FORK].cnt == 3); // with overall 3 »Fork«
CHECK (stat.indicators[STAT_EXIT].cnt == 9); // and 9 »Exit« nodes CHECK (stat.indicators[STAT_EXIT].cnt == 10); // and 10 »Exit« nodes
CHECK (stat.indicators[STAT_EXIT].pL == "1.2857143"_expect); // ∅ 1.3 exits per level CHECK (stat.indicators[STAT_EXIT].pL == "1.6666667"_expect); // ∅ 1.6 exits per level
CHECK (stat.indicators[STAT_NODE].pL == "4.5714286"_expect); // ∅ 4.6 nodes per level CHECK (stat.indicators[STAT_NODE].pL == "5.3333333"_expect); // ∅ 5.3 nodes per level
graph.expansionRule(graph.rule()); // reset graph.expansionRule(graph.rule()); // reset
@ -540,22 +542,22 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x17B66B1A4DE2172A); CHECK (graph.getHash() == 0xBFFA04FE8202C708);
// NOTE: this example produced 10 disjoint graph parts, // NOTE: this example produced 11 disjoint graph parts,
// which however start and end interleaved // which however start and end interleaved
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 13); // Generation carries on for 13 levels CHECK (stat.levels == 12); // Generation carries on for 12 levels
CHECK (stat.segments == 2); // NOTE: the detection of segments FAILS here (due to interleaved starts) CHECK (stat.segments == 1); // NOTE: the detection of segments FAILS here (due to interleaved starts)
CHECK (stat.indicators[STAT_SEED].cnt == 12); // 12 »Seed« nodes CHECK (stat.indicators[STAT_SEED].cnt == 12); // 12 »Seed« nodes
CHECK (stat.indicators[STAT_EXIT].cnt == 11); // 11 »Exit« nodes (including the isolated, last one) CHECK (stat.indicators[STAT_EXIT].cnt == 11); // 11 »Exit« nodes (including the isolated, last one)
CHECK (stat.indicators[STAT_LINK].cnt == 10); // 10 interconnecting links CHECK (stat.indicators[STAT_LINK].cnt == 10); // 10 interconnecting links
CHECK (stat.indicators[STAT_JOIN].cnt == 1); // and one additional »Join« CHECK (stat.indicators[STAT_JOIN].cnt == 1); // and one additional »Join«
CHECK (stat.indicators[STAT_JOIN].cL == "0.91666667"_expect); // ....appended at graph completion CHECK (stat.indicators[STAT_JOIN].cL == "1"_expect); // ....appended at graph completion
CHECK (stat.indicators[STAT_NODE].pL == "2.4615385"_expect); // overall ∅ 2½ nodes per level CHECK (stat.indicators[STAT_NODE].pL == "2.6666667"_expect); // overall ∅ 2⅔ nodes per level (converging ⟶ 3)
CHECK (stat.indicators[STAT_NODE].cL == "0.48697917"_expect); // with generally levelled distribution CHECK (stat.indicators[STAT_NODE].cL == "0.52840909"_expect); // with generally levelled distribution
CHECK (stat.indicators[STAT_SEED].cL == "0.46527778"_expect); // also for the seeds CHECK (stat.indicators[STAT_SEED].cL == "0.5"_expect); // also for the seeds
CHECK (stat.indicators[STAT_EXIT].cL == "0.58333333"_expect); // and the exits CHECK (stat.indicators[STAT_EXIT].cL == "0.62809917"_expect); // and the exits
// The next example is »interesting« insofar it shows self-similarity // The next example is »interesting« insofar it shows self-similarity
@ -570,13 +572,13 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0xDAF51E27A6D91151); CHECK (graph.getHash() == 0xFB0A0EA9B7072507);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 9); // Generation carries on for 13 levels CHECK (stat.levels == 8); // Generation carries on for 13 levels
CHECK (stat.indicators[STAT_JOIN].pL == 1); // with one »Join« event per level on average CHECK (stat.indicators[STAT_JOIN].pL == 1); // with one »Join« event per level on average
CHECK (stat.indicators[STAT_SEED].cnt == 21); // seeds are injected with /fixed rate/, meaning that CHECK (stat.indicators[STAT_SEED].cnt == 22); // seeds are injected with /fixed rate/, meaning that
CHECK (stat.indicators[STAT_SEED].pL == "2.3333333"_expect); // there is one additional seed for every node in previous level CHECK (stat.indicators[STAT_SEED].pL == 2.75); // there is one additional seed for every node in previous level
} }
@ -617,21 +619,21 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0xCAFA895DF9BDFB70); CHECK (graph.getHash() == 0x6B5D7BD3130044E2);
auto stat = graph.computeGraphStatistics(); auto stat = graph.computeGraphStatistics();
CHECK (stat.indicators[STAT_NODE].cL == "0.49970598"_expect); // The resulting distribution of nodes is stable and even CHECK (stat.indicators[STAT_NODE].cL == "0.50509511"_expect); // The resulting distribution of nodes is stable and balanced
CHECK (stat.levels == 94); // ...arranging the 256 nodes into 94 levels CHECK (stat.levels == 93); // ...arranging the 256 nodes into 93 levels
CHECK (stat.indicators[STAT_NODE].pL == "2.7234043"_expect); // ...with ∅ 2.7 nodes per level CHECK (stat.indicators[STAT_NODE].pL == "2.7526882"_expect); // ...with ∅ 2.7 nodes per level
CHECK (stat.indicators[STAT_SEED].pL == "1.0319149"_expect); // comprised of ∅ 1 seed per level CHECK (stat.indicators[STAT_SEED].pL == "1.0537634"_expect); // comprised of ∅ 1 seed per level
CHECK (stat.indicators[STAT_JOIN].pL == "0.4787234"_expect); // ~ ∅ ½ join per level CHECK (stat.indicators[STAT_JOIN].pL == "0.48387097"_expect); // ~ ∅ ½ join per level
CHECK (stat.indicators[STAT_EXIT].pL == "0.32978723"_expect); // ~ ∅ ⅓ exit per level CHECK (stat.indicators[STAT_EXIT].pL == "0.34408602"_expect); // ~ ∅ ⅓ exit per level
CHECK (stat.indicators[STAT_SEED].frac == "0.37890625"_expect); // overall, 38% nodes are seeds CHECK (stat.indicators[STAT_SEED].frac == "0.3828125"_expect); // overall, 38% nodes are seeds
CHECK (stat.indicators[STAT_EXIT].frac == "0.12109375"_expect); // and 12% are exit nodes CHECK (stat.indicators[STAT_EXIT].frac == "0.125"_expect); // and ⅛ are exit nodes
CHECK (stat.indicators[STAT_SEED].cLW == "0.47963675"_expect); // the density centre of all node kinds CHECK (stat.indicators[STAT_SEED].cLW == "0.49273514"_expect); // the density centre of all node kinds
CHECK (stat.indicators[STAT_LINK].cLW == "0.49055446"_expect); // ...is close to the middle CHECK (stat.indicators[STAT_LINK].cLW == "0.49588657"_expect); // ...is close to the middle
CHECK (stat.indicators[STAT_JOIN].cLW == "0.53299599"_expect); CHECK (stat.indicators[STAT_JOIN].cLW == "0.52481335"_expect);
CHECK (stat.indicators[STAT_EXIT].cLW == "0.55210026"_expect); CHECK (stat.indicators[STAT_EXIT].cLW == "0.55716297"_expect);
@ -646,13 +648,13 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x38788543EA81C664); CHECK (graph.getHash() == 0x20122CF2A1F301D1);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 78); // CHECK (stat.levels == 77); //
CHECK (stat.indicators[STAT_NODE].pL == "3.2820513"_expect); // ∅ 3.3 nodes per level CHECK (stat.indicators[STAT_NODE].pL == "3.3246753"_expect); // ∅ 3.3 nodes per level
CHECK (stat.indicators[STAT_SEED].frac == "0.41796875"_expect); // 42% seed CHECK (stat.indicators[STAT_SEED].frac == "0.421875"_expect); // 42% seed
CHECK (stat.indicators[STAT_EXIT].frac == "0.140625"_expect); // 14% exit CHECK (stat.indicators[STAT_EXIT].frac == "0.14453125"_expect); // 14% exit
@ -715,14 +717,14 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x904E12AB04888BD1); CHECK (graph.getHash() == 0x7C0453E7A4F6418D);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 45); // CHECK (stat.levels == 44); //
CHECK (stat.indicators[STAT_NODE].pL == "5.6888889"_expect); // ∅ 5.7 nodes per level CHECK (stat.indicators[STAT_NODE].pL == "5.8181818"_expect); // ∅ 5.7 nodes per level
CHECK (stat.indicators[STAT_SEED].pL == "2.3555556"_expect); // ∅ 2.4 seeds CHECK (stat.indicators[STAT_SEED].pL == "2.4318182"_expect); // ∅ 2.4 seeds
CHECK (stat.indicators[STAT_LINK].pL == "2.4888889"_expect); // ∅ 2.5 link nodes CHECK (stat.indicators[STAT_LINK].pL == "2.4772727"_expect); // ∅ 2.5 link nodes
CHECK (stat.indicators[STAT_EXIT].pL == "0.84444444"_expect); // ∅ 0.8 join/exit nodes — indicating stronger spread/reduction CHECK (stat.indicators[STAT_EXIT].pL == "1"_expect); // ∅ 1 join/exit nodes — indicating stronger spread/reduction
@ -740,17 +742,17 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0xD82AB42040F5EBF7); CHECK (graph.getHash() == 0x904A906B7859301A);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 22); // ▶ resulting graph is very dense, hitting the parallelisation limit CHECK (stat.levels == 21); // ▶ resulting graph is very dense, hitting the parallelisation limit
CHECK (stat.indicators[STAT_NODE].pL == "11.636364"_expect); // ∅ almost 12 nodes per level ! CHECK (stat.indicators[STAT_NODE].pL == "12.190476"_expect); // ∅ more than 12 nodes per level !
CHECK (stat.indicators[STAT_SEED].pL == "6.5454545"_expect); // comprised of ∅ 6.5 seeds CHECK (stat.indicators[STAT_SEED].pL == "6.8571429"_expect); // comprised of ∅ 6.9 seeds
CHECK (stat.indicators[STAT_LINK].pL == "2.2727273"_expect); // ∅ 2.3 links CHECK (stat.indicators[STAT_LINK].pL == "2.3809524"_expect); // ∅ 2.4 links
CHECK (stat.indicators[STAT_JOIN].pL == "2.6818182"_expect); // ∅ 2.7 joins CHECK (stat.indicators[STAT_JOIN].pL == "2.8095238"_expect); // ∅ 2.8 joins
CHECK (stat.indicators[STAT_EXIT].pL == "2.4090909"_expect); // ∅ 2.4 exits CHECK (stat.indicators[STAT_EXIT].pL == "2.5714286"_expect); // ∅ 2.6 exits
CHECK (stat.indicators[STAT_SEED].frac == "0.5625"_expect ); // 56% seed CHECK (stat.indicators[STAT_SEED].frac == "0.5625"_expect ); // 56% seed
CHECK (stat.indicators[STAT_EXIT].frac == "0.20703125"_expect); // 20% exit CHECK (stat.indicators[STAT_EXIT].frac == "0.2109375"_expect); // 21% exit
@ -764,15 +766,15 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0xD65FFB73A3C1B4B7); CHECK (graph.getHash() == 0x9453C56534FF9CD6);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 27); // CHECK (stat.levels == 26); //
CHECK (stat.indicators[STAT_NODE].pL == "9.4814815"_expect); // ∅ 9.5 nodes per level — ⅓ less dense CHECK (stat.indicators[STAT_NODE].pL == "9.8461538"_expect); // ∅ 9.8 nodes per level — ⅓ less dense
CHECK (stat.indicators[STAT_SEED].frac == "0.3984375"_expect); // 40% seed CHECK (stat.indicators[STAT_SEED].frac == "0.40234375"_expect); // 40% seed
CHECK (stat.indicators[STAT_LINK].frac == "0.45703125"_expect); // 45% link CHECK (stat.indicators[STAT_LINK].frac == "0.453125"_expect); // 45% link
CHECK (stat.indicators[STAT_JOIN].frac == "0.109375"_expect ); // 11% joins CHECK (stat.indicators[STAT_JOIN].frac == "0.109375"_expect ); // 11% joins
CHECK (stat.indicators[STAT_EXIT].frac == "0.0859375"_expect); // 8% exits — hinting at very strong reduction CHECK (stat.indicators[STAT_EXIT].frac == "0.08984375"_expect); // 8% exits — hinting at very strong reduction
// The same setup with different seeing produces a // The same setup with different seeing produces a
@ -785,11 +787,11 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x53C7B04F8D234E66); CHECK (graph.getHash() == 0xA57727C2ED277C87);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 130); // CHECK (stat.levels == 129); //
CHECK (stat.indicators[STAT_NODE].pL == "1.9692308"_expect); // ∅ ~2 nodes per level — much lesser density CHECK (stat.indicators[STAT_NODE].pL == "1.9844961"_expect); // ∅ ~2 nodes per level — much lesser density
CHECK (stat.indicators[STAT_SEED].frac == "0.3359375"_expect); // 33% seed CHECK (stat.indicators[STAT_SEED].frac == "0.3359375"_expect); // 33% seed
CHECK (stat.indicators[STAT_LINK].frac == "0.4140625"_expect); // 42% link CHECK (stat.indicators[STAT_LINK].frac == "0.4140625"_expect); // 42% link
CHECK (stat.indicators[STAT_JOIN].frac == "0.1640625"_expect); // 16% join CHECK (stat.indicators[STAT_JOIN].frac == "0.1640625"_expect); // 16% join
@ -806,15 +808,15 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x7DA33206D0773991); CHECK (graph.getHash() == 0x4D0575F8BD269FC3);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 21); // rather dense CHECK (stat.levels == 20); // rather dense
CHECK (stat.indicators[STAT_NODE].pL == "12.190476"_expect); // ∅ 12.2 nodes per level CHECK (stat.indicators[STAT_NODE].pL == "12.8"_expect); // ∅ 12.8 nodes per level
CHECK (stat.indicators[STAT_SEED].pL == "7.2380952"_expect); // ∅ 7.2 seeds CHECK (stat.indicators[STAT_SEED].pL == "7.65"_expect); // ∅ 7.7 seeds
CHECK (stat.indicators[STAT_LINK].pL == "3.047619"_expect); // ∅ 3 links CHECK (stat.indicators[STAT_LINK].pL == "3.15"_expect); // ∅ 3 links
CHECK (stat.indicators[STAT_JOIN].pL == "1.8571429"_expect); // ∅ 1.9 joins CHECK (stat.indicators[STAT_JOIN].pL == "1.9"_expect); // ∅ 1.9 joins
CHECK (stat.indicators[STAT_EXIT].pL == "0.66666667"_expect); // ∅ 0.6 exits CHECK (stat.indicators[STAT_EXIT].pL == "0.95"_expect); // ∅ ~1 exit per level
@ -838,19 +840,19 @@ namespace test {
// .printTopologyDOT() // .printTopologyDOT()
// .printTopologyStatistics() // .printTopologyStatistics()
; ;
CHECK (graph.getHash() == 0x259C7CA1B86E6C61); CHECK (graph.getHash() == 0x25114F8770B1B78E);
stat = graph.computeGraphStatistics(); stat = graph.computeGraphStatistics();
CHECK (stat.levels == 31); // rather high concurrency CHECK (stat.levels == 30); // rather high concurrency
CHECK (stat.indicators[STAT_SEED].cnt == 1); // a single seed CHECK (stat.indicators[STAT_SEED].cnt == 1); // a single seed
CHECK (stat.indicators[STAT_EXIT].cnt == 1); // ...and exit CHECK (stat.indicators[STAT_EXIT].cnt == 4); // ...and 4 exit when running out of node space
CHECK (stat.indicators[STAT_NODE].pL == "8.2580645"_expect); // ∅ 8.25 nodes per level CHECK (stat.indicators[STAT_NODE].pL == "8.5333333"_expect); // ∅ 8.25 nodes per level
CHECK (stat.indicators[STAT_FORK].frac == "0.16015625"_expect); // 16% forks CHECK (stat.indicators[STAT_FORK].frac == "0.16015625"_expect); // 16% forks
CHECK (stat.indicators[STAT_LINK].frac == "0.76953125"_expect); // 77% links CHECK (stat.indicators[STAT_LINK].frac == "0.76171875"_expect); // 77% links
CHECK (stat.indicators[STAT_JOIN].frac == "0.10546875"_expect); // 10% joins CHECK (stat.indicators[STAT_JOIN].frac == "0.1015625"_expect); // 10% joins
CHECK (stat.indicators[STAT_KNOT].frac == "0.0390625"_expect); // 3% »Knot« nodes which both join and fork CHECK (stat.indicators[STAT_KNOT].frac == "0.0390625"_expect); // 3% »Knot« nodes which both join and fork
CHECK (stat.indicators[STAT_FORK].cLW == "0.41855453"_expect); // density centre of forks lies earlier CHECK (stat.indicators[STAT_FORK].cLW == "0.43298744"_expect); // density centre of forks lies earlier
CHECK (stat.indicators[STAT_JOIN].cLW == "0.70806275"_expect); // while density centre of joins heavily leans towards end CHECK (stat.indicators[STAT_JOIN].cLW == "0.64466378"_expect); // while density centre of joins leans rather towards end
} }
@ -922,12 +924,9 @@ namespace test {
* @remark This test uses parameter rules with some expansion and a * @remark This test uses parameter rules with some expansion and a
* pruning rule with 60% probability. This setup is known to * pruning rule with 60% probability. This setup is known to
* create a sequence of tiny isolated trees with 4 nodes each; * create a sequence of tiny isolated trees with 4 nodes each;
* there are 8 such groups, each with a fork and two exit nodes; * there are 8 such groups, each with a fork and two exit nodes.
* the last group is wired differently however, because there the * The following code traverses all nodes grouped into 4-node
* limiting-mechanism of the topology generation activates to ensure * clusters to verify the regular pattern and calculated hashes.
* that the last node is an exit node. The following code traverses
* all nodes grouped into 4-node clusters to verify this regular
* pattern and the calculated hashes.
*/ */
void void
verify_reseed_recalculate() verify_reseed_recalculate()
@ -939,7 +938,7 @@ namespace test {
.buildTopology(); .buildTopology();
CHECK (8 == graph.allNodes().filter(isStartNode).count()); CHECK (8 == graph.allNodes().filter(isStartNode).count());
CHECK (15 == graph.allNodes().filter(isExitNode).count()); CHECK (16 == graph.allNodes().filter(isExitNode).count());
// verify computation of the globally combined exit hash // verify computation of the globally combined exit hash
@ -947,14 +946,14 @@ namespace test {
.filter(isExitNode) .filter(isExitNode)
.transform([](Node& n){ return n.hash; }) .transform([](Node& n){ return n.hash; })
.effuse(); .effuse();
CHECK (15 == exitHashes.size()); CHECK (16 == exitHashes.size());
size_t combinedHash{0}; size_t combinedHash{0};
for (uint i=0; i <15; ++i) for (uint i=0; i <16; ++i)
boost::hash_combine (combinedHash, exitHashes[i]); boost::hash_combine (combinedHash, exitHashes[i]);
CHECK (graph.getHash() == combinedHash); CHECK (graph.getHash() == combinedHash);
CHECK (graph.getHash() == 0x59AC21CFAE268613); CHECK (graph.getHash() == 0x33B00C450215EB00);
// verify connectivity and local exit hashes // verify connectivity and local exit hashes
@ -967,24 +966,12 @@ namespace test {
CHECK (isInner(b)); CHECK (isInner(b));
CHECK (not a->weight); CHECK (not a->weight);
CHECK (not b->weight); CHECK (not b->weight);
if (b->succ.size() == 2) CHECK (isExit(c));
{ CHECK (isExit(d));
CHECK (isExit(c)); CHECK (c->hash == 0xAEDC04CFA2E5B999);
CHECK (isExit(d)); CHECK (d->hash == 0xAEDC04CFA2E5B999);
CHECK (c->hash == 0xAEDC04CFA2E5B999); CHECK (c->weight == 4);
CHECK (d->hash == 0xAEDC04CFA2E5B999); CHECK (d->weight == 4);
CHECK (c->weight == 4);
CHECK (d->weight == 4);
}
else
{ // the last chunk is wired differently
CHECK (b->succ.size() == 1);
CHECK (b->succ[0] == c);
CHECK (isInner(c));
CHECK (isExit(d));
CHECK (graph.nodeID(d) == 31);
CHECK (d->hash == 0xC4AE6EB741C22FCE);
} // this is the global exit node
}); });
@ -1002,30 +989,22 @@ namespace test {
}); });
graph.recalculate(); graph.recalculate();
CHECK (graph.getHash() == 0xA76EA46C6C004CA2); CHECK (graph.getHash() == 0x17427F67DBC8BCC0);
graph.allNodePtr().grouped<4>() graph.allNodePtr().grouped<4>()
.foreach([&](auto group) .foreach([&](auto group)
{ // verify hashes were recalculated { // verify hashes were recalculated
// based on the new seed // based on the new seed
auto& [a,b,c,d] = *group; auto& [a,b,c,d] = *group;
CHECK (a->hash == 55); CHECK (a->hash == 55);
if (b->succ.size() == 2) CHECK (c->hash == 0x7887993B0ED41395);
{ CHECK (d->hash == 0x7887993B0ED41395);
CHECK (c->hash == 0x7887993B0ED41395);
CHECK (d->hash == 0x7887993B0ED41395);
}
else
{
CHECK (graph.nodeID(d) == 31);
CHECK (d->hash == 0x548F240CE91A291C);
}
}); });
// seeding and recalculation are reproducible // seeding and recalculation are reproducible
graph.setSeed(0).recalculate(); graph.setSeed(0).recalculate();
CHECK (graph.getHash() == 0x59AC21CFAE268613); CHECK (graph.getHash() == 0x33B00C450215EB00);
graph.setSeed(55).recalculate(); graph.setSeed(55).recalculate();
CHECK (graph.getHash() == 0xA76EA46C6C004CA2); CHECK (graph.getHash() == 0x17427F67DBC8BCC0);
} }
@ -1072,20 +1051,20 @@ namespace test {
.configureShape_short_segments3_interleaved() .configureShape_short_segments3_interleaved()
.buildTopology(); .buildTopology();
CHECK (graph.getHash() == 0xD2F292D864CF8086); CHECK (graph.getHash() == 0x554F5086DE5B0861);
graph.clearNodeHashes(); graph.clearNodeHashes();
CHECK (graph.getHash() == 0); CHECK (graph.getHash() == 0);
// this is used by the timing benchmark // this is used by the timing benchmark
graph.performGraphSynchronously(); graph.performGraphSynchronously();
CHECK (graph.getHash() == 0xD2F292D864CF8086); CHECK (graph.getHash() == 0x554F5086DE5B0861);
graph.clearNodeHashes(); graph.clearNodeHashes();
CHECK (graph.getHash() == 0); CHECK (graph.getHash() == 0);
graph.calcRuntimeReference(); graph.calcRuntimeReference();
CHECK (graph.getHash() == 0xD2F292D864CF8086); CHECK (graph.getHash() == 0x554F5086DE5B0861);
} }
@ -1107,7 +1086,7 @@ namespace test {
// compute aggregated level data.... // compute aggregated level data....
auto level = testLoad.allLevelWeights().effuse(); auto level = testLoad.allLevelWeights().effuse();
CHECK (level.size() == 27); CHECK (level.size() == 26);
// visualise and verify this data...... // visualise and verify this data......
auto node = testLoad.allNodePtr().effuse(); auto node = testLoad.allNodePtr().effuse();
@ -1181,7 +1160,7 @@ namespace test {
// summing up weight factors, with example concurrency ≔ 4 // summing up weight factors, with example concurrency ≔ 4
uint concurrency = 4; uint concurrency = 4;
auto steps = testLoad.levelScheduleSequence(concurrency).effuse(); auto steps = testLoad.levelScheduleSequence(concurrency).effuse();
CHECK (steps.size() == 27); CHECK (steps.size() == 26);
// for documentation/verification: show also the boost factor and the resulting weight factor // for documentation/verification: show also the boost factor and the resulting weight factor
auto boost = [&](uint i){ return level[i].nodes / std::ceil (double(level[i].nodes)/concurrency); }; auto boost = [&](uint i){ return level[i].nodes / std::ceil (double(level[i].nodes)/concurrency); };
@ -1216,8 +1195,7 @@ namespace test {
CHECK (stepStr(22) == "lev:22 nodes:6 Σw: 6 3.0 Δ2.000 ▿▿ 26.167"_expect); CHECK (stepStr(22) == "lev:22 nodes:6 Σw: 6 3.0 Δ2.000 ▿▿ 26.167"_expect);
CHECK (stepStr(23) == "lev:23 nodes:6 Σw: 6 3.0 Δ2.000 ▿▿ 28.167"_expect); CHECK (stepStr(23) == "lev:23 nodes:6 Σw: 6 3.0 Δ2.000 ▿▿ 28.167"_expect);
CHECK (stepStr(24) == "lev:24 nodes:10 Σw: 9 3.3 Δ2.700 ▿▿ 30.867"_expect); CHECK (stepStr(24) == "lev:24 nodes:10 Σw: 9 3.3 Δ2.700 ▿▿ 30.867"_expect);
CHECK (stepStr(25) == "lev:25 nodes:2 Σw: 2 2.0 Δ1.000 ▿▿ 31.867"_expect); CHECK (stepStr(25) == "lev:25 nodes:3 Σw: 4 3.0 Δ1.333 ▿▿ 32.200"_expect);
CHECK (stepStr(26) == "lev:26 nodes:1 Σw: 1 1.0 Δ1.000 ▿▿ 32.867"_expect);
} }

27
tests/vault/gear/test-chain-load.hpp
View file

@ -49,11 +49,12 @@
** predecessor nodes; additionally, new chains can be spawned (to simulate the effect of ** predecessor nodes; additionally, new chains can be spawned (to simulate the effect of
** data loading Jobs without predecessor) and chains can be deliberately pruned, possibly ** data loading Jobs without predecessor) and chains can be deliberately pruned, possibly
** splitting the computation into several disjoint sub-graphs. Anyway, the computation always ** splitting the computation into several disjoint sub-graphs. Anyway, the computation always
** begins with the _root node_, proceeds over the node links and finally connects any open ** begins with the _root node_, establishes the node links and marks each open end as an
** chains of computation to the _top node,_ leaving no dead end. The probabilistic rules ** _exit node_ — until all the nodes in the pre-allocated node space were visited. Hash
** controlling the topology can be configured using the lib::RandomDraw component, allowing ** values of all exit nodes will be combined into one characteristic hash for the graph,
** either just to set a fixed probability or to define elaborate dynamic configurations ** The probabilistic rules controlling the topology can be configured using the lib::RandomDraw
** based on the graph height or node connectivity properties. ** component, allowing either just to set a fixed probability or to define elaborate dynamic
** configurations based on the graph height or node connectivity properties.
** - expansionRule: controls forking of the graph behind the current node ** - expansionRule: controls forking of the graph behind the current node
** - reductionRule: controls joining of the graph into a combining successor node ** - reductionRule: controls joining of the graph into a combining successor node
** - seedingRule: controls injection of new start nodes in the middle of the graph ** - seedingRule: controls injection of new start nodes in the middle of the graph
@ -606,7 +607,7 @@ namespace test {
// prepare building blocks for the topology generation... // prepare building blocks for the topology generation...
auto moreNext = [&]{ return next->size() < maxFan; }; auto moreNext = [&]{ return next->size() < maxFan; };
auto moreNodes = [&]{ return node < backNode(); }; auto moreNodes = [&]{ return node <= backNode(); };
auto spaceLeft = [&]{ return moreNext() and moreNodes(); }; auto spaceLeft = [&]{ return moreNext() and moreNodes(); };
auto addNode = [&](size_t seed =0) auto addNode = [&](size_t seed =0)
{ {
@ -674,20 +675,10 @@ namespace test {
ENSURE (not next->empty()); ENSURE (not next->empty());
++level; ++level;
} }
ENSURE (node == backNode()); ENSURE (node > backNode());
// connect ends of all remaining chains to top-Node // all open nodes on last level become exit nodes
node->clear();
node->level = level;
for (Node* o : *next) for (Node* o : *next)
{
calcNode(o); calcNode(o);
if (apply (pruningRule_,o))
continue; // leave unconnected
node->addPred(o);
}
if (isnil (node->pred)) // last remains isolated
node->hash = this->getSeed();
calcNode(node);
// //
return move(*this); return move(*this);
} }

95
wiki/thinkPad.ichthyo.mm
View file

@ -111713,16 +111713,13 @@ Date:&#160;&#160;&#160;Thu Apr 20 18:53:17 2023 +0200<br/>
<node CREATED="1708738769854" ID="ID_1335531875" MODIFIED="1708738775540" TEXT="macht hier keinen Sinn"/> <node CREATED="1708738769854" ID="ID_1335531875" MODIFIED="1708738775540" TEXT="macht hier keinen Sinn"/>
<node CREATED="1708738776218" ID="ID_1705315845" MODIFIED="1708738811435"> <node CREATED="1708738776218" ID="ID_1705315845" MODIFIED="1708738811435">
<richcontent TYPE="NODE"><html> <richcontent TYPE="NODE"><html>
<head> <head/>
</head>
<body> <body>
<p> <p>
<i>verschiedene </i>Parameter-Werte f&#252;hren zu besserer statistischer Abdeckung <i>verschiedene </i>Parameter-Werte f&#252;hren zu besserer statistischer Abdeckung
</p> </p>
</body> </body>
</html> </html></richcontent>
</richcontent>
</node> </node>
</node> </node>
<node CREATED="1708653109374" ID="ID_1339763043" MODIFIED="1708653120296" TEXT="Ergebnis ist eine (x,y)-Wolke"/> <node CREATED="1708653109374" ID="ID_1339763043" MODIFIED="1708653120296" TEXT="Ergebnis ist eine (x,y)-Wolke"/>
@ -111831,29 +111828,23 @@ Date:&#160;&#160;&#160;Thu Apr 20 18:53:17 2023 +0200<br/>
<node CREATED="1709852101733" ID="ID_224601368" MODIFIED="1709852106201" TEXT="l&#xe4;&#xdf;t sich aber abmildern"/> <node CREATED="1709852101733" ID="ID_224601368" MODIFIED="1709852106201" TEXT="l&#xe4;&#xdf;t sich aber abmildern"/>
<node CREATED="1709852106705" ID="ID_1753078876" MODIFIED="1709852142659" TEXT="zun&#xe4;chst: Aufwand f&#xfc;r das Notification-POST"> <node CREATED="1709852106705" ID="ID_1753078876" MODIFIED="1709852142659" TEXT="zun&#xe4;chst: Aufwand f&#xfc;r das Notification-POST">
<richcontent TYPE="NOTE"><html> <richcontent TYPE="NOTE"><html>
<head> <head/>
</head>
<body> <body>
<p> <p>
einmal pr&#252;fen ob man das GroomingToken hat, und dann ein Enqueue einmal pr&#252;fen ob man das GroomingToken hat, und dann ein Enqueue
</p> </p>
</body> </body>
</html> </html></richcontent>
</richcontent>
</node> </node>
<node CREATED="1709852150884" ID="ID_856564005" MODIFIED="1709852263009" TEXT="wird mit dem Zeitpunkt des Nachfolgers gescheduled"> <node CREATED="1709852150884" ID="ID_856564005" MODIFIED="1709852263009" TEXT="wird mit dem Zeitpunkt des Nachfolgers gescheduled">
<richcontent TYPE="NOTE"><html> <richcontent TYPE="NOTE"><html>
<head> <head/>
</head>
<body> <body>
<p> <p>
aber nur, wenn man Dependencies nicht &#187;unlimitiert&#171; scheduled. Aber selbst dann werden die Notifications mit &#187;now&#171; gescheduled, und bei einer (hier angestrebten) &#220;berlast-Situation sind alle derzeit zur&#252;ckgestauten Jobs zeitlich vorher einsortiert aber nur, wenn man Dependencies nicht &#187;unlimitiert&#171; scheduled. Aber selbst dann werden die Notifications mit &#187;now&#171; gescheduled, und bei einer (hier angestrebten) &#220;berlast-Situation sind alle derzeit zur&#252;ckgestauten Jobs zeitlich vorher einsortiert
</p> </p>
</body> </body>
</html> </html></richcontent>
</richcontent>
</node> </node>
<node CREATED="1709852267236" ID="ID_487395663" MODIFIED="1709852278970" TEXT="und dieser sitzt auf letztem Level+1"> <node CREATED="1709852267236" ID="ID_487395663" MODIFIED="1709852278970" TEXT="und dieser sitzt auf letztem Level+1">
<icon BUILTIN="idea"/> <icon BUILTIN="idea"/>
@ -111881,16 +111872,13 @@ Date:&#160;&#160;&#160;Thu Apr 20 18:53:17 2023 +0200<br/>
<node CREATED="1709857165163" ID="ID_1141638970" MODIFIED="1709857172661" TEXT="geht nahezu durch den Urspung"/> <node CREATED="1709857165163" ID="ID_1141638970" MODIFIED="1709857172661" TEXT="geht nahezu durch den Urspung"/>
<node CREATED="1709857173321" ID="ID_1210955812" MODIFIED="1709857442437" TEXT="knapp unter 4ms f&#xfc;r 64 Nodes &#x27f9; w&#xe4;re optimale concurrency"> <node CREATED="1709857173321" ID="ID_1210955812" MODIFIED="1709857442437" TEXT="knapp unter 4ms f&#xfc;r 64 Nodes &#x27f9; w&#xe4;re optimale concurrency">
<richcontent TYPE="NOTE"><html> <richcontent TYPE="NOTE"><html>
<head> <head/>
</head>
<body> <body>
<p> <p>
64*0.5 / 8 cores 64*0.5 / 8 cores
</p> </p>
</body> </body>
</html> </html></richcontent>
</richcontent>
</node> </node>
</node> </node>
<node BACKGROUND_COLOR="#d4b76e" COLOR="#fa002a" CREATED="1709857227217" ID="ID_1666459843" MODIFIED="1709917399858" TEXT="aber andere Werte passen &#xfc;berhaupt nicht"> <node BACKGROUND_COLOR="#d4b76e" COLOR="#fa002a" CREATED="1709857227217" ID="ID_1666459843" MODIFIED="1709917399858" TEXT="aber andere Werte passen &#xfc;berhaupt nicht">
@ -111899,16 +111887,13 @@ Date:&#160;&#160;&#160;Thu Apr 20 18:53:17 2023 +0200<br/>
<node CREATED="1709857260813" ID="ID_412697694" MODIFIED="1709857294723" TEXT="durchschnittliche Node-Zeiten 1.9 ... 3ms"/> <node CREATED="1709857260813" ID="ID_412697694" MODIFIED="1709857294723" TEXT="durchschnittliche Node-Zeiten 1.9 ... 3ms"/>
<node CREATED="1709857301560" ID="ID_1659404445" MODIFIED="1709857321709"> <node CREATED="1709857301560" ID="ID_1659404445" MODIFIED="1709857321709">
<richcontent TYPE="NODE"><html> <richcontent TYPE="NODE"><html>
<head> <head/>
</head>
<body> <body>
<p> <p>
und eigentlich hatte ich den <b>Pool auf 4 Worker limitiert</b> und eigentlich hatte ich den <b>Pool auf 4 Worker limitiert</b>
</p> </p>
</body> </body>
</html> </html></richcontent>
</richcontent>
</node> </node>
</node> </node>
<node COLOR="#435e98" CREATED="1709857448450" ID="ID_560141617" MODIFIED="1709917386926" TEXT="&#x27f9; Herausfinden was w&#xe4;hrend dem Lauf tats&#xe4;chlich passiert"> <node COLOR="#435e98" CREATED="1709857448450" ID="ID_560141617" MODIFIED="1709917386926" TEXT="&#x27f9; Herausfinden was w&#xe4;hrend dem Lauf tats&#xe4;chlich passiert">
@ -111938,19 +111923,7 @@ Date:&#160;&#160;&#160;Thu Apr 20 18:53:17 2023 +0200<br/>
<icon BUILTIN="messagebox_warning"/> <icon BUILTIN="messagebox_warning"/>
<node COLOR="#435e98" CREATED="1709942563557" ID="ID_446879015" MODIFIED="1709946418522" TEXT="woran liegt das nochmal?"> <node COLOR="#435e98" CREATED="1709942563557" ID="ID_446879015" MODIFIED="1709946418522" TEXT="woran liegt das nochmal?">
<icon BUILTIN="help"/> <icon BUILTIN="help"/>
<node CREATED="1709946420934" ID="ID_1985139542" MODIFIED="1709946816965" TEXT="weil mein Topologie-Algo eine explizite Spezialbehandlung f&#xfc;r die letzte Node macht"> <node CREATED="1709946420934" ID="ID_1985139542" MODIFIED="1710004052462" TEXT="weil mein Topologie-Algo eine explizite Spezialbehandlung f&#xfc;r die letzte Node macht"/>
<richcontent TYPE="NOTE"><html>
<head>
</head>
<body>
<p>
m&#246;glicherweise k&#246;nne man diese Spezialbehandlung komplett in die normale Verarbeitungsschleife integrieren... das ist mir aber zu schwer (ich br&#228;uchte daf&#252;r mehr Formalisierung)
</p>
</body>
</html>
</richcontent>
</node>
<node CREATED="1709946441684" ID="ID_18071531" MODIFIED="1709946475875" TEXT="diese wird der Reihe nach mit allen zuletzt noch offenen Vorg&#xe4;ngern verkn&#xfc;pft"/> <node CREATED="1709946441684" ID="ID_18071531" MODIFIED="1709946475875" TEXT="diese wird der Reihe nach mit allen zuletzt noch offenen Vorg&#xe4;ngern verkn&#xfc;pft"/>
<node BACKGROUND_COLOR="#e0ceaa" COLOR="#690f14" CREATED="1709946476679" ID="ID_1701910273" MODIFIED="1709946507884" TEXT="hier fehlt die Anwendung der &#xbb;pruning&#xab;-Rule"> <node BACKGROUND_COLOR="#e0ceaa" COLOR="#690f14" CREATED="1709946476679" ID="ID_1701910273" MODIFIED="1709946507884" TEXT="hier fehlt die Anwendung der &#xbb;pruning&#xab;-Rule">
<icon BUILTIN="messagebox_warning"/> <icon BUILTIN="messagebox_warning"/>
@ -111958,20 +111931,52 @@ Date:&#160;&#160;&#160;Thu Apr 20 18:53:17 2023 +0200<br/>
</node> </node>
<node COLOR="#338800" CREATED="1709946512123" ID="ID_1574646547" MODIFIED="1709946754823" TEXT="explizite Behandlung f&#xfc;r diesen Fall nachgetragen"> <node COLOR="#338800" CREATED="1709946512123" ID="ID_1574646547" MODIFIED="1709946754823" TEXT="explizite Behandlung f&#xfc;r diesen Fall nachgetragen">
<richcontent TYPE="NOTE"><html> <richcontent TYPE="NOTE"><html>
<head> <head/>
</head>
<body> <body>
<p> <p>
da es nur noch diese eine letzte Node gibt, macht es keinen Sinn, die Expansion order Join-Regeln noch anzuwenden. Aber die Pruning-Regel kann sehr wohl f&#252;r die Vorg&#228;nger angewendet werden, welch dann infolgedessen eben u.U nicht mit der letzten Node verbunden werden. Damit kann es sogar passieren, da&#223; die letzte Node unverbunden bleibt &#8212; und in diesem Fall mu&#223; dann sogar ihr Seed eigens gesetzt werden da es nur noch diese eine letzte Node gibt, macht es keinen Sinn, die Expansion order Join-Regeln noch anzuwenden. Aber die Pruning-Regel kann sehr wohl f&#252;r die Vorg&#228;nger angewendet werden, welch dann infolgedessen eben u.U nicht mit der letzten Node verbunden werden. Damit kann es sogar passieren, da&#223; die letzte Node unverbunden bleibt &#8212; und in diesem Fall mu&#223; dann sogar ihr Seed eigens gesetzt werden
</p> </p>
</body> </body>
</html> </html></richcontent>
</richcontent>
<icon BUILTIN="button_ok"/> <icon BUILTIN="button_ok"/>
</node> </node>
<node BACKGROUND_COLOR="#eee5c3" COLOR="#990000" CREATED="1709946824257" ID="ID_1284526810" MODIFIED="1709946837518" TEXT="infolgedessen sind jetzt einige der Demo-Testf&#xe4;llge gebrochen"> <node COLOR="#5b280f" CREATED="1710004054445" ID="ID_1047416028" MODIFIED="1710034573166" TEXT="mu&#xdf; die Spezialbehandlung f&#xfc;r die letzte Node wirklich sein?">
<icon BUILTIN="flag-yellow"/> <richcontent TYPE="NOTE"><html>
<head/>
<body>
<p>
m&#246;glicherweise k&#246;nne man diese Spezialbehandlung komplett in die normale Verarbeitungsschleife integrieren... das war&#160;mir aber zu schwer (ich br&#228;uchte daf&#252;r mehr Formalisierung)
</p>
</body>
</html></richcontent>
<icon BUILTIN="button_cancel"/>
<node CREATED="1710004090503" ID="ID_1352002417" MODIFIED="1710004106614" TEXT="dadurch ist sehr viel komplexe Redundanz in der Implementierung"/>
<node CREATED="1710004125618" ID="ID_115324423" MODIFIED="1710004140244" TEXT="der Haupt-Rumpf ist doch auch hinreichend abgesichert"/>
<node CREATED="1710004378143" ID="ID_558670008" MODIFIED="1710004394890" TEXT="m&#xfc;&#xdf;te das Abbruch-Kriterium noch etwas formaler fassen">
<node CREATED="1710023214163" ID="ID_1663579799" MODIFIED="1710023249755" TEXT="einfach: wenn keine unbehandelten Nodes mehr &#xfc;brig sind"/>
<node CREATED="1710023250582" ID="ID_1230709833" MODIFIED="1710023281448" TEXT="das war auch bisher so &#x2014; blo&#xdf; wurde eine extra Schlu&#xdf;-Node explizit beiseite gehalten"/>
<node CREATED="1710023293268" ID="ID_286830849" MODIFIED="1710023320652" TEXT="wenn wir auf diese extra-Node verzichten, &#xe4;ndert sich &#xfc;berhaupt nichts an der Scheifen-Logik"/>
</node>
<node COLOR="#338800" CREATED="1710023354584" ID="ID_678216106" MODIFIED="1710034568175" TEXT="OK &#x27f9; stattdessen werden die letzten &#xbb;nextNodes&#xab; nun allesamt zu Abschlu&#xdf;-Nodes">
<icon BUILTIN="button_ok"/>
<node CREATED="1710023391042" ID="ID_470200915" MODIFIED="1710023397282" TEXT="diese sind stets nicht-leer"/>
<node CREATED="1710023397979" ID="ID_919815534" MODIFIED="1710023417586" TEXT="was unmittelbar aus dem Abbruchkriterium folgt"/>
<node CREATED="1710023420398" ID="ID_719767051" MODIFIED="1710023439311" TEXT="denn man kann nur in die Schleife, wenn man mindestens eine &#xbb;nextNode&#xab; belegen kann"/>
</node>
</node>
<node COLOR="#338800" CREATED="1709946824257" ID="ID_1284526810" MODIFIED="1710034583611" TEXT="infolgedessen sind jetzt einige der Demo-Testf&#xe4;llge gebrochen">
<icon BUILTIN="button_ok"/>
<node COLOR="#88037b" CREATED="1710034584676" ID="ID_1570294045" MODIFIED="1710034634818" TEXT="eine S***&#xdf; Arbeit &#xd83d;&#xdc80;&#xd83d;&#xdc7b; &#xd83d;&#xddf1;">
<icon BUILTIN="smiley-angry"/>
</node>
</node>
<node BACKGROUND_COLOR="#ccb59b" COLOR="#6e2a38" CREATED="1710034649789" ID="ID_1550403213" MODIFIED="1710034672378" TEXT="war&apos;s das wert? Ja &#x27f9; einfacher und sauberer">
<font ITALIC="true" NAME="SansSerif" SIZE="14"/>
<icon BUILTIN="yes"/>
<node CREATED="1710034677153" ID="ID_1852934468" MODIFIED="1710034696482" TEXT="die Implementierung besteht jetzt nur noch aus dem Hauptrumpf"/>
<node CREATED="1710034697078" ID="ID_1113601306" MODIFIED="1710034704921" TEXT="viele Graphen-F&#xe4;lle sind nat&#xfc;rlicher"/>
<node CREATED="1710034705558" ID="ID_670275376" MODIFIED="1710034711528" TEXT="Testf&#xe4;lle wurden einfacher"/>
<node CREATED="1710034712068" ID="ID_127933100" MODIFIED="1710034733221" TEXT="generierte Graphen haben wenig Dependencies, wenn gew&#xfc;nscht"/>
</node> </node>
</node> </node>
</node> </node>