Multiport high speed memory having contention arbitration capabi

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 364DIG2, 3642384, 3642448, 395477, 395478, 395481, 395494, 395495, G06F 1200, G06F 1314

Patent

active

057375690

ABSTRACT:
An arbitration circuit and method for a multiport high speed memory in a computer microprocessor. A plurality of addresses are provided to a plurality of ports. The addresses are decoded in a plurality of decoders. The decoded output lines are compared in a comparison circuitry to determine if one or more of the ports is requesting access to the same memory line, and a comparison bit indicative of a match is outputted. If asserted, the comparison bit disables a line driver so that only one of the wordlines in a particular memory line is driven at any one time.

REFERENCES:
patent: 4535428 (1985-08-01), Furman
patent: 4843542 (1989-06-01), Dashiell et al.
patent: 5036491 (1991-07-01), Yamaguchi
patent: 5089992 (1992-02-01), Shinohara
patent: 5177706 (1993-01-01), Shinohara et al.
patent: 5265235 (1993-11-01), Sindhu et al.
patent: 5276842 (1994-01-01), Sugita
patent: 5327570 (1994-07-01), Foster et al.
patent: 5384734 (1995-01-01), Tsujihashi et al.
patent: 5420984 (1995-05-01), Good et al.
patent: 5502683 (1996-03-01), Marchioro

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Multiport high speed memory having contention arbitration capabi does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multiport high speed memory having contention arbitration capabi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiport high speed memory having contention arbitration capabi will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-24990

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.