Abstract
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. We consider several types of mappings and obtain effective computation and decomposition methods, together with upper bounds on the program length (number of assignments). Our technique is combinatorial and algebraic (graph coloration, partition ordering, modular arithmetics).
For general mappings, we build a program with maximal length 5n − 4, or 2n − 1 for bijective mappings. The length is reducible to 4n − 3 when |S| is a power of 2. This is the main combinatorial result of the paper, which can be stated equivalently in terms of multistage interconnection networks as: any mapping of {0,1}n can be performed by a routing in a double n-dimensional Beneš network. Moreover, the maximal length is 2n − 1 for linear mappings when S is any field, or a quotient of an Euclidean domain (e.g. ℤ/sℤ). In this case the assignments are also linear, thereby particularly efficient from the algorithmic viewpoint.
The in situ trait of the programs constructed here applies to optimization of program and chip design with respect to the number of variables, since no extra writing memory is used. In a non formal way, our approach is to perform an arbitrary transformation of objects by successive elementary local transformations inside these objects only with respect to their successive states.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, D.P.: Graph theoretical analysis and design of multistage interconnection networks. IEEE Trans. Computers C32, 637–648 (1983)
Beneš, V.E.: Optimal Rearrangeable Multistage Connecting Networks. Bell System Technical J. 43, 1641–1656 (1964)
Bermond, J.C., Fourneau, J.M., Jean-Marie, A.: A graph theoretical approach to equivalence of multi-stage interconnection networks. Discrete Applied Maths. 22, 201–214 (1988)
Burckel, S., Gioan, E.: In situ design of register operations. In: IEEE Proceedings of ISVLSI 2008 (2008)
Burckel, S., Morillon, M.: Quadratic Sequential Computations. Theory of Computing Systems 37(4), 519–525 (2004)
Burckel, S., Morillon, M.: Sequential Computation of Linear Boolean Mappings. Theoretical Computer Science serie A 314, 287–292 (2004)
Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297–301 (1965)
König, D.: Uber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlhere. Math. Ann. 77, 453–465 (1916)
Nussbaumer, H.J.: Fast Fourier transform and convolution algorithms, 2nd edn. Springer Series in Information Sciences, vol. 2. Springer, Heidelberg (1982)
Ravikumar, C.P., Aggarwal, R., Sharma, C.: A graph theoretic approach for register file based synthesis. In: Proceedings of VLSID 1997, Tenth International Conference on VLSI Design (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burckel, S., Gioan, E., Thomé, E. (2009). Mapping Computation with No Memory. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds) Unconventional Computation. UC 2009. Lecture Notes in Computer Science, vol 5715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03745-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-03745-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03744-3
Online ISBN: 978-3-642-03745-0
eBook Packages: Computer ScienceComputer Science (R0)