Article

Free access

Size-time complexity of Boolean networks for prefix computations

Authors:

F. P. PreparataAuthors Info & Claims

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

Pages 436 - 442

https://doi.org/10.1145/28395.28442

Published: 01 January 1987 Publication History

Abstract

The prefix problem consists of computing all the products x₀x₁…x_j (j=0, …, N - 1), given a sequence x = (x₀, x₁, …, x_{N - 1}) of elements in a semigroup. In this paper we completely characterize the size-time complexity of computing prefixes with boolean networks, which are synchronized interconnections of Boolean gates and one-bit storage devices. This complexity crucially depends upon a property of the underlying semigroup, which we call cycle-freedom (no cycle of length greater than one in the Cayley graph of the semigroup). Denoting by S and T size and computation time, respectively, we have S = Θ((N/T) log(N/T)), for non-cycle-free semigroups, and S = Θ(N/T), for cycle-free semigroups. In both cases, T ∈ [Ω(logN), O(N)].

References

[1]

G.M. Baudet, "On the area required by VLSI circuits," in H.T. Kung, R. Sproull, and G. Steele (eds.) VLSI Systems and Computations, pp. 100-107, Computer Science Press, Rockville, Mr), ~9sl.

[2]

R.P. Brent and H.T.Kung layout parallel adders,"IEEE Transactions on Computers, vol. C-31, n. 3, pp. 260-264, March 1982.

[3]

O. Bilardi and F.P. Preparata, "The influence of key length on the area-time complexity of sorting," Proceedings I.C,4.L_P., (Ed. W. Brauer) Nafplion, Greece, Springer-Verlag, pp. 53-62, July 1985.

Digital Library

[4]

G. Bilardi, and F.P. Preparata, "Area-time lower-bound techniques with applications to sorting," Algorithmica, vol. 1, n. 1, pp. 65-91, 1986.

Digital Library

[5]

G. Bilardi and F.P. Preparata, D~gital filter' g in VLSI," Proceedings of Aegean Workshop on Computing (Eds.F. Makedon et al.) Loutraki, Greece, Springer-Verlag, pp. 1-11, July 1986.

Digital Library

[6]

A.K. Chandra, S. Fortune, R. Lipton, "Unbounded fan-in circuits and associative functions," Proceedings of the 15th Annual Symposium on Theory of Computing, Boston, MA, pp. 52-60, April 1983.

Digital Library

[7]

R. Cole and A. Siegel, "On information flow and sorting: New upper and lower bounds for VLSI circuits," Proceedings 26th Annual Symposium on the Foundations of Computer Science, Portland, OR, pp. 208-221, October 1985.

[8]

P.W. Dymond and S.A. Cook, "Hardware comlexity and parallel computation," Proceedings st Annual Symposium on the Foundations of Computer Science, Syracuse, NY, pp. 360-372, October 1980.

[9]

F.E. Fitch, "Blew bounds for parallel prefix circuits," Proceedings 15th Annual ACM Symposium on Theory of Computing, Boston, MA, pp. 100-109, April 1983.

Digital Library

[10]

R.B. Johnson, "The complexity of a VLSI adder," Information Processing Letters, vol. 11, n. 2, pp. 92-93, October 1980.

[11]

D.J. Kuck, The structure of computers and computations, New York: Wiley, 19'/8.

Digital Library

[12]

C.P. Kruskal, L. Rudolph, M. Snir, "The power of parallel prefix," IEEE Tran.~actions on Computers, vol. C-34, n. 10, pp. 965-968, October 1985.

[13]

R.E. Ladner and M.J. Fischer, "Parallel prefix computation," Journal of the ACM, vol. 27, n. 4, pp. 831-838, October 1980.

Digital Library

[14]

M. Snir, "Depth-size trade-offs fbr parallel }~refix computation," Journal of Algorithms, vol. ~, no. 2, pp. 185-201, June 1986.

Digital Library

[15]

C.D. Thompson, "A complexity l~eory for VL8i," Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Au{~st 1980.

Digital Library

Cited By

Becker BSparmann U(1989)Computations over finite monoids and their test complexity[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers10.1109/FTCS.1989.105583(299-306)Online publication date: 1989
https://doi.org/10.1109/FTCS.1989.105583
Aggarwal AChandra ARaghavan PSimon J(1988)Energy consumption in VLSI circuitsProceedings of the twentieth annual ACM symposium on Theory of computing10.1145/62212.62230(205-216)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62212.62230

Index Terms

Size-time complexity of Boolean networks for prefix computations
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows
  2. Randomness, geometry and discrete structures

Recommendations

Size-time complexity of Boolean networks for prefix computations

The prefix problem consists of computing all the products x₀x₁ … x_j (j = 0, … , N - 1), given a sequence x = (x₀, x₁, … , x_N-1) of elements in a semigroup. In this paper we completely characterize the size-time complexity of computing prefixes with ...
Size-Time Complexity of Boolean Networks for Prefix Computations
On the Complexity of the Equational Theory of Residuated Boolean Algebras
Proceedings of the 23rd International Workshop on Logic, Language, Information, and Computation - Volume 9803

Residuated boolean algebras are introduced by Jonsson and Tsinakis [10] as generalizations of relation algebras. Jispen [12] proved that the equational theory of residuated boolean algebras with unit, and that of many relative classes of algebras are ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

January 1987

471 pages

ISBN:0897912217

DOI:10.1145/28395

Editor:
Alfred V. Aho

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC87

Sponsor:

SIGACT

STOC87: 19th Annual ACM Conference on Theory of Computing

New York, New York, USA

Acceptance Rates

STOC '87 Paper Acceptance Rate 50 of 165 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
237
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)4

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Becker BSparmann U(1989)Computations over finite monoids and their test complexity[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers10.1109/FTCS.1989.105583(299-306)Online publication date: 1989
https://doi.org/10.1109/FTCS.1989.105583
Aggarwal AChandra ARaghavan PSimon J(1988)Energy consumption in VLSI circuitsProceedings of the twentieth annual ACM symposium on Theory of computing10.1145/62212.62230(205-216)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62212.62230

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents