The Experts below are selected from a list of 1050 Experts worldwide ranked by ideXlab platform
Jianchao Wang - One of the best experts on this subject based on the ideXlab platform.
-
Optimal all-to-all personalized exchange in a class of optical Multistage Networks
IEEE Transactions on Parallel and Distributed Systems, 2001Co-Authors: Yuanyuan Yang, Jianchao WangAbstract:All-to-all personalized exchange is one of the most dense collective communication patterns and it occurs in many important parallel computing/Networking applications. In this paper, we look into the issue of realizing an all-to-all personalized exchange in a class of optical Multistage Networks. Advances in electrooptic technologies have made optical communication a promising Networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical Multistage Networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we provide a systematic scheme for realizing an all-to-all personalized exchange in a class of unique-path optical Multistage Networks crosstalk-free. The basic idea of realizing an all-to-all personalized exchange in such a Multistage Network is to transform it to multiple semipermutations and ensure that each of them can be realized crosstalk-free in a single pass. As can be seen, the all-to-all personalized exchange algorithm we propose has O(n) time complexity for n processors, which is optimal for an all-to-all personalized exchange. The optimal time complexity combined with the property of a single input/output port per processor suggests that a Multistage Network could be a better choice for implementing an all-to-all personalized exchange due to its shorter communication latency and better scalability.
-
Optimal all-to-all personalized exchange in self-routable Multistage Networks
IEEE Transactions on Parallel and Distributed Systems, 2000Co-Authors: Yuanyuan Yang, Jianchao WangAbstract:All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important applications in parallel computing. Previous all-to-all personalized exchange algorithms were mainly developed for hypercube and mesh/torus Networks. Although the algorithms for a hypercube may achieve optimal time complexity, the Network suffers from unbounded node degrees and thus has poor scalability in terms of I/O port limitation in a processor. On the other hand, a mesh/torus has a constant node degree and better scalability in this aspect, but the all-to-all personalized exchange algorithms have higher time complexity. In this paper, we propose an alternative approach to efficient all-to-all personalized exchange by considering another important type of Networks, Multistage Networks, for parallel computing systems. We present a new all-to-all personalized exchange algorithm for a class of unique-path, self-routable Multistage Networks. We first develop a generic method for decomposing all-to-all personalized exchange patterns into some permutations which are realizable in these Networks, and then present a new all-to-all personalized exchange algorithm based on this method. The newly proposed algorithm has O(n) time complexity for an n/spl times/n Network, which is optimal for all-to-all personalized exchange. By taking advantage of fast switch setting of self-routable switches and the property of a single input/output port per processor in a Multistage Network, we believe that a Multistage Network could be a better choice for implementing all-to-all personalized exchange due to its shorter communication latency and better scalability.
-
IPDPS - Optimal all-to-all personalized exchange in a class of optical Multistage Networks
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000, 1Co-Authors: Yuanyuan Yang, Jianchao WangAbstract:All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/Networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical Multistage Networks. Advances in electro-optic technologies have made optical communication a promising Networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical Multistage Networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, self-routing optical Multistage Networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a Multistage Network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of Network.
Isaac D. Scherson - One of the best experts on this subject based on the ideXlab platform.
-
ISPAN - Scalable Multistage Network for Multiprocessor System-on-Chip Design
8th International Symposium on Parallel Architectures Algorithms and Networks (ISPAN'05), 1Co-Authors: Sammy Meftali, Jean-luc Dekeyser, Isaac D. SchersonAbstract:This paper presents a micro-Network that is ageneric, scalable and multi-stage interconnect architecture for systems on a chip (SoC). TheNetwork architecture relies on a packet switching and point-to-point bi-directional links between the routers implementing the micro Network. The NoC provides a configurable number of OCP compliant communication interfaces for both initiators (master) and targets (slave). This Network has been used in a multiprocessor SoC with 16 initiators 16 slaves, and compared with an AMBA bus in terms of latency and saturation threshold.
Yuanyuan Yang - One of the best experts on this subject based on the ideXlab platform.
-
Optimal all-to-all personalized exchange in a class of optical Multistage Networks
IEEE Transactions on Parallel and Distributed Systems, 2001Co-Authors: Yuanyuan Yang, Jianchao WangAbstract:All-to-all personalized exchange is one of the most dense collective communication patterns and it occurs in many important parallel computing/Networking applications. In this paper, we look into the issue of realizing an all-to-all personalized exchange in a class of optical Multistage Networks. Advances in electrooptic technologies have made optical communication a promising Networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical Multistage Networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we provide a systematic scheme for realizing an all-to-all personalized exchange in a class of unique-path optical Multistage Networks crosstalk-free. The basic idea of realizing an all-to-all personalized exchange in such a Multistage Network is to transform it to multiple semipermutations and ensure that each of them can be realized crosstalk-free in a single pass. As can be seen, the all-to-all personalized exchange algorithm we propose has O(n) time complexity for n processors, which is optimal for an all-to-all personalized exchange. The optimal time complexity combined with the property of a single input/output port per processor suggests that a Multistage Network could be a better choice for implementing an all-to-all personalized exchange due to its shorter communication latency and better scalability.
-
Optimal all-to-all personalized exchange in self-routable Multistage Networks
IEEE Transactions on Parallel and Distributed Systems, 2000Co-Authors: Yuanyuan Yang, Jianchao WangAbstract:All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important applications in parallel computing. Previous all-to-all personalized exchange algorithms were mainly developed for hypercube and mesh/torus Networks. Although the algorithms for a hypercube may achieve optimal time complexity, the Network suffers from unbounded node degrees and thus has poor scalability in terms of I/O port limitation in a processor. On the other hand, a mesh/torus has a constant node degree and better scalability in this aspect, but the all-to-all personalized exchange algorithms have higher time complexity. In this paper, we propose an alternative approach to efficient all-to-all personalized exchange by considering another important type of Networks, Multistage Networks, for parallel computing systems. We present a new all-to-all personalized exchange algorithm for a class of unique-path, self-routable Multistage Networks. We first develop a generic method for decomposing all-to-all personalized exchange patterns into some permutations which are realizable in these Networks, and then present a new all-to-all personalized exchange algorithm based on this method. The newly proposed algorithm has O(n) time complexity for an n/spl times/n Network, which is optimal for all-to-all personalized exchange. By taking advantage of fast switch setting of self-routable switches and the property of a single input/output port per processor in a Multistage Network, we believe that a Multistage Network could be a better choice for implementing all-to-all personalized exchange due to its shorter communication latency and better scalability.
-
IPDPS - Optimal all-to-all personalized exchange in a class of optical Multistage Networks
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000, 1Co-Authors: Yuanyuan Yang, Jianchao WangAbstract:All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/Networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical Multistage Networks. Advances in electro-optic technologies have made optical communication a promising Networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical Multistage Networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, self-routing optical Multistage Networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a Multistage Network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of Network.
Sammy Meftali - One of the best experts on this subject based on the ideXlab platform.
-
ISPAN - Scalable Multistage Network for Multiprocessor System-on-Chip Design
8th International Symposium on Parallel Architectures Algorithms and Networks (ISPAN'05), 1Co-Authors: Sammy Meftali, Jean-luc Dekeyser, Isaac D. SchersonAbstract:This paper presents a micro-Network that is ageneric, scalable and multi-stage interconnect architecture for systems on a chip (SoC). TheNetwork architecture relies on a packet switching and point-to-point bi-directional links between the routers implementing the micro Network. The NoC provides a configurable number of OCP compliant communication interfaces for both initiators (master) and targets (slave). This Network has been used in a multiprocessor SoC with 16 initiators 16 slaves, and compared with an AMBA bus in terms of latency and saturation threshold.
Yadong Gui - One of the best experts on this subject based on the ideXlab platform.
-
Optimal software multicast in wormhole-routed Multistage Networks
IEEE Transactions on Parallel and Distributed Systems, 1997Co-Authors: Yadong GuiAbstract:Multistage interconnection Networks are a popular class of interconnection architecture for constructing scalable parallel computers (SPCs). The focus of this paper is on the Multistage Network system which supports wormhole routed turnaround routing. Existing machines characterized by such a system model include the IBM SP-1 and SP-2, TMC CM-5, and Meiko CS-2. Efficient collective communication among processor nodes is critical to the performance of SPCs. A system-level multicast service, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is fundamental in supporting collective communication primitives including the application-level broadcast, reduction, and barrier synchronization. This paper addresses how to efficiently implement multicast services in wormhole-routed Multistage Networks, in the absence of hardware multicast support, by exploiting the properties of the turnaround switching technology. An optimal multicast algorithm is proposed. The results of implementations on a 64-node SP-1 show that the proposed algorithm significantly outperforms the application-level broadcast primitives provided by currently existing collective communication libraries including the public domain MPI.
