Electrical computers and digital processing systems: processing – Dynamic instruction dependency checking – monitoring or...
Reexamination Certificate
1999-07-30
2003-02-04
Coleman, Eric (Department: 2183)
Electrical computers and digital processing systems: processing
Dynamic instruction dependency checking, monitoring or...
C711S216000
Reexamination Certificate
active
06516404
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates in general to data processing and, in particular, to the storage subsystem of a data processing system. Still more particularly, the present invention relates to a data processing system having a hashed and partitioned storage subsystem.
2. Description of the Related Art
In order to capitalize on the high performance processing capability of a state-of-the-art processor core, the storage subsystem of a data processing system must efficiently supply the processor core with large amounts of instructions and data. Conventional data processing systems attempt to satisfy the processor core's demand for instructions and data by implementing deep cache hierarchies and wide buses capable of operating at high frequency. Although heretofore such strategies have been somewhat effective in staying apace of the demands of the core as processing frequency has increased, such strategies, because of their limited scalability, are by themselves inadequate to meet the data and instruction consumption demands of state-of-the-art and future processor technologies operating at 1 GHz and beyond.
SUMMARY OF THE INVENTION
To address the above and other shortcomings of conventional processor and data processing system architectures, the present invention introduces a processor having a hashed and partitioned storage subsystem. The processor includes at least one execution unit, an instruction sequencing unit coupled to the execution unit, and a cache subsystem including a plurality of caches that store data utilized by the execution unit. Each cache among the plurality of caches stores only data having associated addresses within a respective one of a plurality of subsets of an address space. In one preferred embodiment, the execution units of the processor include a number of load-store units (LSUs) that each process only instructions that access data having associated addresses within a respective one of the plurality of address subsets. The processor may further include a register file that is similarly partitioned into a plurality of groups of registers, such that registers within each group can store only data having associated addresses within a respective one of the plurality of subsets of the address space.
The processor may further be incorporated within a data processing system having a number of interconnects and a number of sets of system memory hardware that each have affinity to a respective one of the plurality of address subsets.
All objects, features, and advantages of the present invention will become apparent in the following detailed written description.
REFERENCES:
patent: 4646237 (1987-02-01), Allen
patent: 4755930 (1988-07-01), Wilson, Jr. et al.
patent: 4933940 (1990-06-01), Walter et al.
patent: 5307506 (1994-04-01), Colwell et al.
patent: 5404469 (1995-04-01), Chung et al.
patent: 5418922 (1995-05-01), Liu
patent: 5463739 (1995-10-01), Albaugh et al.
patent: 5499350 (1996-03-01), Uchida et al.
patent: 5530881 (1996-06-01), Inagami et al.
patent: 5542066 (1996-07-01), Mattson et al.
patent: 5546535 (1996-08-01), Stallmo et al.
patent: 5649090 (1997-07-01), Edwards et al.
patent: 5694567 (1997-12-01), Bourekas et al.
patent: 5713001 (1998-01-01), Eberhard et al.
patent: 5717893 (1998-02-01), Mattson
patent: 5754844 (1998-05-01), Fuller
patent: 5809494 (1998-09-01), Nguyen
patent: 5854913 (1998-12-01), Goetz
patent: 5860101 (1999-01-01), Arimilli et al.
patent: 5893163 (1999-04-01), Arimilli et al.
patent: 5897655 (1999-04-01), Mallick
patent: 5903769 (1999-05-01), Arya
patent: 5909694 (1999-06-01), Gregor et al.
patent: 5933860 (1999-08-01), Emer et al.
patent: 5940877 (1999-08-01), Eickemeyer et al.
patent: 5943684 (1999-08-01), Arimilli et al.
patent: 5956751 (1999-09-01), Lai
patent: 5974538 (1999-10-01), Wilmot
patent: 5996060 (1999-11-01), Mendelson et al.
patent: 6014730 (2000-01-01), Ohtsu
patent: 6038647 (2000-03-01), Shimizu
patent: 6081880 (2000-06-01), Sollars
patent: 6094710 (2000-07-01), Arimilli et al.
patent: 6128641 (2000-10-01), Fleck
patent: 6138209 (2000-10-01), Krolak et al.
patent: 6141707 (2000-10-01), Halligan et al.
patent: 6145054 (2000-11-01), Mehrotra et al.
patent: 6161166 (2000-12-01), Doing et al.
patent: 6175770 (2001-01-01), Bladow
patent: 6199179 (2001-03-01), Kauffman et al.
patent: 6205519 (2001-03-01), Aglietti et al.
patent: 6209059 (2001-03-01), Ofer et al.
patent: 6240487 (2001-05-01), Liu et al.
patent: 6275919 (2001-08-01), Johnson
patent: 6282630 (2001-08-01), Nguyen et al.
Neefs, Hank et al., “A Technique for High Bandwidth and Deterministic Low Latency Load/Store Accesses to Multiple Cache Banks,” IEEE Sixth International Symposium on High-Performance Computer Architecture, 1999, pp. 313-324.
Cho, Sangyeun et al., “Decoupling Local Variable Accesses in a Wide-Issue Superscalar Processor,” IEEE Proceedings of the 26thInternational Symposium on Computer Architecture, 1999, pp. 100-110.
Yoaz, Adi et al., “Speculation Techniques for Improving Load Related Instruction Scheduling,” IEEE Proceedings on the 26thInternational Symposium on Computer Architecture, 1999, pp. 42-53.
Leupers et al., “Retargetable Assembly Code Generation by Bootstrapping,” IEEE, pp.: 88-93, May 1994.
Marwedel, “Code Generation for Core Processors,” IEEE, pp. 232-237, Jun. 197.
Gupta et al., “Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers,” IEEE, pp. 179-193, Mar. 1992.
Liem et al., “Address Calculation for Retargetable Compilation and Exploration of Instruction-Set Architectures,” ACM, pp. 597,600, Jun. 1996.
U.S. patent application Ser. No. 09/364,284, Arimilli et al., filed Jul. 30, 1999.
U.S. patent application Ser. No. 09/364,282, Arimilli et al., filed Jul. 30, 1999.
U.S. patent application Ser. No. 09/364,288, Arimilli et al., filed Jul. 30, 1999.
U.S. patent application Ser. No. 09/364,281, Arimilli et al., filed Jul. 30, 1999.
U.S. patent application Ser. No. 09/364,286, Arimilli et al., filed Jul. 30, 1999.
U.S. patent application Ser. No. 09/364,287, Arimilli et al., filed Jul. 30, 1999.
U.S. patent application Ser. No. 09/364,285, Arimilli et al., filed Jul. 30, 1999.
Arimilli Ravi Kumar
Clark Leo James
Dodson John Steve
Guthrie Guy Lynn
Lewis Jerry Don
Bracewell & Patterson L.L.P.
Coleman Eric
International Business Machines - Corporation
Salys Casimer K.
LandOfFree
Data processing system having hashed architected processor... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data processing system having hashed architected processor..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data processing system having hashed architected processor... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3117461