Changes between Initial Version and Version 2 of Ticket #13165
- Timestamp:
- Jan 24, 2017 12:08:19 PM (3 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #13165 – Description
initial v2 1 1 The RTS hash table is rather slow. Every lookup involves at least one indirect call (to get a hash code). It also uses separate chaining, which is itself slow. 2 2 3 Until recently, this didn't really matter, since the RTS hash table wasn't used for anything particularly performance critical other than `Stable Ptr` operations. However, it has since become the bottleneck when compacting with sharing, to the point that compacting without sharing is around 10x faster and is thus the default.3 Until recently, this didn't really matter, since the RTS hash table wasn't used for anything particularly performance critical other than `StableName` operations. However, it has since become the bottleneck when compacting with sharing, to the point that compacting without sharing is around 10x faster and is thus the default. 4 4 5 5 Fortunately, there are easy ways to make the hash table faster. These include:
