Abstract
This paper proposes a new metric that aims to express the cost of manufacturing large-scale, communication-intensive digital systems. These systems are modeled by networks with internal and external edges, where the latter are input/output edges connecting the system with the external world. A k–parceling of such a network is a partition of the network into components each having at most k non-internal edges. (Such a partition is of interest when the number of the external edges is much larger than k.) The k–parceling number of a network is the minimal number of components in a k–parceling.
We argue that the parceling number of a large-scale, communication-intensive network expresses the cost of such a system better than the contemporary prevalent metrics and therefore it can guide the designers of such systems better than these metrics.
The paper studies the parceling of two important networks, the Butterfly and the Batcher Bitonic sorting network. It establishes explicit (rather than asymptotic) lower and upper bounds on the parceling number of both networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in c log n parallel steps. Combinatorica 3, 1–19 (1983)
Bakoglo, H.B.: Circuits, interconnections and packaging for VLSI. Addison-Wesley, Reading (1990)
Batcher, K.E.: Sorting networks and their application. In: Proc. AFIPS Spring Joint Computer Conf, vol. 32, pp. 307–314 (1968)
Bell, C.G., Mudge, J.C., McNamara, J.E.: Computer Engineering. Digital Press (1978)
Bermond, J.C., Fourneau, J.M., Jean-Marie, A.: Equivalence of multistage interconnection networks. Information Processing Letters 26, 45–50 (1987/88)
Bhatt, S.N., Chung, F.R.K., Rosenberg, A.L.: Partitioning circuits for improved testability. Algorithmica 6, 37–48 (1991)
Even, S., Litman, A.: Layered Cross Product - a technique to construct interconnection networks. Networks 29, 219–223 (1997)
Giacopelli, J.N., Hickey, J.J., Marcus, W.S., Sincoskie, W.D., Littlewood, M.: Sunshine: a high-performance self-routing broadband packet switch architecture. IEEE Journal on Selected Areas in Communications 9, 1289–1298 (1991)
Golbandi, N., Litman, A.: Characterizations of generalized butterfly networks, T.R. no. CS-2004-10, Dept. of Computer Science, Technion, Israel (2004), http://www.cs.technion.ac.il/users/wwwb/cgibin/tr-info.cgi?2004/CS/CS-2004-10
Goke, L.R., Lipovski, G.J.: Banyan Networks For Partitioning Multiprocessing Systems. In: Proceedings of the 1st Annual Symposium on Computer Architecture, pp. 21–28 (1973)
Huang, A., Knauer, S.: Starlite: a wideband digital switch. In: Proceedings of GLOBECOME 1984, pp. 121–125 (1984)
Leighton, F.T., Rosenberg, A.L.: Three-dimensional circuit layouts. SIAM J. Comput. 15, 793–813 (1986)
Leighton, F.T.: Introduction to parallel algorithms and architectures. Morgan Kaufmann, San Francisco (1992)
Leiserson, C.E.: Fat-trees: universal networks for hardwareefficient supercomputing. IEEE Trans. Comp. C 34, 892–901 (1985)
Leiserson, C.E., Saxe, J.B.: Optimizing synchronous systems. Journal of VLSI and Computer Systems 1, 41–67 (1983)
Thompson, C.D.: Area-time complexity for VLSI. In: Proceeding of the 11th Annual ACM Symposium on Theory of Computing, pp. 81–88 (1979)
Thompson, C.D.:: A complexity theory for VLSI. Ph.D. Thesis, CMU (1980)
Weste, N.H.E., Eshraghian, K.: Principles of CMOS VLSI design, 1st edn. Addison-Wesley, Reading (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Litman, A. (2006). Parceling the Butterfly and the Batcher Sorting Network. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 3895. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11685654_5
Download citation
DOI: https://doi.org/10.1007/11685654_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32880-3
Online ISBN: 978-3-540-32881-0
eBook Packages: Computer ScienceComputer Science (R0)