Memory expansion structure in multi-path accessible...

Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S149000

Reexamination Certificate

active

07984261

ABSTRACT:
A multiprocessor system includes a first processor coupled to a first bus, a second processor coupled to a second bus, a first memory coupled to the first bus and the second bus, and a second memory coupled to the second bus. The first processor is configured to access the first memory through the first bus, and the second processor is configured to access the first memory and the second memory through the second bus.

REFERENCES:
patent: 5680365 (1997-10-01), Blankenship
patent: 6839739 (2005-01-01), Wilson
patent: 2003/0093628 (2003-05-01), Matter et al.
patent: 2004/0107264 (2004-06-01), Nishida
patent: 2005/0066067 (2005-03-01), Suh
patent: 2008/0144270 (2008-06-01), Dal Porto et al.
patent: 10-161866 (1998-06-01), None
patent: 2005-020088 (2005-02-01), None
patent: 2005-50088 (2005-02-01), None
patent: 1994-22284 (1994-10-01), None
patent: 1997-51155 (1997-07-01), None
patent: 2000-49908 (2000-08-01), None
patent: 2002-58322 (2002-07-01), None
patent: 2005-58322 (2002-07-01), None
patent: 2005-29104 (2005-03-01), None

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

Memory expansion structure in multi-path accessible... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory expansion structure in multi-path accessible..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory expansion structure in multi-path accessible... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2688229

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