Advertisement

A network for parallel searching

  • Mamoru Maekawa
Chapter 5 Application Oriented VLSI
  • 128 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 163)

Abstract

This paper shows a pragmatic approach to highly parallel data base machines focusing on search operations. A system of n processors connected as a superimposed tree will process as many requests in about twice log2n transfer time between processors. Since it is not difficult for a powerful microprocessor to transfer a request in a couple of milliseconds, a system of 1024 processors will have a processing rate of up to 20K search operations per second.

Keywords

Memory Unit Throughput Rate Output Stream Search Operation Calendar Data 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. B. Dennis and D. P. Misunas, “A Preliminary Architecture for a Basic Data-Flow Processor,” Proc. 2nd. Ann. IEEE Symp. Computer Architecture, 1975, pp. 126–132.Google Scholar
  2. 2.
    H. T. Kung, “Why Systolic Architectures,” Computer, Vol. 15, No. 1 (Jan. 1982), pp. 37–46.Google Scholar
  3. 3.
    M. Maekawa, “Optimal Processor Interconnection Topologies,” Proc. Eighth International Symposium on Computer Architecture, Minneapolis, Minnesota, May 12–14, 1981.Google Scholar
  4. 4.
    H. S. Stone, “Parallel Processing with the Perfect Shuffle,” IEEE Trans. Computers, Vol. C-20, 1971, pp. 153–161.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Mamoru Maekawa
    • 1
  1. 1.Department of Information ScienceUniversity of TokyoTokyoJapan

Personalised recommendations