You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The BLS package currently only allows for the aggregation of two signatures at a time - leaving any caller to loop through any array of signatures, and having to do it sequentially. Parallelizing this would save callers a lot of time.
The text was updated successfully, but these errors were encountered:
Following are a first benchmark of naive parallelization with 2/4/8/12 go routines.
TL;DR best setup seems to be run 4 workers that operates the gfP.Add operations concurrently.
HW specs
16GiB System Memory
256KiB L1 cache
1MiB L2 cache
8MiB L3 cache
Intel(R) Core(TM) i7-8550U CPU @ 1.80GHz
The benchmarks show a significant improvement in performances (over 30% speedup) by introducing a light parallelization of bls Signature aggregation. However, it would be preferrable goroutine-based optimization to be operated within the user of the library to not impose any scheduling side effect on the usage of the BLS library
The BLS package currently only allows for the aggregation of two signatures at a time - leaving any caller to loop through any array of signatures, and having to do it sequentially. Parallelizing this would save callers a lot of time.
The text was updated successfully, but these errors were encountered: