Engineering mathematics handbook: definitions, theorems, formulas, tables (3rd ed.)
Engineering mathematics handbook: definitions, theorems, formulas, tables (3rd ed.)
NETBLT: a high throughput transport protocol
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Automatic generation of DAG parallelism
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Data networks (2nd ed.)
Limits to low-latency communication on high-speed networks
ACM Transactions on Computer Systems (TOCS)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Clustering task graphs for message passing architectures
ICS '90 Proceedings of the 4th international conference on Supercomputing
Implementing remote procedure calls
ACM Transactions on Computer Systems (TOCS)
Optimizations Enabled by a Decoupled Front-End Architecture
IEEE Transactions on Computers
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Fast Messages: Efficient, Portable Communication for Workstation Clusters and MPPs
IEEE Parallel & Distributed Technology: Systems & Technology
A Case for NOW (Networks of Workstations)
IEEE Micro
Active messages: an efficient communication architecture for multiprocessors
Active messages: an efficient communication architecture for multiprocessors
Creative destruction of computing systems: analysis and modeling
The Journal of Supercomputing
| Hi-index | 0.00 |
Cluster/distributed computing has become a popular, cost-effective alternative to high-performance parallel computers. Many parallel programming languages and related programming models have become widely accepted on clusters. However, the high communication overhead is a major shortcoming of running parallel applications on cluster/distributed computing environments. To reduce the communication overhead and thus the completion time of a parallel application, this paper introduces and evaluates an efficient Key Message (KM) approach to support parallel computing on cluster computing environments. In this paper, we briefly present the model and algorithm, and then analytical and simulation methods are adopted to evaluate the performance of the algorithm. It demonstrates that when network background load increases or the computation to communication ratio decreases, the analysis results show better improvement on communication of a parallel application over the system which does not use the KM approach.