Abstract
The Key Message (KM) approach prioritizes communications along the critical path to speed up the execution of parallel applications in a cluster environment. However, the current KM approaches (i.e, the Static KM (SKM) and the dynamic KM with a central predictor (CDKM)) either lack the capability of adapting to dynamic environment or suffer from the expensive centralized control to predict dynamic critical path rendering them to be suboptimal. In this paper, we introduce a dynamic and distributed KM algorithm (DDKM) that takes this dynamic nature into account while avoiding overheads of central control, thus, overcoming the drawbacks of its predecessors. To evaluate the DDKM algorithm, we implement it and simulate it in a cluster environment whose communication network (e.g., shared bus) can be modeled as an M/D/1. We compare DDKM with current KM approaches. The performance of DDKM is close to that of CDKM, and much better than SKM up to 28.9% when the network is highly congested. These results demonstrate that DDKM is a promising optimization in a real cluster environment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
