Method and apparatus for scheduling to reduce space and increase speed of microprocessor operations

• US 6,738,893 B1
• Filed: 04/25/2000
• Issued: 05/18/2004
• Est. Priority Date: 04/25/2000
• Status: Expired due to Term

• Current Assignee: Intellectual Ventures Funding LLC (Intellectual Ventures LLC)
• Original Assignee: Transmeta Corporation (Novafora, Inc.)
• Inventors: Rozas, Guillermo J.
• Primary Examiner(s): Pan, Daniel H.
• Application Number:
  US09/557,650
• Time in Patent Office: 1,484 Days
• Field of Search: 712/300, 712/245, 712/227, 712/208, 712/210, 712/219, 712/24, 712/23, 712/244, 712/216, 712/41, 712/228, 717/141, 717/159, 717/161, 717/132, 709/102
• US Class Current: 712/24
• CPC Class Codes: G06F 8/447 Target code generation
• CPC Class Codes: G06F 9/3853 of compound instructions

Abstract

A process for scheduling computer processor execution of operations in a plurality of instruction word formats including the steps of arranging commands into properly formatted instruction words beginning at one end into a sequence selected to provide the most rapid execution of the operations, and then rearranging the operations within the plurality of instruction words from the other end of the sequence into instruction words selected to occupy the least space in memory.

Claims

1. A process for scheduling computer processor execution of commands in a plurality of instruction word formats comprising:

arranging commands into properly formatted instruction words beginning at one end into a sequence selected to provide the most rapid execution of the operations; and

rearranging the commands within the plurality of instruction words from another end of the sequence into instruction words selected to occupy the least space in memory, said rearranging comprises determining if said commands include a do nothing operation (no-op) command.

2. The process as described in claim 1, wherein the number of said plurality of instruction words is the same after said rearranging.

3. The process as described in claim 1, wherein said rearranging preserves any execution latency of said commands.

4. The process as described in claim 1, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a subsequent instruction word without violating any execution latency of said commands.

5. The process as described in claim 1, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a subsequent instruction word without violating any execution latency of said commands, provided said commands include said do nothing operation command.

6. The process as described in claim 1, wherein said rearranging further comprises:

expanding a short instruction word of said plurality of instruction words to a long instruction word.

7. A process for scheduling computer processor execution of commands in a plurality of instruction word formats, said process comprising:

arranging commands into a properly formatted plurality of instruction words to provide a sequence selected to provide the most rapid execution of the operations; and

rearranging said commands within said plurality of instruction words beginning at a last command of said sequence into instruction words selected to occupy the least space in memory, said rearranging comprises determining if said commands include a do nothing operation (no-op) command, said rearranging preserves any execution latency of said commands.

8. The process as described in claim 7, wherein the number of said plurality of instruction words is the same after said rearranging.

9. The process as described in claim 8, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a subsequent instruction word.

10. The process as described in claim 7, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a subsequent instruction word.

11. The process as described in claim 7, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a subsequent instruction word, provided said commands include said do nothing operation command.

12. The process as described in claim 7, wherein said rearranging further comprises:

expanding a short instruction word of said plurality of instruction words to a long instruction word.

13. A process for scheduling computer processor execution of commands in a plurality of instruction word formats, said process comprising:

arranging commands into a plurality of instruction words that include said plurality of instruction word formats to provide a sequence selected to provide the most rapid execution of the operations; and

rearranging said commands within said plurality of instruction words beginning at a last command of said sequence into instruction words selected to occupy the least space in memory, said rearranging comprises determining if said commands include a do nothing operation (no-op) command, said rearranging preserves any execution latency of said commands.

14. The process as described in claim 13, wherein the number of said plurality of instruction words is the same after said rearranging.

15. The process as described in claim 14, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a later instruction word.

16. The process as described in claim 13, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to a later instruction word.

17. The process as described in claim 13, wherein said rearranging further comprises:

determining if a previous instruction word of said plurality of instruction words includes a command which can be moved to replace a no-op command of a later instruction word.

18. The process as described in claim 13, wherein said rearranging further comprises:

expanding a short instruction word of said plurality of instruction words to a long instruction word.