Memory architecture and parallel access
Author(s)
Bibliographic Information
Memory architecture and parallel access
Elsevier, 1994
Available at 4 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 229-243) and index
Description and Table of Contents
Description
Researchers and engineers always need faster computers than the currently existing ones. However rapidly computer engineering may develop on an intemational scale, there are always important fields of application for which the performances of the currently existing computers are absolutely inadequate. This book covers the subject of memory systems that have the possibility of parallel accesses to windows consisting of several memory words each. In modem computer architecture the design of parallel memories is of fundamental importance. The authors present the most significant theoretical foundations currently existing for parallel access as well as explaining the principles of design in the light of actual design examples. Thus, the engineer interested in practical aspects will be able to conceive and design parallel memory systems on his own.
Table of Contents
Introduction. Theory of Raster or Array Memories. Fundamental concepts and notions. Module assignment functions and conflict-free access. Address computation circuit. Permutations for different module assignment functions. Parallel Rectangle Memories. Lower and upper bounds for the number of memory modules. Rectangle memories with N=2 memory modules. Designs for computer graphics. Parallel Straight-Line Memories. Conflict-free access and linear module assignment functions. Functional Implementation. Designs for image processing. Vector access to an interleaved memory. Parallel Memories for General Data Structures. Basic concepts. Classes of module assignment functions. Address computation circuit and permutation network. Conflict-free storage of trees. Mapping of trees into dyadic memories.
by "Nielsen BookData"