4 research outputs found
Computing in Matrix Groups without memory
Memoryless computation is a novel means of computing any function of a set of regis-
ters by updating one register at a time while using no memory. We aim to emulate how
computations are performed on modern cores, since they typically involve updates of sin-
gle registers. The computation model of memoryless computation can be fully expressed
in terms of transformation semigroups, or in the case of bijective functions, permutation
groups. In this paper, we view registers as elements of a finite field and we compute
linear permutations without memory. We first determine the maximum complexity of a
linear function when only linear instructions are allowed. We also determine which linear
functions are hardest to compute when the field in question is the binary field and the
number of registers is even. Secondly, we investigate some matrix groups, thus showing
that the special linear group is internally computable but not fast. Thirdly, we determine
the smallest set of instructions required to generate the special and general linear groups.
These results are important for memoryless computation, for they show that linear func-
tions can be computed very fast or that very few instructions are needed to compute any
linear function. They thus indicate new advantages of using memoryless computation
Computation with No Memory, and Rearrangeable Multicast Networks
We investigate the computation of mappings from a set S^n to itself with "in situ programs", that is using no extra variables than the input, and performing modifications of one component at a time, hence using no extra memory. In this paper, we survey this problem introduced in previous papers by the authors, we detail its close relation with rearrangeable multicast networks, and we provide new results for both viewpoints. A bijective mapping can be computed by 2n-1 component modifications, that is by a program of length 2n-1, a result equivalent to the rearrangeability of the concatenation of two reversed butterfly networks. For a general arbitrary mapping, we give two methods to build a program with maximal length 4n-3. Equivalently, this yields rearrangeable multicast routing methods for the network formed by four successive butterflies with alternating reversions. The first method is available for any set S and practically equivalent to a known method in network theory. The second method, a refinment of the first, described when |S| is a power of 2, is new and allows more flexibility than the known method. For a linear mapping, when S is any field, or a quotient of an Euclidean domain (e.g Z/sZ for any integer s), we build a program with maximal length 2n-1. In this case the assignments are also linear, thereby particularly efficient from the algorithmic viewpoint, and giving moreover directly a program for the inverse when it exists. This yields also a new result on matrix decompositions, and a new result on the multicast properties of two successive reversed butterflies. Results of this flavour were known only for the boolean field Z/2Z
Computation with No Memory, and Rearrangeable Multicast Networks
GeneralInternational audienceWe investigate the computation of mappings from a set S^n to itself with "in situ programs", that is using no extra variables than the input, and performing modifications of one component at a time, hence using no extra memory. In this paper, we survey this problem introduced in previous papers by the authors, we detail its close relation with rearrangeable multicast networks, and we provide new results for both viewpoints. A bijective mapping can be computed by 2n-1 component modifications, that is by a program of length 2n-1, a result equivalent to the rearrangeability of the concatenation of two reversed butterfly networks. For a general arbitrary mapping, we give two methods to build a program with maximal length 4n-3. Equivalently, this yields rearrangeable multicast routing methods for the network formed by four successive butterflies with alternating reversions. The first method is available for any set S and practically equivalent to a known method in network theory. The second method, a refinment of the first, described when |S| is a power of 2, is new and allows more flexibility than the known method. For a linear mapping, when S is any field, or a quotient of an Euclidean domain (e.g Z/sZ for any integer s), we build a program with maximal length 2n-1. In this case the assignments are also linear, thereby particularly efficient from the algorithmic viewpoint, and giving moreover directly a program for the inverse when it exists. This yields also a new result on matrix decompositions, and a new result on the multicast properties of two successive reversed butterflies. Results of this flavour were known only for the boolean field Z/2Z