|
| From: | Auto mailings of changes to Lily Issues via Testlilyissues-auto |
| Subject: | [Lilypond-auto] [LilyIssues-auto] [testlilyissues:issues] #5886 Reimplement Scheme_hash_table using linear probing. |
| Date: | Fri, 10 Apr 2020 18:14:37 -0000 |
[issues:#5886] Reimplement Scheme_hash_table using linear probing.
Status: Started
Created: Fri Apr 10, 2020 06:14 PM UTC by Han-Wen Nienhuys
Last Updated: Fri Apr 10, 2020 06:14 PM UTC
Owner: nobody
Add a unit-test and micro-benchmark, called from
input/regression/scheme-unit-test.ly
The GUILE hash table implementation uses conflict resolution by
chaining. This means that hash lookups involve walking linked lists,
which is both relatively slow (the CPU cannot prefetch the next list
item), and takes up a lot of space (each {key, value} pair needs an
extra cons to form the linked list.
The micro-benchmark for lookup shows a 2x speedup compared to GUILE's
hashtables.
https://codereview.appspot.com/559790043
Sent from sourceforge.net because address@hidden is subscribed to https://sourceforge.net/p/testlilyissues/issues/
To unsubscribe from further messages, a project admin can change settings at https://sourceforge.net/p/testlilyissues/admin/issues/options. Or, if this is a mailing list, you can unsubscribe from the mailing list.
_______________________________________________ Testlilyissues-auto mailing list address@hidden https://lists.sourceforge.net/lists/listinfo/testlilyissues-auto
| [Prev in Thread] | Current Thread | [Next in Thread] |