Logo image
Back
Dynamic key messaging for cluster computing
Conference proceeding

Dynamic key messaging for cluster computing

M Zhu, Y Wang, M Ding, C Katsinis and ieee computer society
THIRD IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS, pp 192-199
01 Jan 2004
DOI: https://doi.org/10.1109/NCA.2004.1347777

Abstract

Computer Science Computer Science, Theory & Methods Science & Technology Technology
Over the past decades, distributed computing has been gaining popularity. It provides more computing power and memory space for parallel applications. On the other hand, such applications fight back and challenge the architectures of the distributed systems for more efficiency. To face the challenge, a Key Messaging (KM) scheme was proposed to realize the optimization of communication at a system architecture level in our previous papers. The contribution of KM is that it performs the optimization in both the underlying communication system and high level application model. The performance of an application is always determined by its critical path. Currently, messages along the critical path can be easily blocked by non-critical path messages, which degrades the performance. To solve this problem, KM provides an algorithm to identify the critical-path messages and optimizes them by introducing a prioritized protocol layer Thus, these messages will be served first before any low priority messages. Shorter processing time for the messages results in faster completion time of the critical path.

Metrics

10 Record Views

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Theory & Methods
Logo image