Enhancing the Performance of Condensed Graph’s Computation in Distributed Systems by Using Numerical Libraries as Super Nodes

Condensed Graph is a graph based programming model which is mainly used for the modeling of imperative, eager and lazy computation and also, it is a simple way to present a workflow. The biggest advantage of CG is to detect all independent instructions (nodes) for assigning them to the different computation devices in distributed and heterogeneous environments. This paper enhances the execution performance of condensed graphs in distributed systems by introducing super nodes for condensed graphs. Super nodes consist of a group of instructions treated as a single and atomic instruction. Accordingly, super nodes are more balanced in terms of computation time (Tcommunication) and communication time (Tcomputation). Therefore, the communication and computation time of the nodes can more likely happen at the same time (Toverlap) and ultimately reduces the overall graph execution time (Ttotal). In this paper, numerical libraries are used to create the super nodes. The results confirm that using super nodes with numerical libraries can have a huge impact on performance improvement in distributed systems