Method, apparatus and system for N-dimensional sparse memory...

Static information storage and retrieval – Read/write circuit – Optical

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C365S064000, C365S073000, C365S198000

Reexamination Certificate

active

07609575

ABSTRACT:
In some embodiments, a method, apparatus and system for n-dimensional sparse memory using serial optical memory are presented. In this regard, a memory device is introduced to circulate a signal among a plurality of optical emitters and receivers. Other embodiments are also disclosed and claimed.

REFERENCES:
patent: 4334305 (1982-06-01), Girardi
patent: 4551720 (1985-11-01), Levin
patent: 5287316 (1994-02-01), Urushidani et al.
patent: 5740117 (1998-04-01), Bona et al.
patent: 6453393 (2002-09-01), Holman et al.
patent: 6917739 (2005-07-01), Chen
patent: 2006/0051101 (2006-03-01), Vishkin
patent: 2007/0081785 (2007-04-01), Hays
Thorson, M. “Multiprocessor cache coherency: MOESI model describes snooping protocols.” Jun. 20, 1990. Microprocessor Report, v4, n11, p12(4).
Lin et al. “Efficient Data Compression Methods for Multi-Dimensional Sparse Array Operations.” Nov. 2002. Proceedings of the First Internation Symposium on Cyber Worlds (CW '02). pp. 62-69.

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

Method, apparatus and system for N-dimensional sparse memory... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method, apparatus and system for N-dimensional sparse memory..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method, apparatus and system for N-dimensional sparse memory... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4139467

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