Electrical computers and digital processing systems: memory – Addressing combined with specific memory configuration or... – For multiple memory modules
Reexamination Certificate
2005-06-21
2005-06-21
Elmore, Stephen C. (Department: 2186)
Electrical computers and digital processing systems: memory
Addressing combined with specific memory configuration or...
For multiple memory modules
C711S157000, C711S158000, C711S168000, C711S169000, C365S230030, C365S230050
Reexamination Certificate
active
06910095
ABSTRACT:
A memory read and write request handling method is performed by a memory controller which buffers incoming memory read and write requests and distributes the requests across multiple memory banks of a memory system in connection with client processes. The read and write requests are intelligently reordered utilizing grouping of both memory reads and memory writes in such a way to minimize the requests processing time while maintaining data coherency.
REFERENCES:
patent: 4799149 (1989-01-01), Wolf
patent: 5542061 (1996-07-01), Omata
patent: 5577236 (1996-11-01), Johnson et al.
patent: 5630096 (1997-05-01), Zuravleff et al.
patent: 5699537 (1997-12-01), Sharangpani et al.
patent: 5724279 (1998-03-01), Benaloh et al.
patent: 5745913 (1998-04-01), Pattin et al.
patent: 5764554 (1998-06-01), Monier
patent: 5771369 (1998-06-01), Curran
patent: 5784582 (1998-07-01), Hughes
patent: 5787457 (1998-07-01), Miller et al.
patent: 5983299 (1999-11-01), Qureshi
patent: 5987574 (1999-11-01), Paluch
patent: 6088453 (2000-07-01), Shimbo
patent: 6134244 (2000-10-01), Van Renesse et al.
patent: 6141705 (2000-10-01), Anand et al.
patent: 6151393 (2000-11-01), Jeong
patent: 6157955 (2000-12-01), Narad et al.
patent: 6240492 (2001-05-01), Foster et al.
patent: 6282144 (2001-08-01), Batson et al.
patent: 6295588 (2001-09-01), Wilson
patent: 6341299 (2002-01-01), Romain
patent: 6591350 (2003-07-01), Stenfort
patent: 2002/0169921 (2002-11-01), Saitoh
patent: 2003/0061459 (2003-03-01), Aboulenein et al.
Menezes, A.J., et al “Efficient Implementation” from The Handbook of Applied Cryptograph, Boca Raton, CRS Press, 1997, pp. 591-607.
Dimitrov, V. and Cooklev, T., “Two Algorithms for Modular Exponentiation Using Nonstandard Arithmetics” IEICE Trans. Fundamentals, vol. E78-A, No. 1, Jan. 1995.
Koc, C.K. and Hung, C.Y. “Carry-Save Adders for Computing the Product AB Modulo N” Electronics Letters, vol. 26, No. 13, Jun. 21, 1990, pp. 899-900.
Freking, W. and Parhi, K.K., “Montgomery Modular Multiplication and Exponentiation in the Residue Number System” Proc. 33rdAsilomar Conf. Signals Systems and Computer, Oct. 1999. pp. 1312-1316.
Tenca, A.F. and Koc, C.K., “A Scalable Architecture for Montgomery Multiplication” in: Koc, C.K. and Paar, C. Cryptographic Hardware and Embedded Systems, CHES 99, Lecture Notes in Computer Science, No. 1717. 1998, New York, NY: Springer-Verlog, 1999.
Koc, C.K. and Acra, T., “Montgomery Multiplication in GF (2k)” 3rdAnnual Workshop on Selected Areas in Cryptography (Aug. 15-16, 1996), pp. 95-106.
Bajard, J.C., et al., “An RNS Montgomery Modular Multiplication Algorithm” IEEE Transactions on Computer, vol. 47, No. 7 (Jul. 1998), pp. 766-776.
Eldridge, S.E., “A Faster Modular Multiplication Algorithm” International Journal of Comuter Math, vol. 40 (1991), pp. 63-68.
Bossalaers, A., et al., “Comparison of Three Modular Reduction Functions” in Douglad R. Stinson, editor, Advances in Cryptology—CRYPTO '93, vol. 773 of Lecture Notes in Computer Science (Aug. 22-26, 1993), pp. 166-174.
Montgomery, P.L., “Modular Multiplication Without Trial Division” Mathematics of Computation, vol. 44, No. 170 (Apr. 1985), pp. 519-521.
Koc, C.K., et al., “Analyzing and Comparing Montgomery Multiplication Algorithms” IEEE Micro, vol. 16, Issue 3 (Jun. 1996), pp. 26-33.
Kornerup, P., “High-Radix Modular Multiplication for Cryptosystems” Department of Mathematics and Computer Science (1993), pp. 277-283.
Sunar, B. and Koc, C.K., “An Efficient Optimal Normal Basis Type II Multiplier” Brief Contributions, IEEE Transactions on Computers, vol. 50, No. 1 (Jan. 2001), pp. 83-87.
Koc, C.K., “Comments on Residue Arthmetic VLSI Array Architecture for Manipular Pseudo-Inverse Jacobian Computation,” Communications, IEEE Tarnsactions on Robotics and Automation, vol. 7, No. 5 (Oct. 1991).
Savas, E. and Koc, C.K., “The Montgomery Modular Inverse-Revisited” IEEE Transactions on Computers, vol. 49, No. 7 (Jul. 2000), pp. 763-766.
Walter, C.D., “Montgomery's Multiplication Technique: How to Make it Smaller and Faster” in Cryptographic Hardware and Embedded Systems—CHAS 1999, C. Paar (Eds.) K. Ko, Ed. 1999, Springer, Berlin German, pp. 61-72.
Oh, H. and Moon, J. “Modular Multiplication Method” IEE Proc.-Comput. Digit. Tech., vol. 145, No. 4 (Jul. 1998), pp. 317-318.
Blum, T., “Modular Exponentiation on Reconfigurable Hardware” Master's thesis, ECE Dept., Worcester Polytechnic Institute, Submitted to Faculty Apr. 8, 1999, Published May, 1999. Retrieved from the Internet <URL: http://www.wpi.edu/pubs/ETC/Available/etd-090399-090413/unrestricted/blum.pdf>.
Marwedel, P., et al., “Built in Chaining: Introducing Complex Components into Architectural Synthesis” Apr. 1996. Proceedings of the ASP-DAC, 1997 [online]. Retrieved from the Internet <URL: http://eldorado.uni-dortmund.de:8080/FB4/Is12/forhung/1997/aspdac/aspacPFF>.
Menezes, A.J., et al., “Hardbook of Applied Cryptography” Boca Raton, CRC Press, 1997.
Britestream Networks, Inc.
Elmore Stephen C.
Weiss Aaron A.
LandOfFree
Memory request handling method for small discontiguous... 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 request handling method for small discontiguous..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory request handling method for small discontiguous... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3487743