You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
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.
The text was updated successfully, but these errors were encountered:
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.The text was updated successfully, but these errors were encountered: