 |
1f77253
Merge partially sorted lists in parallelJohn Hawthorn authored on 15/01/2017 06:10:16 |
|
9bd9d1f
Replace k-way-merge with 2-way mergeJohn Hawthorn authored on 15/01/2017 05:46:55 |
|
267e6a4
Perform sort in parallelJohn Hawthorn authored on 15/01/2017 05:19:45 |
|
77a2eb5
Fix memory leak of jobJohn Hawthorn authored on 15/01/2017 02:18:23 |
|
5df8c7c
Improve parallelism of search workersJohn Hawthorn authored on 08/01/2017 09:18:43 |
|
66d2c52
Store choices on job structJohn Hawthorn authored on 08/01/2017 09:04:34 |
|
47dee6d
Create search_job structJohn Hawthorn authored on 08/01/2017 08:55:11 |
|
00123bf
Remove unused and uninitialized worker struct varJohn Hawthorn authored on 08/01/2017 08:50:19 |
|
7d3b5c1
Use score_t instead of doubleJohn Hawthorn authored on 27/06/2016 08:14:44 |
|
2142a44
Use number of processors as worker countJohn Hawthorn authored on 23/06/2016 04:43:48 |
|
471431c
Store worker_count on choices_tJohn Hawthorn authored on 23/06/2016 04:26:21 |
|
3cf9d22
Use threading when matching/scoringJohn Hawthorn authored on 23/06/2016 04:43:37 |
|
6519dd4
Use threading when matching/scoringJohn Hawthorn authored on 18/06/2016 05:56:38 |
|
e6f8353
Skip sorting on empty search stringJohn Hawthorn authored on 07/06/2016 09:03:48 |
|
3b23f57
Make sorting stableJohn Hawthorn authored on 07/06/2016 08:58:41 |
git.rcrnstn.net