Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

gpython: Optimize recursive call #49

Open
corona10 opened this issue Jan 21, 2019 · 3 comments
Open

gpython: Optimize recursive call #49

corona10 opened this issue Jan 21, 2019 · 3 comments
Labels
enhancement New feature or request

Comments

@corona10
Copy link
Collaborator

corona10 commented Jan 21, 2019

Thanks to tengo and @ncw, we can compare the gpython with other interpreted which are implemented in Go.

https://github.com/d5/tengo#benchmark

fib(35) benchmark is slower than I expected, we can optimize this point later.
(tail call is faster than CPython, I can't believe it!)

@ncw
Copy link
Collaborator

ncw commented Jan 21, 2019

:-) I suspect the times recorded for the tail recursive test are dominated by startup times rather than actually calling the functions.

Perhaps we should have some internal benchmarks which run python code using the go benchmark framework? That would give us a solid baseline to work with.

So we could have a benchmarks directory with python programs and a little driver to run them through the benchmark code.

@ncw ncw added the enhancement New feature or request label Jan 21, 2019
@corona10
Copy link
Collaborator Author

@ncw Looks like we have to create a new issue for build benchmark framework for gpython

@drew-512
Copy link
Contributor

recommend @sbinet close -- addressed in #50

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

3 participants