Article ID Journal Published Year Pages File Type
434470 Theoretical Computer Science 2014 10 Pages PDF
Abstract

In order to resolve the problem of separating conflict routings in shuffle–exchange networks, we define the concepts of the maximal no-conflict routing group and the least no-conflict routing grouping (LNCRG), as well as an associated eigenfunction and covering function. Based on these concepts, we propose a theoretical and practical method of computing the LNCRG using Boolean algebra. In addition, an algorithm for approximately computing the LNCRG is put forward to improve the efficiency of batching routings. Our theoretical analysis and experiments show that the time efficiency and accuracy of the algorithm are excellent. The proposed method provides strong support for the batching of routing policies in large-scale information exchanges.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , ,