Asynchronous acknowledged all-to-all personalized exchange with minimum startup in 2D/3D meshes

摘要

An acknowledged all-to-all personalized exchange (AATAPE) is an all-to-all personalized exchange or complete exchange in which each node acknowledges all other nodes upon receiving their messages in the network. In this paper, we propose two efficient asynchronous AATAPE algorithms based on multidestination and combination techniques, for single-port and multiple-port respectively, on wormhole-routing 2D/3D meshes. The proposed O(1) due to messages startups and low message transmission latency. It requries no barrier synchronization and small number of buffers in the router, These two algorithms are then modified for AATAPE on 3D meshes. Especially in 2D meshes, the proposed algorithm is asymptotic optimal.