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

Find and resolve bottlenecks #53

Open
jGaboardi opened this issue Dec 17, 2020 · 1 comment
Open

Find and resolve bottlenecks #53

jGaboardi opened this issue Dec 17, 2020 · 1 comment
Assignees
Projects

Comments

@jGaboardi
Copy link
Owner

jGaboardi commented Dec 17, 2020

BY far the two largest time/memory hogs are [n2n_matrix] and [paths] within Network.cost_matrix():

# calculate shortest path length and records paths if desired
n2n_matrix, paths = utils.shortest_path(self, gp=wpaths)

An attempt to speed up should be made...

  • try numba?
  • simple multiprocessing?
@jGaboardi jGaboardi self-assigned this Dec 17, 2020
@jGaboardi jGaboardi added this to To do in pre-release build Dec 17, 2020
@jGaboardi jGaboardi removed this from To do in pre-release build Dec 20, 2020
@jGaboardi jGaboardi added this to To do in release Dec 20, 2020
@jGaboardi jGaboardi removed this from the initial functional release milestone Dec 21, 2020
@jGaboardi jGaboardi moved this from To do to In progress in release Dec 21, 2020
@jGaboardi
Copy link
Owner Author

Try:

  • multiprocessing for observations
  • numba

@jGaboardi jGaboardi changed the title multiprocessing for cost matrices? Find and resolve bottlenecks Dec 23, 2020
@jGaboardi jGaboardi added this to To do in release +1 Jul 11, 2021
@jGaboardi jGaboardi removed this from In progress in release Jul 11, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
release +1
  
To do
Development

No branches or pull requests

1 participant