Re: [PR] Optimize IndexedDISI by implementing binary search for sparseDocs in … [lucene]

["rajat315315 (via GitHub)" <gi...@apache.org>]

rajat315315 commented on PR #16349:
URL: https://github.com/apache/lucene/pull/16349#issuecomment-4882312791

   I have run the **AdvanceBenchmark** JMH suite to evaluate the impact of the new binary search implementation on **IndexedDISI**.The results demonstrate that the **inlinedBranchlessBinarySearch** approach provides a performance improvement over the existing linearSearch implementation.
   Benchmark Comparison (Throughput):
   
   ### Throughput Comparison
   
   | Benchmark Method | Main (ops/ms) | PR (ops/ms) |
   | :--- | :--- | :--- |
   | `linearSearch` | 137.506 ± 3.883 | 133.743 ± 5.126 |
   | `binarySearch` | 50.563 ± 1.069 | 50.215 ± 1.523 |
   | **`inlinedBranchlessBinarySearch`** | N/A | **143.826 ± 11.544** |
   
   
   * Baseline (linearSearch): 137.506 ops/ms 
   * Optimized (inlinedBranchlessBinarySearch): 143.826 ops/ms 
   * Improvement: ~4.6% increase in throughput.  
   
   Existing methods (linearSearch and binarySearch) showed no significant performance degradation on the PR branch compared to main, ensuring that these changes are safe for current workloads. 
   These benchmarks were performed using OpenJDK 25.0.3 with consistent JMH parameters (5 warmup iterations, 10 measurement iterations, 3 forks).


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org