[Benchmark] inverse benchmarking algorithm

eclipse-modisco-bot commented 3 days ago

| --- | --- | | Bugzilla Link | 489866 | | Status | CLOSED FIXED | | Importance | P2 normal | | Reported | Mar 17, 2016 12:44 EDT | | Modified | May 23, 2016 10:03 EDT | | Version | 0.13.0 | | See also | Gerrit change https://git.eclipse.org/r/69123, Git commit 0635bca9 | | Reporter | Gregoire Dupe |

Description

Currently, the benchmarking algorithm looks like:

 public void discoverBenchmark(IProject[] projects, IDiscoverer<IProject>[] discovers, int iterations) {\
     for (IProject project : projects) {\
          for (IDiscoverer<IProject> discoverer : discovers) {\
               for (int i = 1; i <= iterations;  i++) {\
                    discoverer.discoverElement(project, null);\
               }\
          }\
     }\
 }

Instead of executing a sequence which launches n times each discover, we want to launch n sequences which launch one time each discoverer.

To fix this problem, we should use an algorithm looking like:

 public void discoverBenchmark(IProject[] projects, IDiscoverer<IProject>[] discovers, int iterations) {\
     for (IProject project : projects) {\

for (int i = 1; i <= iterations; i++) {\ for (IDiscoverer discoverer : discovers) {\ discoverer.discoverElement(project, null);\ }\ }\ }\ }

eclipse-modisco-bot commented 3 days ago

Mar 23, 2016 07:29

New Gerrit change created: https://git.eclipse.org/r/69123

eclipse-modisco-bot commented 3 days ago

Mar 23, 2016 08:33

Gerrit change https://git.eclipse.org/r/69123 was merged to [master].\ Commit: http://git.eclipse.org/c/modisco/org.eclipse.modisco.git/commit/?id=0635bca98fd85c926eaae18ac7766baed4ee02e4

eclipse-modisco-bot commented 3 days ago

By Gregoire Dupe on Apr 12, 2016 16:52

This bug can be closed.

eclipse-modisco / org.eclipse.modisco

[Benchmark] inverse benchmarking algorithm #1004

Description