CA2473548A1 - Data transfer mechanism - Google Patents
Data transfer mechanism Download PDFInfo
- Publication number
- CA2473548A1 CA2473548A1 CA002473548A CA2473548A CA2473548A1 CA 2473548 A1 CA2473548 A1 CA 2473548A1 CA 002473548 A CA002473548 A CA 002473548A CA 2473548 A CA2473548 A CA 2473548A CA 2473548 A1 CA2473548 A1 CA 2473548A1
- Authority
- CA
- Canada
- Prior art keywords
- context
- data
- memory
- agent
- programming
- 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
- 238000012546 transfer Methods 0.000 title claims description 46
- 230000007246 mechanism Effects 0.000 title description 2
- 238000012545 processing Methods 0.000 claims abstract description 44
- 238000000034 method Methods 0.000 claims abstract description 29
- 230000008569 process Effects 0.000 claims description 14
- 230000006870 function Effects 0.000 claims description 6
- 230000003068 static effect Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims 4
- 239000003795 chemical substances by application Substances 0.000 description 4
- 241001522296 Erithacus rubecula Species 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- UDHXJZHVNHGCEC-UHFFFAOYSA-N Chlorophacinone Chemical compound C1=CC(Cl)=CC=C1C(C=1C=CC=CC=1)C(=O)C1C(=O)C2=CC=CC=C2C1=O UDHXJZHVNHGCEC-UHFFFAOYSA-N 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
- G06F9/3824—Operand accessing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
- G06F9/3836—Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution
- G06F9/3851—Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution from multiple instruction streams, e.g. multistreaming
Abstract
A method for transferring data between programming agents and memory resources. The method includes transferring data between a processing agent and a memory resource, designating the memory resource for pushing the data to the processing agent via a push bus having a plurality of sources that arbitrate use of the push bus, and designating the memory resource for receiving the data from the processing agent via a pull bus having a plurali ty of destinations that arbitrate use of the pull bus.
Description
DATA TRANSFER MECHANISM
BACKGROUND
Typical computer processing systems have buses that enable various components to communicate with each other.
Bus communication between these components allow transfer of data commonly through a data path. Generally, the datapath interconnects a processing agent, e.g., a central processing unit (CPU) or processor, with other components such as hard disk drives, device adapters, and the like.
BRIEF DESCRIPTION OF THE DRAT~VINGS
FIG. 1 is a block diagram of a processing system.
FIG. 2 is a detailed block diagram of the processing system of FIG. 1.
FIG. 3 is a flow chart of a read process in the processing system of FIG. 1.
FIG. 4 is a flow chart of a write process in the processing system of FIG. 1.
FIG. 5 is a flow chart of a push operation of the processing system of FIG. 1.
FIG. 6 is a flow chart of a pull operation of the processing system of FIG. 1.
DESCRIPTION
Architecture:
Referring to FIG. 1, a computer processing system 10 includes a parallel, hardware-based multithreaded network processor 12. The hardware-based multithreaded processor 12 is coupled to a memory system or memory resource 14. Memory system 14 includes dynamic random access memory (DRAM) 14a and static random access memory 14b (SRAM). The processing system 10 is especially useful for tasks that can be broken into parallel subtasks or functions. Specifically, the hardware-based multithreaded processor 12 is useful for tasks that are bandwidth oriented rather than latency oriented. The hardware-based multithreaded processor 12 has multiple microengines or programming engines 16 each with multiple hardware controlled threads that are simultaneously active and independently work on a specific task.
The programming engines 16 each maintain program counters in hardware and states associated with the program counters. Effectively, corresponding sets of context or threads can be simultaneously active on each of the programming engines 16 while only one is actually operating at any one time.
In this example, eight programming engines 16 are illustrated in FIG. 1. Each programming engine 16 has capabilities for processing eight hardware threads or contexts. The eight programming engines 16 operate with shared resources including memory resource 14 and bus interfaces. The hardware-based multithreaded processor 12 includes a dynamic random access memory (DRAM) controller 18a and a static random access memory (SRAM) controller 18b.
The DRAM memory 14a and DRAM controller 18a are typically used for processing large volumes of data, e.g., processing of network payloads from network packets. The SRAM memory 14b and SRAM controller 18b are used in a networking implementation for low latency, fast access tasks, e.g., accessing look-up tables, memory for the core processor 20, and the like.
Push buses 26a-26b and pull buses 28a-28b are used to transfer data between the programming engines 16 and the DRAM memory 14a and the SRAM memory 14b. In particular, the push buses 26a-26b are unidirectional buses that move the data from the memory resources 14 to the programming engines 16 whereas the pull buses 28a-28b move data from the programming engines 16 to the memory resources 14.
The eight programming engines 16 access either the DRAM
memory 14a or SRAM memory 14b based on characteristics of the data. Thus, low latency, low bandwidth data are stored in and fetched from SRAM memory 14b, whereas higher bandwidth data for which latency is not as important, are stored in and fetched from DRAM 14a. The programming engines 16 can execute memory reference instructions to either the DRAM controller 18a or SRAM controller 18b.
The hardware-based multithreaded processor 12 also includes a processor core 20 for loading microcode control for other resources of the hardware-based multithreaded processor 12. In this example, the processor core 20 is an XScaleT"" based architecture .
The processor core 20 performs general purpose computer type functions such as handling protocols, exceptions, and extra support for packet processing where the programming engines 16 pass the packets off for more detailed processing such as in boundary conditions. The processor core 20 has an operating system (not shown). Through the operating system (OS), the processor core 20 can call functions to operate on programming engines 16. The processor core 20 can use any supported OS, in particular a real time OS. For the core processor 20 implemented as an XScaleT""
architecture, operating systems such as Microsoft NT real-time, VXWorks and ~COS, or a freeware OS available over the Internet can be used.
Advantages of hardware multithreading can be explained by SRAM or DRAM memory accesses. As an example, an SRAM
access requested by a context (e.g., Thread-0), from one of the programming engines 16 will cause the SRAM controller 18b to initiate an access to the SRAM memory 14b. The SRAM
controller 18b accesses the SRAM memory 14b, fetches the data from the SRAM memory 14b, and returns data to a requesting programming engine 16.
During an SRAM access, if one of the programming engines 16 had only a single thread that could operate, that programming engine would be dormant until data was returned from the SRAM memory 14b.
By employing hardware context swapping within each of the programming engines 16, the hardware context swapping enables other contexts with unique program counters to execute in that same programming engine. Thus, another thread e.g., Thread-1 can function while the first thread, Thread 0, is awaiting the read data to return. During execution, Thread 1 may access the DRAM memory 14a. While Thread_1 operates on the DRAM unit, and Thread-0 is operating on the SRAM unit, a new thread, e.g., Thread 2 can now operate in the programming engine 16. Thread 2 can operate for a certain amount of time until it needs to access memory or perform some other long latency operation, such as making an access to a bus interface. Therefore, simultaneously, the processor 12 can have a bus operation, SRAM operation and DRAM operation all being completed or operated upon by one of the programming engines 16 and have one more thread available to process more work.
The hardware context swapping also synchronizes completion of tasks. For example, two threads could hit the shared memory resource, e.g., the SRAM memory 14b. Each one of the separate functional units, e.g., the SRAM controller 18b, and the DRAM controller 18a, when they complete a requested task from one of the programming engine thread or contexts reports back a flag signaling completion of an operation. When the programming engine 16 receives the flag, the programming engine 16 can determine which thread to turn on.
One example of an application for the hardware-based multithreaded processor 12 is as a network processor. As a network processor, the hardware-based multithreaded processor 12 interfaces to network devices such as a Media Access Controller (MAC) device, e.g., a 10/100BaseT Octal MAC 13a or a Gigabit Ethernet device (not shown). In general, as a network processor, the hardware-based multithreaded processor 12 can interface to any type of communication device or interface that receives or sends large amount of data. The computer processing system 10 functioning in a networking application could receive network packets and process those packets in a parallel manner.
Programming Engine Contexts:
As described above, each of the programming engines 16 supports mufti-threaded execution of eight contexts. This allows one thread to start executing just after another thread issues a memory reference and must wait until that reference completes before doing more work. Mufti-threaded s execution is critical to maintaining efficient hardware execution of the programming engines 16 because memory latency is significant. Multi-threaded execution allows the programming engines 16 to hide memory latency by performing useful independent work across several threads.
Each of the eight contexts of the programming engines 16, to allow for efficient context swapping, has its own register set, program counter, and context specific local registers. Having a copy per context eliminates the need to move context specific information to and from shared memory and programming engine registers for each context swap.
Fast context swapping allows a context to perform computations while other contexts wait for input-output (I/O), typically, external memory accesses to complete or for a signal from another context or hardware unit.
For example, the programming engines 16 execute eight contexts by maintaining eight program counters and eight context relative sets of registers. A number of different types of context relative registers, such as general purposee registers (GPRs), inter-programming agent registers, Static Random Access Memory (SRAM) input transfer registers, Dynamic Random Access Memory (DRAM) input transfer registers, SRAM output transfer registers, DRAM output transfer registers. Local memory registers can also be used.
For example, GPRs are used for general programming purposes. GPRs are read and written exclusively under program control. The GPRs, when used as a source in an instruction, supply operands to an execution datapath (not shown). When used as a destination in an instruction, the GPRs are written with the result of the execution box datapath. The programming engines 16 also include IO
transfer registers as discussed above. The IO transfer registers are used for transferring data to and from the programming engines 16 and locations external to the programming engines 16, e.g., the DRAM memory 14a and the SRAM memory 14b etc.
Bus Architecture:
Referring to FIG. 2, the hardware-based multithreaded processor 12 is shown in greater detail. The DRAM memory 14a and the SRAM memory 14b are connected to the DRAM memory controller 18a and the SRAM memory 18b, respectively. The DRAM controller 18a is coupled to a pull bus arbiter 30a and a push bus arbiter 32a, which are coupled to a programming engines 16a. The SRAM controller 18b is coupled to a pull bus arbiter 30b and a push bus arbiter 32b, which are coupled to a programming engine 16b. Buses 26a-26b and 28a-28b make up the major buses for transferring data between the programming engines 16a-16b and the DRAM memory 14a and the SRAM memory 14b. Any thread from any of the programming engines 16a-16b can access the DRAM controller 18a and the SRAM controller 18a.
In particular, the push buses 26a-26b have multiple sources of memory such as memory controller channels and internal read registers (not shown) which arbitrate via the push arbiters 32a-32b to use the push buses 26a-26b. The destination (e. g., programming engine 16) of any push data transfer recognizes when the data is being "pushed" into it by decoding the Push-ID, which is driven or sent with the push data. The pull buses 28a-28b also have multiple destinations (e. g., writing data to different memory controller channels or writeable internal registers) that arbitrate to use the pull buses 28a-28b. The pull buses 28a-28b have a Pull ID, which is driven or sent, for example, two cycles before the pull data.
Data functions are distributed amongst the programming engines 16. Connectivity to the DRAM memory 14a and the SRAM memory 14b is performed via command requests. A
command request can be a memory request. For example, a command request can move data from a register located in the programming engine 16a to a shared resource, e.g., the DRAM
memory 14a, SRAM memory 14b. The commands or requests are sent out to each of the functional units and the shared resources. Commands such as I/O commands (e. g., SRAM read, SRAM write, DRAM read, DRAM write, load data from a receive memory buffer, move data to a transmit memory buffer) specify either context relative source or destination registers in the programming engines 16.
In general, the data transfers between programming engines and memory resources designate the memory resource for pushing the data to a processing agent via the push bus having a plurality of sources that arbitrate use of the push bus, and designate the memory resource for receiving the data from the processing agent via the pull bus having a plurality of destinations that arbitrate use of the pull bus.
Read Process:
Referring to FIG. 3, a data read process 50 is executed during a read phase of the programming engines 16 by the push buses 26a-26b. As part of the read process 50 the programming engine executes (52) a context. The programming engine 16 issues (54) a read command to the memory controllers 18a-18b, and the memory controllers 18a-18b processes (56) the request for one of the memory resources, i.e., the DRAM memory 14a or the SRAM memory 14b. For read commands, after the read command is issued (54), the programming engines 16 check (58) if the read data is required to continue the program context. If the read data is required to continue the program context or thread, the context is swapped out (60). The programming engine 16 checks (62) to ensure that the memory controllers 18a-18b have finished the request. When the memory controllers have to finished the request, the context is swapped back in (64).
If the request is not required to continue the execution of the context, the programming engine 16 checks (68) if the memory controllers 18a-18b have finished the request. If the memory controllers 18a-18b have not finished the request, a loop back occurs and further checks (58) take place. If the memory controllers 18a-18b have finished the request, when the read data has been acquired from the memory resources, the memory controllers 18a-18b push (70) the data into the context relative input transfer register specified by the read command. The memory controller sets a signal in the programming engine 16 that enables the context that issued the read to become active.
The programming engine 16 reads (72) the requested data in the input transfer register and continues (74) the execution of the context.
Write Process:
Referring to FIG. 4, a data write process 80 is executed during a write phase of the programming engines 16 by the pull buses 28a-28b. During the write process 80 the programming engine executes (82) a context. The programming engine 16 loads (84) the data into the output transfer register and issues (86) a write command or request to the memory controllers 18a-18b. The output transfer register is set (88) to a read-only state. For write commands from the programming engines 16, after the output transfer register is set (88) to a read-only state, the programming engine 16 checks (90) if the request is required to continue the program context or thread. If yes, the context is swapped out ( 92 ) .
If the write request is not required to continue the program context or thread, the memory controllers 18a-18b extracts or pulls (94) the data from the output transfer registers and signals (96) to the programming engines 16 to unlock the output transfer registers. The programming engine 16 then checks (98) if the context was swapped out.
If so, the context is swapped back (100) and if not, the programming engine 16 continues (102) the execution of the context. Thus, the signaled context .can reuse the output transfer registers. The signal may also be used to enable the context to go active if it swapped out (100) on the write command.
Data Push Operation:
Referring to FIG. 5, a data push operation 110 that occurs in the push buses 26a-26b of the computer processing system 10, is shown in different processing cycles, e.g., cycle 0 through cycle 5. Each target, e.g., the DRAM memory 14a or the SRAM memory 14b, sends or drives (112) a Target #-Push-ID to the push arbiters where the # indicates the number of different contexts such a.s context #0 through context #7. The Target #_Push-ID is derived from the read command and a data error bit (e. g., the numbers following the target represent the source address incrementing in the Push ID) for information it would like to push to the push arbiters 32a-32b. For Push IDs, each letter indicates a push operation to a particular destination. A Push ID
destination of "none" indicates that the Push ID is null.
The target also sends the Target-#_Push Data to the Push Arbiter.
The Push ID and Push Data are registered (114) and enqueued (116) into first-in, first-outs (FIFOs) in the push arbiters 32a-32b unless the Target #_Push Q-Full signal is asserted. This signal indicates that the Push_ID and Push Data FIFOs for that specific target are almost full in the push arbiters 32a-32b. In this case, the push arbiters 32a-32b have not registered a Push-ID or Push Data and the target does not change it. The channel changes the Push-ID
and Push Data that is taken by the push arbiters 32a-32b to those for the next word transfer or to null if it has no other valid transfer. Due to latency in the Push Q Full signal, the push arbiters 32a-32b should accommodate the worst case number of in-flight Push-IDs and Push Data per target.
The push arbiters 32a-32b will arbitrate (118) every cycle between all valid Push-IDs and send intermediate Push ID. The arbitration policy can be round robin, a priority scheme or even programmable. Multiple pushes. of data from the push arbiters 32a-32b to the destination are not guaranteed to be in consecutive cycles. The push arbiters 32a-32b send (12) intermediate Push Data and Push ID is forwarded (120) to the destination. It is up to the target to update the destination address of each Push-ID
it issues for each word of data it wishes to push. The Push Data is forwarded (122) to the destination. At the destination, the time from the destination getting the Push ID to the destination getting Push Data is fixed by one processing Cycle.
Data Pull Operation:
Referring to FIG. 6, a data pull operation 130 that occurs in the pull buses 28a-28b of the computer processing system 10, is shown in different processing cycles (e. g., cycle 0 through cycle 7). Each target, e.g., the DRAM
memory 14a or the SRAM memory 14b, sends or drives (132) the full Target # Pull-ID (i.e., the numbers following the target represents the source address incrementing in the Pull ID) and length (derived from the write command) for information it would like to pull to the target. For Pull IDs, each letter indicates a pull operation from a particular source, e.g., the memory resource 14. A Pull_ID
source of "none" indicates that the Pull ID is null. The target must have buffer space available for the pull data when it asserts its Pull ID.
The Pull ID is registered (134) and enqueued (136) into fist-in, first-outs (FIFO) in the pull arbiters 30a-30b, unless the Target #-Pull Q Full signal is asserted. This signal indicates that the Pull-ID queue for that specific target is almost full in the pull arbiters 30a-30b. In this case, the pull arbiters 30a-30b have not registered the Pull ID and the target does not change it. The target changes a Pull-ID that is taken by the pull arbiters 30a-30b to that for the next burst transfer or to null if it has no other valid Pull ID. Due to latency in the Pull Q-Full signal, the pull arbiters 30a-30b should accommodate the worst case number of in-flight Pull-IDs per target.
The pull arbiters 30a-30b arbitrate (138) every cycle among the currently valid Pull-IDs. The arbitration policy can be round robin, a priority scheme or even programmable.
The pull arbiters 30a-30b forwards (140) the selected Pull ID to the source. The time from the pull arbiters 30a-30b sending the Pull-ID to the source providing data is fixed in three processing cycles. The pull arbiters 30a-30b update the "source address" field of the Pull-ID for each new data item. The Pull Data is pulled (142) from the source and sent to the targets.
The pull arbiters 30a-30b also assert (146) a Target # Take Data to the selected target. This signal is asserted for each cycle a valid word of data is sent to the target. However, the assertions are not guaranteed to be on consecutive processing cycles. The pull arbiters 30a-30b only assert at most one Target # Take Data signal at a time.
For transfers between targets and masters with different bus widths, the pull arbiters 30a-30b are required to do the adjusting. For example, the DRAM controller 18b may accept eight bytes of data per processing cycle but the programming engine 16 may only deliver four bytes per cycle.
In this case, the pull arbiters 30a-30b can be used to accept four bytes per processing cycle, merge and pack them into eight bytes, and send the data to the DRAM controller 18a.
Other Embodiments:
It is to be understood that while the example above has been described in conjunction with the detailed description thereof, the foregoing description is intended to illustrate and not limit the scope of the invention, which is defined by the scope of the appended claims. Other aspects, advantages, and modifications are within the scope of the following claims.
BACKGROUND
Typical computer processing systems have buses that enable various components to communicate with each other.
Bus communication between these components allow transfer of data commonly through a data path. Generally, the datapath interconnects a processing agent, e.g., a central processing unit (CPU) or processor, with other components such as hard disk drives, device adapters, and the like.
BRIEF DESCRIPTION OF THE DRAT~VINGS
FIG. 1 is a block diagram of a processing system.
FIG. 2 is a detailed block diagram of the processing system of FIG. 1.
FIG. 3 is a flow chart of a read process in the processing system of FIG. 1.
FIG. 4 is a flow chart of a write process in the processing system of FIG. 1.
FIG. 5 is a flow chart of a push operation of the processing system of FIG. 1.
FIG. 6 is a flow chart of a pull operation of the processing system of FIG. 1.
DESCRIPTION
Architecture:
Referring to FIG. 1, a computer processing system 10 includes a parallel, hardware-based multithreaded network processor 12. The hardware-based multithreaded processor 12 is coupled to a memory system or memory resource 14. Memory system 14 includes dynamic random access memory (DRAM) 14a and static random access memory 14b (SRAM). The processing system 10 is especially useful for tasks that can be broken into parallel subtasks or functions. Specifically, the hardware-based multithreaded processor 12 is useful for tasks that are bandwidth oriented rather than latency oriented. The hardware-based multithreaded processor 12 has multiple microengines or programming engines 16 each with multiple hardware controlled threads that are simultaneously active and independently work on a specific task.
The programming engines 16 each maintain program counters in hardware and states associated with the program counters. Effectively, corresponding sets of context or threads can be simultaneously active on each of the programming engines 16 while only one is actually operating at any one time.
In this example, eight programming engines 16 are illustrated in FIG. 1. Each programming engine 16 has capabilities for processing eight hardware threads or contexts. The eight programming engines 16 operate with shared resources including memory resource 14 and bus interfaces. The hardware-based multithreaded processor 12 includes a dynamic random access memory (DRAM) controller 18a and a static random access memory (SRAM) controller 18b.
The DRAM memory 14a and DRAM controller 18a are typically used for processing large volumes of data, e.g., processing of network payloads from network packets. The SRAM memory 14b and SRAM controller 18b are used in a networking implementation for low latency, fast access tasks, e.g., accessing look-up tables, memory for the core processor 20, and the like.
Push buses 26a-26b and pull buses 28a-28b are used to transfer data between the programming engines 16 and the DRAM memory 14a and the SRAM memory 14b. In particular, the push buses 26a-26b are unidirectional buses that move the data from the memory resources 14 to the programming engines 16 whereas the pull buses 28a-28b move data from the programming engines 16 to the memory resources 14.
The eight programming engines 16 access either the DRAM
memory 14a or SRAM memory 14b based on characteristics of the data. Thus, low latency, low bandwidth data are stored in and fetched from SRAM memory 14b, whereas higher bandwidth data for which latency is not as important, are stored in and fetched from DRAM 14a. The programming engines 16 can execute memory reference instructions to either the DRAM controller 18a or SRAM controller 18b.
The hardware-based multithreaded processor 12 also includes a processor core 20 for loading microcode control for other resources of the hardware-based multithreaded processor 12. In this example, the processor core 20 is an XScaleT"" based architecture .
The processor core 20 performs general purpose computer type functions such as handling protocols, exceptions, and extra support for packet processing where the programming engines 16 pass the packets off for more detailed processing such as in boundary conditions. The processor core 20 has an operating system (not shown). Through the operating system (OS), the processor core 20 can call functions to operate on programming engines 16. The processor core 20 can use any supported OS, in particular a real time OS. For the core processor 20 implemented as an XScaleT""
architecture, operating systems such as Microsoft NT real-time, VXWorks and ~COS, or a freeware OS available over the Internet can be used.
Advantages of hardware multithreading can be explained by SRAM or DRAM memory accesses. As an example, an SRAM
access requested by a context (e.g., Thread-0), from one of the programming engines 16 will cause the SRAM controller 18b to initiate an access to the SRAM memory 14b. The SRAM
controller 18b accesses the SRAM memory 14b, fetches the data from the SRAM memory 14b, and returns data to a requesting programming engine 16.
During an SRAM access, if one of the programming engines 16 had only a single thread that could operate, that programming engine would be dormant until data was returned from the SRAM memory 14b.
By employing hardware context swapping within each of the programming engines 16, the hardware context swapping enables other contexts with unique program counters to execute in that same programming engine. Thus, another thread e.g., Thread-1 can function while the first thread, Thread 0, is awaiting the read data to return. During execution, Thread 1 may access the DRAM memory 14a. While Thread_1 operates on the DRAM unit, and Thread-0 is operating on the SRAM unit, a new thread, e.g., Thread 2 can now operate in the programming engine 16. Thread 2 can operate for a certain amount of time until it needs to access memory or perform some other long latency operation, such as making an access to a bus interface. Therefore, simultaneously, the processor 12 can have a bus operation, SRAM operation and DRAM operation all being completed or operated upon by one of the programming engines 16 and have one more thread available to process more work.
The hardware context swapping also synchronizes completion of tasks. For example, two threads could hit the shared memory resource, e.g., the SRAM memory 14b. Each one of the separate functional units, e.g., the SRAM controller 18b, and the DRAM controller 18a, when they complete a requested task from one of the programming engine thread or contexts reports back a flag signaling completion of an operation. When the programming engine 16 receives the flag, the programming engine 16 can determine which thread to turn on.
One example of an application for the hardware-based multithreaded processor 12 is as a network processor. As a network processor, the hardware-based multithreaded processor 12 interfaces to network devices such as a Media Access Controller (MAC) device, e.g., a 10/100BaseT Octal MAC 13a or a Gigabit Ethernet device (not shown). In general, as a network processor, the hardware-based multithreaded processor 12 can interface to any type of communication device or interface that receives or sends large amount of data. The computer processing system 10 functioning in a networking application could receive network packets and process those packets in a parallel manner.
Programming Engine Contexts:
As described above, each of the programming engines 16 supports mufti-threaded execution of eight contexts. This allows one thread to start executing just after another thread issues a memory reference and must wait until that reference completes before doing more work. Mufti-threaded s execution is critical to maintaining efficient hardware execution of the programming engines 16 because memory latency is significant. Multi-threaded execution allows the programming engines 16 to hide memory latency by performing useful independent work across several threads.
Each of the eight contexts of the programming engines 16, to allow for efficient context swapping, has its own register set, program counter, and context specific local registers. Having a copy per context eliminates the need to move context specific information to and from shared memory and programming engine registers for each context swap.
Fast context swapping allows a context to perform computations while other contexts wait for input-output (I/O), typically, external memory accesses to complete or for a signal from another context or hardware unit.
For example, the programming engines 16 execute eight contexts by maintaining eight program counters and eight context relative sets of registers. A number of different types of context relative registers, such as general purposee registers (GPRs), inter-programming agent registers, Static Random Access Memory (SRAM) input transfer registers, Dynamic Random Access Memory (DRAM) input transfer registers, SRAM output transfer registers, DRAM output transfer registers. Local memory registers can also be used.
For example, GPRs are used for general programming purposes. GPRs are read and written exclusively under program control. The GPRs, when used as a source in an instruction, supply operands to an execution datapath (not shown). When used as a destination in an instruction, the GPRs are written with the result of the execution box datapath. The programming engines 16 also include IO
transfer registers as discussed above. The IO transfer registers are used for transferring data to and from the programming engines 16 and locations external to the programming engines 16, e.g., the DRAM memory 14a and the SRAM memory 14b etc.
Bus Architecture:
Referring to FIG. 2, the hardware-based multithreaded processor 12 is shown in greater detail. The DRAM memory 14a and the SRAM memory 14b are connected to the DRAM memory controller 18a and the SRAM memory 18b, respectively. The DRAM controller 18a is coupled to a pull bus arbiter 30a and a push bus arbiter 32a, which are coupled to a programming engines 16a. The SRAM controller 18b is coupled to a pull bus arbiter 30b and a push bus arbiter 32b, which are coupled to a programming engine 16b. Buses 26a-26b and 28a-28b make up the major buses for transferring data between the programming engines 16a-16b and the DRAM memory 14a and the SRAM memory 14b. Any thread from any of the programming engines 16a-16b can access the DRAM controller 18a and the SRAM controller 18a.
In particular, the push buses 26a-26b have multiple sources of memory such as memory controller channels and internal read registers (not shown) which arbitrate via the push arbiters 32a-32b to use the push buses 26a-26b. The destination (e. g., programming engine 16) of any push data transfer recognizes when the data is being "pushed" into it by decoding the Push-ID, which is driven or sent with the push data. The pull buses 28a-28b also have multiple destinations (e. g., writing data to different memory controller channels or writeable internal registers) that arbitrate to use the pull buses 28a-28b. The pull buses 28a-28b have a Pull ID, which is driven or sent, for example, two cycles before the pull data.
Data functions are distributed amongst the programming engines 16. Connectivity to the DRAM memory 14a and the SRAM memory 14b is performed via command requests. A
command request can be a memory request. For example, a command request can move data from a register located in the programming engine 16a to a shared resource, e.g., the DRAM
memory 14a, SRAM memory 14b. The commands or requests are sent out to each of the functional units and the shared resources. Commands such as I/O commands (e. g., SRAM read, SRAM write, DRAM read, DRAM write, load data from a receive memory buffer, move data to a transmit memory buffer) specify either context relative source or destination registers in the programming engines 16.
In general, the data transfers between programming engines and memory resources designate the memory resource for pushing the data to a processing agent via the push bus having a plurality of sources that arbitrate use of the push bus, and designate the memory resource for receiving the data from the processing agent via the pull bus having a plurality of destinations that arbitrate use of the pull bus.
Read Process:
Referring to FIG. 3, a data read process 50 is executed during a read phase of the programming engines 16 by the push buses 26a-26b. As part of the read process 50 the programming engine executes (52) a context. The programming engine 16 issues (54) a read command to the memory controllers 18a-18b, and the memory controllers 18a-18b processes (56) the request for one of the memory resources, i.e., the DRAM memory 14a or the SRAM memory 14b. For read commands, after the read command is issued (54), the programming engines 16 check (58) if the read data is required to continue the program context. If the read data is required to continue the program context or thread, the context is swapped out (60). The programming engine 16 checks (62) to ensure that the memory controllers 18a-18b have finished the request. When the memory controllers have to finished the request, the context is swapped back in (64).
If the request is not required to continue the execution of the context, the programming engine 16 checks (68) if the memory controllers 18a-18b have finished the request. If the memory controllers 18a-18b have not finished the request, a loop back occurs and further checks (58) take place. If the memory controllers 18a-18b have finished the request, when the read data has been acquired from the memory resources, the memory controllers 18a-18b push (70) the data into the context relative input transfer register specified by the read command. The memory controller sets a signal in the programming engine 16 that enables the context that issued the read to become active.
The programming engine 16 reads (72) the requested data in the input transfer register and continues (74) the execution of the context.
Write Process:
Referring to FIG. 4, a data write process 80 is executed during a write phase of the programming engines 16 by the pull buses 28a-28b. During the write process 80 the programming engine executes (82) a context. The programming engine 16 loads (84) the data into the output transfer register and issues (86) a write command or request to the memory controllers 18a-18b. The output transfer register is set (88) to a read-only state. For write commands from the programming engines 16, after the output transfer register is set (88) to a read-only state, the programming engine 16 checks (90) if the request is required to continue the program context or thread. If yes, the context is swapped out ( 92 ) .
If the write request is not required to continue the program context or thread, the memory controllers 18a-18b extracts or pulls (94) the data from the output transfer registers and signals (96) to the programming engines 16 to unlock the output transfer registers. The programming engine 16 then checks (98) if the context was swapped out.
If so, the context is swapped back (100) and if not, the programming engine 16 continues (102) the execution of the context. Thus, the signaled context .can reuse the output transfer registers. The signal may also be used to enable the context to go active if it swapped out (100) on the write command.
Data Push Operation:
Referring to FIG. 5, a data push operation 110 that occurs in the push buses 26a-26b of the computer processing system 10, is shown in different processing cycles, e.g., cycle 0 through cycle 5. Each target, e.g., the DRAM memory 14a or the SRAM memory 14b, sends or drives (112) a Target #-Push-ID to the push arbiters where the # indicates the number of different contexts such a.s context #0 through context #7. The Target #_Push-ID is derived from the read command and a data error bit (e. g., the numbers following the target represent the source address incrementing in the Push ID) for information it would like to push to the push arbiters 32a-32b. For Push IDs, each letter indicates a push operation to a particular destination. A Push ID
destination of "none" indicates that the Push ID is null.
The target also sends the Target-#_Push Data to the Push Arbiter.
The Push ID and Push Data are registered (114) and enqueued (116) into first-in, first-outs (FIFOs) in the push arbiters 32a-32b unless the Target #_Push Q-Full signal is asserted. This signal indicates that the Push_ID and Push Data FIFOs for that specific target are almost full in the push arbiters 32a-32b. In this case, the push arbiters 32a-32b have not registered a Push-ID or Push Data and the target does not change it. The channel changes the Push-ID
and Push Data that is taken by the push arbiters 32a-32b to those for the next word transfer or to null if it has no other valid transfer. Due to latency in the Push Q Full signal, the push arbiters 32a-32b should accommodate the worst case number of in-flight Push-IDs and Push Data per target.
The push arbiters 32a-32b will arbitrate (118) every cycle between all valid Push-IDs and send intermediate Push ID. The arbitration policy can be round robin, a priority scheme or even programmable. Multiple pushes. of data from the push arbiters 32a-32b to the destination are not guaranteed to be in consecutive cycles. The push arbiters 32a-32b send (12) intermediate Push Data and Push ID is forwarded (120) to the destination. It is up to the target to update the destination address of each Push-ID
it issues for each word of data it wishes to push. The Push Data is forwarded (122) to the destination. At the destination, the time from the destination getting the Push ID to the destination getting Push Data is fixed by one processing Cycle.
Data Pull Operation:
Referring to FIG. 6, a data pull operation 130 that occurs in the pull buses 28a-28b of the computer processing system 10, is shown in different processing cycles (e. g., cycle 0 through cycle 7). Each target, e.g., the DRAM
memory 14a or the SRAM memory 14b, sends or drives (132) the full Target # Pull-ID (i.e., the numbers following the target represents the source address incrementing in the Pull ID) and length (derived from the write command) for information it would like to pull to the target. For Pull IDs, each letter indicates a pull operation from a particular source, e.g., the memory resource 14. A Pull_ID
source of "none" indicates that the Pull ID is null. The target must have buffer space available for the pull data when it asserts its Pull ID.
The Pull ID is registered (134) and enqueued (136) into fist-in, first-outs (FIFO) in the pull arbiters 30a-30b, unless the Target #-Pull Q Full signal is asserted. This signal indicates that the Pull-ID queue for that specific target is almost full in the pull arbiters 30a-30b. In this case, the pull arbiters 30a-30b have not registered the Pull ID and the target does not change it. The target changes a Pull-ID that is taken by the pull arbiters 30a-30b to that for the next burst transfer or to null if it has no other valid Pull ID. Due to latency in the Pull Q-Full signal, the pull arbiters 30a-30b should accommodate the worst case number of in-flight Pull-IDs per target.
The pull arbiters 30a-30b arbitrate (138) every cycle among the currently valid Pull-IDs. The arbitration policy can be round robin, a priority scheme or even programmable.
The pull arbiters 30a-30b forwards (140) the selected Pull ID to the source. The time from the pull arbiters 30a-30b sending the Pull-ID to the source providing data is fixed in three processing cycles. The pull arbiters 30a-30b update the "source address" field of the Pull-ID for each new data item. The Pull Data is pulled (142) from the source and sent to the targets.
The pull arbiters 30a-30b also assert (146) a Target # Take Data to the selected target. This signal is asserted for each cycle a valid word of data is sent to the target. However, the assertions are not guaranteed to be on consecutive processing cycles. The pull arbiters 30a-30b only assert at most one Target # Take Data signal at a time.
For transfers between targets and masters with different bus widths, the pull arbiters 30a-30b are required to do the adjusting. For example, the DRAM controller 18b may accept eight bytes of data per processing cycle but the programming engine 16 may only deliver four bytes per cycle.
In this case, the pull arbiters 30a-30b can be used to accept four bytes per processing cycle, merge and pack them into eight bytes, and send the data to the DRAM controller 18a.
Other Embodiments:
It is to be understood that while the example above has been described in conjunction with the detailed description thereof, the foregoing description is intended to illustrate and not limit the scope of the invention, which is defined by the scope of the appended claims. Other aspects, advantages, and modifications are within the scope of the following claims.
Claims (29)
1. A method of transferring data between a processing agent and a memory resource comprising:
designating the memory resource for pushing the data to the processing agent using a push bus having a plurality of sources that arbitrate use of the push bus; and, designating the memory resource for receiving the data from the processing agent using a pull bus having a plurality of destinations that arbitrate use of the pull bus.
designating the memory resource for pushing the data to the processing agent using a push bus having a plurality of sources that arbitrate use of the push bus; and, designating the memory resource for receiving the data from the processing agent using a pull bus having a plurality of destinations that arbitrate use of the pull bus.
2. The method of claim 1 wherein transferring comprises:
establishing a plurality of contexts on the programming agent and maintaining program counters and context relative registers.
establishing a plurality of contexts on the programming agent and maintaining program counters and context relative registers.
3. The method of claim 2 wherein the programming agent executes a context and issues a read command to a memory controller in a read phase.
4. The method of claim 3 wherein the memory controller processes the read command to be sent to the memory resource.
5. The method of claim 4 wherein the context is swapped out if the read data is required to continue the execution of the context.
6. The method of claim 5 wherein after the memory controller has completed the processing of the read command, the memory controller pushes the data to an input transfer register of the programming agent.
7. The method of claim 6 wherein after the data has been pushed, the programming agent reads the data in the input transfer register and the programming agent continues the execution of the context.
8. The method of claim 2 wherein the programming agent executes a context and loads the data into an output transfer register of the programming agent in a write phase.
9. The method of claim 8 wherein the programming agent issues a write command to a memory controller and the output transfer register is set to a read-only state.
10. The method of claim 9 wherein the context is swapped out if the write command is required to continue the execution of the context.
11. The method of claim 10 wherein the memory controller pushes the data from the output transfer register and the memory controller sends a signal to the programming agent to unlock the output transfer register.
12. The method of claim 11 wherein if the context has been swapped out after the output transfer register has been unlocked, the context is swapped back in and the programming agent continues the execution of the context.
13. A system comprising:
a memory resource;
a processing agent configured to transfer data between the processing agent and the memory resource;
a push bus for pushing the data to the processing agent having a plurality of sources that arbitrate use of the push bus;
a pull bus for receiving the data from the processing agent having a plurality of destinations that arbitrate use of the pull bus; and a plurality of microengines executing multiple contexts that seek resources of the processing agent.
a memory resource;
a processing agent configured to transfer data between the processing agent and the memory resource;
a push bus for pushing the data to the processing agent having a plurality of sources that arbitrate use of the push bus;
a pull bus for receiving the data from the processing agent having a plurality of destinations that arbitrate use of the pull bus; and a plurality of microengines executing multiple contexts that seek resources of the processing agent.
14. The system of claim 13 further comprising a read phase for the transfer of data from the memory resource to the processing agent in which the transfer is unidirectional.
15. The system of claim 13 further comprising a write phase for the transfer of data from the processing agent to the memory resource in which the transfer is unidirectional.
16. The system of claim 13 further comprising a plurality of program counters and a plurality of context relative registers.
17. The system of claim 16 in which the context relative registers are selected from a group comprising of general purpose registers, inter-programming agent registers, static random access memory (SRAM) input transfer registers, dynamic random access memory (DRAM) input transfer registers, SRAM output transfer registers, DRAM output transfer registers, and local memory registers.
18. The system of claim 17 in which the programming agent is configured to execute a context and issue a read command to a memory controller.
19. The system of claim 18 in which the memory controller is configured to process the read command to be sent to the memory resource.
20. The system of claim 19 in which the programming agent is configured to swap the context out if the read command is required to continue to execution of the context.
21. The method of claim 20 in which after the read command is processed, the memory controller is configured to push the data to an input transfer register of the programming agent and the programming agent is configured to read the data in the input transfer register and to continue the execution of the context.
22. The system of claim 15 in which the programming agent is configured to execute a context and load the data into an output transfer register of the programming agent.
23. The system of claim 22 in which the programming agent is configured to issue a write command to a memory controller and in which the output transfer register is set to a read-only state.
24. The system of claim 23 in which the programming agent is configured to swap the context out if the write command is required to continue to execution of the context.
25. The system of claim 24 in which the memory controller is configured to push the data from the output transfer register and to send a signal to the programming agent to unlock the output transfer register.
26. A computer program product residing on a computer readable medium for causing a parallel processor to perform a function comprises instructions causing the processor to:
designate the memory resource for pushing the data to the processing agent using a push bus having a plurality of sources that arbitrate use of the push bus; and, designate the memory resource for receiving the data from the processing agent using a pull bus having a plurality of destinations that arbitrate use of the pull bus.
designate the memory resource for pushing the data to the processing agent using a push bus having a plurality of sources that arbitrate use of the push bus; and, designate the memory resource for receiving the data from the processing agent using a pull bus having a plurality of destinations that arbitrate use of the pull bus.
27. The computer program product of claim 26 further comprising instructions causing the processor to establish a plurality of contexts on the programming agent and maintaining program counters and context relative registers.
28. The computer program product of claim 26 wherein the programming agent in a read phase executes a context and issues a read command to a memory controller.
29. The computer program product of claim 26 wherein the memory controller processes the read command to be sent to the memory resource and the context is swapped out if the read command is required to continue the execution of the context.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/057,738 | 2002-01-25 | ||
| US10/057,738 US7610451B2 (en) | 2002-01-25 | 2002-01-25 | Data transfer mechanism using unidirectional pull bus and push bus |
| PCT/US2003/001579 WO2003065205A2 (en) | 2002-01-25 | 2003-01-16 | Data transfer mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2473548A1 true CA2473548A1 (en) | 2003-08-07 |
Family
ID=27609479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002473548A Abandoned CA2473548A1 (en) | 2002-01-25 | 2003-01-16 | Data transfer mechanism |
Country Status (10)
| Country | Link |
|---|---|
| US (1) | US7610451B2 (en) |
| EP (1) | EP1493081B1 (en) |
| KR (1) | KR100895536B1 (en) |
| CN (1) | CN101027634B (en) |
| AT (1) | ATE487179T1 (en) |
| CA (1) | CA2473548A1 (en) |
| DE (1) | DE60334784D1 (en) |
| HK (1) | HK1070704A1 (en) |
| TW (1) | TWI236595B (en) |
| WO (1) | WO2003065205A2 (en) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7487505B2 (en) * | 2001-08-27 | 2009-02-03 | Intel Corporation | Multithreaded microprocessor with register allocation based on number of active threads |
| US7225281B2 (en) * | 2001-08-27 | 2007-05-29 | Intel Corporation | Multiprocessor infrastructure for providing flexible bandwidth allocation via multiple instantiations of separate data buses, control buses and support mechanisms |
| US6868476B2 (en) * | 2001-08-27 | 2005-03-15 | Intel Corporation | Software controlled content addressable memory in a general purpose execution datapath |
| US7216204B2 (en) * | 2001-08-27 | 2007-05-08 | Intel Corporation | Mechanism for providing early coherency detection to enable high performance memory updates in a latency sensitive multithreaded environment |
| US20040034858A1 (en) * | 2002-08-14 | 2004-02-19 | Kushlis Robert J. | Programming a multi-threaded processor |
| US7185153B2 (en) * | 2003-12-18 | 2007-02-27 | Intel Corporation | Packet assembly |
| US20050198361A1 (en) * | 2003-12-29 | 2005-09-08 | Chandra Prashant R. | Method and apparatus for meeting a given content throughput using at least one memory channel |
| 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 |
| US7779198B2 (en) * | 2004-11-23 | 2010-08-17 | Efficient Memory Technology | Method and apparatus of multiple abbreviations of interleaved addressing of paged memories |
| US7555630B2 (en) * | 2004-12-21 | 2009-06-30 | Intel Corporation | Method and apparatus to provide efficient communication between multi-threaded processing elements in a processor unit |
| JP2007066109A (en) * | 2005-08-31 | 2007-03-15 | Fujitsu Ltd | Apparatus and method for controlling data transmission/reception |
| US8127113B1 (en) | 2006-12-01 | 2012-02-28 | Synopsys, Inc. | Generating hardware accelerators and processor offloads |
| US8289966B1 (en) | 2006-12-01 | 2012-10-16 | Synopsys, Inc. | Packet ingress/egress block and system and method for receiving, transmitting, and managing packetized data |
| US8706987B1 (en) | 2006-12-01 | 2014-04-22 | Synopsys, Inc. | Structured block transfer module, system architecture, and method for transferring |
| US8914417B2 (en) * | 2009-01-07 | 2014-12-16 | International Business Machines Corporation | Apparatus, system, and method for maintaining a context stack |
| US9125005B2 (en) * | 2010-04-30 | 2015-09-01 | Nokia Technologies Oy | Method and apparatus for providing mobile services outside of cellular coverage |
| CN102377790B (en) * | 2010-08-04 | 2016-02-24 | 腾讯科技（深圳）有限公司 | A kind of method and apparatus of propelling data |
| US9524114B2 (en) * | 2015-01-27 | 2016-12-20 | Futurewei Technologies, Inc. | Optimizing synchronous write via speculation |
Family Cites Families (167)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3373408A (en) | 1965-04-16 | 1968-03-12 | Rca Corp | Computer capable of switching between programs without storage and retrieval of the contents of operation registers |
| US3478322A (en) | 1967-05-23 | 1969-11-11 | Ibm | Data processor employing electronically changeable control storage |
| BE795789A (en) | 1972-03-08 | 1973-06-18 | Burroughs Corp | MICROPROGRAM CONTAINING A MICRO-RECOVERY INSTRUCTION |
| US3881173A (en) | 1973-05-14 | 1975-04-29 | Amdahl Corp | Condition code determination and data processing |
| IT986411B (en) | 1973-06-05 | 1975-01-30 | Olivetti E C Spa | SYSTEM TO TRANSFER THE CONTROL OF PROCESSING FROM A FIRST PRIORITY LEVEL TO A SECOND PRIORITY LEVEL |
| FR2253415A5 (en) | 1973-12-04 | 1975-06-27 | Cii | |
| US3913074A (en) | 1973-12-18 | 1975-10-14 | Honeywell Inf Systems | Search processing apparatus |
| US4045782A (en) | 1976-03-29 | 1977-08-30 | The Warner & Swasey Company | Microprogrammed processor system having external memory |
| US4130890A (en) | 1977-06-08 | 1978-12-19 | Itt Industries, Inc. | Integrated DDC memory with bitwise erase |
| US4392758A (en) | 1978-05-22 | 1983-07-12 | International Business Machines Corporation | Underscore erase |
| US4189767A (en) | 1978-06-05 | 1980-02-19 | Bell Telephone Laboratories, Incorporated | Accessing arrangement for interleaved modular memories |
| JPS56164464A (en) | 1980-05-21 | 1981-12-17 | Tatsuo Nogi | Parallel processing computer |
| US4400770A (en) | 1980-11-10 | 1983-08-23 | International Business Machines Corporation | Cache synonym detection and handling means |
| CA1179069A (en) | 1981-04-10 | 1984-12-04 | Yasushi Fukunaga | Data transmission apparatus for a multiprocessor system |
| US4569016A (en) | 1983-06-30 | 1986-02-04 | International Business Machines Corporation | Mechanism for implementing one machine cycle executable mask and rotate instructions in a primitive instruction set computing system |
| US4868735A (en) | 1984-05-08 | 1989-09-19 | Advanced Micro Devices, Inc. | Interruptible structured microprogrammed sixteen-bit address sequence controller |
| US4742451A (en) | 1984-05-21 | 1988-05-03 | Digital Equipment Corporation | Instruction prefetch system for conditional branch instruction for central processor unit |
| US4777587A (en) | 1985-08-30 | 1988-10-11 | Advanced Micro Devices, Inc. | System for processing single-cycle branch instruction in a pipeline having relative, absolute, indirect and trap addresses |
| JPS62103893A (en) | 1985-10-30 | 1987-05-14 | Toshiba Corp | Semiconductor memory |
| US5021945A (en) | 1985-10-31 | 1991-06-04 | Mcc Development, Ltd. | Parallel processor system for processing natural concurrencies and method therefor |
| US4745544A (en) | 1985-12-12 | 1988-05-17 | Texas Instruments Incorporated | Master/slave sequencing processor with forced I/O |
| US4724521A (en) | 1986-01-14 | 1988-02-09 | Veri-Fone, Inc. | Method for operating a local terminal to execute a downloaded application program |
| US5297260A (en) | 1986-03-12 | 1994-03-22 | Hitachi, Ltd. | Processor having a plurality of CPUS with one CPU being normally connected to common bus |
| US4992934A (en) | 1986-12-15 | 1991-02-12 | United Technologies Corporation | Reduced instruction set computing apparatus and methods |
| US5073864A (en) | 1987-02-10 | 1991-12-17 | Davin Computer Corporation | Parallel string processor and method for a minicomputer |
| US4866664A (en) | 1987-03-09 | 1989-09-12 | Unisys Corporation | Intercomputer communication control apparatus & method |
| US5142683A (en) | 1987-03-09 | 1992-08-25 | Unisys Corporation | Intercomputer communication control apparatus and method |
| EP0357768B1 (en) | 1988-03-14 | 1994-03-09 | Unisys Corporation | Record lock processor for multiprocessing data system |
| US5008808A (en) | 1988-06-23 | 1991-04-16 | Storage Technology Corporation | Consolidation of commands in a buffered input/output device |
| US5165025A (en) | 1988-10-06 | 1992-11-17 | Lass Stanley E | Interlacing the paths after a conditional branch like instruction |
| US5142676A (en) | 1988-12-28 | 1992-08-25 | Gte Laboratories Incorporated | Separate content addressable memories for storing locked segment addresses and locking processor identifications for controlling access to shared memory |
| US5155854A (en) | 1989-02-03 | 1992-10-13 | Digital Equipment Corporation | System for arbitrating communication requests using multi-pass control unit based on availability of system resources |
| US5155831A (en) | 1989-04-24 | 1992-10-13 | International Business Machines Corporation | Data processing system with fast queue store interposed between store-through caches and a main memory |
| US5166872A (en) | 1989-07-17 | 1992-11-24 | Ability Technologies Corporation | System and method for controlling devices through communication processors and pluralities of address-associated device controllers sharing each communication processor |
| US5113516A (en) | 1989-07-31 | 1992-05-12 | North American Philips Corporation | Data repacker having controlled feedback shifters and registers for changing data format |
| US5168555A (en) | 1989-09-06 | 1992-12-01 | Unisys Corporation | Initial program load control |
| US5263169A (en) | 1989-11-03 | 1993-11-16 | Zoran Corporation | Bus arbitration and resource management for concurrent vector signal processor architecture |
| DE3942977A1 (en) | 1989-12-23 | 1991-06-27 | Standard Elektrik Lorenz Ag | METHOD FOR RESTORING THE CORRECT SEQUENCE OF CELLS, ESPECIALLY IN AN ATM SWITCHING CENTER, AND OUTPUT UNIT THEREFOR |
| US5247671A (en) | 1990-02-14 | 1993-09-21 | International Business Machines Corporation | Scalable schedules for serial communications controller in data processing systems |
| JPH0799812B2 (en) | 1990-03-26 | 1995-10-25 | 株式会社グラフイックス・コミュニケーション・テクノロジーズ | Signal coding apparatus, signal decoding apparatus, and signal coding / decoding apparatus |
| EP0449369B1 (en) | 1990-03-27 | 1998-07-29 | Koninklijke Philips Electronics N.V. | A data processing system provided with a performance enhancing instruction cache |
| US5390329A (en) | 1990-06-11 | 1995-02-14 | Cray Research, Inc. | Responding to service requests using minimal system-side context in a multiprocessor environment |
| US5404482A (en) | 1990-06-29 | 1995-04-04 | Digital Equipment Corporation | Processor and method for preventing access to a locked memory block by recording a lock in a content addressable memory with outstanding cache fills |
| CA2045790A1 (en) * | 1990-06-29 | 1991-12-30 | Richard Lee Sites | Branch prediction in high-performance processor |
| US5432918A (en) | 1990-06-29 | 1995-07-11 | Digital Equipment Corporation | Method and apparatus for ordering read and write operations using conflict bits in a write queue |
| US5347648A (en) | 1990-06-29 | 1994-09-13 | Digital Equipment Corporation | Ensuring write ordering under writeback cache error conditions |
| US5367678A (en) | 1990-12-06 | 1994-11-22 | The Regents Of The University Of California | Multiprocessor system having statically determining resource allocation schedule at compile time and the using of static schedule with processor signals to control the execution time dynamically |
| EP0522513A2 (en) | 1991-07-09 | 1993-01-13 | Hughes Aircraft Company | High speed parallel microcode program controller |
| US5255239A (en) | 1991-08-13 | 1993-10-19 | Cypress Semiconductor Corporation | Bidirectional first-in-first-out memory device with transparent and user-testable capabilities |
| US5623489A (en) | 1991-09-26 | 1997-04-22 | Ipc Information Systems, Inc. | Channel allocation system for distributed digital switching network |
| US5392412A (en) | 1991-10-03 | 1995-02-21 | Standard Microsystems Corporation | Data communication controller for use with a single-port data packet buffer |
| GB2260429B (en) | 1991-10-11 | 1995-05-24 | Intel Corp | Versatile cache memory |
| US5392391A (en) | 1991-10-18 | 1995-02-21 | Lsi Logic Corporation | High performance graphics applications controller |
| US5557766A (en) | 1991-10-21 | 1996-09-17 | Kabushiki Kaisha Toshiba | High-speed processor for handling multiple interrupts utilizing an exclusive-use bus and current and previous bank pointers to specify a return bank |
| US5452437A (en) | 1991-11-18 | 1995-09-19 | Motorola, Inc. | Methods of debugging multiprocessor system |
| US5357617A (en) | 1991-11-22 | 1994-10-18 | International Business Machines Corporation | Method and apparatus for substantially concurrent multiple instruction thread processing by a single pipeline processor |
| US5442797A (en) | 1991-12-04 | 1995-08-15 | Casavant; Thomas L. | Latency tolerant risc-based multiple processor with event driven locality managers resulting from variable tagging |
| JP2823767B2 (en) | 1992-02-03 | 1998-11-11 | 松下電器産業株式会社 | Register file |
| US5459842A (en) | 1992-06-26 | 1995-10-17 | International Business Machines Corporation | System for combining data from multiple CPU write requests via buffers and using read-modify-write operation to write the combined data to the memory |
| DE4223600C2 (en) | 1992-07-17 | 1994-10-13 | Ibm | Multiprocessor computer system and method for transmitting control information and data information between at least two processor units of a computer system |
| US5274770A (en) | 1992-07-29 | 1993-12-28 | Tritech Microelectronics International Pte Ltd. | Flexible register-based I/O microcontroller with single cycle instruction execution |
| US5692167A (en) | 1992-07-31 | 1997-11-25 | Intel Corporation | Method for verifying the correct processing of pipelined instructions including branch instructions and self-modifying code in a microprocessor |
| US5442756A (en) | 1992-07-31 | 1995-08-15 | Intel Corporation | Branch prediction and resolution apparatus for a superscalar computer processor |
| US5649109A (en) | 1992-10-22 | 1997-07-15 | Digital Equipment Corporation | Apparatus and method for maintaining forwarding information in a bridge or router using multiple free queues having associated free space sizes |
| US5481683A (en) | 1992-10-30 | 1996-01-02 | International Business Machines Corporation | Super scalar computer architecture using remand and recycled general purpose register to manage out-of-order execution of instructions |
| US5450603A (en) | 1992-12-18 | 1995-09-12 | Xerox Corporation | SIMD architecture with transfer register or value source circuitry connected to bus |
| DK0627100T3 (en) | 1992-12-23 | 2000-06-26 | Ebauchesfabrik Eta Ag | Low power multitasking controller |
| US5404464A (en) | 1993-02-11 | 1995-04-04 | Ast Research, Inc. | Bus control system and method that selectively generate an early address strobe |
| US5448702A (en) | 1993-03-02 | 1995-09-05 | International Business Machines Corporation | Adapters with descriptor queue management capability |
| US6311286B1 (en) | 1993-04-30 | 2001-10-30 | Nec Corporation | Symmetric multiprocessing system with unified environment and distributed system functions |
| WO1994027216A1 (en) | 1993-05-14 | 1994-11-24 | Massachusetts Institute Of Technology | Multiprocessor coupling system with integrated compile and run time scheduling for parallelism |
| CA2122182A1 (en) | 1993-05-20 | 1994-11-21 | Rene Leblanc | Method for rapid prototyping of programming problems |
| US5363448A (en) | 1993-06-30 | 1994-11-08 | United Technologies Automotive, Inc. | Pseudorandom number generation and cryptographic authentication |
| CA2107299C (en) | 1993-09-29 | 1997-02-25 | Mehrad Yasrebi | High performance machine for switched communications in a heterogenous data processing network gateway |
| US5446736A (en) | 1993-10-07 | 1995-08-29 | Ast Research, Inc. | Method and apparatus for connecting a node to a wireless network using a standard protocol |
| US5450351A (en) | 1993-11-19 | 1995-09-12 | International Business Machines Corporation | Content addressable memory implementation with random access memory |
| US6079014A (en) * | 1993-12-02 | 2000-06-20 | Intel Corporation | Processor that redirects an instruction fetch pipeline immediately upon detection of a mispredicted branch while committing prior instructions to an architectural state |
| US5487159A (en) | 1993-12-23 | 1996-01-23 | Unisys Corporation | System for processing shift, mask, and merge operations in one instruction |
| US5490204A (en) | 1994-03-01 | 1996-02-06 | Safco Corporation | Automated quality assessment system for cellular networks |
| US5659722A (en) | 1994-04-28 | 1997-08-19 | International Business Machines Corporation | Multiple condition code branching system in a multi-processor environment |
| US5542088A (en) | 1994-04-29 | 1996-07-30 | Intergraph Corporation | Method and apparatus for enabling control of task execution |
| US5721870A (en) | 1994-05-25 | 1998-02-24 | Nec Corporation | Lock control for a shared main storage data processing system |
| US5544236A (en) | 1994-06-10 | 1996-08-06 | At&T Corp. | Access to unsubscribed features |
| US5574922A (en) | 1994-06-17 | 1996-11-12 | Apple Computer, Inc. | Processor with sequences of processor instructions for locked memory updates |
| US5666551A (en) * | 1994-06-30 | 1997-09-09 | Digital Equipment Corporation | Distributed data bus sequencing for a system bus with separate address and data bus protocols |
| FR2722041B1 (en) | 1994-06-30 | 1998-01-02 | Samsung Electronics Co Ltd | HUFFMAN DECODER |
| US5640538A (en) | 1994-08-22 | 1997-06-17 | Adaptec, Inc. | Programmable timing mark sequencer for a disk drive |
| US5717760A (en) | 1994-11-09 | 1998-02-10 | Channel One Communications, Inc. | Message protection system and method |
| US5610864A (en) | 1994-12-23 | 1997-03-11 | Micron Technology, Inc. | Burst EDO memory device with maximized write cycle timing |
| US5550816A (en) | 1994-12-29 | 1996-08-27 | Storage Technology Corporation | Method and apparatus for virtual switching |
| US5649157A (en) | 1995-03-30 | 1997-07-15 | Hewlett-Packard Co. | Memory controller with priority queues |
| TW360852B (en) | 1995-04-12 | 1999-06-11 | Matsushita Electric Ind Co Ltd | Pipeline processor |
| US5592622A (en) | 1995-05-10 | 1997-01-07 | 3Com Corporation | Network intermediate system with message passing architecture |
| US5541920A (en) | 1995-06-15 | 1996-07-30 | Bay Networks, Inc. | Method and apparatus for a delayed replace mechanism for a streaming packet modification engine |
| KR0180169B1 (en) | 1995-06-30 | 1999-05-01 | 배순훈 | A variable length coder |
| US5613071A (en) | 1995-07-14 | 1997-03-18 | Intel Corporation | Method and apparatus for providing remote memory access in a distributed memory multiprocessor system |
| US5680641A (en) | 1995-08-16 | 1997-10-21 | Sharp Microelectronics Technology, Inc. | Multiple register bank system for concurrent I/O operation in a CPU datapath |
| US5689566A (en) | 1995-10-24 | 1997-11-18 | Nguyen; Minhtam C. | Network with secure communications sessions |
| KR0150072B1 (en) | 1995-11-30 | 1998-10-15 | 양승택 | Device for controlling memory data path in parallel processing computer system |
| US5699537A (en) | 1995-12-22 | 1997-12-16 | Intel Corporation | Processor microarchitecture for efficient dynamic scheduling and execution of chains of dependent instructions |
| US6088783A (en) * | 1996-02-16 | 2000-07-11 | Morton; Steven G | DPS having a plurality of like processors controlled in parallel by an instruction word, and a control processor also controlled by the instruction word |
| US5978874A (en) * | 1996-07-01 | 1999-11-02 | Sun Microsystems, Inc. | Implementing snooping on a split-transaction computer system bus |
| US6058465A (en) * | 1996-08-19 | 2000-05-02 | Nguyen; Le Trong | Single-instruction-multiple-data processing in a multimedia signal processor |
| US6247040B1 (en) * | 1996-09-30 | 2001-06-12 | Lsi Logic Corporation | Method and structure for automated switching between multiple contexts in a storage subsystem target device |
| US6173349B1 (en) * | 1996-10-18 | 2001-01-09 | Samsung Electronics Co., Ltd. | Shared bus system with transaction and destination ID |
| US6029228A (en) * | 1996-12-31 | 2000-02-22 | Texas Instruments Incorporated | Data prefetching of a load target buffer for post-branch instructions based on past prediction accuracy's of branch predictions |
| WO1998031121A2 (en) * | 1997-01-10 | 1998-07-16 | Koninklijke Philips Electronics N.V. | Communication bus system |
| US5893162A (en) * | 1997-02-05 | 1999-04-06 | Transwitch Corp. | Method and apparatus for allocation and management of shared memory with data in memory stored as multiple linked lists |
| US5742587A (en) | 1997-02-28 | 1998-04-21 | Lanart Corporation | Load balancing port switching hub |
| EP0931290A1 (en) * | 1997-03-21 | 1999-07-28 | International Business Machines Corporation | Address mapping for system memory |
| US5941949A (en) * | 1997-05-14 | 1999-08-24 | Citrix Systems, Inc. | System and method for transmitting data from a server application to more than one client node |
| US6047334A (en) * | 1997-06-17 | 2000-04-04 | Intel Corporation | System for delaying dequeue of commands received prior to fence command until commands received before fence command are ordered for execution in a fixed sequence |
| US6233599B1 (en) * | 1997-07-10 | 2001-05-15 | International Business Machines Corporation | Apparatus and method for retrofitting multi-threaded operations on a computer by partitioning and overlapping registers |
| US6104700A (en) * | 1997-08-29 | 2000-08-15 | Extreme Networks | Policy based quality of service |
| US6223277B1 (en) * | 1997-11-21 | 2001-04-24 | Texas Instruments Incorporated | Data processing circuit with packed data structure capability |
| US6029170A (en) * | 1997-11-25 | 2000-02-22 | International Business Machines Corporation | Hybrid tree array data structure and method |
| US6212602B1 (en) * | 1997-12-17 | 2001-04-03 | Sun Microsystems, Inc. | Cache tag caching |
| US6230119B1 (en) * | 1998-02-06 | 2001-05-08 | Patrick Michael Mitchell | Integrated circuit with embedded emulator and emulation system for use with such an integrated circuit |
| US6092175A (en) * | 1998-04-02 | 2000-07-18 | University Of Washington | Shared register storage mechanisms for multithreaded computer systems with out-of-order execution |
| US6408325B1 (en) * | 1998-05-06 | 2002-06-18 | Sun Microsystems, Inc. | Context switching technique for processors with large register files |
| US6505281B1 (en) * | 1998-06-02 | 2003-01-07 | Raymond C. Sherry | Hard disk drives employing high speed distribution bus |
| TW374967B (en) * | 1998-06-22 | 1999-11-21 | Winbond Electronics Corp | Ethernet switch having shared memory structure and method of the shared memory |
| US6724767B1 (en) * | 1998-06-27 | 2004-04-20 | Intel Corporation | Two-dimensional queuing/de-queuing methods and systems for implementing the same |
| US6505229B1 (en) * | 1998-09-25 | 2003-01-07 | Intelect Communications, Inc. | Method for allowing multiple processing threads and tasks to execute on one or more processor units for embedded real-time processor systems |
| US6356962B1 (en) * | 1998-09-30 | 2002-03-12 | Stmicroelectronics, Inc. | Network device and method of controlling flow of data arranged in frames in a data-based network |
| US6247086B1 (en) * | 1998-11-12 | 2001-06-12 | Adaptec, Inc. | PCI bridge for optimized command delivery |
| US6182183B1 (en) * | 1998-11-13 | 2001-01-30 | Sonics, Inc. | Communications system and method with multilevel connection identification |
| US6230261B1 (en) * | 1998-12-02 | 2001-05-08 | I. P. First, L.L.C. | Method and apparatus for predicting conditional branch instruction outcome based on branch condition test type |
| US6212604B1 (en) * | 1998-12-03 | 2001-04-03 | Sun Microsystems, Inc. | Shared instruction cache for multiple processors |
| GB2344665B (en) * | 1998-12-08 | 2003-07-30 | Advanced Risc Mach Ltd | Cache memory |
| US6378124B1 (en) * | 1999-02-22 | 2002-04-23 | International Business Machines Corporation | Debugger thread synchronization control points |
| CA2266283C (en) * | 1999-03-19 | 2006-07-11 | Wen Tong | Data interleaver and method of interleaving data |
| US6570877B1 (en) * | 1999-04-07 | 2003-05-27 | Cisco Technology, Inc. | Search engine for forwarding table content addressable memory |
| US6401149B1 (en) * | 1999-05-05 | 2002-06-04 | Qlogic Corporation | Methods for context switching within a disk controller |
| US6351808B1 (en) * | 1999-05-11 | 2002-02-26 | Sun Microsystems, Inc. | Vertically and horizontally threaded processor with multidimensional storage for storing thread data |
| US6539439B1 (en) * | 1999-08-18 | 2003-03-25 | Ati International Srl | Method and apparatus for interfacing a bus at an independent rate with input/output devices |
| US6643726B1 (en) * | 1999-08-18 | 2003-11-04 | Ati International Srl | Method of manufacture and apparatus of an integrated computing system |
| US6427196B1 (en) * | 1999-08-31 | 2002-07-30 | Intel Corporation | SRAM controller for parallel processor architecture including address and command queue and arbiter |
| US6606704B1 (en) * | 1999-08-31 | 2003-08-12 | Intel Corporation | Parallel multithreaded processor with plural microengines executing multiple threads each microengine having loadable microcode |
| US6529999B1 (en) * | 1999-10-27 | 2003-03-04 | Advanced Micro Devices, Inc. | Computer system implementing system and method for ordering write operations and maintaining memory coherency |
| US6523108B1 (en) * | 1999-11-23 | 2003-02-18 | Sony Corporation | Method of and apparatus for extracting a string of bits from a binary bit string and depositing a string of bits onto a binary bit string |
| US6889319B1 (en) * | 1999-12-09 | 2005-05-03 | Intel Corporation | Method and apparatus for entering and exiting multiple threads within a multithreaded processor |
| US6357016B1 (en) * | 1999-12-09 | 2002-03-12 | Intel Corporation | Method and apparatus for disabling a clock signal within a multithreaded processor |
| US7051329B1 (en) * | 1999-12-28 | 2006-05-23 | Intel Corporation | Method and apparatus for managing resources in a multithreaded processor |
| US6307789B1 (en) * | 1999-12-28 | 2001-10-23 | Intel Corporation | Scratchpad memory |
| US6625654B1 (en) * | 1999-12-28 | 2003-09-23 | Intel Corporation | Thread signaling in multi-threaded network processor |
| US6631462B1 (en) * | 2000-01-05 | 2003-10-07 | Intel Corporation | Memory shared between processing threads |
| US6513089B1 (en) * | 2000-05-18 | 2003-01-28 | International Business Machines Corporation | Dual burst latency timers for overlapped read and write data transfers |
| US6654836B1 (en) * | 2000-06-20 | 2003-11-25 | International Business Machines Corporation | Dual master device for improved utilization of a processor local bus |
| US6587905B1 (en) * | 2000-06-29 | 2003-07-01 | International Business Machines Corporation | Dynamic data bus allocation |
| US6754662B1 (en) * | 2000-08-01 | 2004-06-22 | Nortel Networks Limited | Method and apparatus for fast and consistent packet classification via efficient hash-caching |
| US7681018B2 (en) * | 2000-08-31 | 2010-03-16 | Intel Corporation | Method and apparatus for providing large register address space while maximizing cycletime performance for a multi-threaded register file set |
| US20020053017A1 (en) * | 2000-09-01 | 2002-05-02 | Adiletta Matthew J. | Register instructions for a multithreaded processor |
| US6847645B1 (en) * | 2001-02-22 | 2005-01-25 | Cisco Technology, Inc. | Method and apparatus for controlling packet header buffer wrap around in a forwarding engine of an intermediate network node |
| TW556077B (en) * | 2001-06-05 | 2003-10-01 | Via Tech Inc | Controller for improving buffer management efficiency and the buffer management method |
| JP3489573B2 (en) * | 2001-07-11 | 2004-01-19 | 日本電気株式会社 | Packet processing device |
| US6868476B2 (en) * | 2001-08-27 | 2005-03-15 | Intel Corporation | Software controlled content addressable memory in a general purpose execution datapath |
| US7225281B2 (en) * | 2001-08-27 | 2007-05-29 | Intel Corporation | Multiprocessor infrastructure for providing flexible bandwidth allocation via multiple instantiations of separate data buses, control buses and support mechanisms |
| US7216204B2 (en) * | 2001-08-27 | 2007-05-08 | Intel Corporation | Mechanism for providing early coherency detection to enable high performance memory updates in a latency sensitive multithreaded environment |
| US7487505B2 (en) * | 2001-08-27 | 2009-02-03 | Intel Corporation | Multithreaded microprocessor with register allocation based on number of active threads |
| US20030065862A1 (en) * | 2001-09-28 | 2003-04-03 | Wyland David C. | Computer system and method for communications between bus devices |
| US6934729B2 (en) * | 2001-10-18 | 2005-08-23 | International Business Machines Corporation | Method and system for performing shift operations |
| US7028118B2 (en) * | 2001-12-12 | 2006-04-11 | Texas Instruments Incorporated | Multi-channel buffered serial port debugging |
| US6738831B2 (en) * | 2001-12-12 | 2004-05-18 | Intel Corporation | Command ordering |
| US6754795B2 (en) * | 2001-12-21 | 2004-06-22 | Agere Systems Inc. | Methods and apparatus for forming linked list queue using chunk-based structure |
| US7337275B2 (en) * | 2002-08-13 | 2008-02-26 | Intel Corporation | Free list and ring data structure management |
| US6941438B2 (en) * | 2003-01-10 | 2005-09-06 | Intel Corporation | Memory interleaving |
-
2002
- 2002-01-25 US US10/057,738 patent/US7610451B2/en not_active Expired - Fee Related
-
2003
- 2003-01-16 AT AT03734963T patent/ATE487179T1/en not_active IP Right Cessation
- 2003-01-16 CN CN03802115.3A patent/CN101027634B/en not_active Expired - Fee Related
- 2003-01-16 DE DE60334784T patent/DE60334784D1/en not_active Expired - Lifetime
- 2003-01-16 EP EP03734963A patent/EP1493081B1/en not_active Expired - Lifetime
- 2003-01-16 KR KR1020037017300A patent/KR100895536B1/en not_active IP Right Cessation
- 2003-01-16 CA CA002473548A patent/CA2473548A1/en not_active Abandoned
- 2003-01-16 WO PCT/US2003/001579 patent/WO2003065205A2/en not_active Application Discontinuation
- 2003-01-23 TW TW092101470A patent/TWI236595B/en not_active IP Right Cessation
-
2005
- 2005-01-27 HK HK05100730.0A patent/HK1070704A1/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| TWI236595B (en) | 2005-07-21 |
| CN101027634B (en) | 2015-09-09 |
| TW200302417A (en) | 2003-08-01 |
| US7610451B2 (en) | 2009-10-27 |
| KR20040017822A (en) | 2004-02-27 |
| ATE487179T1 (en) | 2010-11-15 |
| WO2003065205A2 (en) | 2003-08-07 |
| EP1493081B1 (en) | 2010-11-03 |
| WO2003065205A8 (en) | 2004-10-28 |
| EP1493081A2 (en) | 2005-01-05 |
| DE60334784D1 (en) | 2010-12-16 |
| US20030145155A1 (en) | 2003-07-31 |
| HK1070704A1 (en) | 2005-06-24 |
| CN101027634A (en) | 2007-08-29 |
| KR100895536B1 (en) | 2009-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7610451B2 (en) | Data transfer mechanism using unidirectional pull bus and push bus | |
| US9824038B2 (en) | Memory mapping in a processor having multiple programmable units | |
| US6631462B1 (en) | Memory shared between processing threads | |
| US6560667B1 (en) | Handling contiguous memory references in a multi-queue system | |
| US7111296B2 (en) | Thread signaling in multi-threaded processor | |
| US6587906B2 (en) | Parallel multi-threaded processing | |
| US20080109569A1 (en) | Remote DMA systems and methods for supporting synchronization of distributed processes in a multi-processor system using collective operations | |
| US20080109573A1 (en) | RDMA systems and methods for sending commands from a source node to a target node for local execution of commands at the target node | |
| US7802025B2 (en) | DMA engine for repeating communication patterns | |
| US20040205719A1 (en) | Hop method for stepping parallel hardware threads | |
| US20080109604A1 (en) | Systems and methods for remote direct memory access to processor caches for RDMA reads and writes | |
| CN114827048A (en) | Dynamic configurable high-performance queue scheduling method, system, processor and protocol | |
| US10740256B2 (en) | Re-ordering buffer for a digital multi-processor system with configurable, scalable, distributed job manager | |
| EP1504349B1 (en) | Signal aggregation | |
| US9779044B2 (en) | Access extent monitoring for data transfer reduction | |
| WO2008057833A2 (en) | System and method for remote direct memory access without page locking by the operating system | |
| US6985982B2 (en) | Active ports in a transfer controller with hub and ports |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |