Microprocessor system and method for instruction-initiated recording and execution of instruction sequences in a dynamically decoupleable extended instruction pipeline

Information

  • Patent Grant
  • 7971042
  • Patent Number
    7,971,042
  • Date Filed
    Thursday, September 28, 2006
    18 years ago
  • Date Issued
    Tuesday, June 28, 2011
    13 years ago
Abstract
Systems and methods for recording instruction sequences in a microprocessor having a dynamically decoupleable extended instruction pipeline. A record instruction including a record start address is sent to the extended pipeline. The extended pipeline thus begins recording the subsequent instruction sequence at the specified address until an end record instruction is encountered. The end record instruction is recorded as the last instruction in the sequence. The main pipeline may then call the instruction sequence by sending a run instruction including the start address for the desired sequence to the extended pipeline. This run instruction causes the extended pipeline to begin autonomously executing the recorded sequence until the end record instruction is encountered. This instruction causes the extended pipeline to cease autonomous execution and to return to executing instructions supplied by the main pipeline.
Description
FIELD OF THE INVENTION

The invention relates generally to embedded microprocessor architecture and more specifically to systems and methods for recording instruction sequences in microprocessor-based systems.


BACKGROUND OF THE INVENTION

Processor extension logic is utilized to extend a microprocessor's capability.


Typically, this logic is in parallel and accessible by the main processor pipeline. It is often used to perform specific, repetitive, computationally intensive functions thereby freeing up the main processor pipeline.


In conventional microprocessors, there are essentially two types of parallel pipeline architectures: tightly coupled and loosely or decoupled. In the former, instructions are fetched and executed serially in the main processor pipeline. If the instruction is an instruction to be processed by the extension logic, the instruction is sent to that logic.


However, every instruction comes from the main pipeline, thus the two pipelines are said to be tightly coupled. Also, transporting each instruction to be executed by the extension logic with the main instruction pipeline requires significant overhead, reducing the efficiency gains provided by the extension logic.


In the second architecture, the parallel pipeline containing the extension logic is capable of fetching and executing its own instructions. However, control and synchronization becomes difficult when programming a processor having such a decoupled architecture.


Thus, there exists a need for a parallel pipeline architecture that can fully exploit the advantages of parallelism without suffering from the design complexity of loosely or completely decoupled pipelines.


SUMMARY OF THE INVENTION

In view of the foregoing, at least one embodiment of the invention may provide a method of recording processor extension instruction sequences for a CPU (central processing unit) employing processor extensions. The method according to this embodiment may comprise issuing a sequence record instruction to a processor extension, including a memory address to record to, issuing a processor instruction sequence to the processor extension to be recorded, and issuing a sequence record end instruction to the processor extension, wherein the CPU can make future calls to the processor instruction by merely referencing the instruction address specified in the sequence record instruction.


Accordingly, at least one embodiment of the invention provides a microprocessor architecture. The microprocessor architecture according to this embodiment comprises a main instruction pipeline, and an extended instruction pipeline, wherein the main instruction pipeline is configured to issue a begin record instruction to the extended instruction pipeline, causing the extended instruction pipeline to begin recording a sequence of instructions issued by the main instruction pipeline.


Another embodiment of the invention provides A method of recording instruction sequences in a microprocessor-based system having an main instruction pipeline and an extended instruction pipeline. The method according to this embodiment comprises sending a record instruction from the main instruction pipeline to the extended instruction pipeline to cause the extended instruction pipeline to begin recording an instruction sequence, and sending an end record instruction from the main instruction pipeline to the extended instruction pipeline to cause the extended instruction pipeline to stop recording the instruction sequence.


Still a further embodiment of the invention provides in a microprocessor-based system comprising a main instruction pipeline and an extended instruction pipeline, a method of recording instruction sequences for the extended instruction pipeline to reduce microprocessor overhead. The method according to this embodiment comprises issuing a begin record instruction from the main instruction pipeline to the extended instruction pipeline, the begin record instruction including a starting address to begin storing an instruction sequence, subsequently recording an instruction sequence supplied by the main instruction pipeline, and issuing an end record instruction from the main instruction pipeline to the extended instruction pipeline causing the extended processor pipeline to record the end record instruction as the last instruction in the sequence, wherein future calls to the recorded sequence are made by sending a run instruction from the main instruction pipeline to the extended instruction pipeline, the run instruction specifying the starting address of the recorded instruction sequence and causing the extended processor pipeline to begin a mode of autonomous operation until the end record instruction is encountered.


These and other embodiments and advantages of the present invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the principles of the invention.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to facilitate a fuller understanding of the present disclosure, reference is now made to the accompanying drawings, in which like elements are referenced with like numerals. These drawings should not be construed as limiting the present disclosure, but are intended to be exemplary only.



FIG. 1 is a functional block diagram illustrating a microprocessor-based system including a main processor core and a SIMD media accelerator according to at least one embodiment of the invention;



FIG. 2 is a block diagram illustrating a conventional multistage microprocessor pipeline having a pair of parallel data paths;



FIG. 3 is a block diagram illustrating another conventional multiprocessor design having a pair of parallel processor pipelines;



FIG. 4 is a block diagram illustrating a dynamically decoupleable multi-stage microprocessor pipeline including an instruction sequence record memory according to at least one embodiment of the invention;



FIG. 5 is a code fragment containing an example of a processor extension instruction sequence that is issued to the processor extension in accordance with various embodiments of the invention;



FIG. 6 is a code fragment in which a processor extension instruction is preloaded to a memory location and then run from that location by the processor extension in accordance with various embodiments of the invention;



FIG. 7 is a code fragment containing an example of an extension instruction sequence that is being issued and simultaneously captured and recorded in accordance with at least one embodiment of the invention; and



FIG. 8 is a flow chart of an exemplary method for recording instruction in an extended instruction pipeline and using such recorded instructions according to at least one embodiment of the invention.





DETAILED DESCRIPTION

The following description is intended to convey a thorough understanding of the embodiments described by providing a number of specific embodiments and details involving microprocessor architecture and systems and methods for recording instruction sequences in microprocessor-based systems. It should be appreciated, however, that the present invention is not limited to these specific embodiments and details, which are exemplary only. It is further understood that one possessing ordinary skill in the art, in light of known systems and methods, would appreciate the use of the invention for its intended purposes and benefits in any number of alternative embodiments, depending upon specific design and other needs.


Commonly assigned U.S. patent application Ser. No. 11/528,434 titled “System and Method for Selectively Decoupling a Parallel Extended Processor Pipeline,” filed concurrently with this application is hereby incorporated by reference in its entirety into the disclosure of this application.


Referring now to FIG. 1, a functional block diagram illustrating a microprocessor-based system 5 including a main processor core 10 and a SIMD media accelerator 50 according to at least one embodiment of the invention is provided. The diagram illustrates a microprocessor 5 comprising a standard single instruction single data (SISD) processor core 10 having a multistage instruction pipeline 12 and a SIMD media engine 50. In various embodiments, the processor core 10 may be a processor core such as the ARC 700 embedded processor core available from ARC, International of Elstree, United Kingdom, and as described in provisional patent application number 60/572,238 filed May 19, 2004 entitled “Microprocessor Architecture” which, is hereby incorporated by reference in its entirety. Alternatively, in various embodiments, the processor core may be a different processor core.


In various embodiments, a single instruction issued by the processor pipeline 12 may cause up to 16 16-bit elements to be operated on in parallel through the use of the 128-bit data path 55 in the media engine 50. In various embodiments, the SIMD engine 50 utilizes closely coupled memory units. In various embodiments, the SIMD data memory 52 (SDM) is a 128-bit wide data memory that provides low latency access to and from the 128-bit vector register file 51. The SDM contents are transferable via a DMA unit 54 thereby freeing up the processor core 10 and the SIMD core 50. In various embodiments, a SIMD code memory 56 (SCM) allows the SIMD unit to fetch instructions from a localized code memory via the Fetch stage 53 of its pipeline, allowing the SIMD pipeline to dynamically decouple from the processor core 10 resulting in truly parallel operation between the processor core and SIMD media engine.


Therefore, in various embodiments, the microprocessor architecture will permit the processor-based system 5 to operate in both closely coupled and decoupled modes of operation. In the closely coupled mode of operation, the SIMD program code fetch is exclusively handled by the main processor core 10. In the decoupled mode of operation, the SIMD pipeline 50 executes code fetched from a local memory 56 independent of the processor core 10. The processor core 10 may therefore instruct the SIMD pipeline 50 to execute autonomously in this de-coupled mode, for example, to perform video tasks such as audio processing, entropy encoding/decoding, discrete cosine transforms (DCTs) and inverse DCTs, motion compensation and de-block filtering.


Referring now to FIG. 2, a block diagram illustrating a conventional multistage microprocessor pipeline having a pair of parallel data paths is depicted. In a microprocessor employing a variable-length pipeline, data paths required to support different instructions typically have a different number of stages. Data paths supporting specialized extension instructions for performing digital signal processing or other complex but repetitive functions may be used only some of the time during processor execution and remain idle otherwise. Thus, whether or not these instructions are currently needed will effect the number of effective stages in the processor pipeline.


Extending a general-purpose microprocessor with application specific extension instructions can often add significant length to the instruction pipeline. In the pipeline of FIG. 2, pipeline stages F1 to F4 at the front end 100 of the processor pipeline are responsible for functions such as instruction fetch, decode and issue. These pipeline stages are used to handle all instructions issued by the microprocessor. After these stages, the pipeline splits into parallel data paths 110 and 115 incorporating stages E1-E3 and D1-D4 respectively. These parallel sub-paths represent pipeline stages used to support different instructions/data operations. For example, stages E1-E3 may be the primary/default processor pipeline, while stages D1-D4 comprise the extended pipeline designed for processing specific instructions. This type of architecture can be characterized as coupled or tightly coupled to the extent that regardless of whether instructions are destined for default pipeline stages E1-E3 or extended pipeline D1-D4, they all must pass through stages F1-F4, until a decision is made as to which portion of the pipeline will perform the remaining processing steps.


By using the single pipeline front-end to fetch and issue all instructions, the processor pipeline of FIG. 2 achieves the advantage that instructions can be freely intermixed, irrespectively of whether the instructions are executed by the data path in sub-paths E1-E3 or D1-D4. Thus, all instructions appear as a single thread of program execution. This type of pipeline architecture also has the advantage of greatly simplified program design and debugging, thereby reducing the time to market in product developments. It is admittedly a highly flexible architecture. However, a limitation of this architecture is that the sequential nature of instruction execution significantly limits the exploitable parallelism between the data paths that could otherwise be used to improve overall performance. This negatively effects performance relative to other parallel pipeline architectures.



FIG. 3 is a block diagram illustrating another conventional multiprocessor architecture having a pair of parallel instruction pipelines. The processor pipeline of FIG. 3 contains a front end 120 comprised of stages F1-F4 and a rear portion 125 comprised of stages E1-E3. However, the processor also contains a parallel data path having a front end 135 comprised of front end stages G1-G2 and rear portion 140 comprised of stages D1-D4. Unlike the architecture of FIG. 2, this architecture contains truly parallel pipelines to the extent that both front portions 420 and 435 each can fetch instructions separately. This type of parallel architecture may be characterized as loosely coupled or decoupled because the application specific extension data path G1-G2 and D1-D4 is autonomous and can execute instructions in parallel to the main pipeline consisting of F1-F4 and E1-E3. This arrangement enhances exploitable parallelism over the architecture depicted in FIG. 2. However, as the two parallel pipelines become independent, mechanisms are required to synchronize their operations, as represented by dashed line 130. These mechanisms, typically implemented using specific instructions and bus structures which, are often not a natural part of a program and are inserted as after-thoughts to “fix” the disconnect between main pipeline and extended pipeline. As consequence of this, the resulting program utilizing both instruction pipelines becomes difficult to design and optimize.


Referring now to FIG. 4, a block diagram illustrating a dynamically decoupleable multi-stage microprocessor pipeline including an instruction sequence record memory according to at least one embodiment of the invention is provided. The pipeline architecture according to this embodiment ameliorates at least some and preferably most or all of the above-noted limitations of conventional parallel pipeline architectures. This exemplary pipeline depicted in FIG. 4 consists of a front end portion 145 comprising stages F1-F4, a rear portion 150 comprising stages E1-E3, and a parallel extendible pipeline having a front portion 160 comprising stages G1-G2 and a rear portion 165 comprising stages D1-D4. In the pipeline depicted in FIG. 4, instructions can be issued from the main processor pipeline F1-F4 to the extended pipeline D1 to D4. To decouple the extendible pipeline D1 to D4 from the front portion 145 of the main pipeline F1 to F4, a queue 155 is added between the two pipelines. The queue serves to delay execution of instructions issued by the front end portion 145 of the main pipeline if the extension pipeline is not ready. A tradeoff can be made during system design to decide on how many entries should be in the queue 155 to insure that the extension pipeline is sufficiently decoupled from the main pipeline. The architecture of FIG. 4 also includes a record memory 156 coupled to the queue 155 and the front end of the parallel extended pipeline G1-G2. In various embodiments, as will be discussed in greater detail in the context of FIGS. 5-8, instructions sequences can be recorded in the record memory 156.


Additionally, in various embodiments, the main pipeline can issue a Sequence Run (vrun) instruction to instruct the extension pipeline to execute an instruction sequence in the record memory 156, causing the extension pipeline to use its own front end 160, G1 to G2 in the diagram, to fetch and execute instructions autonomously. In various embodiments, while the extension pipeline, G1-G2 and D1-D4, is performing operations, the main pipeline can keep issuing extension instructions that accumulate in the queue 155 until the extension pipeline executes a Sequence Record End (vendrec) instruction. After the vendrec instruction is issued, the extension resumes executing instructions issued to the queue 155.


Therefore, instead of trying to get what effectively becomes two independent processors to work together as in the pipeline depicted in FIG. 3, the pipeline depicted in FIG. 4 is designed to switch between being coupled, that is, executing instructions for the main pipeline front end 145, and being decoupled, that is, during autonomous runtime of the extended pipeline. As such, the instructions vrun and vendrec, which dynamically switch the pipeline between the coupling states, can be designed to be light weight, executing in, for example, a single cycle. These instructions can then be seen as parallel analogs of the conventional call and return instructions. That is, when instructing the extension pipeline to fetch and execute instructions autonomously, the main processor pipeline is issuing a parallel function call that runs concurrently with its own thread of instruction execution to maximize speedup of the application. The two threads of instruction execution eventually join back into one after the extension pipeline executes the vendrec instruction which is the last instruction of the program thread autonomously executed by the extension pipeline.


In addition to efficient operation, another advantage of this architecture is that during debugging, such as, for example, instruction stepping, the two parallel threads can be forced to be serialized such that the CPU front portion 145 will not issue any instruction after issuing vrun to the extension pipeline until the latter fetches and executes the vendrec instruction. In various embodiments, this will give the programmer the view of a single program thread that has the same functional behavior of the parallel program when executed normally and hence will greatly simplify the task of debugging.


Another advantage of the processor pipeline containing a parallel extendible pipeline that can be dynamically coupled and decoupled is the ability to use two separate clock domains. In low power applications, it is often necessary to run specific parts of the integrated circuit at varying clock frequencies, in order to reduce and/or minimize power consumption. Using dynamic decoupling, the front end portion 145 of the main pipeline can utilize an operating clock frequency different from that of the parallel pipeline 165 of stages D1-D4 with the primary clock partitioning occurring naturally at the queue 155 labeled as Q in the FIG. 4.


As discussed above in the context of FIG. 1, general purpose microprocessors, including embedded microprocessors, are sometimes extended with co-processors, additional extension instructions, and/or pipeline extensions, all collectively referred to hereafter as “processor extensions.” A processor extension typically supports specialized instructions that hugely accelerate the computation required by the application that the instruction is designed for. For example, SIMD extension instructions can be added to a processor to improve performance of applications with high degree of data parallelism. Traditionally, there are two ways by which such specialized instructions are issued. Firstly, the instructions can be issued directly from the CPU or main processor pipeline to the processor extension through a tightly coupled interface as discussed above in the context of FIG. 2. Secondly, the CPU can preload the instructions into specific memory locations and the processor extension is then instructed by the CPU to fetch and execute the preloaded instructions from memory so that the processor extensions are largely decoupled from the CPU, as discussed in the context of FIG. 3.


In view of the shortcomings of these two traditional methods, various embodiments of this invention propose an innovative alternative in which processor extension instructions are issued by the CPU (main processor pipeline) and dynamically captured into a processor extension memory or processor extension instruction buffer/queue for subsequent retrieval and playback. In various embodiments, processor extension instructions can optionally be executed by the processor extensions as they are captured and recorded.


By way of example, consider code fragment A of FIG. 5. In this code fragment, all instructions from statement L1 to just before statement L3 are to be issued to the extended instruction pipeline. In this case, these extension instructions are intermixed with general-purpose instructions and the extension instructions are issued to the processor extension by the CPU, through retrieval of the instructions from CPU instruction memory.


One problem with this approach is that intermixing instructions makes execution in the CPU and the processor extension difficult to decouple. Additionally, extension instruction sequences are typically used in several places in an application. However, the way that these instructions are included in code fragment A does not allow for reductions in overall code size. An increase in overhead to the standard CPU code execution performance is also associated with the issuing of extension instructions due to the number of cycles consumed in the transport of processor extension instructions as well as the CPU instruction cache occupancy overhead due to storage of processor extension instructions.


As an alternative to this approach of loading instructions whenever they are needed, in various embodiments of the invention, an extension instruction sequence can be preloaded into some specific memory location from which the processor extension logic is directed to fetch such instructions, as shown in code fragment B in FIG. 6. In code fragment B, the extension instruction sequence is preloaded to location L100 and then a Sequence Run (vrun) instruction is issued in statement L5 to direct the processor extension to fetch and execute the sequence. However, to dynamically preload such a sequence in a CPU with load/store architecture, each instruction has first to be loaded into a register in the CPU and then stored at the desired location, requiring at least 2 instructions (a load and a store). Additional overhead is also incurred by the need to track the number of instructions to be loaded and to increment the addresses of the targeted memory locations. Furthermore, if the extension instruction sequence is adaptive, that is, based upon the run-time conditions in the CPU, the preloading routine, referred to as the preloader, would need linking functionalities to modify the sequence while preloading. Such functionalities add to the preloading overhead. An example of adaptation is L2 in code fragment A of FIG. 5 in which a CPU register r10 is read in additional to the extension register vr01. The cumulative effect of all these overheads can significantly reduce application performance if the extension instruction sequences have to be dynamically reloaded relatively frequently as is likely in video processing applications.


Thus, in various embodiments, this invention introduces a scheme by which, instead of preloading, extension instruction sequences can be captured on-the-fly, that is, while such instructions are being issued from the CPU, and recorded to specific memory locations accessible by the extension logic. The instructions being recorded can also be optionally executed by the processor extension, further reducing the recording overhead.


Referring now to the code fragment C in FIG. 7, in this fragment the Sequence Record (vrec) instruction in statement L1A initiates a recording session to record all extension instructions issued by the CPU to the memory locations starting at L100. The Sequence Record End (vendrec) instruction in statement L2C terminates the recording session. This type of record instruction is referred to herein as an instruction macro. Once the instruction macro is recorded, the CPU can then direct the processor extension to fetch and execute the instruction macro using only the vrun instruction, for example, in statement L5 of code segment C. The overhead in recording the macro is now constrained by the rate in which the CPU can issue extension instructions, which is typically one instruction per cycle, and is significantly less than the overhead in instruction preloading. Also, it becomes trivial to adapt the instruction macro based on runtime conditions in the CPU. There are two such examples of adaptation in code fragment C. In the first example, when issuing the vbmulf instruction in statement L2, the CPU can read its own register r10 and its value is issued directly to the processor extension together with the instruction and recorded into the macro. In the second example, the breq instruction in statement L2A is actually a conditional branch instruction of the CPU that depends on the contents of the CPU registers r4 and r5. If this branch is taken, the vaddw instruction in statement L2B will not be issued to the processor extension and hence not recorded. In various embodiments, a mechanism is used to keep track of address locations in the SCM such that during the recording of subsequent additional instruction sequences, previous instruction sequences are not overwritten and such that different instruction sequence start addresses are maintained by the main processor core.


A further advantage of instruction recording over preloading is the elimination of the requirement to load the extension instruction sequences into data cache using the preloader, which would have polluted the data cache and thereby reduce overall efficiency of the CPU. Furthermore, by replacing the vrec instruction in statement L1A by the Sequence Record And Run (vrecrun) instruction, the instruction being captured and recorded is also executed by the processor extension and the overhead of instruction recording is thereby reduced or even minimized. Once recorded, an instruction macro can be used in the same way as a preloaded instruction sequence and has the same benefits of code reuse and simplifying decoupled execution. In various embodiments, the record mechanism can coexist with the preloading mechanism, that is, the two mechanisms are not necessarily mutually exclusive. As an example, preloading may still be useful for preloading macros that do not require frequent reloading in runtime.


In various embodiments, in order to increase and ideally maximize flexibility, the processor extension can operate in one of two modes. In various embodiments, after executing the Sequence Run (vrun) instruction, the processor extension may switch to an autonomous mode in which it fetches and execute instructions in a pre-recorded macro on its own. After executing the Sequence Record End (vendrec) instruction that signifies the end of an instruction macro, the processor extension may switch back to the normal operating mode, in which the CPU provides all further processor extension instructions. As a result of this flexibility, this recording scheme combines all the benefits of direct instruction issuing and preloading.


Referring now to FIG. 8, this Figure is a flow chart of an exemplary method for recording instructions in an extended instruction pipeline and using such recorded instructions according to at least one embodiment of the invention. The method begins in step 200 and proceeds to step 205, where the main processor pipeline issues a record instruction sequence instruction to the extended instruction pipeline. In various embodiments, as discussed above, this record sequence instruction will specify a starting memory address. In step 210, the extended pipeline begins recording the sequence of instructions following the record instruction in a memory structure accessible by the extended pipeline at the starting location specified in the record instruction. It should be appreciated that, as discussed herein, in step 210 the extended pipeline may also begin executing the sequence of instruction in addition to recording them.


In step 215, the main pipeline issues the record end instruction to the extended pipeline causing the latter to stop recording the instruction sequence. In various embodiments, as indicated in step 220, the extended instruction pipeline may record the end record instruction as the last instruction in the current sequence. As discussed above, after the instruction sequence has been recorded, the main processor pipeline can call the instruction sequence with a single run instruction and effectively decouple the extended pipeline from the main pipeline, as exemplified in the remaining method steps of FIG. 8.


In step 225, the main processor pipeline calls the recorded instruction sequence. In various embodiments as illustrated in FIGS. 6-7 and discussed in the corresponding description, this is accomplished by issuing a run instruction that specifies the start address of the instruction sequence. In this manner, different sequences may be called with the same run instruction by specifying different start addresses. By calling this recorded instruction, the main pipeline effectively decouples the extended pipeline so that the latter may begin fetching and executing instructions autonomously, as stated in step 230. As discussed above, in various embodiments, the extended pipeline has its own front end for this purpose. In various embodiments, the extended pipeline will continue operating in the autonomous mode, that is independent of main pipeline's fetch-execution cycles, until the “end” or “record end” instruction that was previously recorded at the end of the current instruction sequence is encountered. In various embodiments, this instruction will cause the extended pipeline to cease autonomous execution and, as stated in step 235, to resume executing instructions issued by the main pipeline via the queue, as discussed in the related application entitled, “System and Method for Selectively Decoupling a Parallel Extended Processor Pipeline.”


The embodiments of the present inventions are not to be limited in scope by the specific embodiments described herein. For example, although many of the embodiments disclosed herein have been described with reference to systems and method for recording instruction sequences in a microprocessor including a main instruction pipeline and an extended instruction pipeline in a SIMD microprocessor architecture, the principles herein are equally applicable to other aspects of microprocessor design and function. Indeed, various modifications of the embodiments of the present inventions, in addition to those described herein, will be apparent to those of ordinary skill in the art from the foregoing description and accompanying drawings. Thus, such modifications are intended to fall within the scope of the following appended claims. Further, although some of the embodiments of the present invention have been described herein in the context of a particular implementation in a particular environment for a particular purpose, those of ordinary skill in the art will recognize that its usefulness is not limited thereto and that the embodiments of the present inventions can be beneficially implemented in any number of environments for any number of purposes. Accordingly, the claims set forth below should be construed in view of the full breath and spirit of the embodiments of the present inventions as disclosed herein.

Claims
  • 1. A microprocessor architecture having decoupled fetch-execution cycles for at least two instruction pipelines, comprising: a main instruction pipeline operating at a first clock frequency; andan extended instruction pipeline,wherein the main instruction pipeline is configured to issue: a begin record instruction to the extended instruction pipeline, causing the extended instruction pipeline to begin recording a sequence of instructions issued by the main instruction pipeline; anda single instruction comprising a starting address of the sequence of recorded instructions to the extended instruction pipeline, causing the extended instruction pipeline to execute the sequence of recorded instructions;wherein the single instruction or the begin record instruction causes the extended instruction pipeline to switch to an autonomous mode of operation from a main instruction pipeline controlled mode of operation,wherein operating in the autonomous mode of operation comprises fetching and executing instructions from the sequence of recorded instructions independent from the main instruction pipeline, through a front end portion of the extended instruction pipeline, the front end portion of the extended instruction pipeline operating at a second clock frequency that is different from the first clock frequency, thereby decoupling the fetch-execution cycles of the main instruction pipeline from the extended instruction pipeline.
  • 2. The microprocessor architecture according to claim 1, wherein the begin record instruction specifies a starting memory address of a memory structure accessible by the extended instruction pipeline at which to begin storing the issued sequence of instructions.
  • 3. The microprocessor architecture according to claim 2, wherein the begin record instruction instructs the extended instruction pipeline to execute the issued sequence of instructions.
  • 4. The microprocessor architecture according to claim 2, wherein a microprocessor core for implementing the main instruction pipeline maintains a plurality of instruction sequence start addresses.
  • 5. The microprocessor architecture according to claim 1, wherein the main instruction pipeline is further configured to issue an end record instruction to the extended instruction pipeline to stop recording instructions.
  • 6. The microprocessor architecture according to claim 5, wherein the end record instruction is issued by the main instruction pipeline in the sequence of instructions and is recorded as the last instruction of the sequence of instructions.
  • 7. The microprocessor architecture according to claim 6, wherein execution of the end record instruction by the extended instruction pipeline causes the extended instruction pipeline to switch back from the autonomous mode of operation to the main instruction pipeline controlled mode of operation.
  • 8. A method of decoupling the fetch-execution cycles of at least two instruction pipelines in a microprocessor-based system having a main instruction pipeline operating at a first clock frequency and an extended instruction pipeline, the method comprising: sending a record instruction from the main instruction pipeline to the extended instruction pipeline to cause the extended instruction pipeline to begin recording an instruction sequence;sending an end record instruction from the main instruction pipeline to the extended instruction pipeline to cause the extended instruction pipeline to stop recording the instruction sequence;sending a single run instruction comprising a starting address of the sequence of recorded instructions from the main instruction pipeline to the extended instruction pipeline to cause the extended instruction pipeline to begin executing the recorded sequence of instructions; andswitching the extended instruction pipeline to an autonomous mode of operation from a main instruction pipeline controlled mode of operation, wherein operating in the autonomous mode of operation comprises fetching and executing instructions from the recorded sequence of instructions independent from the main instruction pipeline, through a front end portion of the extended instruction pipeline, the front end portion of the extended instruction pipeline operating at a second clock frequency that is different from the first clock frequency, thereby decoupling the fetch-execution cycles of the main instruction pipeline from the extended instruction pipeline.
  • 9. The method according to claim 8, wherein sending the record instruction comprises specifying a starting memory address of a memory structure accessible by the extended instruction pipeline at which to begin storing the instruction sequence.
  • 10. The method according to claim 9, wherein a microprocessor core for implementing the main instruction pipeline maintains a plurality of starting memory addresses.
  • 11. The method according to claim 8, wherein sending the record instruction comprises sending an instruction that causes the extended instruction pipeline to execute the instruction sequence.
  • 12. The method according to claim 8, wherein sending the single run instruction comprises causing the extended instruction pipeline to begin the autonomous mode of operation.
  • 13. The method according to claim 12, wherein sending the end record instruction from the main instruction pipeline to the extended instruction pipeline comprises causing the extended instruction pipeline to record the end record instruction as the last instruction in the recorded sequence.
  • 14. The method according to claim 13, further comprising ending the autonomous mode of operation when the end record instruction is executed by the extended instruction pipeline and returning to a main pipeline controlled mode of operation.
  • 15. In a microprocessor-based system comprising a main instruction pipeline operating at a first clock frequency and an extended instruction pipeline, a method of decoupling the fetch-execution cycles of at least two instruction pipelines in the microprocessor-based system for the extended instruction pipeline to reduce microprocessor overhead comprising: issuing a begin record instruction from the main instruction pipeline to the extended instruction pipeline, the begin record instruction including a starting address to begin storing an instruction sequence;subsequently recording the instruction sequence supplied by the main instruction pipeline;issuing an end record instruction from the main instruction pipeline to the extended instruction pipeline causing the extended instruction pipeline to record the end record instruction as the last instruction in the sequence, wherein future calls to the recorded instruction sequence are made by sending a run instruction from the main instruction pipeline to the extended instruction pipeline, the run instruction specifying the starting address of the recorded instruction sequence and causing the extended instruction pipeline to begin a mode of autonomous operation; andoperating in the mode of autonomous operation, wherein autonomous operation comprises the extended instruction pipeline fetching and executing instructions from the recorded instruction sequence independent from the main instruction pipeline, through a front end portion of the extended instruction pipeline, the front end portion of the extended instruction pipeline operating at a second clock frequency that is different from the first clock frequency, thereby decoupling the fetch-execution cycles of the main instruction pipeline from the extended instruction pipeline, until the end record instruction is encountered.
CROSS REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Patent Application No. 60/721,108 titled “SIMD Architecture and Associated Systems and Methods,” filed Sep. 28, 2005, the disclosure of which is hereby incorporated by reference in its entirety.

US Referenced Citations (247)
Number Name Date Kind
4594659 Guenthner et al. Jun 1986 A
4829460 Ito May 1989 A
4831571 Tokumaru May 1989 A
4905178 Mor et al. Feb 1990 A
4914622 Sfarti et al. Apr 1990 A
4926323 Baror et al. May 1990 A
4939684 Gehrig et al. Jul 1990 A
4962500 Nakagawa Oct 1990 A
5148532 Narita et al. Sep 1992 A
5155698 Niimi et al. Oct 1992 A
5155843 Stamm et al. Oct 1992 A
5220670 Arakawa et al. Jun 1993 A
5295250 Komoto et al. Mar 1994 A
5317701 Reininger et al. May 1994 A
5327536 Suzuki Jul 1994 A
5422964 Devimeux et al. Jun 1995 A
5423011 Blaner Jun 1995 A
5450586 Kuzara et al. Sep 1995 A
5454117 Puziol et al. Sep 1995 A
5475856 Kogge Dec 1995 A
5493687 Garg et al. Feb 1996 A
5509129 Guttag et al. Apr 1996 A
5517436 Andreas et al. May 1996 A
5530825 Black et al. Jun 1996 A
5542074 Kim et al. Jul 1996 A
5560036 Yoshida Sep 1996 A
5586279 Pardo et al. Dec 1996 A
5590350 Guttag et al. Dec 1996 A
5590351 Sowadsky et al. Dec 1996 A
5600674 Bonet et al. Feb 1997 A
5600847 Guttag et al. Feb 1997 A
5636363 Bourekas et al. Jun 1997 A
5642500 Inone Jun 1997 A
5655122 Wu Aug 1997 A
5692168 McMahan Nov 1997 A
5696954 Guttag et al. Dec 1997 A
5696958 Mowry et al. Dec 1997 A
5727211 Gulsen Mar 1998 A
5752014 Mallick et al. May 1998 A
5778423 Sites et al. Jul 1998 A
5784636 Rupp Jul 1998 A
5805876 Bose et al. Sep 1998 A
5809293 Bridges et al. Sep 1998 A
5826100 Bonet et al. Oct 1998 A
5835753 Witt Nov 1998 A
5848264 Baird et al. Dec 1998 A
5884057 Blomgren et al. Mar 1999 A
5892847 Johnson Apr 1999 A
5896305 Bosshart et al. Apr 1999 A
5907498 Rim May 1999 A
5909566 Cai et al. Jun 1999 A
5920711 Seawright et al. Jul 1999 A
5923892 Levy Jul 1999 A
5937202 Crosetto Aug 1999 A
5948099 Crawford et al. Sep 1999 A
5964884 Partovi et al. Oct 1999 A
5978909 Lempel Nov 1999 A
5996071 White et al. Nov 1999 A
6014743 Henry et al. Jan 2000 A
6026478 Dowling Feb 2000 A
6038649 Ozawa et al. Mar 2000 A
6044458 Rinkenberger et al. Mar 2000 A
6061521 Thayer et al. May 2000 A
6076158 Sites et al. Jun 2000 A
6088034 Deering Jul 2000 A
6088786 Feierbach et al. Jul 2000 A
6141673 Thayer et al. Oct 2000 A
6151672 Hunt Nov 2000 A
6154857 Mann Nov 2000 A
6157988 Dowling Dec 2000 A
6185732 Mann et al. Feb 2001 B1
6189091 Col et al. Feb 2001 B1
6226738 Dowling May 2001 B1
6253287 Green Jun 2001 B1
6289417 Larri Sep 2001 B1
6292879 Fong Sep 2001 B1
6327651 Dubey et al. Dec 2001 B1
6339822 Miller Jan 2002 B1
6343337 Dubey et al. Jan 2002 B1
6353882 Hunt Mar 2002 B1
6377970 Abdallah et al. Apr 2002 B1
6412038 Mehalel Jun 2002 B1
6412066 Worrell et al. Jun 2002 B2
6427206 Yeh et al. Jul 2002 B1
6477683 Killian et al. Nov 2002 B1
6499101 Henry et al. Dec 2002 B1
6518974 Taylor et al. Feb 2003 B2
6519696 Henry et al. Feb 2003 B1
6526502 Col et al. Feb 2003 B1
6529930 Sazzad et al. Mar 2003 B1
6550056 Mizumoto et al. Apr 2003 B1
6560754 Hakewill et al. May 2003 B1
6571331 Henry et al. May 2003 B2
6584585 Patterson, Jr. Jun 2003 B1
6609194 Henry et al. Aug 2003 B1
6622240 Olson et al. Sep 2003 B1
6647491 Hsu et al. Nov 2003 B2
6671743 Verity Dec 2003 B1
6681295 Root et al. Jan 2004 B1
6718460 Prakash Apr 2004 B1
6718504 Coombs et al. Apr 2004 B1
6757019 Hsieh et al. Jun 2004 B1
6760833 Dowling Jul 2004 B1
6774832 Essenwanger Aug 2004 B1
6823444 Henry et al. Nov 2004 B1
6853683 Song et al. Feb 2005 B2
6865663 Barry Mar 2005 B2
6886093 Henry et al. Apr 2005 B2
6895424 Kirsch May 2005 B2
6909744 Molloy Jun 2005 B2
6925634 Hunter et al. Aug 2005 B2
6948052 Nguyen et al. Sep 2005 B2
6950929 Chung et al. Sep 2005 B2
6954845 Arnold et al. Oct 2005 B2
6963554 Weigand Nov 2005 B1
6968444 Kroesche et al. Nov 2005 B1
6981012 Kirsch Dec 2005 B2
7010558 Morris Mar 2006 B2
7050504 Joch et al. May 2006 B2
7079147 Wichman et al. Jul 2006 B2
7093165 Kageshima Aug 2006 B2
7162619 Henry et al. Jan 2007 B2
7180943 Arlid et al. Feb 2007 B1
7181596 Henry et al. Feb 2007 B2
7215823 Miura et al. May 2007 B2
7277592 Lin Oct 2007 B1
7336720 Martemyanov et al. Feb 2008 B2
7424501 Macy, Jr. Sep 2008 B2
7457362 Sankaran Nov 2008 B2
7539714 Macy, Jr. et al. May 2009 B2
20010016903 Tremblay Aug 2001 A1
20010021974 Lee Sep 2001 A1
20010032309 Henry et al. Oct 2001 A1
20010040686 Schoolcraft et al. Nov 2001 A1
20010044892 Yamaura Nov 2001 A1
20010046260 Molloy Nov 2001 A1
20010050682 Deering et al. Dec 2001 A1
20010056531 McFarling Dec 2001 A1
20020025001 Ismaeil et al. Feb 2002 A1
20020053015 Tan et al. May 2002 A1
20020065860 Grisenthwaite et al. May 2002 A1
20020066006 Worrell May 2002 A1
20020069351 Chi et al. Jun 2002 A1
20020073301 Kahle et al. Jun 2002 A1
20020078332 Seznec et al. Jun 2002 A1
20020083312 Sinharoy Jun 2002 A1
20020087851 Yoshioka Jul 2002 A1
20020087852 Jourdan et al. Jul 2002 A1
20020100019 Hunter et al. Jul 2002 A1
20020100020 Hunter et al. Jul 2002 A1
20020138236 Takamura Sep 2002 A1
20020157000 Hay et al. Oct 2002 A1
20020188833 Henry et al. Dec 2002 A1
20020194238 Kirsch Dec 2002 A1
20020194461 Henry et al. Dec 2002 A1
20020194462 Henry et al. Dec 2002 A1
20020194463 Henry et al. Dec 2002 A1
20020194464 Henry et al. Dec 2002 A1
20020198916 Kirsch Dec 2002 A1
20020199092 Henry et al. Dec 2002 A1
20030023838 Karim et al. Jan 2003 A1
20030046614 Brokish Mar 2003 A1
20030070013 Hansson Apr 2003 A1
20030105793 Guttag et al. Jun 2003 A1
20030123748 Sebot et al. Jul 2003 A1
20030126508 Litt Jul 2003 A1
20030131030 Sebot et al. Jul 2003 A1
20030154359 Henry et al. Aug 2003 A1
20030154463 Betker et al. Aug 2003 A1
20030159009 Henry et al. Aug 2003 A1
20030159020 Henry et al. Aug 2003 A1
20030172252 Henry et al. Sep 2003 A1
20030188129 Henry et al. Oct 2003 A1
20030188130 Henry et al. Oct 2003 A1
20030188131 Henry et al. Oct 2003 A1
20030188133 Henry et al. Oct 2003 A1
20030188140 Henry et al. Oct 2003 A1
20030196077 Henry et al. Oct 2003 A1
20030204705 Oldfield et al. Oct 2003 A1
20030221091 Henry et al. Nov 2003 A1
20030225998 Khan et al. Dec 2003 A1
20040015683 Emma et al. Jan 2004 A1
20040049660 Jeppesen et al. Mar 2004 A1
20040054877 Macy et al. Mar 2004 A1
20040068643 Dowling Apr 2004 A1
20040103263 Colavin et al. May 2004 A1
20040139281 McDonald Jul 2004 A1
20040172524 Hoogerbrugge Sep 2004 A1
20040186985 Tran et al. Sep 2004 A1
20040193843 Altshuler et al. Sep 2004 A1
20040193852 Johnson Sep 2004 A1
20040193855 Kacevas et al. Sep 2004 A1
20040225870 Srinivasan et al. Nov 2004 A1
20040225871 Irie et al. Nov 2004 A1
20040225872 Bonanno et al. Nov 2004 A1
20040225949 Coombs Nov 2004 A1
20040230782 Busaba et al. Nov 2004 A1
20040250045 Dowling Dec 2004 A1
20040254965 Giernalczyk et al. Dec 2004 A1
20040255100 Kershaw Dec 2004 A1
20040255104 Akkary et al. Dec 2004 A1
20040267856 Macy Dec 2004 A1
20040268102 Combs et al. Dec 2004 A1
20050027970 Arnold et al. Feb 2005 A1
20050027971 Williams et al. Feb 2005 A1
20050027974 Lempel Feb 2005 A1
20050050309 Yamashita et al. Mar 2005 A1
20050060457 Olukotun Mar 2005 A1
20050066305 Lisanke et al. Mar 2005 A1
20050076193 Henry et al. Apr 2005 A1
20050091479 Chung Apr 2005 A1
20050097398 Day et al. May 2005 A1
20050102492 Henry et al. May 2005 A1
20050125613 Kim et al. Jun 2005 A1
20050125632 Alsup et al. Jun 2005 A1
20050125634 Ishizuka Jun 2005 A1
20050132175 Henry et al. Jun 2005 A1
20050138607 Lu Jun 2005 A1
20050154867 DeWitt, Jr. et al. Jul 2005 A1
20050169550 Arnold et al. Aug 2005 A1
20050172277 Chheda et al. Aug 2005 A1
20050174270 Koo et al. Aug 2005 A1
20050188179 Henry et al. Aug 2005 A1
20050204121 Burdass Sep 2005 A1
20050216703 Dieffenderfer et al. Sep 2005 A1
20050216713 Prasky et al. Sep 2005 A1
20050223202 Peri et al. Oct 2005 A1
20050273559 Aristodemou et al. Dec 2005 A1
20050273581 Arnold et al. Dec 2005 A1
20050278505 Lim et al. Dec 2005 A1
20050278513 Aristodemou et al. Dec 2005 A1
20050278517 Wong et al. Dec 2005 A1
20050289321 Hakewill et al. Dec 2005 A1
20050289323 Wong et al. Dec 2005 A1
20060015702 Khan et al. Jan 2006 A1
20060015706 Lai Jan 2006 A1
20060036836 Gelman et al. Feb 2006 A1
20060041868 Huang Feb 2006 A1
20060047934 Schmisseur et al. Mar 2006 A1
20060095713 Boggs et al. May 2006 A1
20070070080 Graham et al. Mar 2007 A1
20070071101 Topham Mar 2007 A1
20070071106 Graham et al. Mar 2007 A1
20070073925 Lim et al. Mar 2007 A1
20070074004 Wong et al. Mar 2007 A1
20070074007 Topham et al. Mar 2007 A1
20070074012 Graham et al. Mar 2007 A1
Foreign Referenced Citations (7)
Number Date Country
1 503595 Feb 2005 EP
2365583 Feb 2002 GB
WO-93-08526 Apr 1993 WO
WO 2005114441 Dec 2005 WO
WO 2006096612 Sep 2006 WO
WO 2007049150 May 2007 WO
WO 2008147565 Dec 2008 WO
Related Publications (1)
Number Date Country
20070074012 A1 Mar 2007 US
Provisional Applications (1)
Number Date Country
60721108 Sep 2005 US