US20210365381A1 - Microprocessor architecture having alternative memory access paths - Google Patents
Microprocessor architecture having alternative memory access paths Download PDFInfo
- Publication number
- US20210365381A1 US20210365381A1 US17/396,716 US202117396716A US2021365381A1 US 20210365381 A1 US20210365381 A1 US 20210365381A1 US 202117396716 A US202117396716 A US 202117396716A US 2021365381 A1 US2021365381 A1 US 2021365381A1
- Authority
- US
- United States
- Prior art keywords
- instruction
- cache
- data
- main memory
- processor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
- 230000015654 memory Effects 0.000 title claims abstract description 220
- 238000000034 method Methods 0.000 claims abstract description 32
- 230000004044 response Effects 0.000 claims description 8
- 230000008878 coupling Effects 0.000 claims 1
- 238000010168 coupling process Methods 0.000 claims 1
- 238000005859 coupling reaction Methods 0.000 claims 1
- 239000004065 semiconductor Substances 0.000 abstract description 8
- 238000012545 processing Methods 0.000 description 22
- 230000008901 benefit Effects 0.000 description 8
- 230000007246 mechanism Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 238000003860 storage Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 238000013519 translation Methods 0.000 description 5
- 230000014616 translation Effects 0.000 description 5
- 230000001133 acceleration Effects 0.000 description 4
- 230000002123 temporal effect Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 230000002085 persistent effect Effects 0.000 description 3
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 2
- 230000009471 action Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 230000009977 dual effect Effects 0.000 description 2
- 238000007667 floating Methods 0.000 description 2
- 229910052710 silicon Inorganic materials 0.000 description 2
- 239000010703 silicon Substances 0.000 description 2
- 102100021198 Chemerin-like receptor 2 Human genes 0.000 description 1
- 102100034032 Cytohesin-3 Human genes 0.000 description 1
- 101710160297 Cytohesin-3 Proteins 0.000 description 1
- 101000750094 Homo sapiens Chemerin-like receptor 2 Proteins 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001427 coherent effect Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000007620 mathematical function Methods 0.000 description 1
- 238000001693 membrane extraction with a sorbent interface Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0888—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches using selective caching, e.g. bypass
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1027—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0844—Multiple simultaneous or quasi-simultaneous cache accessing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0877—Cache access modes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/60—Details of cache memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/68—Details of translation look-aside buffer [TLB]
Definitions
- the following description relates generally to multi-processor systems, and more particularly to a system having two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory for directly loading data into processor registers and/or storing data.
- processors such as CPUs (central processing units) featured a single execution unit to process instructions of a program. More recently, computer systems are being developed with multiple processors in an attempt to improve the computing performance of the system. In some instances, multiple independent processors may be implemented in a system. In other instances, a multi-core architecture may be employed, in which multiple processor cores are amassed on a single integrated silicon die. Each of the multiple processors (e.g., processor cores) can simultaneously execute program instructions. This parallel operation of the multiple processors can improve performance of a variety of applications.
- a multi-core CPU combines two or more independent cores into a single package comprised of a single piece silicon integrated circuit (IC), called a die.
- a multi-core CPU may comprise two or more dies packaged together.
- a dual-core device contains two independent microprocessors and a quad-core device contains four microprocessors.
- Cores in a multi-core device may share a single coherent cache at the highest on-device cache level (e.g., L2 for the Intel® Core 2) or may have separate caches (e.g. current AMD® dual-core processors).
- the processors also share the same interconnect to the rest of the system.
- Each “core” may independently implement optimizations such as superscalar execution, pipelining, and multithreading.
- a system with N cores is typically most effective when it is presented with N or more threads concurrently.
- processors e.g., multiple cores
- processors which are homogeneous in that they are all implemented with the same fixed instruction sets (e.g., Intel's x86 instruction set, AMD's Opteron instruction set, etc.).
- the homogeneous processors may employ a cache memory coherency protocol, as discussed further below.
- an instruction set refers to a list of all instructions, and all their variations, that a processor can execute.
- Such instructions may include, as examples, arithmetic instructions, such as ADD and SUBTRACT; logic instructions, such as AND, OR, and NOT; data instructions, such as MOVE, INPUT, OUTPUT, LOAD, and STORE; and control flow instructions, such as GOTO, if X then GOTO, CALL, and RETURN.
- Examples of well-known instruction sets include x86 (also known as IA-32), x86-64 (also known as AMD64 and Intel® 64), AMD's Opteron, VAX (Digital Equipment Corporation), IA-64 (Itanium), and PA-RISC (HP Precision Architecture).
- the instruction set architecture is distinguished from the microarchitecture, which is the set of processor design techniques used to implement the instruction set.
- Computers with different microarchitectures can share a common instruction set.
- the Intel® Pentium and the AMD® Athlon implement nearly identical versions of the x86 instruction set, but have radically different internal microarchitecture designs.
- the instruction set (e.g., x86) is fixed by the manufacturer and directly hardware implemented, in a semiconductor technology, by the microarchitecture. Consequently, the instruction set is fixed for the lifetime of this implementation.
- Cache memory coherency is an issue that affects the design of computer systems in which two or more processors share a common area of memory.
- processors often perform work by reading data from persistent storage (e.g., disk) into memory, performing some operation on that data, and then storing the result back to persistent storage.
- persistent storage e.g., disk
- processors In a uniprocessor system, there is only one processor doing all the work, and therefore only one processor that can read or write the data values.
- a simple uniprocessor can only perform one operation at a time, and thus when a value in storage is changed, all subsequent read operations will see the updated value.
- processors there are two or more processors working at the same time, and so the possibility that the processors will all attempt to process the same value at the same time arises. Provided none of the processors updates the value, then they can share it indefinitely; but as soon as one updates the value, the others will be working on an out-of-date copy of the data.
- cache coherence protocol Various well-known protocols have been developed for maintaining cache coherency in multiprocessor systems, such as the MESI protocol, MSI protocol, MOSI protocol, and the MOESI protocol, are examples. Accordingly, such cache coherency generally refers to the integrity of data stored in local caches of the multiple processors.
- FIG. 1 shows an exemplary prior art system 100 in which multiple homogeneous processors (or cores) are implemented.
- System 100 comprises two subsystems: 1) a main memory (physical memory) subsystem 101 and 2) a processing subsystem 102 (e.g., a multi-core die).
- System 100 includes a first microprocessor core 104 A and a second microprocessor core 104 B.
- microprocessor cores 104 A and 104 B are homogeneous in that they are each implemented to have the same, fixed instruction set, such as x86. Further, in this example, cores 104 A and 104 B are implemented on a common die 102 .
- Main memory 101 is communicatively connected to processing subsystem 102 .
- Main memory 101 comprises a common physical address space that microprocessor cores 104 A and 104 B can each reference.
- a cache 103 is also implemented on die 102 .
- Cores 104 A and 104 B are each communicatively coupled to cache 103 .
- a cache generally is memory for storing a collection of data duplicating original values stored elsewhere (e.g., to main memory 101 ) or computed earlier, where the original data is expensive to fetch (due to longer access time) or to compute, compared to the cost of reading the cache.
- a cache 103 generally provides a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in cache 103 , future use can be made by accessing the cached copy rather than re-fetching the original data from main memory 101 , so that the average access time is shorter. In many systems, cache access times are approximately 50 times faster than similar accesses to main memory 101 . Cache 103 , therefore, helps expedite data access that the micro-cores 104 A and 104 B would otherwise have to fetch from main memory 101 .
- each core 104 A and 104 B will have its own cache also, commonly called the “L1” cache, and cache 103 is commonly referred to as the “L2” cache.
- cache 103 generally refers to any level of cache that may be implemented, and thus may encompass L1, L2, etc. Accordingly, while shown for ease of illustration as a single block that is accessed by both of cores 104 A and 104 B, cache 103 may include L1 cache that is implemented for each core. Again, a cache coherency protocol may be employed to maintain the integrity of data stored in local caches of the multiple processor cores 104 A/ 104 B, as is well known.
- a virtual address is an address identifying a virtual (non-physical) entity.
- virtual addresses may be utilized for accessing memory.
- Virtual memory is a mechanism that permits data that is located on a persistent storage medium (e.g., disk) to be referenced as if the data was located in physical memory.
- Translation tables maintained by the operating system, are used to determine the location of the reference data (e.g., disk or main memory).
- Program instructions being executed by a processor may refer to a virtual memory address, which is translated into a physical address.
- TLB Translation Look-aside Buffer
- Foo a virtual address that the processor translates to a physical address, such as address “123456”.
- the actual physical address which may be formatted according to a global physical memory address format, is used to access cache 103 and/or memory 101 .
- cache 103 Traditional implementations of cache 103 have proven to be extremely effective in many areas of computing because access patterns in many computer applications have locality of reference. There are several kinds of locality, including data that are accessed close together in time (temporal locality) and data that is located physically close to each other (spatial locality).
- each of cores 104 A and 104 B reference main memory 101 by providing a physical memory address.
- the physical memory address (of data or “an operand” that is desired to be retrieved) is first inputted to cache 103 . If the addressed data is not encached (i.e., not present in cache 103 ), the same physical address is presented to main memory 101 to retrieve the desired data.
- a cache block is fetched from main memory 101 and loaded into cache 103 . That is, rather than retrieving only the addressed data from main memory 101 for storage to cache 103 , a larger block of data may be retrieved for storage to cache 103 .
- a cache block typically comprises a fixed-size amount of data that is independent of the actual size of the requested data. For example, in most implementations a cache block comprises 64 bytes of data that is fetched from main memory 101 and loaded into cache 103 independent of the actual size of the operand referenced by the requesting micro-core 104 A/ 104 B.
- the physical address of the cache block referenced and loaded is a block address. This means that all the cache block data is in sequentially contiguous physical memory. Table 1 below shows an example of a cache block.
- a 64-byte block of data may be fetched from main memory 101 and loaded into cache 103 , wherein such block of data includes not only Operand 0 but also Operands 1-7.
- a core 104 A/ 104 B references one operand (e.g., a simple load)
- the memory system will bring in 4 to 8 to 16 operands into cache 103 .
- cache 103 reduces the memory access time.
- cache access times are 50 times faster than similar access to main memory 101 . For many applications, this is the memory access pattern.
- special-purpose processors that are often referred to as “accelerators” are also implemented to perform certain types of operations. For example, a processor executing a program may offload certain types of operations to an accelerator that is configured to perform those types of operations efficiently.
- Such hardware acceleration employs hardware to perform some function faster than is possible in software running on the normal (general-purpose) CPU.
- Hardware accelerators are generally designed for computationally intensive software code. Depending upon granularity, hardware acceleration can vary from a small functional unit to a large functional block like motion estimation in MPEG2. Examples of such hardware acceleration include blitting acceleration functionality in graphics processing units (GPUs) and instructions for complex operations in CPUs.
- GPUs graphics processing units
- Such accelerator processors generally have a fixed instruction set that differs from the instruction set of the general-purpose processor, and the accelerator processor's local memory does not maintain cache coherency with the general-purpose processor.
- a graphics processing unit is a well-known example of an accelerator.
- a GPU is a dedicated graphics rendering device commonly implemented for a personal computer, workstation, or game console.
- Modern GPUs are very efficient at manipulating and displaying computer graphics, and their highly parallel structure makes them more effective than typical CPUs for a range of complex algorithms.
- a GPU implements a number of graphics primitive operations in a way that makes running them much faster than drawing directly to the screen with the host CPU.
- the most common operations for early two-dimensional (2D) computer graphics include the BitBLT operation (combines several bitmap patterns using a RasterOp), usually in special hardware called a “blitter”, and operations for drawing rectangles, triangles, circles, and arcs.
- Modern GPUs also have support for three-dimensional (3D) computer graphics, and typically include digital video-related functions.
- graphics operations of a program being executed by host processors 104 A and 104 B may be passed to a GPU. While the homogeneous host processors 104 A and 104 B maintain cache coherency with each other, as discussed above with FIG. 1 , they do not maintain cache coherency with accelerator hardware of the GPU. This means that the GPU reads and writes to its local memory are NOT part of the hardware-based cache coherency mechanism used by processors 104 A and 104 B. This also means that the GPU does not share the same physical or virtual address space of processors 104 A and 104 B.
- FPGAs field-programmable gate arrays
- a field-programmable gate array (FPGA) is a well-known type of semiconductor device containing programmable logic components called “logic blocks”, and programmable interconnects.
- Logic blocks can be programmed to perform the function of basic logic gates such as AND, and XOR, or more complex combinational functions such as decoders or simple mathematical functions.
- the logic blocks also include memory elements, which may be simple flip-flops or more complete blocks of memories.
- a hierarchy of programmable interconnects allows logic blocks to be interconnected as desired by a system designer.
- Logic blocks and interconnects can be programmed by the customer/designer, after the FPGA is manufactured, to implement any logical function, hence the name “field-programmable.”
- the present invention is directed to a system and method which employ two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory for directly loading data into processor registers and/or storing data.
- the memory access techniques described herein may be employed for both loading and storing data. Thus, while much of the description provided herein is directed toward exemplary applications of fetching and loading data, it should be understood that the techniques may be likewise applied for storing data.
- the system may comprise one or more processor cores that utilize the cache-access path for accessing data.
- the system may further comprise at least one heterogeneous functional unit that is operable to utilize the direct-access path for accessing data.
- the one or more processor cores, cache, and the at least one heterogeneous functional unit may be included on a common semiconductor die (e.g., as part of an integrated circuit).
- embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions (e.g., selectively having the processor core(s) process certain instructions) while selectively employing the direct-access path for other instructions (e.g., by offloading those other instructions to the heterogeneous functional unit).
- Embodiments of the present invention provide a system in which two memory access paths are employed for accessing data by two or more processing nodes.
- a first memory access path (which may be referred to herein as a “cache-access path” or a “block-oriented access path”) is a path in which a block of data is fetched from main memory to cache.
- This cache-access path is similar to the traditional memory access described above, whereby if the desired data is present in cache, it is accessed from the cache and if the desired data is not present in the cache it is fetched from main memory and loaded into the cache.
- Such fetching may load not only the desired data into cache, but may also load some fixed block of data, commonly referred to as a “cache block” as discussed above (e.g., a 64-byte cache block).
- a second memory access path (which may be referred to herein as a “direct-access path”, “cache-bypass path”, or “address-oriented access”) enables the cache to be bypassed to retrieve data directly from main memory. In such a direct access, data of an individual physical address that is requested may be retrieved, rather than retrieving a block of data that encompasses more than what is desired.
- the main memory is implemented as non-sequential access main memory that supports random address accesses as opposed to block accesses. That is, upon requesting a given physical address, the main memory may return a corresponding operand (data) that is stored to the given physical address, rather than returning a fixed block of data residing at physical addresses.
- the main memory is implemented such that it is dependent on the requested physical address requested (i.e., is capable of returning only the individual data residing at the requested physical address).
- the main memory When being accessed directly (via the “direct-access path”), the main memory returns the data residing at a given requested physical address, rather than returning a fixed block of data that is independent (in size) of the requested physical address. Thus, rather than a block-oriented access, an address-oriented access may be performed in which only the data for the requested physical address is retrieved. Further, when being accessed via the cache-access path, the main memory is capable of returning a cache block of data. For instance, the non-sequential access main memory can be used to emulate a block reference when desired for loading to a cache, but also supports individual random address accesses without requiring a block load (e.g., when being accessed via the direct-access path).
- the same non-sequential access main memory is utilized (with the same physical memory addresses) for both the direct-access and cache-access paths.
- the non-sequential access main memory is implemented by scatter/gather DIMMs (dual in-line memory modules).
- the above-mentioned memory architecture is implemented in a system that comprises at least one processor and at least one heterogeneous functional unit.
- a semiconductor die e.g., die 102 of FIG. 1
- the semiconductor die may further comprise a heterogeneous functional unit, such as a FPGA or other type of functional unit.
- a multi-processor system is implemented; for instance, a plurality of micro-cores (e.g., cores 104 A and 104 B of FIG. 1 ) may be implemented on the semiconductor die.
- the processor(s) may utilize the cache-access path for accessing memory, while the heterogeneous functional unit is operable to utilize the direct-access path.
- certain instructions being processed for a given application may be off-loaded from the one or more processors to the heterogeneous functional unit such that the heterogeneous functional unit may take advantage of the cache-bypass path to access memory for processing those off-loaded instructions. For instance, again consider the following FORTRAN loop that may be executed for a given application:
- the cache block memory access approach is beneficial in many instances, such as when the data accesses have temporal and/or spatial locality, but such cache block memory access is inefficient in certain instances, such as in the exemplary DO loop operation above. Accordingly, by selectively employing the cache-access path for certain instructions and employing the direct-access path for other instructions, the overall system performance can be improved.
- the heterogeneous functional unit implemented comprises a different instruction set than the native instruction set of the one or more processors.
- the instruction set of the heterogeneous functional unit may be dynamically reconfigurable. As an example, in one implementation three (3) mutually-exclusive instruction sets may be pre-defined, any of which may be dynamically loaded to the heterogeneous functional unit.
- a first pre-defined instruction set might be a vector instruction set designed particularly for processing 64-bit floating point operations as are commonly encountered in computer-aided simulations
- a second pre-defined instruction set might be designed particularly for processing 32-bit floating point operations as are commonly encountered in signal and image processing applications
- a third pre-defined instruction set might be designed particularly for processing cryptography-related operations. While three illustrative pre-defined instruction sets are described above, it should be recognized that embodiments of the present invention are not limited to the exemplary instruction sets mentioned above. Rather, any number of instruction sets of any type may be pre-defined in a similar manner and may be employed on a given system in addition to or instead of one or more of the above-mentioned pre-defined instruction sets.
- the heterogeneous functional unit contains some operational instructions that are part of the native instruction set of the one or more processors (e.g., micro-cores).
- the x86 (or other) instruction set may be modified to include certain instructions that are common to both the processor(s) and the heterogeneous functional unit.
- certain operational instructions may be included in the native instruction set of the processor(s) for off-loading instructions to the heterogeneous functional unit.
- the instructions of an application being executed are decoded by the one or more processors (e.g., micro-core(s)).
- the processor fetches a native instruction (e.g., X86 instruction) that is called, as an example, “Heterogeneous Instruction 1”.
- the decode logic of the processor determines that this is an instruction to be off-loaded to the heterogeneous functional unit, and thus in response to decoding the Heterogeneous Instruction 1, the processor initiates a control sequence to the heterogeneous functional unit to communicate the instruction to the heterogeneous functional unit for processing. So, the processor (e.g., micro-core) may decode the instruction and initiate the heterogeneous functional unit via a control line.
- the heterogeneous functional unit then sends instructions to reference memory via the direct-access path.
- the heterogeneous functional unit comprises a co-processor, such as the exemplary co-processor disclosed in co-pending and commonly assigned U.S. patent application Ser. No. 11/841,406 filed Aug. 20, 2007 titled “MULTI-PROCESSOR SYSTEM HAVING AT LEAST ONE PROCESSOR THAT COMPRISES A DYNAMICALLY RECONFIGURABLE INSTRUCTION SET”, and U.S. patent application Ser. No. 11/854,432 filed Sep. 12, 2007 titled “DISPATCH MECHANISM FOR DISPATCHING INSTRUCTIONS FROM A HOST PROCESSOR TO A CO-PROCESSOR,” the disclosures of which have been incorporated herein by reference.
- a co-processor such as the exemplary co-processor disclosed in co-pending and commonly assigned U.S. patent application Ser. No. 11/841,406 filed Aug. 20, 2007 titled “MULTI-PROCESSOR SYSTEM HAVING AT LEAST ONE PROCESSOR THAT COMPRISES A
- an exemplary multi-processor system in which such dispatch mechanism may be employed is described. While an exemplary multi-processor system that comprises heterogeneous processors (i.e., having different instruction sets) is described herein, it should be recognized that embodiments of the dispatch mechanism described herein are not limited to the exemplary multi-processor system described.
- a multi-processor system that comprises at least one processor having a dynamically reconfigurable instruction set.
- at least one host processor is implemented in the system, which may comprise a fixed instruction set, such as the well-known x86 instruction set.
- At least one co-processor is implemented, which comprises dynamically reconfigurable logic that enables the co-processor's instruction set to be dynamically reconfigured.
- the at least one host processor and the at least one dynamically reconfigurable co-processor are heterogeneous processors because the dynamically reconfigurable co-processor may be configured to have a different instruction set than that of the at least one host processor.
- the co-processor may be dynamically reconfigured with an instruction set for use in optimizing performance of a given executable. For instance, in certain embodiments, one of a plurality of predefined instruction set images may be loaded onto the co-processor for use by the co-processor in processing a portion of a given executable's instruction stream.
- an executable (e.g., an a.out file or a.exe file, etc.) may include (e.g., in its header) an identification of an instruction set with which the co-processor is to be configured for use in processing a portion of the executable's instruction stream. Accordingly, when the executable is initiated, the system's operating system (OS) may determine whether the co-processor possesses the instruction set identified for the executable. If determined that the co-processor does not possess the identified instruction set, the OS causes the co-processor to be reconfigured to possess such identified instruction set.
- OS operating system
- a portion of the instructions of the executable may be off-loaded for processing by the co-processor according to its instruction set, while a portion of the executable's instructions may be processed by the at least one host processor.
- a single executable may have instructions that are processed by different, heterogeneous processors that possess different instruction sets.
- the co-processor's instructions are decoded as if they were defined with the host processor's instruction set (e.g., x86's ISA). In essence, to a compiler, it appears that the host processor's instruction set (e.g., the x86 ISA) has been extended.
- FIG. 1 shows a block diagram of an exemplary system architecture of the prior art
- FIG. 2 shows a block diagram of an exemplary system architecture of an embodiment of the present invention.
- FIGS. 3A-3B show an exemplary operational flow diagram according to one embodiment of the present invention.
- FIG. 2 shows a block diagram of a system 200 according to one embodiment of the present invention.
- System 200 comprises two subsystems: 1) main memory (physical memory) subsystem 201 and processor subsystem (semiconductor die) 208 .
- the combination of subsystems 201 and 208 permit programs to be executed, i.e. instructions are executed in processor subsystem 208 to process data stored in main memory subsystem 201 .
- processor subsystem 208 comprises one or more processor cores (two processor cores, 202 A and 202 B, in the illustrated example), cache 203 , and a heterogeneous functional unit 204 . In the illustrated example, all elements of processor subsystem 208 are implemented on a common die.
- System 200 employs two memory access paths: 1) a cache-access path in which block data is stored/loaded to/from main memory 201 to/from cache 203 , and 2) a direct-access path in which individually-addressed data is stored/loaded to/from main memory 201 (e.g., along path 206 in system 200 ).
- system 200 employs a cache-access path in which block data may be stored to main memory 201 and in which block data may be loaded from main memory 201 to cache 203 .
- system 200 employs a direct-access path in which individually-addressed data, rather than a fixed-size block of data, may be stored to main memory 201 and in which individually-addressed data may be loaded from main memory 201 (e.g., along path 206 in system 200 ) to a processor register (e.g., of heterogeneous functional unit 204 ).
- a processor register e.g., of heterogeneous functional unit 204
- System 200 comprises two processor cores, 202 A and 202 B, that utilize the cache-access path for accessing data from main memory 201 .
- System 200 further comprises at least one heterogeneous functional unit 204 that is operable to utilize the direct-access path for accessing data from main memory 201 .
- embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions (e.g., selectively having the processor core(s) 202 A/ 202 B process certain instructions) while selectively employing the direct-access path for other instructions (e.g., by offloading those other instructions to the heterogeneous functional unit 204 ).
- Embodiments of the present invention provide a system in which two memory access paths are employed for accessing data by two or more processing nodes.
- a first memory access path (which may be referred to herein as a “cache-access path” or a “block-oriented access path”) is a path in which a block of data is fetched from main memory 201 to cache 203 .
- This cache-access path is similar to the traditional memory access described above with FIG. 1 , whereby the processor core decodes an instruction and determines a physical address 210 of desired data.
- the desired data i.e., at the referenced physical address
- main memory 201 main memory 201
- main memory 201 main memory 201
- cache block some fixed block of data, commonly referred to as a “cache block” as discussed above (e.g., a 64-byte cache block such as that discussed with Table 1).
- a second memory access path (which may be referred to herein as a “direct-access path”, “cache-bypass path”, or “address-oriented access”) enables cache 203 to be bypassed to retrieve data directly from main memory 201 .
- direct-access path data of an individual physical address that is requested may be retrieved from main memory 201 , rather than retrieving a fixed-size block of data that encompasses more than what is desired.
- the main memory is implemented as non-sequential access main memory that supports random address accesses as opposed to block accesses. That is, upon requesting a given physical address, the main memory may return a corresponding operand (data) that is stored to the given physical address, rather than returning a fixed block of data residing at physical addresses. In other words, rather than returning a fixed block of data (e.g., a 64-byte block of data) independent of the requested physical address, the main memory is implemented such that it is dependent on the requested physical address requested (i.e., is capable of returning only the individual data residing at the requested physical address).
- a fixed block of data e.g., a 64-byte block of data
- processor cores 202 A and 202 B are operable to access data in a manner similar to that of traditional processor architectures (e.g., that described above with FIG. 1 ). That is, processor cores 202 A and 202 B are operable to access data via the cache-access path, in which a fixed-size block of data is fetched from main memory 201 for loading into cache 203 , such as described above with exemplary Table 1.
- processor cores 202 A and 202 B are operable to off-load (e.g., via control line 209 ) certain instructions for processing by heterogeneous functional unit 204 , which is operable to access data via the direct-access path 206 .
- main memory 201 When being accessed directly (via the “direct-access path” 206 ), main memory 201 returns the data residing at a given requested physical address, rather than returning a fixed-size block of data that is independent (in size) of the requested physical address. Thus, rather than a block-oriented access, an address-oriented access may be performed in which only the data for the requested physical address is retrieved. Further, when being accessed via the cache-access path, main memory 201 is capable of returning a cache block of data.
- the non-sequential access main memory 201 can be used to emulate a block reference when desired for loading a cache block of data to cache 203 , but also supports individual random address accesses without requiring a block load (e.g., when being accessed via the direct-access path 206 ).
- the same non-sequential access main memory 201 is utilized (with the same physical memory addresses) for both the cache-access path (e.g., utilized for data accesses by processor cores 202 A and 202 B in this example) and the direct-access path (e.g., utilized for data access by heterogeneous functional unit 204 ).
- non-sequential access main memory 201 is implemented by scatter/gather DIMMs (dual in-line memory modules) 21 .
- main memory subsystem 201 supports non-sequential memory references.
- main memory subsystem 201 has the following characteristics:
- Interleaving means that each operand resides in its individually controlled memory location.
- the memory reference pattern is sequential, e.g., physical address reference pattern: Address1, Address2, Address3, Address8 (assuming a cache block of 8 operands or 8 words).
- the memory system can support full bandwidth random physical addresses and can also support full bandwidth sequential addresses.
- a mechanism is further provided in certain embodiments to determine whether a memory reference is directed to the cache 203 , or directly to main memory 201 .
- a heterogeneous functional unit 204 provides such a mechanism.
- FIGS. 3A-3B show an exemplary operational flow diagram for processing instructions of a program being executed by processor subsystem 208 (of FIG. 2 ) according to one embodiment of the present invention.
- an executable file is provided that includes a first portion of instructions to be processed by a first instruction set (such as a first instruction set of a first processor in a multi-processor system) and a second portion of instructions to be processed by a second instruction set (such as a second instruction set of a second processor in a multi-processor system).
- a first instruction set such as a first instruction set of a first processor in a multi-processor system
- a second instruction set such as a second instruction set of a second processor in a multi-processor system
- operation of system 200 works as follows: a processor core 202 A/ 202 B fetches referenced an instruction (e.g., referenced by a program counter (PC)) of the program being executed in operational block 31 .
- the processor core 202 A/ 202 B decodes the instruction and determines a physical address 210 at which the desired data resides.
- the processor core determines whether the instruction is to be executed in its entirety by the processor core 202 A/ 202 B or whether it is to be executed by heterogeneous functional unit 204 .
- the instruction i.e., the instruction set architecture
- it is a priori determined if the instruction is executed by processor core 202 A/ 202 B or heterogeneous functional unit 204 . If determined in block 33 that the instruction is to be executed by the processor core 202 A/ 202 B, operation advances to block 34 where the processor core 202 A/ 202 B accesses data (by referencing its physical address 210 ) for processing the instruction via a cache-access path. If, on the other hand, it is determined in block 33 that the instruction is to be executed by the heterogeneous functional unit 204 , operation advances to block 35 (of FIG.
- the processor core 202 A/ 202 B communicates the instruction to the heterogeneous functional unit 204 , and then in block 36 the heterogeneous functions unit accesses data for processing the instruction via the direct-access path.
- the cache-access path 34 and the direct-access path 36 Exemplary operations that may be performed in each of the cache-access path 34 and the direct-access path 36 in certain embodiments are described further below.
- the determination in block 33 may be made based, at least in part, on the instruction that is fetched.
- the heterogeneous functional unit 204 contains some operational instructions (in its instruction set) that are part of the native instruction set of the processor cores 202 A/ 202 B.
- the x86 (or other) instruction set may be modified to include certain instructions that are common to both the processor core(s) and the heterogeneous functional unit.
- certain operational instructions may be included in the native instruction set of the processor core(s) for off-loading instructions to the heterogeneous functional unit.
- the instructions of an application being executed are decoded by the processor core(s) 202 A/ 202 B, wherein the processor core may fetch (in operational block 31 ) a native instruction (e.g., X86 instruction) that is called, as an example, “Heterogeneous Instruction 1”.
- the decode logic of the processor core decodes the instruction in block 32 and determines in block 33 that this is an instruction to be off-loaded to the heterogeneous functional unit 204 , and thus in response to decoding the Heterogeneous Instruction 1, the processor core initiates a control sequence (via control line 209 ) to the heterogeneous functional unit 204 to communicate (in operational block 35 ) the instruction to the heterogeneous functional unit 204 for processing.
- the cache-path access 34 includes the processor core 202 A/ 202 B querying, in block 301 , the cache 203 for the physical address to determine if the referenced data (e.g., operand) is encached.
- the processor core 202 A/ 202 B determines whether the referenced data is encached in cache 203 . If it is encached, then operation advances to block 304 where the processor core 202 A/ 202 B retrieves the referenced data from cache 203 .
- operation advances to block 303 where a cache block fetch from main memory 201 is performed to load a fixed-size block of data, including the referenced data, into cache 203 , and then operation advances to block 304 where the processor core retrieves the fetched data from cache 203 .
- the direct-access path 36 includes the heterogeneous functional unit 204 interrogating (via path 205 of FIG. 2 ), in block 305 , cache 203 to determine whether the referenced data has been previously encached. For instance, all memory references by heterogeneous functional unit 204 may use address path (bus) 205 of FIG. 2 to reference physical main memory 201 . Data is loaded or stored via bus 206 of FIG. 2 . Control path 209 of FIG. 2 is used to initiate control and pass data from processor core 202 A/ 202 B to heterogeneous functional unit 204 .
- heterogeneous functional unit 204 determines whether the referenced data has been previously encached in cache 203 . If it has not, operation advances to block 310 where the heterogeneous functional unit 204 retrieves the referenced data of the individually-referenced physical address (e.g., physical address 210 and 207 of FIG. 2 ) from main memory 201 . That is, the referenced data is received, via path 206 , from the individual-referenced physical address of main memory, rather than receiving a fixed-size block of data (such as a cache block), as is returned from main memory 201 in the cache-path access 34 .
- the referenced data of the individually-referenced physical address e.g., physical address 210 and 207 of FIG. 2
- the cache is a write-back caching technique or a write-through caching technique, each of which are well-known caching techniques in the art and are thus not described further herein. If a write-back caching technique is
- the request may be completed from the cache 203 , rather than requiring the entire data block to be written back to main memory 201 (as in block 308 ) and then referencing the single operand from main memory 201 (as in block 310 ).
- the memory access request (e.g., store or load) may be satisfied by cache 203 for the heterogeneous functional unit 204 , and if a miss occurs for cache 203 , then the referenced data of the individually-referenced physical address (e.g., physical address 210 and 207 of FIG. 2 ) may be accessed in main memory 201 , as discussed above (e.g., as in block 310 ).
- certain embodiments permit memory access of cache 203 by heterogeneous functional unit 204 (rather than bypassing the cache 203 ) when the memory access request can be satisfied by cache 203 , but when the memory access request cannot be satisfied by cache 203 (i.e., a miss occurs), then an individually-referenced physical address (rather than a block-oriented access) is made of main memory 201 .
- main memory e.g., 101 of FIG. 1
- Block-oriented means that even if one 64-bit word is referenced, 8 to 16 words ARE ALWAYS fetched and loaded into the microprocessor's cache (e.g., cache 103 of FIG. 1 ). As discussed above, this fixed-size block of 8 to 16 words are called the “cache block”. For many applications, only one word of the 8 to 16 words of the cache block that are fetched is used. Consequently, a large amount (e.g., 87%) of the memory bandwidth is wasted (not used). This results in reduced application performance.
- main memory 201 of system 200 comprises a memory dimm that is formed utilizing standard memory DRAMs, that provides full bandwidth memory accesses for non-sequential memory addresses.
- the memory reference pattern is: 1, 20, 33, 55; then only memory words, 1, 20, 33, and 55 are fetched and stored. In fact, they are fetched and stored at the maximum rate permitted by the DRAMs.
Abstract
The present invention is directed to a system and method which employ two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory. The system may comprise one or more processor cores that utilize the cache-access path for accessing data. The system may further comprise at least one heterogeneous functional unit that is operable to utilize the direct-access path for accessing data. In certain embodiments, the one or more processor cores, cache, and the at least one heterogeneous functional unit may be included on a common semiconductor die (e.g., as part of an integrated circuit). Embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions while selectively employing the direct-access path for other instructions.
Description
- The present application is a continuation of U.S. patent application Ser. No. 15/596,649 filed May 16, 2017 and entitled “MICROPROCESSOR ARCHITECTURE HAVING ALTERNATIVE MEMORY ACCESS PATHS,” which is a continuation of U.S. patent application Ser. No. 11/969,792 filed Jan. 4, 2008 and entitled “MICROPROCESSOR ARCHITECTURE HAVING ALTERNATIVE MEMORY ACCESS PATHS,” which issued Jul. 18, 2017 as U.S. Pat. No. 9,710,384, the disclosures of which are incorporated herein by reference in their entirety. The present application is also related to the U.S. patent application Ser. No. 11/841,406 filed Aug. 20, 2007 and entitled “MULTI-PROCESSOR SYSTEM HAVING AT LEAST ONE PROCESSOR THAT COMPRISES A DYNAMICALLY RECONFIGURABLE INSTRUCTION SET,” which issued Apr. 10, 2012 as U.S. Pat. No. 8,156,307, U.S. patent application Ser. No. 11/854,432 filed Sep. 12, 2007 and entitled “DISPATCH MECHANISM FOR DISPATCHING INSTRUCTIONS FROM A HOST PROCESSOR TO A CO-PROCESSOR,” which issued Feb. 21, 2012 as U.S. Pat. No. 8,122,229, and U.S. patent application Ser. No. 11/847,169 filed Aug. 29, 2007 and entitled “COMPILER FOR GENERATING AN EXECUTABLE COMPRISING INSTRUCTIONS FOR A PLURALITY OF DIFFERENT INSTRUCTION SETS,” which issued Oct. 15, 2013 as U.S. Pat. No. 8,561,037, the disclosures of which are incorporated herein by reference in their entirety.
- The following description relates generally to multi-processor systems, and more particularly to a system having two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory for directly loading data into processor registers and/or storing data.
- The popularity of computing systems continues to grow and the demand for improved processing architectures thus likewise continues to grow. Ever-increasing desires for improved computing performance/efficiency has led to various improved processor architectures. For example, multi-core processors are becoming more prevalent in the computing industry and are being used in various computing devices, such as servers, personal computers (PCs), laptop computers, personal digital assistants (PDAs), wireless telephones, and so on.
- In the past, processors such as CPUs (central processing units) featured a single execution unit to process instructions of a program. More recently, computer systems are being developed with multiple processors in an attempt to improve the computing performance of the system. In some instances, multiple independent processors may be implemented in a system. In other instances, a multi-core architecture may be employed, in which multiple processor cores are amassed on a single integrated silicon die. Each of the multiple processors (e.g., processor cores) can simultaneously execute program instructions. This parallel operation of the multiple processors can improve performance of a variety of applications.
- A multi-core CPU combines two or more independent cores into a single package comprised of a single piece silicon integrated circuit (IC), called a die. In some instances, a multi-core CPU may comprise two or more dies packaged together. A dual-core device contains two independent microprocessors and a quad-core device contains four microprocessors. Cores in a multi-core device may share a single coherent cache at the highest on-device cache level (e.g., L2 for the Intel® Core 2) or may have separate caches (e.g. current AMD® dual-core processors). The processors also share the same interconnect to the rest of the system. Each “core” may independently implement optimizations such as superscalar execution, pipelining, and multithreading. A system with N cores is typically most effective when it is presented with N or more threads concurrently.
- One processor architecture that has been developed utilizes multiple processors (e.g., multiple cores), which are homogeneous in that they are all implemented with the same fixed instruction sets (e.g., Intel's x86 instruction set, AMD's Opteron instruction set, etc.). Further, the homogeneous processors may employ a cache memory coherency protocol, as discussed further below.
- In general, an instruction set refers to a list of all instructions, and all their variations, that a processor can execute. Such instructions may include, as examples, arithmetic instructions, such as ADD and SUBTRACT; logic instructions, such as AND, OR, and NOT; data instructions, such as MOVE, INPUT, OUTPUT, LOAD, and STORE; and control flow instructions, such as GOTO, if X then GOTO, CALL, and RETURN. Examples of well-known instruction sets include x86 (also known as IA-32), x86-64 (also known as AMD64 and Intel® 64), AMD's Opteron, VAX (Digital Equipment Corporation), IA-64 (Itanium), and PA-RISC (HP Precision Architecture).
- Generally, the instruction set architecture is distinguished from the microarchitecture, which is the set of processor design techniques used to implement the instruction set. Computers with different microarchitectures can share a common instruction set. For example, the Intel® Pentium and the AMD® Athlon implement nearly identical versions of the x86 instruction set, but have radically different internal microarchitecture designs. In all these cases the instruction set (e.g., x86) is fixed by the manufacturer and directly hardware implemented, in a semiconductor technology, by the microarchitecture. Consequently, the instruction set is fixed for the lifetime of this implementation.
- Cache memory coherency is an issue that affects the design of computer systems in which two or more processors share a common area of memory. In general, processors often perform work by reading data from persistent storage (e.g., disk) into memory, performing some operation on that data, and then storing the result back to persistent storage. In a uniprocessor system, there is only one processor doing all the work, and therefore only one processor that can read or write the data values. Moreover a simple uniprocessor can only perform one operation at a time, and thus when a value in storage is changed, all subsequent read operations will see the updated value. However, in multiprocessor systems (e.g., multi-core architectures) there are two or more processors working at the same time, and so the possibility that the processors will all attempt to process the same value at the same time arises. Provided none of the processors updates the value, then they can share it indefinitely; but as soon as one updates the value, the others will be working on an out-of-date copy of the data. Accordingly, in such multiprocessor systems a scheme is generally required to notify all processors of changes to shared values, and such a scheme that is employed is commonly referred to as a “cache coherence protocol.” Various well-known protocols have been developed for maintaining cache coherency in multiprocessor systems, such as the MESI protocol, MSI protocol, MOSI protocol, and the MOESI protocol, are examples. Accordingly, such cache coherency generally refers to the integrity of data stored in local caches of the multiple processors.
-
FIG. 1 shows an exemplaryprior art system 100 in which multiple homogeneous processors (or cores) are implemented.System 100 comprises two subsystems: 1) a main memory (physical memory)subsystem 101 and 2) a processing subsystem 102 (e.g., a multi-core die).System 100 includes afirst microprocessor core 104A and asecond microprocessor core 104B. In this example,microprocessor cores cores common die 102.Main memory 101 is communicatively connected toprocessing subsystem 102.Main memory 101 comprises a common physical address space thatmicroprocessor cores - As shown further shown, a
cache 103 is also implemented ondie 102.Cores cache 103. As is well known, a cache generally is memory for storing a collection of data duplicating original values stored elsewhere (e.g., to main memory 101) or computed earlier, where the original data is expensive to fetch (due to longer access time) or to compute, compared to the cost of reading the cache. In other words, acache 103 generally provides a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored incache 103, future use can be made by accessing the cached copy rather than re-fetching the original data frommain memory 101, so that the average access time is shorter. In many systems, cache access times are approximately 50 times faster than similar accesses tomain memory 101.Cache 103, therefore, helps expedite data access that the micro-cores 104A and 104B would otherwise have to fetch frommain memory 101. - In many system architectures, each
core cache 103 is commonly referred to as the “L2” cache. Unless expressly stated herein,cache 103 generally refers to any level of cache that may be implemented, and thus may encompass L1, L2, etc. Accordingly, while shown for ease of illustration as a single block that is accessed by both ofcores cache 103 may include L1 cache that is implemented for each core. Again, a cache coherency protocol may be employed to maintain the integrity of data stored in local caches of themultiple processor cores 104A/104B, as is well known. - In many architectures, virtual addresses are utilized. In general, a virtual address is an address identifying a virtual (non-physical) entity. As is well-known in the art, virtual addresses may be utilized for accessing memory. Virtual memory is a mechanism that permits data that is located on a persistent storage medium (e.g., disk) to be referenced as if the data was located in physical memory. Translation tables, maintained by the operating system, are used to determine the location of the reference data (e.g., disk or main memory). Program instructions being executed by a processor may refer to a virtual memory address, which is translated into a physical address. To minimize the performance penalty of address translation, most modern CPUs include an on-chip Memory Management Unit (MMU), and maintain a table of recently used virtual-to-physical translations, called a Translation Look-aside Buffer (TLB). Addresses with entries in the TLB require no additional memory references (and therefore time) to translate. However, the TLB can only maintain a fixed number of mappings between virtual and physical addresses; when the needed translation is not resident in the TLB, action will have to be taken to load it in.
- As an example, suppose a program's instruction stream that is being executed by a processor, say
processor core 104A ofFIG. 1 , desires to load data from an address “Foo” into a first general-purpose register, GPR1. Such instruction may appear similar to “LD<Foo>, GRP1”. Foo, in this example, is a virtual address that the processor translates to a physical address, such as address “123456”. Thus, the actual physical address, which may be formatted according to a global physical memory address format, is used to accesscache 103 and/ormemory 101. - Traditional implementations of
cache 103 have proven to be extremely effective in many areas of computing because access patterns in many computer applications have locality of reference. There are several kinds of locality, including data that are accessed close together in time (temporal locality) and data that is located physically close to each other (spatial locality). - In operation, each of
cores main memory 101 by providing a physical memory address. The physical memory address (of data or “an operand” that is desired to be retrieved) is first inputted tocache 103. If the addressed data is not encached (i.e., not present in cache 103), the same physical address is presented tomain memory 101 to retrieve the desired data. - In contemporary architectures, a cache block is fetched from
main memory 101 and loaded intocache 103. That is, rather than retrieving only the addressed data frommain memory 101 for storage tocache 103, a larger block of data may be retrieved for storage tocache 103. A cache block typically comprises a fixed-size amount of data that is independent of the actual size of the requested data. For example, in most implementations a cache block comprises 64 bytes of data that is fetched frommain memory 101 and loaded intocache 103 independent of the actual size of the operand referenced by the requesting micro-core 104A/104B. Furthermore, the physical address of the cache block referenced and loaded is a block address. This means that all the cache block data is in sequentially contiguous physical memory. Table 1 below shows an example of a cache block. -
TABLE 1 Physical Address Operand X, Y, Z (7) Operand 7 X, Y, Z (6) Operand 6 . . . . . . X, Y, Z (1) Operand 1 X, Y, Z (0) Operand 0 - In the example of table 1, in response to a micro-core 104A/104B requesting Operand 0 via its corresponding physical address X,Y,Z (0), a 64-byte block of data may be fetched from
main memory 101 and loaded intocache 103, wherein such block of data includes not only Operand 0 but also Operands 1-7. Thus, depending on the fixed size of the cache block employed on a given system, whenever acore 104A/104B references one operand (e.g., a simple load), the memory system will bring in 4 to 8 to 16 operands intocache 103. - There are both advantages and disadvantages of this traditional approach. One advantage is that if there is temporal (over time) and spatial (data locality) references to operands (e.g., operands 0-7 in the example of Table 1), then
cache 103 reduces the memory access time. Typically, cache access times (and data bandwidth) are 50 times faster than similar access tomain memory 101. For many applications, this is the memory access pattern. - However, if the memory access pattern of an application is not sequential and/or does not re-use data, inefficiencies arise which result in decreased performance. Consider the following FORTRAN loop that may be executed for a given application:
-
- DO 1=1, N, 4
-
A(i)=B(i)+C(i) -
- END DO
In this loop, every fourth element is used. If a cache block maintains 8 operands, then only 2 of the 8 operands are used. Thus, 6/8 of the data loaded intocache 103 and 6/8 of the memory bandwidth is “wasted” in this example.
- END DO
- In some architectures, special-purpose processors that are often referred to as “accelerators” are also implemented to perform certain types of operations. For example, a processor executing a program may offload certain types of operations to an accelerator that is configured to perform those types of operations efficiently. Such hardware acceleration employs hardware to perform some function faster than is possible in software running on the normal (general-purpose) CPU. Hardware accelerators are generally designed for computationally intensive software code. Depending upon granularity, hardware acceleration can vary from a small functional unit to a large functional block like motion estimation in MPEG2. Examples of such hardware acceleration include blitting acceleration functionality in graphics processing units (GPUs) and instructions for complex operations in CPUs. Such accelerator processors generally have a fixed instruction set that differs from the instruction set of the general-purpose processor, and the accelerator processor's local memory does not maintain cache coherency with the general-purpose processor.
- A graphics processing unit (GPU) is a well-known example of an accelerator. A GPU is a dedicated graphics rendering device commonly implemented for a personal computer, workstation, or game console. Modern GPUs are very efficient at manipulating and displaying computer graphics, and their highly parallel structure makes them more effective than typical CPUs for a range of complex algorithms. A GPU implements a number of graphics primitive operations in a way that makes running them much faster than drawing directly to the screen with the host CPU. The most common operations for early two-dimensional (2D) computer graphics include the BitBLT operation (combines several bitmap patterns using a RasterOp), usually in special hardware called a “blitter”, and operations for drawing rectangles, triangles, circles, and arcs. Modern GPUs also have support for three-dimensional (3D) computer graphics, and typically include digital video-related functions.
- Thus, for instance, graphics operations of a program being executed by
host processors homogeneous host processors FIG. 1 , they do not maintain cache coherency with accelerator hardware of the GPU. This means that the GPU reads and writes to its local memory are NOT part of the hardware-based cache coherency mechanism used byprocessors processors - Additionally, various devices are known that are reconfigurable. Examples of such reconfigurable devices include field-programmable gate arrays (FPGAs). A field-programmable gate array (FPGA) is a well-known type of semiconductor device containing programmable logic components called “logic blocks”, and programmable interconnects. Logic blocks can be programmed to perform the function of basic logic gates such as AND, and XOR, or more complex combinational functions such as decoders or simple mathematical functions. In most FPGAs, the logic blocks also include memory elements, which may be simple flip-flops or more complete blocks of memories. A hierarchy of programmable interconnects allows logic blocks to be interconnected as desired by a system designer. Logic blocks and interconnects can be programmed by the customer/designer, after the FPGA is manufactured, to implement any logical function, hence the name “field-programmable.”
- The present invention is directed to a system and method which employ two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory for directly loading data into processor registers and/or storing data. The memory access techniques described herein may be employed for both loading and storing data. Thus, while much of the description provided herein is directed toward exemplary applications of fetching and loading data, it should be understood that the techniques may be likewise applied for storing data. The system may comprise one or more processor cores that utilize the cache-access path for accessing data. The system may further comprise at least one heterogeneous functional unit that is operable to utilize the direct-access path for accessing data. In certain embodiments, the one or more processor cores, cache, and the at least one heterogeneous functional unit may be included on a common semiconductor die (e.g., as part of an integrated circuit). As described further herein, embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions (e.g., selectively having the processor core(s) process certain instructions) while selectively employing the direct-access path for other instructions (e.g., by offloading those other instructions to the heterogeneous functional unit).
- Embodiments of the present invention provide a system in which two memory access paths are employed for accessing data by two or more processing nodes. A first memory access path (which may be referred to herein as a “cache-access path” or a “block-oriented access path”) is a path in which a block of data is fetched from main memory to cache. This cache-access path is similar to the traditional memory access described above, whereby if the desired data is present in cache, it is accessed from the cache and if the desired data is not present in the cache it is fetched from main memory and loaded into the cache. Such fetching may load not only the desired data into cache, but may also load some fixed block of data, commonly referred to as a “cache block” as discussed above (e.g., a 64-byte cache block). A second memory access path (which may be referred to herein as a “direct-access path”, “cache-bypass path”, or “address-oriented access”) enables the cache to be bypassed to retrieve data directly from main memory. In such a direct access, data of an individual physical address that is requested may be retrieved, rather than retrieving a block of data that encompasses more than what is desired.
- According to certain embodiments of the present invention the main memory is implemented as non-sequential access main memory that supports random address accesses as opposed to block accesses. That is, upon requesting a given physical address, the main memory may return a corresponding operand (data) that is stored to the given physical address, rather than returning a fixed block of data residing at physical addresses. In other words, rather than returning a fixed block of data (e.g., a 64-byte block of data as described in Table 1 above) independent of the requested physical address, the main memory is implemented such that it is dependent on the requested physical address requested (i.e., is capable of returning only the individual data residing at the requested physical address).
- When being accessed directly (via the “direct-access path”), the main memory returns the data residing at a given requested physical address, rather than returning a fixed block of data that is independent (in size) of the requested physical address. Thus, rather than a block-oriented access, an address-oriented access may be performed in which only the data for the requested physical address is retrieved. Further, when being accessed via the cache-access path, the main memory is capable of returning a cache block of data. For instance, the non-sequential access main memory can be used to emulate a block reference when desired for loading to a cache, but also supports individual random address accesses without requiring a block load (e.g., when being accessed via the direct-access path). Thus, the same non-sequential access main memory is utilized (with the same physical memory addresses) for both the direct-access and cache-access paths. According to one embodiment, the non-sequential access main memory is implemented by scatter/gather DIMMs (dual in-line memory modules).
- According to certain embodiments, the above-mentioned memory architecture is implemented in a system that comprises at least one processor and at least one heterogeneous functional unit. As an example, a semiconductor die (e.g., die 102 of
FIG. 1 ) may comprise one or more processors, such as micro-cores 104A and 104B ofFIG. 1 , and the semiconductor die may further comprise a heterogeneous functional unit, such as a FPGA or other type of functional unit. In certain embodiments a multi-processor system is implemented; for instance, a plurality of micro-cores (e.g.,cores FIG. 1 ) may be implemented on the semiconductor die. - The processor(s) may utilize the cache-access path for accessing memory, while the heterogeneous functional unit is operable to utilize the direct-access path. Thus, certain instructions being processed for a given application may be off-loaded from the one or more processors to the heterogeneous functional unit such that the heterogeneous functional unit may take advantage of the cache-bypass path to access memory for processing those off-loaded instructions. For instance, again consider the following FORTRAN loop that may be executed for a given application:
-
- DO I=1, N, 4
-
A(i)=B(i)+C(i) -
- END DO
In this loop, every fourth element (or physical memory address) is used, loaded or stored. As discussed above, if a cache-access path is utilized in which a cache block of 8 operands is retrieved for each access of main memory, then only 2 of the 8 operands are used, and 6/8 of the data loaded into the cache and 6/8 of the memory bandwidth is “wasted” in this example. In certain embodiments of the present invention, such DO loop operation may be off-loaded to the heterogeneous functional unit, which may retrieve the individual data elements desired to be accessed directly from the non-sequential access main memory.
- END DO
- As mentioned above, the cache block memory access approach is beneficial in many instances, such as when the data accesses have temporal and/or spatial locality, but such cache block memory access is inefficient in certain instances, such as in the exemplary DO loop operation above. Accordingly, by selectively employing the cache-access path for certain instructions and employing the direct-access path for other instructions, the overall system performance can be improved. That is, by off-loading certain instructions to a heterogeneous functional unit that is operable to bypass cache and access individual data (e.g., random, non-sequential addresses) from main memory, rather than requiring fetching of fixed block size of data from main memory, while permitting the cache block memory access to be utilized by the one or more processors (and thus gain the benefits of the cache for those instructions that have temporal and/or spatial locality), the system performance can be improved.
- In certain embodiments, the heterogeneous functional unit implemented comprises a different instruction set than the native instruction set of the one or more processors. Further, in certain embodiments, the instruction set of the heterogeneous functional unit may be dynamically reconfigurable. As an example, in one implementation three (3) mutually-exclusive instruction sets may be pre-defined, any of which may be dynamically loaded to the heterogeneous functional unit. As an illustrative example, a first pre-defined instruction set might be a vector instruction set designed particularly for processing 64-bit floating point operations as are commonly encountered in computer-aided simulations, a second pre-defined instruction set might be designed particularly for processing 32-bit floating point operations as are commonly encountered in signal and image processing applications, and a third pre-defined instruction set might be designed particularly for processing cryptography-related operations. While three illustrative pre-defined instruction sets are described above, it should be recognized that embodiments of the present invention are not limited to the exemplary instruction sets mentioned above. Rather, any number of instruction sets of any type may be pre-defined in a similar manner and may be employed on a given system in addition to or instead of one or more of the above-mentioned pre-defined instruction sets.
- Further, in certain embodiments the heterogeneous functional unit contains some operational instructions that are part of the native instruction set of the one or more processors (e.g., micro-cores). For instance, in certain embodiments, the x86 (or other) instruction set may be modified to include certain instructions that are common to both the processor(s) and the heterogeneous functional unit. For instance, certain operational instructions may be included in the native instruction set of the processor(s) for off-loading instructions to the heterogeneous functional unit.
- For example, in one embodiment, the instructions of an application being executed are decoded by the one or more processors (e.g., micro-core(s)). Suppose that the processor fetches a native instruction (e.g., X86 instruction) that is called, as an example, “
Heterogeneous Instruction 1”. The decode logic of the processor determines that this is an instruction to be off-loaded to the heterogeneous functional unit, and thus in response to decoding theHeterogeneous Instruction 1, the processor initiates a control sequence to the heterogeneous functional unit to communicate the instruction to the heterogeneous functional unit for processing. So, the processor (e.g., micro-core) may decode the instruction and initiate the heterogeneous functional unit via a control line. The heterogeneous functional unit then sends instructions to reference memory via the direct-access path. - In certain embodiments, the heterogeneous functional unit comprises a co-processor, such as the exemplary co-processor disclosed in co-pending and commonly assigned U.S. patent application Ser. No. 11/841,406 filed Aug. 20, 2007 titled “MULTI-PROCESSOR SYSTEM HAVING AT LEAST ONE PROCESSOR THAT COMPRISES A DYNAMICALLY RECONFIGURABLE INSTRUCTION SET”, and U.S. patent application Ser. No. 11/854,432 filed Sep. 12, 2007 titled “DISPATCH MECHANISM FOR DISPATCHING INSTRUCTIONS FROM A HOST PROCESSOR TO A CO-PROCESSOR,” the disclosures of which have been incorporated herein by reference.
- According to certain embodiments, an exemplary multi-processor system in which such dispatch mechanism may be employed is described. While an exemplary multi-processor system that comprises heterogeneous processors (i.e., having different instruction sets) is described herein, it should be recognized that embodiments of the dispatch mechanism described herein are not limited to the exemplary multi-processor system described. As one example, according to certain embodiments, a multi-processor system that comprises at least one processor having a dynamically reconfigurable instruction set. According to certain embodiments, at least one host processor is implemented in the system, which may comprise a fixed instruction set, such as the well-known x86 instruction set. Additionally, at least one co-processor is implemented, which comprises dynamically reconfigurable logic that enables the co-processor's instruction set to be dynamically reconfigured. In this manner, the at least one host processor and the at least one dynamically reconfigurable co-processor are heterogeneous processors because the dynamically reconfigurable co-processor may be configured to have a different instruction set than that of the at least one host processor. According to certain embodiments, the co-processor may be dynamically reconfigured with an instruction set for use in optimizing performance of a given executable. For instance, in certain embodiments, one of a plurality of predefined instruction set images may be loaded onto the co-processor for use by the co-processor in processing a portion of a given executable's instruction stream.
- In certain embodiments, an executable (e.g., an a.out file or a.exe file, etc.) may include (e.g., in its header) an identification of an instruction set with which the co-processor is to be configured for use in processing a portion of the executable's instruction stream. Accordingly, when the executable is initiated, the system's operating system (OS) may determine whether the co-processor possesses the instruction set identified for the executable. If determined that the co-processor does not possess the identified instruction set, the OS causes the co-processor to be reconfigured to possess such identified instruction set. Then, a portion of the instructions of the executable may be off-loaded for processing by the co-processor according to its instruction set, while a portion of the executable's instructions may be processed by the at least one host processor. Accordingly, in certain embodiments, a single executable may have instructions that are processed by different, heterogeneous processors that possess different instruction sets. As described further herein, according to certain embodiments, the co-processor's instructions are decoded as if they were defined with the host processor's instruction set (e.g., x86's ISA). In essence, to a compiler, it appears that the host processor's instruction set (e.g., the x86 ISA) has been extended.
- The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims. The novel features which are believed to be characteristic of the invention, both as to its organization and method of operation, together with further objects and advantages will be better understood from the following description when considered in connection with the accompanying figures. It is to be expressly understood, however, that each of the figures is provided for the purpose of illustration and description only and is not intended as a definition of the limits of the present invention.
- For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawing, in which:
-
FIG. 1 shows a block diagram of an exemplary system architecture of the prior art; -
FIG. 2 shows a block diagram of an exemplary system architecture of an embodiment of the present invention; and -
FIGS. 3A-3B show an exemplary operational flow diagram according to one embodiment of the present invention. -
FIG. 2 shows a block diagram of asystem 200 according to one embodiment of the present invention.System 200 comprises two subsystems: 1) main memory (physical memory)subsystem 201 and processor subsystem (semiconductor die) 208. The combination ofsubsystems processor subsystem 208 to process data stored inmain memory subsystem 201. As described further herein,processor subsystem 208 comprises one or more processor cores (two processor cores, 202A and 202B, in the illustrated example),cache 203, and a heterogeneousfunctional unit 204. In the illustrated example, all elements ofprocessor subsystem 208 are implemented on a common die. -
System 200 employs two memory access paths: 1) a cache-access path in which block data is stored/loaded to/frommain memory 201 to/fromcache 203, and 2) a direct-access path in which individually-addressed data is stored/loaded to/from main memory 201 (e.g., alongpath 206 in system 200). For instance,system 200 employs a cache-access path in which block data may be stored tomain memory 201 and in which block data may be loaded frommain memory 201 tocache 203. Additionally,system 200 employs a direct-access path in which individually-addressed data, rather than a fixed-size block of data, may be stored tomain memory 201 and in which individually-addressed data may be loaded from main memory 201 (e.g., alongpath 206 in system 200) to a processor register (e.g., of heterogeneous functional unit 204). -
System 200 comprises two processor cores, 202A and 202B, that utilize the cache-access path for accessing data frommain memory 201.System 200 further comprises at least one heterogeneousfunctional unit 204 that is operable to utilize the direct-access path for accessing data frommain memory 201. As described further herein, embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions (e.g., selectively having the processor core(s) 202A/202B process certain instructions) while selectively employing the direct-access path for other instructions (e.g., by offloading those other instructions to the heterogeneous functional unit 204). - Embodiments of the present invention provide a system in which two memory access paths are employed for accessing data by two or more processing nodes. A first memory access path (which may be referred to herein as a “cache-access path” or a “block-oriented access path”) is a path in which a block of data is fetched from
main memory 201 tocache 203. This cache-access path is similar to the traditional memory access described above withFIG. 1 , whereby the processor core decodes an instruction and determines aphysical address 210 of desired data. If the desired data (i.e., at the referenced physical address) is present incache 203 it is accessed fromcache 203, and if the desired data is not present incache 203, the physical address is used to fetch (via path 207) the data frommain memory 201, which is loaded intocache 203. Such fetching frommain memory 201 may load not only the desired data residing at the referenced physical address intocache 203, but may also load some fixed block of data, commonly referred to as a “cache block” as discussed above (e.g., a 64-byte cache block such as that discussed with Table 1). A second memory access path (which may be referred to herein as a “direct-access path”, “cache-bypass path”, or “address-oriented access”) enablescache 203 to be bypassed to retrieve data directly frommain memory 201. In such a direct access, data of an individual physical address that is requested may be retrieved frommain memory 201, rather than retrieving a fixed-size block of data that encompasses more than what is desired. - According to certain embodiments of the present invention the main memory is implemented as non-sequential access main memory that supports random address accesses as opposed to block accesses. That is, upon requesting a given physical address, the main memory may return a corresponding operand (data) that is stored to the given physical address, rather than returning a fixed block of data residing at physical addresses. In other words, rather than returning a fixed block of data (e.g., a 64-byte block of data) independent of the requested physical address, the main memory is implemented such that it is dependent on the requested physical address requested (i.e., is capable of returning only the individual data residing at the requested physical address).
- According to certain embodiments,
processor cores FIG. 1 ). That is,processor cores main memory 201 for loading intocache 203, such as described above with exemplary Table 1. In addition, in certain embodiments,processor cores functional unit 204, which is operable to access data via the direct-access path 206. - When being accessed directly (via the “direct-access path” 206),
main memory 201 returns the data residing at a given requested physical address, rather than returning a fixed-size block of data that is independent (in size) of the requested physical address. Thus, rather than a block-oriented access, an address-oriented access may be performed in which only the data for the requested physical address is retrieved. Further, when being accessed via the cache-access path,main memory 201 is capable of returning a cache block of data. For instance, the non-sequential accessmain memory 201 can be used to emulate a block reference when desired for loading a cache block of data tocache 203, but also supports individual random address accesses without requiring a block load (e.g., when being accessed via the direct-access path 206). Thus, the same non-sequential accessmain memory 201 is utilized (with the same physical memory addresses) for both the cache-access path (e.g., utilized for data accesses byprocessor cores main memory 201 is implemented by scatter/gather DIMMs (dual in-line memory modules) 21. - Thus,
main memory subsystem 201 supports non-sequential memory references. According to one embodiment,main memory subsystem 201 has the following characteristics: - 1) Each memory location is individually addressed. There is no built-in notion of a cache block.
- 2) The entire physical memory is highly interleaved. Interleaving means that each operand resides in its individually controlled memory location.
- 3) Thus, full memory bandwidth is achieved for a non-sequentially referenced address pattern. For instance, in the above example of the DO loop that accesses every fourth memory address, the full memory bandwidth is achieved for the address reference pattern: Address1, Address5, Address9, and Address13.
- 4) If the memory reference is derived from a micro-core, then the memory reference pattern is sequential, e.g., physical address reference pattern: Address1, Address2, Address3, Address8 (assuming a cache block of 8 operands or 8 words).
- 5) Thus, the memory system can support full bandwidth random physical addresses and can also support full bandwidth sequential addresses.
- Given a
memory system 201 as described above, a mechanism is further provided in certain embodiments to determine whether a memory reference is directed to thecache 203, or directly tomain memory 201. In a preferred embodiment of the present invention, a heterogeneousfunctional unit 204 provides such a mechanism. -
FIGS. 3A-3B show an exemplary operational flow diagram for processing instructions of a program being executed by processor subsystem 208 (ofFIG. 2 ) according to one embodiment of the present invention. According to embodiments, an executable file is provided that includes a first portion of instructions to be processed by a first instruction set (such as a first instruction set of a first processor in a multi-processor system) and a second portion of instructions to be processed by a second instruction set (such as a second instruction set of a second processor in a multi-processor system). In the example ofFIGS. 3A-3B , operation ofsystem 200 works as follows: aprocessor core 202A/202B fetches referenced an instruction (e.g., referenced by a program counter (PC)) of the program being executed inoperational block 31. Inblock 32, theprocessor core 202A/202B decodes the instruction and determines aphysical address 210 at which the desired data resides. Inblock 33, the processor core determines whether the instruction is to be executed in its entirety by theprocessor core 202A/202B or whether it is to be executed by heterogeneousfunctional unit 204. According to one embodiment, as part of the definition of the instruction (i.e., the instruction set architecture), it is a priori determined if the instruction is executed byprocessor core 202A/202B or heterogeneousfunctional unit 204. If determined inblock 33 that the instruction is to be executed by theprocessor core 202A/202B, operation advances to block 34 where theprocessor core 202A/202B accesses data (by referencing its physical address 210) for processing the instruction via a cache-access path. If, on the other hand, it is determined inblock 33 that the instruction is to be executed by the heterogeneousfunctional unit 204, operation advances to block 35 (ofFIG. 3B ) where theprocessor core 202A/202B communicates the instruction to the heterogeneousfunctional unit 204, and then inblock 36 the heterogeneous functions unit accesses data for processing the instruction via the direct-access path. Exemplary operations that may be performed in each of the cache-access path 34 and the direct-access path 36 in certain embodiments are described further below. - In certain embodiments, the determination in
block 33 may be made based, at least in part, on the instruction that is fetched. For instance, in certain embodiments, the heterogeneousfunctional unit 204 contains some operational instructions (in its instruction set) that are part of the native instruction set of theprocessor cores 202A/202B. For instance, in certain embodiments, the x86 (or other) instruction set may be modified to include certain instructions that are common to both the processor core(s) and the heterogeneous functional unit. For instance, certain operational instructions may be included in the native instruction set of the processor core(s) for off-loading instructions to the heterogeneous functional unit. - For example, in one embodiment, the instructions of an application being executed are decoded by the processor core(s) 202A/202B, wherein the processor core may fetch (in operational block 31) a native instruction (e.g., X86 instruction) that is called, as an example, “
Heterogeneous Instruction 1”. The decode logic of the processor core decodes the instruction inblock 32 and determines inblock 33 that this is an instruction to be off-loaded to the heterogeneousfunctional unit 204, and thus in response to decoding theHeterogeneous Instruction 1, the processor core initiates a control sequence (via control line 209) to the heterogeneousfunctional unit 204 to communicate (in operational block 35) the instruction to the heterogeneousfunctional unit 204 for processing. - In one embodiment, the cache-
path access 34 includes theprocessor core 202A/202B querying, inblock 301, thecache 203 for the physical address to determine if the referenced data (e.g., operand) is encached. Inblock 302, theprocessor core 202A/202B determines whether the referenced data is encached incache 203. If it is encached, then operation advances to block 304 where theprocessor core 202A/202B retrieves the referenced data fromcache 203. If determined inblock 302 that the referenced data is not encached, operation advances to block 303 where a cache block fetch frommain memory 201 is performed to load a fixed-size block of data, including the referenced data, intocache 203, and then operation advances to block 304 where the processor core retrieves the fetched data fromcache 203. - In one embodiment, the direct-access path 36 (of
FIG. 3B ) includes the heterogeneousfunctional unit 204 interrogating (viapath 205 ofFIG. 2 ), inblock 305,cache 203 to determine whether the referenced data has been previously encached. For instance, all memory references by heterogeneousfunctional unit 204 may use address path (bus) 205 ofFIG. 2 to reference physicalmain memory 201. Data is loaded or stored viabus 206 ofFIG. 2 .Control path 209 ofFIG. 2 is used to initiate control and pass data fromprocessor core 202A/202B to heterogeneousfunctional unit 204. - In
block 306, heterogeneousfunctional unit 204 determines whether the referenced data has been previously encached incache 203. If it has not, operation advances to block 310 where the heterogeneousfunctional unit 204 retrieves the referenced data of the individually-referenced physical address (e.g.,physical address FIG. 2 ) frommain memory 201. That is, the referenced data is received, viapath 206, from the individual-referenced physical address of main memory, rather than receiving a fixed-size block of data (such as a cache block), as is returned frommain memory 201 in the cache-path access 34. - If determined in
block 306 that the referenced data has been previously cached, then in certain embodiments different actions may be performed depending on the type of caching employed in the system. For instance, inblock 307, a determination may be made as to whether the cache is a write-back caching technique or a write-through caching technique, each of which are well-known caching techniques in the art and are thus not described further herein. If a write-back caching technique is employed, then the heterogeneousfunctional unit 204 writes the cache block ofcache 203 that contains the referenced data back tomain memory 201, inoperational block 308. If a write-through caching technique is employed, then the heterogeneousfunctional unit 204 invalidates the referenced data incache 203, inoperational block 309. In either case, operation then advances to block 310 to retrieve the referenced data of the individually-referenced physical address (e.g.,physical address FIG. 2 ) frommain memory 201, as discussed above. - In certain embodiments, if a hit is achieved from the cache in the direct-access path 36 (e.g., as determined in block 306), then the request may be completed from the
cache 203, rather than requiring the entire data block to be written back to main memory 201 (as in block 308) and then referencing the single operand from main memory 201 (as in block 310). That is, in certain embodiments, if a hit is achieved for thecache 203, then the memory access request (e.g., store or load) may be satisfied bycache 203 for the heterogeneousfunctional unit 204, and if a miss occurs forcache 203, then the referenced data of the individually-referenced physical address (e.g.,physical address FIG. 2 ) may be accessed inmain memory 201, as discussed above (e.g., as in block 310). Thus, certain embodiments permit memory access ofcache 203 by heterogeneous functional unit 204 (rather than bypassing the cache 203) when the memory access request can be satisfied bycache 203, but when the memory access request cannot be satisfied by cache 203 (i.e., a miss occurs), then an individually-referenced physical address (rather than a block-oriented access) is made ofmain memory 201. - For all traditional microprocessors of the prior art, main memory (e.g., 101 of
FIG. 1 ) is block-oriented. Block-oriented means that even if one 64-bit word is referenced, 8 to 16 words ARE ALWAYS fetched and loaded into the microprocessor's cache (e.g.,cache 103 ofFIG. 1 ). As discussed above, this fixed-size block of 8 to 16 words are called the “cache block”. For many applications, only one word of the 8 to 16 words of the cache block that are fetched is used. Consequently, a large amount (e.g., 87%) of the memory bandwidth is wasted (not used). This results in reduced application performance. - Typical of these types of applications are those that reference memory using a vector of indices. This is called “scatter/gather”. For example, in the following FORTRAN code:
-
- do i=1,n
-
a(i)=b(i)+c(i) -
- enddo
all the elements of a, b, and c are sequentially referenced.
- enddo
- In the following FORTRAN code:
-
- do i=1,n
-
a(j(i))=b(j(i))+c(j(i)) -
- enddo
a, b, and c are referenced through an index vector. Thus, the physical main memory system is referenced by non-sequential memory addresses.
- enddo
- According to certain embodiments,
main memory 201 ofsystem 200 comprises a memory dimm that is formed utilizing standard memory DRAMs, that provides full bandwidth memory accesses for non-sequential memory addresses. Thus, if the memory reference pattern is: 1, 20, 33, 55; then only memory words, 1, 20, 33, and 55 are fetched and stored. In fact, they are fetched and stored at the maximum rate permitted by the DRAMs. - In the above example, with the same memory reference pattern, a block-oriented memory system, with a block size of 8 words, would fetch 4 cache blocks to fetch 4 words:
-
- {1 . . . 8}—for
word 1; - {17 . . . 24}—for word 20;
- {33 . . . 40}—for
word 33; and - {51 . . . 56}—for word 55.
- {1 . . . 8}—for
- In the above-described embodiment of
system 200 ofFIG. 2 , since full bandwidth is achieved for non-sequential memory accesses, full memory bandwidth is achieved for sequential accesses. Accordingly, embodiments of the present invention enable full bandwidth for memory accesses to be achieved for both non-sequential and sequential memory accesses. - Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
Claims (20)
1. A method comprising:
fetching, by at least one processor, at least one instruction of a first instruction set from a cache memory for execution by the at least one processor, wherein the at least one instruction of the first instruction set is loaded to the cache memory in a fixed-size data block fetched from main memory via a block oriented cache-access path that provides fixed-size data block access to the main memory; and
offloading, by the at least one processor, at least one instruction of a second instruction set for execution by at least one heterogeneous functional unit, wherein the at least one instruction of the second instruction set is fetched directly from the main memory to the at least one heterogeneous functional unit via an address oriented cache-bypass path that provides individually-addressed data access to the main memory.
2. The method of claim 1 , wherein the at least one processor is configured to execute instructions of the first instruction set, and the at least one heterogeneous functional unit is configured to execute instructions of the second instruction set that is different from the first instruction set.
3. The method of claim 1 , wherein fetching the at least one instruction of the first instruction set from the cache memory for execution by the at least one processor includes:
determining whether the at least one instruction is present in cache memory;
fetching the fixed-size data block including the at least one instruction of the first instruction set from the main memory to the cache memory via the block oriented cache-access path that provides fixed-size data block access to the main memory; and
loading the at least one instruction of the first instruction set from the cache memory to the at least one processor.
4. The method of claim 1 , wherein the fixed-size data block loaded to the cache memory from the main memory includes instructions in addition to the at least one instruction of the first instruction set, and wherein the at least one instruction of the second instruction set is fetched directly from the main memory to the at least one heterogeneous functional unit is fetched individually without other instructions.
5. The method of claim 1 , further comprising determining whether an instruction to be executed is an instruction of the first instruction set or an instruction of the second instruction set.
6. The method of claim 5 , further comprising:
fetching the at least one instruction of the first instruction set from the cache memory for execution by the at least one processor in response to determining that the instruction to be executed is an instruction of the first instruction set; and
offloading the at least one instruction of the second instruction set for execution by at least one heterogeneous functional unit in response to determining that the instruction to be executed is an instruction of the second instruction set.
7. The method of claim 1 , wherein the main memory comprises scatter/gather memory configured for individually-addressed data access, and is configured to emulate block data access for fetching the fixed-size data block fetched from the main memory to the cache memory via the block oriented cache-access path.
8. A system comprising:
at least one processor configured to fetch at least one instruction of a first instruction set for execution by the at least one processor from a main memory via a block oriented cache-access path, wherein the block oriented cache-access path is configured to provide fixed-size data block access to the main memory; and
at least one heterogeneous functional unit configured to fetch at least one instruction of a second instruction set from the main memory via an address oriented cache-bypass path, wherein the address oriented cache-bypass path provides individually-addressed data access to the main memory, and wherein the at least one instruction of the first instruction set is offloaded from the at least one processor to the at least one heterogeneous functional unit for execution by the at least one heterogeneous functional unit.
9. The system of claim 8 , wherein the at least one processor is configured to execute instructions of the first instruction set, and the at least one heterogeneous functional unit is configured to execute instructions of the second instruction set that is different from the first instruction set.
10. The system of claim 8 , wherein the block oriented cache-access path couples the main memory to a cache memory, and wherein the configuration of the at least one processor to fetch the at least one instruction of the first instruction set via the block oriented cache-access path includes configuration of the at least one processor to:
cause at least one fixed-size data block to be fetched from the main memory and to be loaded to the cache memory when the at least one instruction of the first instruction set is absent from the cache memory, the at least one fixed-size data block including at least one instruction of the first instruction set; and
fetch the at least one instruction of the first instruction set from the cache memory.
11. The system of claim 8 , wherein the fixed-size data block access to the main memory returns data in addition to data referenced by a cache memory access by the at least one processor, and wherein the individually-addressed data access returns only data referenced by a physical address access by the at least one heterogeneous functional unit.
12. The system of claim 8 , wherein the at least one processor is further configured to determine whether an instruction to be executed is an instruction of the first instruction set or an instruction of the second instruction set.
13. The system of claim 12 , wherein the at least one processor is further configured to:
fetch the at least one instruction of the first instruction set from a cache memory for execution by the at least one processor in response to a determination that the instruction to be executed is an instruction of the first instruction set; and
offloading the at least one instruction of the second instruction set for execution by at least one heterogeneous functional unit in response to determining that the instruction to be executed is an instruction of the second instruction set.
14. The system of claim 8 , wherein the main memory comprises scatter/gather memory configured for individually-addressed data access, and is configured to emulate block data access for fetching a fixed-size data block from the main memory via the block oriented cache-access path.
15. The system of claim 8 , further comprising:
a cache interrogation path coupling a cache memory to the at least one heterogeneous functional unit, wherein the cache interrogation path is configured to provide information regarding encached data to the at least one heterogeneous functional unit in response to an interrogation by the at least one heterogeneous functional unit regarding referenced data to be accessed by the at least one heterogeneous functional unit, the referenced data including the at least one instruction of the second instruction set.
16. The system of claim 15 , wherein the cache interrogation path is configured to initiate loading a fixed-size cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the at least one heterogeneous functional unit using the address oriented cache-bypass path.
17. The system of claim 15 , wherein the cache interrogation path is configured to invalidate the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the at least one heterogeneous functional unit using the address oriented cache-bypass path.
18. A method comprising:
accessing, by at least one processor, a first portion of data from a main memory via a block oriented cache-access path, wherein the block oriented cache-access path is configured to provide fixed-size data block access to the main memory; and
accessing, by at least one heterogeneous functional unit, a second portion of data from the main memory via an address oriented cache-bypass path, wherein the address oriented cache-bypass path provides individually-addressed data access to the main memory, and wherein the second portion of data includes at least one instruction offloaded from the at least one processor to the at least one heterogeneous functional unit for execution by the at least one heterogeneous functional unit.
19. The method of claim 18 , wherein accessing the first portion of data from the main memory via the block oriented cache-access path includes:
determining whether the first portion of data is present in cache memory;
fetching a fixed-size data block including the first portion of data from the main memory to the cache memory via the block oriented cache-access path; and
loading the first portion of data from the cache memory to the at least one processor.
20. The method of claim 18 , wherein accessing the second portion of data from the main memory via the address oriented cache-bypass path includes:
offloading, by the at least one processor, execution of the at least one instruction included in the second portion of data to the at least one heterogeneous functional unit; and
fetching the at least one instruction directly from the main memory to the at least one heterogeneous functional unit via the address oriented cache-bypass path by referencing an individual address of the at least one instruction in the main memory to individually-addressed data access the address of the at least one instruction.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US17/396,716 US20210365381A1 (en) | 2008-01-04 | 2021-08-08 | Microprocessor architecture having alternative memory access paths |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/969,792 US9710384B2 (en) | 2008-01-04 | 2008-01-04 | Microprocessor architecture having alternative memory access paths |
US15/596,649 US11106592B2 (en) | 2008-01-04 | 2017-05-16 | Microprocessor architecture having alternative memory access paths |
US17/396,716 US20210365381A1 (en) | 2008-01-04 | 2021-08-08 | Microprocessor architecture having alternative memory access paths |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/596,649 Continuation US11106592B2 (en) | 2008-01-04 | 2017-05-16 | Microprocessor architecture having alternative memory access paths |
Publications (1)
Publication Number | Publication Date |
---|---|
US20210365381A1 true US20210365381A1 (en) | 2021-11-25 |
Family
ID=40845507
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/969,792 Active 2032-04-29 US9710384B2 (en) | 2007-08-20 | 2008-01-04 | Microprocessor architecture having alternative memory access paths |
US15/596,649 Active 2029-12-01 US11106592B2 (en) | 2008-01-04 | 2017-05-16 | Microprocessor architecture having alternative memory access paths |
US17/396,716 Abandoned US20210365381A1 (en) | 2008-01-04 | 2021-08-08 | Microprocessor architecture having alternative memory access paths |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/969,792 Active 2032-04-29 US9710384B2 (en) | 2007-08-20 | 2008-01-04 | Microprocessor architecture having alternative memory access paths |
US15/596,649 Active 2029-12-01 US11106592B2 (en) | 2008-01-04 | 2017-05-16 | Microprocessor architecture having alternative memory access paths |
Country Status (2)
Country | Link |
---|---|
US (3) | US9710384B2 (en) |
WO (1) | WO2009088682A1 (en) |
Families Citing this family (60)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9015399B2 (en) | 2007-08-20 | 2015-04-21 | Convey Computer | Multiple data channel memory module architecture |
US9710384B2 (en) * | 2008-01-04 | 2017-07-18 | Micron Technology, Inc. | Microprocessor architecture having alternative memory access paths |
US8972958B1 (en) | 2012-10-23 | 2015-03-03 | Convey Computer | Multistage development workflow for generating a custom instruction set reconfigurable processor |
US9386114B2 (en) * | 2011-12-28 | 2016-07-05 | Google Inc. | Systems and methods for accessing an update server |
US20130179642A1 (en) * | 2012-01-10 | 2013-07-11 | Qualcomm Incorporated | Non-Allocating Memory Access with Physical Address |
US10430190B2 (en) | 2012-06-07 | 2019-10-01 | Micron Technology, Inc. | Systems and methods for selectively controlling multithreaded execution of executable code segments |
RU2635255C2 (en) | 2013-05-31 | 2017-11-09 | Интел Корпорейшн | System coherent cache with possibility of fragmentation/ defragmentation |
US10133578B2 (en) * | 2013-09-06 | 2018-11-20 | Huawei Technologies Co., Ltd. | System and method for an asynchronous processor with heterogeneous processors |
US10191747B2 (en) | 2015-06-26 | 2019-01-29 | Microsoft Technology Licensing, Llc | Locking operand values for groups of instructions executed atomically |
US10169044B2 (en) | 2015-06-26 | 2019-01-01 | Microsoft Technology Licensing, Llc | Processing an encoding format field to interpret header information regarding a group of instructions |
US10175988B2 (en) | 2015-06-26 | 2019-01-08 | Microsoft Technology Licensing, Llc | Explicit instruction scheduler state information for a processor |
US9952867B2 (en) | 2015-06-26 | 2018-04-24 | Microsoft Technology Licensing, Llc | Mapping instruction blocks based on block size |
US10409606B2 (en) | 2015-06-26 | 2019-09-10 | Microsoft Technology Licensing, Llc | Verifying branch targets |
US9946548B2 (en) | 2015-06-26 | 2018-04-17 | Microsoft Technology Licensing, Llc | Age-based management of instruction blocks in a processor instruction window |
US10346168B2 (en) | 2015-06-26 | 2019-07-09 | Microsoft Technology Licensing, Llc | Decoupled processor instruction window and operand buffer |
US10409599B2 (en) | 2015-06-26 | 2019-09-10 | Microsoft Technology Licensing, Llc | Decoding information about a group of instructions including a size of the group of instructions |
US11755484B2 (en) | 2015-06-26 | 2023-09-12 | Microsoft Technology Licensing, Llc | Instruction block allocation |
US10768936B2 (en) | 2015-09-19 | 2020-09-08 | Microsoft Technology Licensing, Llc | Block-based processor including topology and control registers to indicate resource sharing and size of logical processor |
US11126433B2 (en) | 2015-09-19 | 2021-09-21 | Microsoft Technology Licensing, Llc | Block-based processor core composition register |
US11016770B2 (en) | 2015-09-19 | 2021-05-25 | Microsoft Technology Licensing, Llc | Distinct system registers for logical processors |
US9992248B2 (en) * | 2016-01-12 | 2018-06-05 | International Business Machines Corporation | Scalable event stream data processing using a messaging system |
KR101842764B1 (en) * | 2016-03-18 | 2018-03-28 | 연세대학교 산학협력단 | Apparatus for maintaining data consistency between hardware accelerator and host system and method of the same |
US11531552B2 (en) | 2017-02-06 | 2022-12-20 | Microsoft Technology Licensing, Llc | Executing multiple programs simultaneously on a processor core |
US10924508B2 (en) * | 2017-12-21 | 2021-02-16 | Sonicwall Inc. | Providing access to data in a secure communication |
US11392527B2 (en) | 2020-08-31 | 2022-07-19 | Micron Technology, Inc. | Ordered delivery of data packets based on type of path information in each packet |
US11586443B2 (en) | 2020-10-20 | 2023-02-21 | Micron Technology, Inc. | Thread-based processor halting |
US11431653B2 (en) | 2020-10-20 | 2022-08-30 | Micron Technology, Inc. | Packet arbitration for buffered packets in a network device |
US11507453B2 (en) | 2020-10-20 | 2022-11-22 | Micron Technology, Inc. | Low-latency register error correction |
US11379365B2 (en) | 2020-10-20 | 2022-07-05 | Micron Technology, Inc. | Memory access bounds checking for a programmable atomic operator |
US11740929B2 (en) | 2020-10-20 | 2023-08-29 | Micron Technology, Inc. | Registering a custom atomic operation with the operating system |
US11409539B2 (en) | 2020-10-20 | 2022-08-09 | Micron Technology, Inc. | On-demand programmable atomic kernel loading |
US11294848B1 (en) | 2020-10-20 | 2022-04-05 | Micron Technology, Inc. | Initialization sequencing of chiplet I/O channels within a chiplet system |
US11614942B2 (en) | 2020-10-20 | 2023-03-28 | Micron Technology, Inc. | Reuse in-flight register data in a processor |
US11436187B2 (en) | 2020-10-20 | 2022-09-06 | Micron Technology, Inc. | Method of notifying a process or programmable atomic operation traps |
US11403023B2 (en) | 2020-10-20 | 2022-08-02 | Micron Technology, Inc. | Method of organizing a programmable atomic unit instruction memory |
US11586439B2 (en) | 2020-10-20 | 2023-02-21 | Micron Technology, Inc. | Detecting infinite loops in a programmable atomic transaction |
US11693690B2 (en) | 2020-10-20 | 2023-07-04 | Micron Technology, Inc. | Method of completing a programmable atomic transaction by ensuring memory locks are cleared |
US11409533B2 (en) | 2020-10-20 | 2022-08-09 | Micron Technology, Inc. | Pipeline merging in a circuit |
US11614891B2 (en) | 2020-10-20 | 2023-03-28 | Micron Technology, Inc. | Communicating a programmable atomic operator to a memory controller |
US11803391B2 (en) | 2020-10-20 | 2023-10-31 | Micron Technology, Inc. | Self-scheduling threads in a programmable atomic unit |
US11526361B2 (en) | 2020-10-20 | 2022-12-13 | Micron Technology, Inc. | Variable pipeline length in a barrel-multithreaded processor |
US11907718B2 (en) | 2020-12-31 | 2024-02-20 | Micron Technology, Inc. | Loop execution in a reconfigurable compute fabric using flow controllers for respective synchronous flows |
US11698853B2 (en) | 2020-12-31 | 2023-07-11 | Micron Technology, Inc. | Saturating local cache in memory-compute systems |
US11740800B2 (en) | 2021-06-22 | 2023-08-29 | Micron Technology, Inc. | Alleviating memory hotspots on systems with multiple memory controllers |
US20210326135A1 (en) * | 2021-06-25 | 2021-10-21 | Dheeraj Subbareddy | Programmable Fabric-Based Instruction Set Architecture for a Processor |
US11762661B2 (en) | 2021-07-28 | 2023-09-19 | Micron Technology, Inc. | Counter for preventing completion of a thread including a non-blocking external device call with no-return indication |
US11861366B2 (en) | 2021-08-11 | 2024-01-02 | Micron Technology, Inc. | Efficient processing of nested loops for computing device with multiple configurable processing elements using multiple spoke counts |
US11604650B1 (en) | 2021-08-11 | 2023-03-14 | Micron Technology, Inc. | Packing conditional branch operations |
US11768626B2 (en) | 2021-08-11 | 2023-09-26 | Micron Technology, Inc. | Stencil data access from tile memory |
US11886728B2 (en) | 2021-08-13 | 2024-01-30 | Micron Technology, Inc. | Undo capability for memory devices |
US11853216B2 (en) | 2021-08-16 | 2023-12-26 | Micron Technology, Inc. | High bandwidth gather cache |
US11841823B2 (en) | 2021-08-16 | 2023-12-12 | Micron Technology, Inc. | Connectivity in coarse grained reconfigurable architecture |
US11782725B2 (en) | 2021-08-16 | 2023-10-10 | Micron Technology, Inc. | Mask field propagation among memory-compute tiles in a reconfigurable architecture |
US11704130B2 (en) | 2021-08-16 | 2023-07-18 | Micron Technology, Inc. | Indexing external memory in a reconfigurable compute fabric |
US11709796B2 (en) | 2021-08-16 | 2023-07-25 | Micron Technology, Inc. | Data input/output operations during loop execution in a reconfigurable compute fabric |
US11507493B1 (en) * | 2021-08-18 | 2022-11-22 | Micron Technology, Inc. | Debugging dataflow computer architectures |
US11860800B2 (en) | 2021-08-20 | 2024-01-02 | Micron Technology, Inc. | Kernel mapping to nodes in compute fabric |
US11675588B2 (en) | 2021-08-20 | 2023-06-13 | Micron Technology, Inc. | Tile-based result buffering in memory-compute systems |
US11940919B2 (en) | 2022-08-30 | 2024-03-26 | Micron Technology, Inc. | Recall pending cache line eviction |
US11899953B1 (en) | 2022-08-30 | 2024-02-13 | Micron Technology, Inc. | Method of efficiently identifying rollback requests |
Citations (68)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4386399A (en) * | 1980-04-25 | 1983-05-31 | Data General Corporation | Data processing system |
US4504902A (en) * | 1982-03-25 | 1985-03-12 | At&T Bell Laboratories | Cache arrangement for direct memory access block transfer |
US4669043A (en) * | 1984-02-17 | 1987-05-26 | Signetics Corporation | Memory access controller |
US4875161A (en) * | 1985-07-31 | 1989-10-17 | Unisys Corporation | Scientific processor vector file organization |
US4888679A (en) * | 1988-01-11 | 1989-12-19 | Digital Equipment Corporation | Method and apparatus using a cache and main memory for both vector processing and scalar processing by prefetching cache blocks including vector data elements |
US4897783A (en) * | 1983-03-14 | 1990-01-30 | Nay Daniel L | Computer memory system |
US5097437A (en) * | 1988-07-17 | 1992-03-17 | Larson Ronald J | Controller with clocking device controlling first and second state machine controller which generate different control signals for different set of devices |
US5197140A (en) * | 1989-11-17 | 1993-03-23 | Texas Instruments Incorporated | Sliced addressing multi-processor and method of operation |
US5202969A (en) * | 1988-11-01 | 1993-04-13 | Hitachi, Ltd. | Single-chip-cache-buffer for selectively writing write-back and exclusively writing data-block portions to main-memory based upon indication of bits and bit-strings respectively |
US5222224A (en) * | 1989-02-03 | 1993-06-22 | Digital Equipment Corporation | Scheme for insuring data consistency between a plurality of cache memories and the main memory in a multi-processor system |
US5239643A (en) * | 1987-11-30 | 1993-08-24 | International Business Machines Corporation | Method for reducing disk I/O accesses in a multi-processor clustered type data processing system |
US5261066A (en) * | 1990-03-27 | 1993-11-09 | Digital Equipment Corporation | Data processing system and method with small fully-associative cache and prefetch buffers |
US5283886A (en) * | 1989-08-11 | 1994-02-01 | Hitachi, Ltd. | Multiprocessor cache system having three states for generating invalidating signals upon write accesses |
US5293603A (en) * | 1991-06-04 | 1994-03-08 | Intel Corporation | Cache subsystem for microprocessor based computer system with synchronous and asynchronous data path |
US5357618A (en) * | 1991-04-15 | 1994-10-18 | International Business Machines Corporation | Cache prefetch and bypass using stride registers |
US5357521A (en) * | 1990-02-14 | 1994-10-18 | International Business Machines Corporation | Address sensitive memory testing |
US5418973A (en) * | 1992-06-22 | 1995-05-23 | Digital Equipment Corporation | Digital computer system with cache controller coordinating both vector and scalar operations |
US5450564A (en) * | 1990-05-04 | 1995-09-12 | Unisys Corporation | Method and apparatus for cache memory access with separate fetch and store queues |
US5499355A (en) * | 1992-03-06 | 1996-03-12 | Rambus, Inc. | Prefetching into a cache to minimize main memory access time and cache size in a computer system |
US5724533A (en) * | 1995-11-17 | 1998-03-03 | Unisys Corporation | High performance instruction data path |
US5749089A (en) * | 1994-01-31 | 1998-05-05 | Fujitsu Limited | Cache-memory system having multidimensional spread cache |
US5838946A (en) * | 1990-04-14 | 1998-11-17 | Sun Microsystems, Inc. | Method and apparatus for accomplishing processor read of selected information through a cache memory |
US5924117A (en) * | 1996-12-16 | 1999-07-13 | International Business Machines Corporation | Multi-ported and interleaved cache memory supporting multiple simultaneous accesses thereto |
US5935204A (en) * | 1989-11-08 | 1999-08-10 | Fujitsu Limited | System for a multi-processor system wherein each processor transfers a data block from cache if a cache hit and from main memory only if cache miss |
US6041401A (en) * | 1994-10-14 | 2000-03-21 | Compaq Computer Corporation | Computer system that places a cache memory into low power mode in response to special bus cycles executed on the bus |
US6058056A (en) * | 1998-04-30 | 2000-05-02 | Micron Technology, Inc. | Data compression circuit and method for testing memory devices |
US6209067B1 (en) * | 1994-10-14 | 2001-03-27 | Compaq Computer Corporation | Computer system controller and method with processor write posting hold off on PCI master memory request |
US6243791B1 (en) * | 1998-08-13 | 2001-06-05 | Hewlett-Packard Company | Method and architecture for data coherency in set-associative caches including heterogeneous cache sets having different characteristics |
US20010004753A1 (en) * | 1998-04-28 | 2001-06-21 | International Business Machines Corporation | Address re-mapping for memory module using presence detect data |
US6308255B1 (en) * | 1998-05-26 | 2001-10-23 | Advanced Micro Devices, Inc. | Symmetrical multiprocessing bus and chipset used for coprocessor support allowing non-native code to run in a system |
US6342892B1 (en) * | 1995-11-22 | 2002-01-29 | Nintendo Co., Ltd. | Video game system and coprocessor for video game system |
US20020013892A1 (en) * | 1998-05-26 | 2002-01-31 | Frank J. Gorishek | Emulation coprocessor |
US20020059540A1 (en) * | 1995-10-24 | 2002-05-16 | Seachange Technology, Inc. | Loosley coupled mass storage computer cluster |
US6401192B1 (en) * | 1998-10-05 | 2002-06-04 | International Business Machines Corporation | Apparatus for software initiated prefetch and method therefor |
US20020099907A1 (en) * | 2001-01-19 | 2002-07-25 | Vittorio Castelli | System and method for storing data sectors with header and trailer information in a disk cache supporting memory compression |
US6430103B2 (en) * | 2000-02-03 | 2002-08-06 | Hitachi, Ltd. | Semiconductor integrated circuit device with memory banks and read buffer capable of storing data read out from one memory bank when data of another memory bank is outputting |
US20020135583A1 (en) * | 1997-08-22 | 2002-09-26 | Sony Computer Entertainment Inc. | Information processing apparatus for entertainment system utilizing DMA-controlled high-speed transfer and processing of routine data |
US20020144061A1 (en) * | 1998-12-31 | 2002-10-03 | Cray Inc. | Vector and scalar data cache for a vector multiprocessor |
US6473777B1 (en) * | 1998-10-30 | 2002-10-29 | National Semiconductor Corporation | Method for accelerating java virtual machine bytecode verification, just-in-time compilation and garbage collection by using a dedicated co-processor |
US6507894B1 (en) * | 1998-12-10 | 2003-01-14 | Nec Corporation | Information processing apparatus and process |
US6510164B1 (en) * | 1998-11-16 | 2003-01-21 | Sun Microsystems, Inc. | User-level dedicated interface for IP applications in a data packet switching and load balancing system |
US20030226018A1 (en) * | 2002-05-31 | 2003-12-04 | Broadcom Corporation | Data transfer efficiency in a cryptography accelerator system |
US6665749B1 (en) * | 1999-08-17 | 2003-12-16 | Nec Electronics, Inc. | Bus protocol for efficiently transferring vector data |
US20040019762A1 (en) * | 2002-07-25 | 2004-01-29 | Hitachi, Ltd. | Semiconductor integrated circuit |
US20040068622A1 (en) * | 2002-10-03 | 2004-04-08 | Van Doren Stephen R. | Mechanism for resolving ambiguous invalidates in a computer system |
US20040088524A1 (en) * | 2002-07-31 | 2004-05-06 | Texas Instruments Incorporated | Inter-processor control |
US6751700B2 (en) * | 2001-02-21 | 2004-06-15 | 3Com Corporation | Date processor and storage system including a set associative cache with memory aliasing |
US20040153610A1 (en) * | 2003-01-31 | 2004-08-05 | Hua-Chang Chi | Cache controller unit architecture and applied method |
US6789167B2 (en) * | 2002-03-06 | 2004-09-07 | Hewlett-Packard Development Company, L.P. | Method and apparatus for multi-core processor integrated circuit having functional elements configurable as core elements and as system device elements |
US20040210642A1 (en) * | 2001-06-11 | 2004-10-21 | Adisak Mekkittikul | Method and system for caching data in a network node |
US20040267970A1 (en) * | 1989-11-03 | 2004-12-30 | Jirgal James J. | Parallel port with direct memory access capabilities |
US6868472B1 (en) * | 1999-10-01 | 2005-03-15 | Fujitsu Limited | Method of Controlling and addressing a cache memory which acts as a random address memory to increase an access speed to a main memory |
US20050198442A1 (en) * | 2004-03-02 | 2005-09-08 | Mandler Alberto R. | Conditionally accessible cache memory |
US20060224861A1 (en) * | 2005-04-01 | 2006-10-05 | Arm Limited | Condition branch instruction encoding within a multiple instruction set data processing system |
US20070101096A1 (en) * | 2005-10-27 | 2007-05-03 | Sandisk Corporation | Non-volatile memory with adaptive handling of data writes |
US20070204107A1 (en) * | 2004-02-24 | 2007-08-30 | Analog Devices, Inc. | Cache memory background preprocessing |
US20070226424A1 (en) * | 2006-03-23 | 2007-09-27 | International Business Machines Corporation | Low-cost cache coherency for accelerators |
US7360060B2 (en) * | 2002-07-31 | 2008-04-15 | Texas Instruments Incorporated | Using IMPDEP2 for system commands related to Java accelerator hardware |
US7376812B1 (en) * | 2002-05-13 | 2008-05-20 | Tensilica, Inc. | Vector co-processor for configurable and extensible processor architecture |
US20080209127A1 (en) * | 2007-02-23 | 2008-08-28 | Daniel Alan Brokenshire | System and method for efficient implementation of software-managed cache |
US20080215854A1 (en) * | 2004-06-30 | 2008-09-04 | Asaad Sameh W | System and Method for Adaptive Run-Time Reconfiguration for a Reconfigurable Instruction Set Co-Processor Architecture |
US20090177843A1 (en) * | 2008-01-04 | 2009-07-09 | Convey Computer | Microprocessor architecture having alternative memory access paths |
US7577822B2 (en) * | 2001-12-14 | 2009-08-18 | Pact Xpp Technologies Ag | Parallel task operation in processor and reconfigurable coprocessor configured based on information in link list including termination information for synchronization |
US20100037024A1 (en) * | 2008-08-05 | 2010-02-11 | Convey Computer | Memory interleave for heterogeneous computing |
US7886129B2 (en) * | 2000-12-29 | 2011-02-08 | Mips Technologies, Inc. | Configurable co-processor interface |
US8122229B2 (en) * | 2007-09-12 | 2012-02-21 | Convey Computer | Dispatch mechanism for dispatching instructions from a host processor to a co-processor |
US8156307B2 (en) * | 2007-08-20 | 2012-04-10 | Convey Computer | Multi-processor system having at least one processor that comprises a dynamically reconfigurable instruction set |
US8205066B2 (en) * | 2008-10-31 | 2012-06-19 | Convey Computer | Dynamically configured coprocessor for different extended instruction set personality specific to application program with shared memory storing instructions invisibly dispatched from host processor |
Family Cites Families (144)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3434114A (en) * | 1966-09-23 | 1969-03-18 | Ibm | Variable floating point precision |
US4128880A (en) | 1976-06-30 | 1978-12-05 | Cray Research, Inc. | Computer vector register processing |
JPS6077265A (en) | 1983-10-05 | 1985-05-01 | Hitachi Ltd | Vector processor |
US4817140A (en) * | 1986-11-05 | 1989-03-28 | International Business Machines Corp. | Software protection system using a single-key cryptosystem, a hardware-based authorization system and a secure coprocessor |
JP2602240B2 (en) | 1987-08-28 | 1997-04-23 | 株式会社日立製作所 | Multi-processor system |
US5027272A (en) * | 1988-01-28 | 1991-06-25 | Weitek Corporation | Method and apparatus for performing double precision vector operations on a coprocessor |
US5117487A (en) * | 1988-08-26 | 1992-05-26 | Kabushiki Kaisha Toshiba | Method for accessing microprocessor and microinstruction control type microprocessor including pointer register |
JP2658397B2 (en) | 1989-06-13 | 1997-09-30 | 日本電気株式会社 | Multiprocessor system |
US5179702A (en) | 1989-12-29 | 1993-01-12 | Supercomputer Systems Limited Partnership | System and method for controlling a highly parallel multiprocessor using an anarchy based scheduler for parallel execution thread scheduling |
US5440752A (en) * | 1991-07-08 | 1995-08-08 | Seiko Epson Corporation | Microprocessor architecture with a switch network for data transfer between cache, memory port, and IOU |
US6240508B1 (en) | 1992-07-06 | 2001-05-29 | Compaq Computer Corporation | Decode and execution synchronized pipeline processing using decode generated memory read queue with stop entry to allow execution generated memory read |
US5802290A (en) * | 1992-07-29 | 1998-09-01 | Virtual Computer Corporation | Computer network of distributed virtual computers which are EAC reconfigurable in response to instruction to be executed |
EP0651321B1 (en) * | 1993-10-29 | 2001-11-14 | Advanced Micro Devices, Inc. | Superscalar microprocessors |
JPH0816530A (en) * | 1994-07-04 | 1996-01-19 | Kurieiteibu Design:Kk | Coprocessor system and external memory device with auxiliary operation function |
US5598546A (en) * | 1994-08-31 | 1997-01-28 | Exponential Technology, Inc. | Dual-architecture super-scalar pipeline |
US5513366A (en) | 1994-09-28 | 1996-04-30 | International Business Machines Corporation | Method and system for dynamically reconfiguring a register file in a vector processor |
JPH08278916A (en) * | 1994-11-30 | 1996-10-22 | Hitachi Ltd | Multichannel memory system, transfer information synchronizing method, and signal transfer circuit |
US5887183A (en) | 1995-01-04 | 1999-03-23 | International Business Machines Corporation | Method and system in a data processing system for loading and storing vectors in a plurality of modes |
US5752035A (en) * | 1995-04-05 | 1998-05-12 | Xilinx, Inc. | Method for compiling and executing programs for reprogrammable instruction set accelerator |
US6594752B1 (en) * | 1995-04-17 | 2003-07-15 | Ricoh Company, Ltd. | Meta-address architecture for parallel, dynamically reconfigurable computing |
GB9600823D0 (en) * | 1996-01-16 | 1996-03-20 | British Telecomm | Distributed processing |
US5933627A (en) | 1996-07-01 | 1999-08-03 | Sun Microsystems | Thread switch on blocked load or store using instruction thread field |
US5838984A (en) * | 1996-08-19 | 1998-11-17 | Samsung Electronics Co., Ltd. | Single-instruction-multiple-data processing using multiple banks of vector registers |
US5941938A (en) * | 1996-12-02 | 1999-08-24 | Compaq Computer Corp. | System and method for performing an accumulate operation on one or more operands within a partitioned register |
US6308248B1 (en) * | 1996-12-31 | 2001-10-23 | Compaq Computer Corporation | Method and system for allocating memory space using mapping controller, page table and frame numbers |
US5920721A (en) * | 1997-06-11 | 1999-07-06 | Digital Equipment Corporation | Compiler generating functionally-alike code sequences in an executable program intended for execution in different run-time environments |
US6202133B1 (en) * | 1997-07-02 | 2001-03-13 | Micron Technology, Inc. | Method of processing memory transactions in a computer system having dual system memories and memory controllers |
US5999734A (en) * | 1997-10-21 | 1999-12-07 | Ftl Systems, Inc. | Compiler-oriented apparatus for parallel compilation, simulation and execution of computer programs and hardware models |
US6212544B1 (en) | 1997-10-23 | 2001-04-03 | International Business Machines Corporation | Altering thread priorities in a multithreaded processor |
US6075546A (en) | 1997-11-10 | 2000-06-13 | Silicon Grahphics, Inc. | Packetized command interface to graphics processor |
US6434687B1 (en) | 1997-12-17 | 2002-08-13 | Src Computers, Inc. | System and method for accelerating web site access and processing utilizing a computer system incorporating reconfigurable processors operating under a single operating system image |
US6076152A (en) | 1997-12-17 | 2000-06-13 | Src Computers, Inc. | Multiprocessor computer architecture incorporating a plurality of memory algorithm processors in the memory subsystem |
US6098169A (en) | 1997-12-23 | 2000-08-01 | Intel Corporation | Thread performance analysis by monitoring processor performance event registers at thread switch |
DE69919059T2 (en) | 1998-02-04 | 2005-01-27 | Texas Instruments Inc., Dallas | Data processing system with a digital signal processor and a coprocessor and data processing method |
US6097402A (en) | 1998-02-10 | 2000-08-01 | Intel Corporation | System and method for placement of operands in system memory |
US6473897B1 (en) * | 1998-04-13 | 2002-10-29 | Intel Corporation | Method and apparatus for generating multiple processor-specific code segments in a single executable |
JPH11306026A (en) | 1998-04-22 | 1999-11-05 | Toshiba Corp | Code optimization device and method and computer readable recording medium recording code optimization program |
US6026479A (en) | 1998-04-22 | 2000-02-15 | Hewlett-Packard Company | Apparatus and method for efficient switching of CPU mode between regions of high instruction level parallism and low instruction level parallism in computer programs |
US6170001B1 (en) * | 1998-05-27 | 2001-01-02 | Arm Limited | System for transfering format data from format register to memory wherein format data indicating the distribution of single or double precision data type in the register bank |
JPH11338710A (en) | 1998-05-28 | 1999-12-10 | Toshiba Corp | Method and device for compiling processor having plural kinds of instruction sets and recording medium for programming and recording its method |
US6175915B1 (en) * | 1998-08-11 | 2001-01-16 | Cisco Technology, Inc. | Data processor with trie traversal instruction set extension |
US6343356B1 (en) * | 1998-10-09 | 2002-01-29 | Bops, Inc. | Methods and apparatus for dynamic instruction controlled reconfiguration register file with extended precision |
US6320964B1 (en) | 1998-08-26 | 2001-11-20 | Intel Corporation | Cryptographic accelerator |
US6868490B1 (en) | 2000-06-21 | 2005-03-15 | Pts Corporation | Methods and apparatus for providing context switching between software tasks with reconfigurable control |
CA2317387A1 (en) * | 1999-09-10 | 2001-03-10 | Sibercore Technologies, Inc. | Variable width content addressable memory device for searching variable width data |
US6473831B1 (en) * | 1999-10-01 | 2002-10-29 | Avido Systems Corporation | Method and system for providing universal memory bus and module |
US6581191B1 (en) | 1999-11-30 | 2003-06-17 | Synplicity, Inc. | Hardware debugging in a hardware description language |
US6633181B1 (en) | 1999-12-30 | 2003-10-14 | Stretch, Inc. | Multi-scale programmable array |
US6339813B1 (en) | 2000-01-07 | 2002-01-15 | International Business Machines Corporation | Memory system for permitting simultaneous processor access to a cache line and sub-cache line sectors fill and writeback to a system memory |
US6665790B1 (en) | 2000-02-29 | 2003-12-16 | International Business Machines Corporation | Vector register file with arbitrary vector addressing |
US6154419A (en) * | 2000-03-13 | 2000-11-28 | Ati Technologies, Inc. | Method and apparatus for providing compatibility with synchronous dynamic random access memory (SDRAM) and double data rate (DDR) memory |
US6738967B1 (en) * | 2000-03-14 | 2004-05-18 | Microsoft Corporation | Compiling for multiple virtual machines targeting different processor architectures |
US6701424B1 (en) * | 2000-04-07 | 2004-03-02 | Nintendo Co., Ltd. | Method and apparatus for efficient loading and storing of vectors |
US7058750B1 (en) | 2000-05-10 | 2006-06-06 | Intel Corporation | Scalable distributed memory and I/O multiprocessor system |
EP1306751A4 (en) | 2000-06-06 | 2009-05-06 | Tadahiro Ohmi | System for managing circuitry of variable function information processing circuit and method for managing circuitry of variable function information processing circuit |
US6668308B2 (en) * | 2000-06-10 | 2003-12-23 | Hewlett-Packard Development Company, L.P. | Scalable architecture based on single-chip multiprocessing |
US20020100029A1 (en) | 2000-07-20 | 2002-07-25 | Matt Bowen | System, method and article of manufacture for compiling and invoking C functions in hardware |
US6567900B1 (en) * | 2000-08-31 | 2003-05-20 | Hewlett-Packard Development Company, L.P. | Efficient address interleaving with simultaneous multiple locality options |
TW525091B (en) | 2000-10-05 | 2003-03-21 | Koninkl Philips Electronics Nv | Retargetable compiling system and method |
US7233998B2 (en) * | 2001-03-22 | 2007-06-19 | Sony Computer Entertainment Inc. | Computer architecture and software cells for broadband networks |
US7028286B2 (en) | 2001-04-13 | 2006-04-11 | Pts Corporation | Methods and apparatus for automated generation of abbreviated instruction set and configurable processor architecture |
US6684305B1 (en) * | 2001-04-24 | 2004-01-27 | Advanced Micro Devices, Inc. | Multiprocessor system implementing virtual memory using a shared memory, and a page replacement method for maintaining paged memory coherence |
US6662289B1 (en) * | 2001-05-15 | 2003-12-09 | Hewlett-Packard Development Company, Lp. | Method and apparatus for direct conveyance of physical addresses from user level code to peripheral devices in virtual memory systems |
US6978451B2 (en) | 2001-05-31 | 2005-12-20 | Esmertec Ag | Method for fast compilation of preverified JAVA bytecode to high quality native machine code |
WO2002103532A2 (en) * | 2001-06-20 | 2002-12-27 | Pact Xpp Technologies Ag | Data processing method |
US6839828B2 (en) * | 2001-08-14 | 2005-01-04 | International Business Machines Corporation | SIMD datapath coupled to scalar/vector/address/conditional data register file with selective subpath scalar processing mode |
US7134002B2 (en) | 2001-08-29 | 2006-11-07 | Intel Corporation | Apparatus and method for switching threads in multi-threading processors |
US7328195B2 (en) * | 2001-11-21 | 2008-02-05 | Ftl Systems, Inc. | Semi-automatic generation of behavior models continuous value using iterative probing of a device or existing component model |
US7120755B2 (en) | 2002-01-02 | 2006-10-10 | Intel Corporation | Transfer of cache lines on-chip between processing cores in a multi-core system |
US7065631B2 (en) * | 2002-04-09 | 2006-06-20 | Sun Microsystems, Inc. | Software controllable register map |
US6891543B2 (en) | 2002-05-08 | 2005-05-10 | Intel Corporation | Method and system for optimally sharing memory between a host processor and graphics processor |
US6983456B2 (en) | 2002-10-31 | 2006-01-03 | Src Computers, Inc. | Process for converting programs in high-level programming languages to a unified executable for hybrid computing platforms |
US7225324B2 (en) | 2002-10-31 | 2007-05-29 | Src Computers, Inc. | Multi-adaptive processing systems and techniques for enhancing parallelism and performance of computational functions |
US7254696B2 (en) * | 2002-12-12 | 2007-08-07 | Alacritech, Inc. | Functional-level instruction-set computer architecture for processing application-layer content-service requests such as file-access requests |
JP2004220070A (en) | 2003-01-09 | 2004-08-05 | Japan Science & Technology Agency | Context switching method and device, central processing unit, context switching program and computer-readable storage medium storing it |
US6941438B2 (en) * | 2003-01-10 | 2005-09-06 | Intel Corporation | Memory interleaving |
US7228531B1 (en) | 2003-02-03 | 2007-06-05 | Altera Corporation | Methods and apparatus for optimizing a processor core on a programmable chip |
US7000211B2 (en) | 2003-03-31 | 2006-02-14 | Stretch, Inc. | System and method for efficiently mapping heterogeneous objects onto an array of heterogeneous programmable logic resources |
US20040193837A1 (en) * | 2003-03-31 | 2004-09-30 | Patrick Devaney | CPU datapaths and local memory that executes either vector or superscalar instructions |
US7581081B2 (en) | 2003-03-31 | 2009-08-25 | Stretch, Inc. | Systems and methods for software extensible multi-processing |
US7590829B2 (en) | 2003-03-31 | 2009-09-15 | Stretch, Inc. | Extension adapter |
US7073043B2 (en) | 2003-04-28 | 2006-07-04 | International Business Machines Corporation | Multiprocessor system supporting multiple outstanding TLBI operations per partition |
US20040236920A1 (en) * | 2003-05-20 | 2004-11-25 | Sheaffer Gad S. | Methods and apparatus for gathering and scattering data associated with a single-instruction-multiple-data (SIMD) operation |
US7149867B2 (en) | 2003-06-18 | 2006-12-12 | Src Computers, Inc. | System and method of enhancing efficiency and utilization of memory bandwidth in reconfigurable hardware |
US7373642B2 (en) * | 2003-07-29 | 2008-05-13 | Stretch, Inc. | Defining instruction extensions in a standard programming language |
US7421565B1 (en) | 2003-08-18 | 2008-09-02 | Cray Inc. | Method and apparatus for indirectly addressed vector load-add -store across multi-processors |
US7665078B2 (en) * | 2003-08-21 | 2010-02-16 | Gateway, Inc. | Huffman-L compiler optimized for cell-based computers or other computers having reconfigurable instruction sets |
US7200837B2 (en) | 2003-08-21 | 2007-04-03 | Qst Holdings, Llc | System, method and software for static and dynamic programming and configuration of an adaptive computing architecture |
DE10353267B3 (en) | 2003-11-14 | 2005-07-28 | Infineon Technologies Ag | Multithread processor architecture for triggered thread switching without cycle time loss and without switching program command |
US7386703B2 (en) | 2003-11-18 | 2008-06-10 | International Business Machines Corporation | Two dimensional addressing of a matrix-vector register array |
US7188229B2 (en) * | 2004-01-17 | 2007-03-06 | Sun Microsystems, Inc. | Method and apparatus for memory management in a multi-processor computer system |
JP2005216177A (en) * | 2004-01-30 | 2005-08-11 | Toshiba Corp | Configurable processor design apparatus and method, library optimizing method, processor, and method of manufacturing semiconductor device comprising processor |
US7383529B2 (en) | 2004-02-13 | 2008-06-03 | The Regents Of The University Of California | Method and apparatus for designing circuits using high-level synthesis |
US7676800B2 (en) | 2004-02-20 | 2010-03-09 | Intel Corporation | Method and apparatus for reducing the storage overhead of portable executable (PE) images |
US20050223369A1 (en) | 2004-03-31 | 2005-10-06 | Intel Corporation | Method and system for programming a reconfigurable processing element |
US7257757B2 (en) | 2004-03-31 | 2007-08-14 | Intel Corporation | Flexible accelerators for physical layer processing |
US20050262278A1 (en) | 2004-05-20 | 2005-11-24 | Schmidt Dominik J | Integrated circuit with a plurality of host processor family types |
US7278122B2 (en) * | 2004-06-24 | 2007-10-02 | Ftl Systems, Inc. | Hardware/software design tool and language specification mechanism enabling efficient technology retargeting and optimization |
US8095778B1 (en) | 2004-06-30 | 2012-01-10 | Open Computing Trust I & II | Method and system for sharing functional units of a multithreaded processor |
US7546441B1 (en) | 2004-08-06 | 2009-06-09 | Xilinx, Inc. | Coprocessor interface controller |
US7257679B2 (en) | 2004-10-01 | 2007-08-14 | Advanced Micro Devices, Inc. | Sharing monitored cache lines across multiple cores |
US7506325B2 (en) | 2004-10-07 | 2009-03-17 | International Business Machines Corporation | Partitioning processor resources based on memory usage |
US8190809B2 (en) * | 2004-11-23 | 2012-05-29 | Efficient Memory Technology | Shunted interleave for accessing plural memory banks, particularly those having partially accessed cells containing data for cache lines |
US7594102B2 (en) * | 2004-12-15 | 2009-09-22 | Stmicroelectronics, Inc. | Method and apparatus for vector execution on a scalar machine |
US20060259737A1 (en) | 2005-05-10 | 2006-11-16 | Telairity Semiconductor, Inc. | Vector processor with special purpose registers and high speed memory access |
US20070150697A1 (en) | 2005-05-10 | 2007-06-28 | Telairity Semiconductor, Inc. | Vector processor with multi-pipe vector block matching |
US7313673B2 (en) | 2005-06-16 | 2007-12-25 | International Business Machines Corporation | Fine grained multi-thread dispatch block mechanism |
US20070005932A1 (en) | 2005-06-29 | 2007-01-04 | Intel Corporation | Memory management in a multiprocessor system |
US20070005881A1 (en) * | 2005-06-30 | 2007-01-04 | Garney John I | Minimizing memory bandwidth usage in optimal disk transfers |
US7500083B2 (en) * | 2005-08-15 | 2009-03-03 | Silicon Informatics | Accelerated processing with scheduling to configured coprocessor for molecular data type by service and control coprocessor upon analysis of software code |
US7895585B2 (en) | 2005-09-09 | 2011-02-22 | Oracle America, Inc. | Automatic code tuning |
US7624250B2 (en) | 2005-12-05 | 2009-11-24 | Intel Corporation | Heterogeneous multi-core processor having dedicated connections between processor cores |
US20070153907A1 (en) | 2005-12-30 | 2007-07-05 | Intel Corporation | Programmable element and hardware accelerator combination for video processing |
US20070186210A1 (en) | 2006-02-06 | 2007-08-09 | Via Technologies, Inc. | Instruction set encoding in a dual-mode computer processing environment |
US7562739B2 (en) * | 2006-03-16 | 2009-07-21 | Kwang Yang Motor Co., Ltd. | Cooling structure for a continuous variation transmission system of an all-terrain vehicle |
US7849241B2 (en) * | 2006-03-23 | 2010-12-07 | International Business Machines Corporation | Memory compression method and apparatus for heterogeneous processor architectures in an information handling system |
US7543282B2 (en) | 2006-03-24 | 2009-06-02 | Sun Microsystems, Inc. | Method and apparatus for selectively executing different executable code versions which are optimized in different ways |
US8074026B2 (en) | 2006-05-10 | 2011-12-06 | Intel Corporation | Scatter-gather intelligent memory architecture for unstructured streaming data on multiprocessor systems |
US20070283336A1 (en) * | 2006-06-01 | 2007-12-06 | Michael Karl Gschwind | System and method for just-in-time compilation in a heterogeneous processing environment |
US8136102B2 (en) | 2006-06-20 | 2012-03-13 | Google Inc. | Systems and methods for compiling an application for a parallel-processing computer system |
US8136104B2 (en) * | 2006-06-20 | 2012-03-13 | Google Inc. | Systems and methods for determining compute kernels for an application in a parallel-processing computer system |
WO2008014494A2 (en) | 2006-07-28 | 2008-01-31 | Drc Computer Corporation | Fpga co-processor for accelerated computation |
US8196127B2 (en) | 2006-08-04 | 2012-06-05 | International Business Machines Corporation | Pervasively data parallel information handling system and methodology for generating data parallel select operations |
US7508325B2 (en) | 2006-09-06 | 2009-03-24 | Intellectual Ventures Holding 35 Llc | Matching pursuits subband coding of data |
US8370806B2 (en) | 2006-11-15 | 2013-02-05 | Qualcomm Incorporated | Non-intrusive, thread-selective, debugging method and system for a multi-thread digital signal processor |
US7886255B2 (en) | 2007-01-22 | 2011-02-08 | Texas Instruments Incorporated | Method for design of programmable data processors |
US7904703B1 (en) | 2007-04-10 | 2011-03-08 | Marvell International Ltd. | Method and apparatus for idling and waking threads by a multithread processor |
US8561037B2 (en) * | 2007-08-29 | 2013-10-15 | Convey Computer | Compiler for generating an executable comprising instructions for a plurality of different instruction sets |
US9015399B2 (en) | 2007-08-20 | 2015-04-21 | Convey Computer | Multiple data channel memory module architecture |
US8972958B1 (en) | 2012-10-23 | 2015-03-03 | Convey Computer | Multistage development workflow for generating a custom instruction set reconfigurable processor |
US7643353B1 (en) * | 2007-10-25 | 2010-01-05 | Netlogic Microsystems, Inc. | Content addressable memory having programmable interconnect structure |
US7904850B2 (en) | 2007-11-30 | 2011-03-08 | Cebatech | System and method for converting software to a register transfer (RTL) design |
US7984273B2 (en) * | 2007-12-31 | 2011-07-19 | Intel Corporation | System and method for using a mask register to track progress of gathering elements from memory |
US7804735B2 (en) | 2008-02-29 | 2010-09-28 | Qualcomm Incorporated | Dual channel memory architecture having a reduced interface pin requirements using a double data rate scheme for the address/control signals |
WO2009151934A1 (en) | 2008-05-24 | 2009-12-17 | Tabula, Inc. | Decision modules |
US8050173B2 (en) * | 2008-07-01 | 2011-11-01 | Broadcom Corporation | Dynamic precision for datapath modules |
US7979450B2 (en) | 2008-09-15 | 2011-07-12 | Xsevo Systems, Inc. | Instance management of code in a database |
US8327325B2 (en) | 2009-01-14 | 2012-12-04 | International Business Machines Corporation | Programmable framework for automatic tuning of software applications |
JP5463076B2 (en) | 2009-05-28 | 2014-04-09 | パナソニック株式会社 | Multithreaded processor |
US8484588B2 (en) | 2010-07-13 | 2013-07-09 | Algo to Chip Corporation | System, architecture and micro-architecture (SAMA) representation of an integrated circuit |
WO2012019111A2 (en) | 2010-08-06 | 2012-02-09 | Frederick Furtek | A method and apparatus for a compiler and related components for stream-based computations for a general-purpose, multiple-core system |
US9552206B2 (en) | 2010-11-18 | 2017-01-24 | Texas Instruments Incorporated | Integrated circuit with control node circuitry and processing circuitry |
US8726253B2 (en) | 2011-01-25 | 2014-05-13 | Micron Technology, Inc. | Method and apparatus for compiling regular expressions |
US9069553B2 (en) | 2011-09-06 | 2015-06-30 | Marvell World Trade Ltd. | Switching tasks between heterogeneous cores |
-
2008
- 2008-01-04 US US11/969,792 patent/US9710384B2/en active Active
- 2008-12-17 WO PCT/US2008/087233 patent/WO2009088682A1/en active Application Filing
-
2017
- 2017-05-16 US US15/596,649 patent/US11106592B2/en active Active
-
2021
- 2021-08-08 US US17/396,716 patent/US20210365381A1/en not_active Abandoned
Patent Citations (71)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4386399A (en) * | 1980-04-25 | 1983-05-31 | Data General Corporation | Data processing system |
US4504902A (en) * | 1982-03-25 | 1985-03-12 | At&T Bell Laboratories | Cache arrangement for direct memory access block transfer |
US4897783A (en) * | 1983-03-14 | 1990-01-30 | Nay Daniel L | Computer memory system |
US4669043A (en) * | 1984-02-17 | 1987-05-26 | Signetics Corporation | Memory access controller |
US4875161A (en) * | 1985-07-31 | 1989-10-17 | Unisys Corporation | Scientific processor vector file organization |
US5239643A (en) * | 1987-11-30 | 1993-08-24 | International Business Machines Corporation | Method for reducing disk I/O accesses in a multi-processor clustered type data processing system |
US4888679A (en) * | 1988-01-11 | 1989-12-19 | Digital Equipment Corporation | Method and apparatus using a cache and main memory for both vector processing and scalar processing by prefetching cache blocks including vector data elements |
US5097437A (en) * | 1988-07-17 | 1992-03-17 | Larson Ronald J | Controller with clocking device controlling first and second state machine controller which generate different control signals for different set of devices |
US5202969A (en) * | 1988-11-01 | 1993-04-13 | Hitachi, Ltd. | Single-chip-cache-buffer for selectively writing write-back and exclusively writing data-block portions to main-memory based upon indication of bits and bit-strings respectively |
US5222224A (en) * | 1989-02-03 | 1993-06-22 | Digital Equipment Corporation | Scheme for insuring data consistency between a plurality of cache memories and the main memory in a multi-processor system |
US5283886A (en) * | 1989-08-11 | 1994-02-01 | Hitachi, Ltd. | Multiprocessor cache system having three states for generating invalidating signals upon write accesses |
US20040267970A1 (en) * | 1989-11-03 | 2004-12-30 | Jirgal James J. | Parallel port with direct memory access capabilities |
US5935204A (en) * | 1989-11-08 | 1999-08-10 | Fujitsu Limited | System for a multi-processor system wherein each processor transfers a data block from cache if a cache hit and from main memory only if cache miss |
US5197140A (en) * | 1989-11-17 | 1993-03-23 | Texas Instruments Incorporated | Sliced addressing multi-processor and method of operation |
US5357521A (en) * | 1990-02-14 | 1994-10-18 | International Business Machines Corporation | Address sensitive memory testing |
US5261066A (en) * | 1990-03-27 | 1993-11-09 | Digital Equipment Corporation | Data processing system and method with small fully-associative cache and prefetch buffers |
US5838946A (en) * | 1990-04-14 | 1998-11-17 | Sun Microsystems, Inc. | Method and apparatus for accomplishing processor read of selected information through a cache memory |
US5450564A (en) * | 1990-05-04 | 1995-09-12 | Unisys Corporation | Method and apparatus for cache memory access with separate fetch and store queues |
US5357618A (en) * | 1991-04-15 | 1994-10-18 | International Business Machines Corporation | Cache prefetch and bypass using stride registers |
US5293603A (en) * | 1991-06-04 | 1994-03-08 | Intel Corporation | Cache subsystem for microprocessor based computer system with synchronous and asynchronous data path |
US5499355A (en) * | 1992-03-06 | 1996-03-12 | Rambus, Inc. | Prefetching into a cache to minimize main memory access time and cache size in a computer system |
US5418973A (en) * | 1992-06-22 | 1995-05-23 | Digital Equipment Corporation | Digital computer system with cache controller coordinating both vector and scalar operations |
US5749089A (en) * | 1994-01-31 | 1998-05-05 | Fujitsu Limited | Cache-memory system having multidimensional spread cache |
US6041401A (en) * | 1994-10-14 | 2000-03-21 | Compaq Computer Corporation | Computer system that places a cache memory into low power mode in response to special bus cycles executed on the bus |
US6209067B1 (en) * | 1994-10-14 | 2001-03-27 | Compaq Computer Corporation | Computer system controller and method with processor write posting hold off on PCI master memory request |
US20020059540A1 (en) * | 1995-10-24 | 2002-05-16 | Seachange Technology, Inc. | Loosley coupled mass storage computer cluster |
US5724533A (en) * | 1995-11-17 | 1998-03-03 | Unisys Corporation | High performance instruction data path |
US6342892B1 (en) * | 1995-11-22 | 2002-01-29 | Nintendo Co., Ltd. | Video game system and coprocessor for video game system |
US5924117A (en) * | 1996-12-16 | 1999-07-13 | International Business Machines Corporation | Multi-ported and interleaved cache memory supporting multiple simultaneous accesses thereto |
US20020135583A1 (en) * | 1997-08-22 | 2002-09-26 | Sony Computer Entertainment Inc. | Information processing apparatus for entertainment system utilizing DMA-controlled high-speed transfer and processing of routine data |
US20010004753A1 (en) * | 1998-04-28 | 2001-06-21 | International Business Machines Corporation | Address re-mapping for memory module using presence detect data |
US6058056A (en) * | 1998-04-30 | 2000-05-02 | Micron Technology, Inc. | Data compression circuit and method for testing memory devices |
US20020013892A1 (en) * | 1998-05-26 | 2002-01-31 | Frank J. Gorishek | Emulation coprocessor |
US6308255B1 (en) * | 1998-05-26 | 2001-10-23 | Advanced Micro Devices, Inc. | Symmetrical multiprocessing bus and chipset used for coprocessor support allowing non-native code to run in a system |
US6480952B2 (en) * | 1998-05-26 | 2002-11-12 | Advanced Micro Devices, Inc. | Emulation coprocessor |
US6243791B1 (en) * | 1998-08-13 | 2001-06-05 | Hewlett-Packard Company | Method and architecture for data coherency in set-associative caches including heterogeneous cache sets having different characteristics |
US6401192B1 (en) * | 1998-10-05 | 2002-06-04 | International Business Machines Corporation | Apparatus for software initiated prefetch and method therefor |
US6473777B1 (en) * | 1998-10-30 | 2002-10-29 | National Semiconductor Corporation | Method for accelerating java virtual machine bytecode verification, just-in-time compilation and garbage collection by using a dedicated co-processor |
US6510164B1 (en) * | 1998-11-16 | 2003-01-21 | Sun Microsystems, Inc. | User-level dedicated interface for IP applications in a data packet switching and load balancing system |
US6507894B1 (en) * | 1998-12-10 | 2003-01-14 | Nec Corporation | Information processing apparatus and process |
US20020144061A1 (en) * | 1998-12-31 | 2002-10-03 | Cray Inc. | Vector and scalar data cache for a vector multiprocessor |
US6496902B1 (en) * | 1998-12-31 | 2002-12-17 | Cray Inc. | Vector and scalar data cache for a vector multiprocessor |
US6665749B1 (en) * | 1999-08-17 | 2003-12-16 | Nec Electronics, Inc. | Bus protocol for efficiently transferring vector data |
US6868472B1 (en) * | 1999-10-01 | 2005-03-15 | Fujitsu Limited | Method of Controlling and addressing a cache memory which acts as a random address memory to increase an access speed to a main memory |
US6430103B2 (en) * | 2000-02-03 | 2002-08-06 | Hitachi, Ltd. | Semiconductor integrated circuit device with memory banks and read buffer capable of storing data read out from one memory bank when data of another memory bank is outputting |
US7886129B2 (en) * | 2000-12-29 | 2011-02-08 | Mips Technologies, Inc. | Configurable co-processor interface |
US20020099907A1 (en) * | 2001-01-19 | 2002-07-25 | Vittorio Castelli | System and method for storing data sectors with header and trailer information in a disk cache supporting memory compression |
US6751700B2 (en) * | 2001-02-21 | 2004-06-15 | 3Com Corporation | Date processor and storage system including a set associative cache with memory aliasing |
US20040210642A1 (en) * | 2001-06-11 | 2004-10-21 | Adisak Mekkittikul | Method and system for caching data in a network node |
US7577822B2 (en) * | 2001-12-14 | 2009-08-18 | Pact Xpp Technologies Ag | Parallel task operation in processor and reconfigurable coprocessor configured based on information in link list including termination information for synchronization |
US6789167B2 (en) * | 2002-03-06 | 2004-09-07 | Hewlett-Packard Development Company, L.P. | Method and apparatus for multi-core processor integrated circuit having functional elements configurable as core elements and as system device elements |
US7376812B1 (en) * | 2002-05-13 | 2008-05-20 | Tensilica, Inc. | Vector co-processor for configurable and extensible processor architecture |
US20030226018A1 (en) * | 2002-05-31 | 2003-12-04 | Broadcom Corporation | Data transfer efficiency in a cryptography accelerator system |
US20040019762A1 (en) * | 2002-07-25 | 2004-01-29 | Hitachi, Ltd. | Semiconductor integrated circuit |
US7434029B2 (en) * | 2002-07-31 | 2008-10-07 | Texas Instruments Incorporated | Inter-processor control |
US7360060B2 (en) * | 2002-07-31 | 2008-04-15 | Texas Instruments Incorporated | Using IMPDEP2 for system commands related to Java accelerator hardware |
US20040088524A1 (en) * | 2002-07-31 | 2004-05-06 | Texas Instruments Incorporated | Inter-processor control |
US20040068622A1 (en) * | 2002-10-03 | 2004-04-08 | Van Doren Stephen R. | Mechanism for resolving ambiguous invalidates in a computer system |
US20040153610A1 (en) * | 2003-01-31 | 2004-08-05 | Hua-Chang Chi | Cache controller unit architecture and applied method |
US20070204107A1 (en) * | 2004-02-24 | 2007-08-30 | Analog Devices, Inc. | Cache memory background preprocessing |
US20050198442A1 (en) * | 2004-03-02 | 2005-09-08 | Mandler Alberto R. | Conditionally accessible cache memory |
US20080215854A1 (en) * | 2004-06-30 | 2008-09-04 | Asaad Sameh W | System and Method for Adaptive Run-Time Reconfiguration for a Reconfigurable Instruction Set Co-Processor Architecture |
US20060224861A1 (en) * | 2005-04-01 | 2006-10-05 | Arm Limited | Condition branch instruction encoding within a multiple instruction set data processing system |
US20070101096A1 (en) * | 2005-10-27 | 2007-05-03 | Sandisk Corporation | Non-volatile memory with adaptive handling of data writes |
US20070226424A1 (en) * | 2006-03-23 | 2007-09-27 | International Business Machines Corporation | Low-cost cache coherency for accelerators |
US20080209127A1 (en) * | 2007-02-23 | 2008-08-28 | Daniel Alan Brokenshire | System and method for efficient implementation of software-managed cache |
US8156307B2 (en) * | 2007-08-20 | 2012-04-10 | Convey Computer | Multi-processor system having at least one processor that comprises a dynamically reconfigurable instruction set |
US8122229B2 (en) * | 2007-09-12 | 2012-02-21 | Convey Computer | Dispatch mechanism for dispatching instructions from a host processor to a co-processor |
US20090177843A1 (en) * | 2008-01-04 | 2009-07-09 | Convey Computer | Microprocessor architecture having alternative memory access paths |
US20100037024A1 (en) * | 2008-08-05 | 2010-02-11 | Convey Computer | Memory interleave for heterogeneous computing |
US8205066B2 (en) * | 2008-10-31 | 2012-06-19 | Convey Computer | Dynamically configured coprocessor for different extended instruction set personality specific to application program with shared memory storing instructions invisibly dispatched from host processor |
Also Published As
Publication number | Publication date |
---|---|
US20090177843A1 (en) | 2009-07-09 |
US20170249253A1 (en) | 2017-08-31 |
US9710384B2 (en) | 2017-07-18 |
US11106592B2 (en) | 2021-08-31 |
WO2009088682A1 (en) | 2009-07-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20210365381A1 (en) | Microprocessor architecture having alternative memory access paths | |
US11921635B2 (en) | Method and apparatus for shared virtual memory to manage data coherency in a heterogeneous processing system | |
Hao et al. | Supporting address translation for accelerator-centric architectures | |
US10365930B2 (en) | Instructions for managing a parallel cache hierarchy | |
US8443147B2 (en) | Memory interleave for heterogeneous computing | |
US8205066B2 (en) | Dynamically configured coprocessor for different extended instruction set personality specific to application program with shared memory storing instructions invisibly dispatched from host processor | |
US9513904B2 (en) | Computer processor employing cache memory with per-byte valid bits | |
EP0734553B1 (en) | Split level cache | |
US11436695B2 (en) | Coarse grain coherency | |
US9218289B2 (en) | Multi-core compute cache coherency with a release consistency memory ordering model | |
US5249286A (en) | Selectively locking memory locations within a microprocessor's on-chip cache | |
US20100115233A1 (en) | Dynamically-selectable vector register partitioning | |
US20220244957A1 (en) | Cache Preload Operations Using Streaming Engine | |
US20210406014A1 (en) | Cache management operations using streaming engine | |
US9971699B2 (en) | Method to control cache replacement for decoupled data fetch | |
EP0459233A2 (en) | Selectively locking memory locations within a microprocessor's on-chip cache | |
US8108621B2 (en) | Data cache with modified bit array |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: ADVISORY ACTION MAILED |