summaryrefslogtreecommitdiff |
diff options
author | nsensfel <SpamShield0@noot-noot.org> | 2019-09-30 18:16:18 +0200 |
---|---|---|
committer | nsensfel <SpamShield0@noot-noot.org> | 2019-09-30 18:16:18 +0200 |
commit | af3ccc4ddcb9e13973b8d06283e6bf088f1d8f6a (patch) | |
tree | 1ba6887410f2f48634ecf06705aebfa429877ead /other/db_bounty.txt | |
parent | 3db4177ebf2d3c8cca27e352644c1efa1a1a3580 (diff) |
Diffstat (limited to 'other/db_bounty.txt')
-rw-r--r-- | other/db_bounty.txt | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/other/db_bounty.txt b/other/db_bounty.txt deleted file mode 100644 index d31226a..0000000 --- a/other/db_bounty.txt +++ /dev/null @@ -1,18 +0,0 @@ -Designing with a "it can crash at any point" mentality -+ can't combine DB queries in an atomic manner -= Potential for partially completed tasks, "corrupting" the global DB. - -A solution could be having "bounty" entries, which work as follows: -A process P0 needs to do tasks T0, then T1, then T2. -P0 creates a bounty B0: -{ - not_before: 60s. - task: T0_T1_T2. - params: [{T0.id, T1.id, 20] -} -P0 adds B0 to the Bounty DB. -P0 attempts T0, T1, and T2. -P0 removes B0 from the Bounty DB. - -There are other processes trying to access available bounties (i.e. bounties -for which the "not_before" has expired) to complete them. |