Multi-component processor

• US 7,454,588 B2
• Filed: 06/23/2004
• Issued: 11/18/2008
• Est. Priority Date: 12/14/1999
• Status: Expired due to Fees

• Current Assignee: Genesis Microchip Inc. (STMicroelectronics NV)
• Original Assignee: Genesis Microchip Inc. (STMicroelectronics NV)
• Inventors: Greicar, Richard K.
• Primary Examiner(s): Thai; Tuan V.
• Application Number:
  US10/875,364
• Publication Number:
  US 20070255923A1
• Time in Patent Office: 1,609 Days
• Field of Search: 711/100, 711/154, 711/170, 711/171, 711/172
• US Class Current: 711/171
• CPC Class Codes: G06F 12/08 in hierarchically structured memory systems, e.g. virtual memory systems
• CPC Class Codes: G06F 2212/251 Local memory within processor subsystem
• CPC Class Codes: G06F 2212/253 Centralized memory
• CPC Class Codes: G06F 9/44521 Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading
• CPC Class Codes: G06F 9/44552 Conflict resolution, i.e. enabling coexistence of conflicting executables
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

A processor having a limited amount of local memory for storing code and/or data utilizes a program stored in external memory. The program stored in external memory is configured into blocks which can be loaded individually into the local memory for execution. Queuing the individual blocks of code allows the program to be executed by the processor and also facilitates loading of the subsequent code to the executed. A semaphore system can be utilized to indicate which blocks of local memory are available/unavailable. The system can support the interaction of multiple independent programs in external memory.

Claims

1. A method of processing in a computing system having a processor with a local memory for storing code capable of concurrent DMA transfers and an external memory for use by the processor, comprising:

configuring said local memory into a plurality of blocks of memory;

segmenting a program of code into blocks of code in a first order wherein each of said blocks can be stored in an associated one of said blocks of memory;

determining which blocks of code are safe to load into the blocks of memory; and

based upon the determining, loading the blocks of code in a second order, wherein the second order provides a fastest execution of the program of code.

2. The method as recited in claim 1, further comprising:

storing a first block of code in a memory space in at least one block of memory of said local memory;

storing a second block of code in said local memory; and

when said first block of code is completely stored into said local memory, initiating execution of said first block of code.

3. The method as recited in claim 2, further comprising:

determining that at least one block of code in said local memory has completed execution; and

replacing said executed block of code with another block of code.

4. The method as recited in claim 3, further comprising:

determining that at least one memory space of said local memory is available; and

storing a first block of code from a second program in said available memory space of said local memory while said first program code is still executing.

5. The method as recited in claim 1, further comprising:

utilizing a semaphore to indicate when said memory space of said local memory is available.

6. The method as recited in claim 5, wherein the semaphore is one of a set of semaphores.

7. The method as recited in claim 1, wherein the computing system is selected from a group that includes a DVD player, a set top box, and a video processor unit.

8. Computer program product for use with a computing system with a local memory for storing code capable of concurrent DMA transfers and an external memory for use by a processor, the computer program product embodied in a computer readable storage medium having instructions executable by the processor that causing the computing system to execute a method comprising:

configuring the local memory into a plurality of blocks of memory;

segmenting a program of code into blocks of code in a first order wherein each of the blocks can be stored in an associated one of the blocks of memory;

determining which blocks of code are safe to load into the blocks of memory;

loading the blocks of code in a second order, wherein the second order provides a fastest execution of the program of code based upon the determining.

9. Computer program product as recited in claim 8, further comprising:

based upon the determining, storing a first block of code in a memory space in at least one block of memory of said local memory;

storing a second block of code in said local memory based upon the determining; and

initiating execution of said first block of code when said first block of code is completely stored into said local memory.

10. Computer program product as recited in claim 9, further comprising:

computer code for determining that at least one block of code in said local memory has completed execution; and

computer code for replacing said executed block of code with another block of code.

11. Computer program product as recited in claim 10, further comprising:

computer code for determining that at least one memory space of said local memory is available; and

computer code for storing a first block of code from a second program in said available memory space of said local memory while said first program code is still executing.

12. Computer program product as recited in claim 8, further comprising:

computer code for utilizing a semaphore to indicate when said memory space of said local memory is available.

13. Computer program product as recited in claim 12, wherein the semaphore is one of a set of semaphores.

14. Computer program product as recited in claim 8, wherein the computing system is selected from a group that includes a DVD player, a set top box, and a video processor unit.