A distributed Key Message algorithm to optimize the communication in clusters

Bertsekas, 1992 C.C. Iancu, E. Strohmaier, Optimizing communication overlap for high-speed networks, in: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid, 2007. Jin, 2006, FAST TCP: motivation, architecture, algorithms, performance, IEEE/ACM Transactions on Networking, 14, 1246, 10.1109/TNET.2006.886335 Cooper, 1981 D.Buntinas, G.Mercier, W.Gropp, Design and evaluation of nemesis, a scalable, low-latency, message-passing communication subsystem, in: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid, 2006. Dong, 1998, Characterizing and scheduling communication interactions of parallel and local jobs on networks of workstations, Computer Communications, 21, 470, 10.1016/S0140-3664(97)00189-8 E.Okorafor, M.Lu, Priority based cluster message scheduling for single-hop wdm networks, in: Proceedings of the Wireless and Optical Communications, 2003. Fredj, 2007, RWAPI over infiniband: design and performance, Scalable Computing: Practice and Experience, 8, 271 Hollingsworth, 1998, Critical path profiling of message-passing and shared-memory programs, IEEE Transactions on Parallel and Distributed Systems, 9, 1029, 10.1109/71.730530 SMURPH, <http://www.cs.ualberta.ca/pawl.smurph/smurph.html>. Standard task graph set, <http://www.kasahara.elec.waseda.ac.jp/schedule>. RapidIO, <http://www.rapidio.org>. Karlsson, 2003, Priority based messaging for software distributed shared-memory, Cluster Computing, 6, 161, 10.1023/A:1022808723380 Keren, 2003, Opportunity cost algorithms for reduction of i/o and interprocess communication overhead in a computing cluster, IEEE Transactions on Computer, 14, 39 Kwok, 1996, Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors, IEEE Transactions on Parallel and Distributed Systems, 5, 506, 10.1109/71.503776 Kwok, 1999, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Survey, 31, 406, 10.1145/344588.344618 M.Schulz, Extracting critical path graphs from MPI applications, in: Proceedings of the IEEE International Conference on Cluster Computing, 2005. Sinnen, 2005, Communication contention in task scheduling, IEEE Transactions on Parallel and Distributed Systems, 16, 503, 10.1109/TPDS.2005.64 Pakin, 1997, Fast Messages: efficient, portable communication for workstation clusters and MPPs, IEEE Concurrency, 5, 60, 10.1109/4434.588295 B. Palmer, J. Nieplocha, E. Apra, Shared-memory mirroring for reducing communication overhead on commodity networks, in: Proceedings of the IEEE Conference on Cluster Computing, 2003. A. Radulescu, C. Nicolescu, A. van Gemund, P. Jonker, CPR: mixed task and data parallel scheduling for distributed systems, in: Proceedings of the 15th International Parallel and Distributed Processing Symposium, 2001. R.P.Martin, A. Vahdat, D. Culler, T. Anderson, Effects of communication latency, overhead, and bandwidth in a cluster architecture, in: Proceedings of the 24th Annual International Symposium on Computer Architecture, 1997. S. Sistare, C. Jackson, Ultra-high performance communication with MPI and the sun fire link interconnect, in: The International Conference on Supercomputing, 2002. Zhu, 2003, Key message approach to optimize communication of parallel applications on clusters, Journal of Cluster Computing, 6, 253, 10.1023/A:1023603505117 Zhu, 2004, Key messaging on some-bus clusters, Parallel Computing, 30, 947, 10.1016/j.parco.2004.07.004 M. Zhu, Y. Wang, M. Ding, Dynamic key messaging for cluster computing, in: The Third IEEE International Symposium on Network Computing and Applications (NCA’04), 2004.