Processes for Random and Sequential Accessing in Dynamic Memories

  title={Processes for Random and Sequential Accessing in Dynamic Memories},
  author={S. Brent Morris and Arthur Valliere and Richard A. Wisniewski},
  journal={IEEE Transactions on Computers},
In a memory using shuffle interconnections, the concept of sequential accessing in unit time has been related to the existence of a sequence of operations, called a tour, that moves each datum through the read/write port. For memories of size 32, it has been stated that for certain operations no tours exist at window 1; moreover, the existence and construction of tours at other windows and for larger memories have been left as open questions. In this paper, we present several processes for… CONTINUE READING
3 Citations
8 References
Similar Papers


Publications referenced by this paper.
Showing 1-8 of 8 references

Permutations by cutting and shuffling-A generalization to Q-dimensions

  • S. B. Morris
  • Ph.D. dissertation, Duke Univ., 1974.
  • 1974
1 Excerpt

Apparatus for shifting data in a long register

  • Batcher
  • U.S. Pat. 3605024, Sept. 14, 1971.
  • 1971
1 Excerpt

A note on Stone's dynamic memory

  • H. Fredicksen
  • unpublished.

His current research interests are in random and sequential accessing using various interconnections in dynamic memories

  • George G. Meade, MD.

Processes for random and sequential accessing in dynamic memories

  • S. B. Morris, A. Valliere, 111, R. A. Wisniewski
  • IEEE Computer Society Repository.
1 Excerpt

Similar Papers

Loading similar papers…