Peter Dillinger
c48b020e92
Summary: Reduce wall-clock time of parallel 'make check' by improving the scheduling and granularity of slow test binaries. Three Makefile changes: 1) Refresh slow_test_regexp with current observed bottlenecks. Adds binaries (point_lock_manager_stress_test, compaction_service_test, corruption_test, comparator_db_test, external_sst_file_basic_test, rate_limiter_test, db_compaction_test, db_merge_operator_test, db_dynamic_level_test, db_bloom_filter_test, error_handler_fs_test, merge_helper_test, db_kv_checksum_test, inlineskiplist_test) whose shards take >=15s but were not being front-loaded for early queueing. Also drops stale FIXME comments that no longer apply and adds tier annotations + a maintenance recipe. 2) Add SHARD_SIZE_OVERRIDES, a per-binary override of GTEST_SHARD_SIZE, so binaries with slow individual tests (e.g. point_lock_manager_stress_test where each test is ~10s) can be chopped into more, smaller shards. The default of 10 stays for everything else. Each shard's effective size is reported in the 'Generating ... shards for ...' line. 3) Add 'make suggest-slow-tests' to print a per-binary aggregation of the most recent LOG (max single-shard time, total time, shard count) for any binary worth attention. Used to maintain the regex and override list above. Pull Request resolved: https://github.com/facebook/rocksdb/pull/14745 Test Plan: Two runs each of 'make -j166 check', before and after this change (all compilation already finished): Before: 197s and 198s After: 123s and 125s Reduction: 37% Reviewed By: xingbowang Differential Revision: D105332444 Pulled By: pdillinger fbshipit-source-id: 1d1c2f89a32647e6651e2ffeb72da9d51bcc004f
RocksDB: A Persistent Key-Value Store for Flash and RAM Storage
RocksDB is developed and maintained by Facebook Database Engineering Team. It is built on earlier work on LevelDB by Sanjay Ghemawat (sanjay@google.com) and Jeff Dean (jeff@google.com)
This code is a library that forms the core building block for a fast key-value server, especially suited for storing data on flash drives. It has a Log-Structured-Merge-Database (LSM) design with flexible tradeoffs between Write-Amplification-Factor (WAF), Read-Amplification-Factor (RAF) and Space-Amplification-Factor (SAF). It has multi-threaded compactions, making it especially suitable for storing multiple terabytes of data in a single database.
Start with example usage here: https://github.com/facebook/rocksdb/tree/main/examples
See the github wiki for more explanation.
The public interface is in include/. Callers should not include or
rely on the details of any other header files in this package. Those
internal APIs may be changed without warning.
Questions and discussions are welcome on the RocksDB Developers Public Facebook group and email list on Google Groups.
License
RocksDB is dual-licensed under both the GPLv2 (found in the COPYING file in the root directory) and Apache 2.0 License (found in the LICENSE.Apache file in the root directory). You may select, at your option, one of the above-listed licenses.