research-article

Traversing Binary Tree Structures with Shift-Register Memories

Author:

W. E. KlugeAuthors Info & Claims

IEEE Transactions on Computers, Volume 26, Issue 11

Pages 1112 - 1122

https://doi.org/10.1109/TC.1977.1674757

Published: 01 November 1977 Publication History

Publisher Site

Abstract

The paper proposes a tree-structured shift-register memory which employs two different data permutation operations to perform pre-/post-order traversals of binary tree structures.

References

[1]

C. K. Wong and P. C. Yue, "The anticipatory control of a cyclically permutable memory," IEEE Trans. Comput., vol. C-22, pp. 481-488, May 1973.

Digital Library

Google Scholar

[2]

P. Schneider and J. Witte, "CCD memories in a working memory system," Siemens Forsch.-u. Entw. Ber., no. 4, pp. 231-237, 1975.

Google Scholar

[3]

D. E. Knuth, The Art of Computer Programming: Fundamental Algorithms, vol. 1, 2nd ed. Reading, MA: Addison-Wesley, 1973.

Google Scholar

[4]

K. J. Berkling, "A computing machine based on tree structures," IEEE Trans. Comput., vol. C-20, pp. 404-418, Apr. 1971.

Digital Library

Google Scholar

[5]

H. S. Stone, "Dynamic memories with enhanced data access," IEEE Trans. Comput., vol. C-21, pp. 359-365, Apr. 1972.

Digital Library

Google Scholar

[6]

A. V. Aho and J. D. Ullman, "Dynamic memories with rapid random and sequential access," IEEE Trans. Comput., vol. C-23, pp. 272-276, Mar. 1974.

Digital Library

Google Scholar

[7]

W. H. Kautz, "Shift register memories," IEEE Comput. Soc. Repos. Serv., R 73-48, 1973.

Google Scholar

[8]

W. Kluge, "A dynamic memory with fast random access and page transfer properties," Digital Processes, vol. 1, pp. 279-293, 1975.

Google Scholar

[9]

K. J. Berkling, "Reduction languages for reduction machines," in Proc. 2nd IEEE Annu. Symp. Computer Architecture, Jan. 20-22, 1975, pp. 133-140.

Digital Library

Google Scholar

Cited By

View all

Bongiovanni GWong C(1981)Tree Search in Major/Minor Loop Magnetic Bubble MemoriesIEEE Transactions on Computers10.1109/TC.1981.167583830:8(537-545)Online publication date: 1-Aug-1981
https://dl.acm.org/doi/10.1109/TC.1981.1675838
Chung KLuccio FWong C(1980)A Tree Storage Scheme for Magnetic Bubble MemoriesIEEE Transactions on Computers10.1109/TC.1980.167546929:10(864-874)Online publication date: 1-Oct-1980
https://dl.acm.org/doi/10.1109/TC.1980.1675469

Traversing Binary Tree Structures with Shift-Register Memories
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Directory structures
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Traversing binary tree structures with shift register memories (Recent Results)

The paper proposes a tree-structured shift register memory in which traversals of binary data tress in pre-or end-order are performed as sequences of two non-cyclic data permutations which move the data tree relative to a unique access port that is ...
Traversing binary tree structures with shift register memories (Recent Results)
ISCA '76: Proceedings of the 3rd annual symposium on Computer architecture

The paper proposes a tree-structured shift register memory in which traversals of binary data tress in pre-or end-order are performed as sequences of two non-cyclic data permutations which move the data tree relative to a unique access port that is ...
Tree Structures and Algorithms for Physical Design
ISPD '18: Proceedings of the 2018 International Symposium on Physical Design

Tree structures and algorithms provide a fundamental and powerful data abstraction and methods for computer science and operations research. In particular, they enable significant advancement of IC physical design techniques and design optimization. For ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 26, Issue 11

November 1977

137 pages

ISSN:0018-9340

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 November 1977

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bongiovanni GWong C(1981)Tree Search in Major/Minor Loop Magnetic Bubble MemoriesIEEE Transactions on Computers10.1109/TC.1981.167583830:8(537-545)Online publication date: 1-Aug-1981
https://dl.acm.org/doi/10.1109/TC.1981.1675838
Chung KLuccio FWong C(1980)A Tree Storage Scheme for Magnetic Bubble MemoriesIEEE Transactions on Computers10.1109/TC.1980.167546929:10(864-874)Online publication date: 1-Oct-1980
https://dl.acm.org/doi/10.1109/TC.1980.1675469

Abstract

References

Cited By

Recommendations