Controller architecture and strategy for small discontiguous...

Details Controller architecture and strategy for small discontiguous... Controller architecture and strategy for small discontiguous...

2002-02-16

2004-05-18

Kim, Matthew (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Control technique

C711S158000, C711S168000, C711S169000

Reexamination Certificate

active

06738874

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to an information-processing system and in particular to an information-processing system with high-density memory.
2. Description of Related Art
For purposes of the present discussion, RAM devices may be divided into at least two general classes based on intended applications and cost/performance tradeoffs.
A first class (type one RAM) is comprised of devices whose design is optimized for high-density and access to large amounts of contiguous data, while a second class (type two RAM) is comprised of devices whose design is optimized for random access to small amounts of data that may be discontiguous within the total address space of the memory.
An example of type one RAM is Dynamic RAM (DRAM), which by definition includes Synchronous DRAM (SDRAM) and Double Data Rate Synchronous DRAM (DDR-SDRAM). Type one RAM memory cells may be packed relatively densely, so the large quantity of data that can be stored in such devices allows the cost per data unit stored to be minimized. Such devices are a typical choice for providing large amounts of memory in systems that require this. Since the performance of most such systems benefit from rapid access to large contiguous blocks of data, the designs are optimized to enable this, at the cost of providing relatively slower access to small blocks of discontiguous data. Such a design tradeoff is often appropriate because many business, scientific, engineering and graphics data processing applications have the characteristic of operating on relatively large blocks of contiguous data.
Static RAM (SRAM) is one example of type two RAM. Type two RAM memory cells cannot be packed as densely as type one RAM memory cells and dissipate more power than type one RAM memory cells. The consequence of the relatively low packing density and the higher power of type two RAM is that the quantity of data that can be stored is lower than type one RAM devices would provide and a higher cost per unit data stored. Current design practice is to accept this higher cost in order to gain uniformly low access latency over the total address space of the memory.
Certain data processing applications such as networking components inevitably need to operate on discontiguous data. The current design practice yields acceptable cost-effectiveness provided the quantity of memory which must be provided is relatively low, since the aggregate of the higher cost per data unit of the memory remains a low portion of the total system cost. But for systems requiring large amounts of memory, type two RAM can be infeasible due to cost, and the high power consumption and low density of type two RAM can create heat dissipation and physical size problems. The growing processing and memory needs of networking components provide one example of this situation.
Network infrastructure speeds have increased dramatically, often generation-to-generation being 10X in throughput from the previous. Historically the infrastructure itself only required the information related to routing or other transient data/statistics to be maintained in the wire speed equipment. The servers themselves or other general purpose CPUs in equipment were responsible for the processing of persistent state such as TCP, UDP, IPSec or SSL connection information.
General purpose CPUs with traditional memory systems or even specialized processors for routing (i.e., stand-alone Network Processors) do not have the memory subsystems to handle both the high-data-throughput and the high-simultaneous-connection specifications required. The aggregation of services at the edge of a data center can require one million or more TCP connections for an application such as SSL or similarly 500,000+ security associations for IPSec. Firewalls, load balancers, etc. could also be enhanced if there were a capability to either terminate or shadow TCP connections at wire speeds. A “shadow TCP connection” is one that does not terminate the TCP connection, but maintains state with the connection so as to monitor the terminated TCP connection. It would be valuable to provide sufficient memory to support such tasks, but they inherently need to access small blocks of discontiguous data. The cost of providing adequate amounts of suitable memory using existing design precepts can make such systems infeasible due to total cost.
In light of the above discussion, it would be desirable to provide a memory architecture that enabled the use of the high-density, low power and low cost devices such as type one RAM, while providing adequately low latency in accessing small blocks of discontiguous data. The present invention solves this and other problems.
BRIEF SUMMARY OF THE INVENTION
In light of reviewing the prior art, it is desirable to provide a memory architecture strategy based on the use of high-density storage devices, providing low latency in accessing the full address space of the memory to write or read small blocks of discontiguous data.
A memory architecture design and strategy of the present invention uses memory devices that would normally be considered disadvantageous, but by accommodating the data input, output, and other peripheral controller services, overall performance in this mode is optimized. The surprising result is that even though the choice of memory is inappropriate for the task based on the precepts of the prior art, the overall memory system is effective.
One example of a normally disadvantageous situation that is beneficial in connection with one or more embodiments of the present invention is bank switching in DDR-SDRAM, thereby achieving feasibility without resort to, for example, SRAM.


REFERENCES:
patent: 4799149 (1989-01-01), Wolf
patent: 5542061 (1996-07-01), Omata
patent: 5577236 (1996-11-01), Johnson 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: 6341299 (2002-01-01), Romain
patent: 6591350 (2003-07-01), Stenfort
Menezes, A.J., et al “Handbook of Applied Cryptography” Boca Raton, CRC Press, 1997.
Kornerup, P., “High-Radix Modular Multiplication for Crytosystems” 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 Arithmetic VLSI Array Architecture for Manipulator Pseudo-Inverse Jacobian Computation’” Communications, IEEE Transactions on Robotics and Automation, vol. 7, No. 5, (Oct. 1991), pp. 715-716.
Savas, E. and Koc, C.K., “The Montgomery Modular Inverse-Revisted” 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 Germany, 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 Department, Worcester Polytechnic Institute, Submitted to Faculty Apr. 8, 1999, Published May 1999. Retrieved from the Internet <URL: http://www.wpi.edu/pubs/ETD/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 Inte

Affiliated with

Also associated with

Rating

Controller architecture and strategy 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 Controller architecture and strategy for small discontiguous..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Controller architecture and strategy for small discontiguous... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3250500