| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | ExtensionStructure: first basic test of lookahead task stealing | Douglas Rumbaugh | 2024-02-12 | 2 | -1/+14 | |
| | | ||||||
| * | ExtensionStructure: Added simulated reconstruction lookahead | Douglas Rumbaugh | 2024-02-12 | 1 | -28/+88 | |
| | | | | | | The reconstruction task procedure can now simulate future reconstructions to a specified depth. | |||||
| * | MutableBuffer: Allow hwm to equal lwm | Douglas Rumbaugh | 2024-02-12 | 1 | -1/+1 | |
| | | | | | | The high watermark and low watermark can now be equal, to allow for blocking reconstruction without requiring odd buffer sizes. | |||||
| * | Refactored Reconstruction Tasks | Douglas Rumbaugh | 2024-02-12 | 5 | -20/+77 | |
| | | | | | | Added a ReconVector type to make it easier to do load balancing by shifting tasks around, and clean up a few interfaces. | |||||
| * | Added structure state vector w/ scratch version for reconstruction | Douglas Rumbaugh | 2024-02-12 | 1 | -55/+89 | |
| | | | | | | | | | | | | | | This approach should allow us to "simulate" a reconstruction to monitor the future state of the structure. The idea being that we can then add pre-emptive reconstructions to load balance and further smooth the tail latency curve. If a given reconstruction is significantly smaller than the next one will be, we can move some of the next one's work preemptively into the current one. The next phase is to do the simulation within the scratch_vector and then do a second pass examining the state of that reconstruction. In principle, we could look arbitrarily far ahead using this technique. | |||||
| * | Benchmark updates | Douglas Rumbaugh | 2024-02-09 | 3 | -2/+248 | |
| | | ||||||
| * | Update README.md | Douglas B. Rumbaugh | 2024-02-09 | 1 | -4/+4 | |
| | | ||||||
| * | Readme update | Douglas Rumbaugh | 2024-02-09 | 1 | -0/+53 | |
| | | ||||||
| * | Merge pull request #1 from dbrumbaugh/new-buffer | Douglas B. Rumbaugh | 2024-02-09 | 101 | -6298/+8893 | |
| |\ | | | | | Initial Concurrency Implementation | |||||
| | * | Updated to newer version of psudb-commonnew-buffer | Douglas Rumbaugh | 2024-02-09 | 1 | -0/+0 | |
| | | | | | | | | | Some bugfixes in here greatly improve BloomFilter performance. | |||||
| | * | Removed centralized version structure | Douglas Rumbaugh | 2024-02-09 | 2 | -35/+8 | |
| | | | ||||||
| | * | Framework: Fixed a bug where tagged deletes didn't release the epoch | Douglas Rumbaugh | 2024-02-09 | 3 | -11/+28 | |
| | | | ||||||
| | * | Comment updates/fixes | Douglas Rumbaugh | 2024-02-09 | 24 | -104/+224 | |
| | | | ||||||
| | * | Updated VPTree to new shard/query interfaces | Douglas Rumbaugh | 2024-02-08 | 8 | -320/+319 | |
| | | | ||||||
| | * | Merge branch 'new-buffer' of github.com:dbrumbaugh/dynamic-extension into ↵ | Douglas Rumbaugh | 2024-02-08 | 0 | -0/+0 | |
| | |\ | | | | | | | | | | new-buffer | |||||
| | | * | ISAMTree: added comment explaining the compiler fence | Douglas Rumbaugh | 2024-02-08 | 1 | -0/+4 | |
| | | | | ||||||
| | | * | Added compiler fence to block reordering | Douglas Rumbaugh | 2024-02-08 | 2 | -2/+4 | |
| | | | | | | | | | | | | | I'm reasonably certain that this is a compiler bug... | |||||
| | * | | Added compiler fence to block reordering | Douglas Rumbaugh | 2024-02-08 | 2 | -2/+8 | |
| | |/ | | | | | | | I'm reasonably certain that this is a compiler bug... | |||||
| | * | Fixed a slight synchronization bug in Epoch retirement "properly" | Douglas Rumbaugh | 2024-02-08 | 1 | -10/+27 | |
| | | | ||||||
| | * | Fixed benchmark memory leak | Douglas Rumbaugh | 2024-02-08 | 1 | -0/+2 | |
| | | | ||||||
| | * | Cleaned up shard files (except VPTree) | Douglas Rumbaugh | 2024-02-07 | 28 | -1674/+859 | |
| | | | | | | | | | | | | | Cleaned up shard implementations, fixed a few bugs, and set up some tests. There's still some work to be done in creating tests for the weighted sampling operations for the alias and aug btree shards. | |||||
| | * | Fully realized shard concept interface | Douglas Rumbaugh | 2024-02-07 | 33 | -686/+77 | |
| | | | ||||||
| | * | Fully implemented Query concept and adjusted queries to use it | Douglas Rumbaugh | 2024-02-07 | 13 | -56/+54 | |
| | | | ||||||
| | * | BufferView: Adjusted BV to avoid repeated modulus operations | Douglas Rumbaugh | 2024-02-05 | 3 | -15/+190 | |
| | | | ||||||
| | * | Set up tombstone deletes properly | Douglas Rumbaugh | 2024-02-05 | 8 | -56/+72 | |
| | | | ||||||
| | * | updated btree benchmark | Douglas Rumbaugh | 2024-01-31 | 1 | -0/+4 | |
| | | | ||||||
| | * | IRS bench (replication of existing one) | Douglas Rumbaugh | 2024-01-31 | 1 | -0/+125 | |
| | | | ||||||
| | * | BTree benchmark | Douglas Rumbaugh | 2024-01-31 | 3 | -6/+128 | |
| | | | ||||||
| | * | Updated throughput bench to use SOSD | Douglas Rumbaugh | 2024-01-31 | 2 | -21/+39 | |
| | | | ||||||
| | * | temporary hack to get working | Douglas Rumbaugh | 2024-01-31 | 1 | -6/+12 | |
| | | | ||||||
| | * | Adjusted epoch transition methodology | Douglas Rumbaugh | 2024-01-31 | 4 | -153/+121 | |
| | | | ||||||
| | * | More locking! | Douglas Rumbaugh | 2024-01-31 | 1 | -0/+2 | |
| | | | ||||||
| | * | Updated insert query throughput to use IRS queries | Douglas Rumbaugh | 2024-01-31 | 4 | -123/+25 | |
| | | | ||||||
| | * | insert query tput updates | Douglas Rumbaugh | 2024-01-31 | 1 | -2/+7 | |
| | | | ||||||
| | * | Possibly fixed epoch retirement sync error | Douglas Rumbaugh | 2024-01-31 | 1 | -1/+5 | |
| | | | ||||||
| | * | Insert throughput benchmark | Douglas Rumbaugh | 2024-01-31 | 3 | -46/+220 | |
| | | | ||||||
| | * | Query/Insert intermix benchmarks | Douglas Rumbaugh | 2024-01-31 | 4 | -41/+162 | |
| | | | ||||||
| | * | Temporary thread affinity for reconstruction | Douglas Rumbaugh | 2024-01-31 | 3 | -7/+40 | |
| | | | ||||||
| | * | TrieSpline + tests | Douglas Rumbaugh | 2024-01-30 | 4 | -301/+117 | |
| | | | ||||||
| | * | Benchmarking updates | Douglas Rumbaugh | 2024-01-30 | 9 | -30/+495 | |
| | | | ||||||
| | * | Multithreaded Insertion Benchmark | Douglas Rumbaugh | 2024-01-24 | 1 | -11/+37 | |
| | | | ||||||
| | * | DynamicExtension: Fixed reconstruction trigger data race | Douglas Rumbaugh | 2024-01-24 | 1 | -4/+7 | |
| | | | | | | | | | | | Tweak the reconstruction trigger code to ensure that multiple reconstructions won't be triggered at the same time. | |||||
| | * | Added watermark testing to CMake | Douglas Rumbaugh | 2024-01-22 | 1 | -0/+6 | |
| | | | ||||||
| | * | WAtermark testing benchmark | Douglas Rumbaugh | 2024-01-22 | 1 | -0/+53 | |
| | | | ||||||
| | * | Adjusted recon_benchmark and properly shutdown FIFOScheduler | Douglas Rumbaugh | 2024-01-22 | 2 | -12/+25 | |
| | | | ||||||
| | * | Benchmarking: updated insert_query_tput to use better rng | Douglas Rumbaugh | 2024-01-22 | 1 | -3/+14 | |
| | | | ||||||
| | * | FIFOScheduler: added automake wakeup | Douglas Rumbaugh | 2024-01-22 | 1 | -1/+12 | |
| | | | | | | | | | | | | | | | | | | | | | | | | | Sometimes, when the max thread count is exceeded, it is possible for the scheduler to lock up. This is because the scheduler is only run when a new job is put into the queue, and so it is possible for a job to be blocked by thread limitations and be left sitting in the queue. If the main program is waiting on this job to finish before scheduling a new one, then the system deadlocks. I added a second background thread to the scheduler that wakes the scheduler up every 20us to resolve this and prevent these deadlocks. | |||||
| | * | Moved some benchmarks over to range count | Douglas Rumbaugh | 2024-01-22 | 2 | -6/+6 | |
| | | | ||||||
| | * | Added RangeCount query | Douglas Rumbaugh | 2024-01-22 | 4 | -0/+386 | |
| | | | ||||||
| | * | Initial rough-out of internal statistics tracker | Douglas Rumbaugh | 2024-01-19 | 8 | -36/+160 | |
| | | | | | | | | | | | | | Need to figure out the best way to do the detailed tracking in a concurrent manner. I was thinking just an event log, with parsing routines for extracting statistics. But that'll be pretty slow. | |||||