a 30:1 reduction moving from C to ASM is pretty drastic unless there
is no (or worse) optimization in the C compiler. 2:1 is realistic in
my experience with careful coding.
You might try your algorithm on a real computer with a good profiler
and see if there is some unforseen bottleneck.
Of course if you are relying on TOS tasks and such you may have
other sequencing problems.
MS
Andrea Pacini wrote:
I ' ve implemented a computational expensive operation on TMote Sky and
the time it takes is
large (about 30 seconds): this value was confirmed by some papers I read
some other papers about other platforms computing the same things and
they takes less than
one seconds to do the same but they wrote all code in Assembler.
My question is: is it possible that writing in assembler my code reduce
time from 30 seconds to
much lower times ? (Lower times OK, but so low (less than one second ?))
Thanks
Andrea
_______________________________________________
Tinyos-help mailing list
[email protected]
https://mail.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
_______________________________________________
Tinyos-help mailing list
[email protected]
https://mail.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
