search

UTSASRG / Scaler

GNU General Public License v2.0
4 stars 0 forks source link

New implementation: Reduced one jmp. Removed dynamic compilation. Reduced memory consumption. Devised algorithm to map address to id in O(1). #47

Closed GammaPi closed 2 years ago

GammaPi commented 2 years ago

This issue records the details

GammaPi commented 2 years ago

image

GammaPi commented 2 years ago

Hash value: Addr/N

Find an N such that the endpoint of each segment will not share the same hash value as any other endpoints.

Split are marked as evenly spaced blue vertical lines.

image

GammaPi commented 2 years ago

Think of an more extreme example. image

GammaPi commented 2 years ago

image

GammaPi commented 2 years ago

image

GammaPi commented 2 years ago

I proposed an iterative algorithm to calculate N.

GammaPi commented 2 years ago

Memory overhead is too large. Give up this version. Impl is in commit 4d8658bcdbb329aec53a0d06f8c601b6dc0c3a3f