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

Callpath sensitive profiles and recursion handling #28

Open
mo-mglover opened this issue Jul 8, 2022 · 0 comments
Open

Callpath sensitive profiles and recursion handling #28

mo-mglover opened this issue Jul 8, 2022 · 0 comments
Assignees

Comments

@mo-mglover
Copy link
Collaborator

mo-mglover commented Jul 8, 2022

It'd be great to be able to separate costs of routines according to the callpath via which they were called. Example use case: to determine the cost of halo swaps for each Physics scheme separately.

There's an interesting paper on the web.

Essentially, I think it'd be sufficient to hash together routine names, their parent routine's name and their level in the overall call stack. This would have the added bonus that recursive subroutine calls would be handled automatically, since the call stack level is included. We can at least start with that and see how well it works. Whether we'd need to do any more work to disambiguate further, I don't know. A little ambiguity wouldn't hurt if the associated time is small. Just thinking this may well give us a good-enough solution with little additional runtime cost.

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

No branches or pull requests

1 participant