The need to partition and place pieces of applications on different nodes. Considering the effort, repartitioning is not done frequently because of the required effort even though repartitioning may buy a lot of efficiency for the application.
Application reprofiling is supported based on the periodical profiling of the application and calculating the optimal solution.
The architecture for Coign:
The application is augmented with instrumentations for Coign using the binary re-writer. - The instrumented binary is run through a set of profiling scenarios (degrading application performance. inter-component communications are summarized)
- The profile analysis engine combines component communication profiles and component location constraints to create an abstract inter-component communication graph (ICC).
- Location constraints are obtained from the programmer, from analysis of component communication records, and from application binaries.
- The ICC graph is combined with a network profile to create a graph of potential communication time on the network
- The graph cutting algorithm: lift-to-front minimum cut
The set of components for Coign Runtime:
Instance Classifier is probably the most important part of Coign Runtime. This is probably the most important part of the profiler as it tries to identify similarities between instances and extracted profiles. They have listed the following classifiers which need to be further investigated:
- incremental classifier (Straw man classifier)
- Procedure Called-By Classifier (PCB)
- Static Type Classifier (ST)
- Static Type Called-By Classifier (STCB)
- Internal-function Called-By Classifier (IFCB)
- Entry Point Called-By Classifier (EPCB)
- Instantiated-By Classifier (IB)
The next step is correlating the profile of one instance with another instance based on similar resource usage and communication behavior. They have used instance communication vector.
The algorithm that it uses is the lift-to-front minimum cut graph cutting algorithm
No comments:
Post a Comment