This is merely a historical archive of years 2008-2021, before the migration to mailman3.
A maintained and still updated list archive can be found at https://lists.osmocom.org/hyperkitty/list/osmocom-net-gprs@lists.osmocom.org/.
Pravin Kumaravel Manoharan Pravin.Manoharan at radisys.comHello Holger, We have pushed the branch with tree based decoding algorithm and profiling test for comparison of existing method in master over the tree based algorithm developed by Radisys. Branch name: users/pravin/epdan_profiling at http://git.osmocom.org/radisys/osmo-pcu/ The comments suggested in earlier mail are addressed in the branch. Following is the profiling results in micro-seconds. Each of 4 inputs is decoded 10000 times for getting the below data Existing decoding algorithm in Target Input Min Max Avg 1 165 174 276 2 100 101 168 3 16 26 26 4 185 190 312 Tree based decoding algorithm Target Input Min Max Avg 1 65 430 110 2 58 59 98 3 3 4 6 4 96 469 162 Moreover, we also tried the same on host machine below are the results. Existing decoding algorithm in Host Input Min Max Avg 1 5 6 12 2 3 4 8 3 0 1 0 4 5 7 14 Tree based decoding algorithm in Host Input Min Max Avg 1 2 3 7 2 2 3 5 3 0 1 0 4 3 4 9 Regards, Pravin