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

Improve performance of adaptation algorithms #9

Open
vitorsouza opened this issue Feb 29, 2012 · 0 comments
Open

Improve performance of adaptation algorithms #9

vitorsouza opened this issue Feb 29, 2012 · 0 comments

Comments

@vitorsouza
Copy link
Member

Some operations are repeated in many procedures, e.g.:

  • Find the goal model given the AwReq;
  • Find relations that refer to a given AwReq;
  • Check if a parameter is incrementable.

In particular, in SimpleValueCalculationProcedure and SimpleParameterChangeProcedure there is a nested loop: for each of the N params to increment, loop all relations to find the appropriate one in order to check bounds, etc. This makes the overall algorithm be O(amount-of-parameters-chosen x number-of-relations-in-model). Study a way to avoid this.

One early idea is to delegate some of these operations to the repository service instead of having them in the EMF classes as they are now. This would allow for the creation of maps when the model is registered, as the case with other elements such as goals, tasks, AwReqs, etc.

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

No branches or pull requests

1 participant