Ian R. Philp and Y. Liong. The Scheduled Transfer (ST) Protocol. In Proceedings of Workshop on Communication, Architecture, and Applications for Network-based Parallel Computing, January 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on this simulated platform includes a standard version of a signi cant subset of MPI 2 that runs each job in dedicated mode and a multitasking version of the same subset that performs bu ered coscheduling as outlined in section 3. The standard version uses an aggressive user level messaging system [2, 17, 19, 26] which introduces very little overhead and exposes the full communication capability provided by the hardware. 4.3 Sensitivity Analysis Figures 5 and 6 illustrate the communication and computation characteristics of our synthetic benchmarks as a function of the communication pattern, ....

Ian R. Philp and Y. Liong. The Scheduled Transfer (ST) Protocol. In Proceedings of Workshop on Communication, Architecture, and Applications for Network-based Parallel Computing, January 1999.

....necessary to access the kernel data structures is amortized over a set of user calls. This implies that the methodology is tolerant to the potential high latencies that can be introduced in a kernel call. BCS can obtain comparable performance to user level network interfaces (e.g. FM [16] or ST [22]) without using specialized hardware. Second, the global knowledge of the communication pattern provided by the total exchange allows for the implementation of ecient ow control strategies. For example it is possible to avoid congestion inside the network by carefully scheduling the ....

Ian R. Philp and Y. Liong. The Scheduled Transfer (ST) Protocol. In Proceedings of Workshop on Communication, Architecture, and Applications for Network-based Parallel Computing, January 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC