METHODS AND SYSTEMS FOR OPTIMIZING EXECUTION OF A PROGRAM IN A PARALLEL PROCESSING ENVIRONMENT

• US 20130061213A1
• Filed: 08/24/2012
• Published: 03/07/2013
• Est. Priority Date: 08/26/2011
• Status: Abandoned Application

• Current Assignee: Cognitive Electronics, Inc.
• Original Assignee: Cognitive Electronics, Inc.
• Inventors: FELCH, Andrew C.
• Application Number:
  US13/594,125
• Publication Number:
  US 20130061213A1
• Time in Patent Office: Days
• US Class Current: 717/149
• CPC Class Codes: G06F 8/4434 Reducing the memory space required by the program code
• CPC Class Codes: G06F 8/48 Incremental compilation software reuse G06F8/36

Abstract

An automated method of optimizing execution of a program in a parallel processing environment is described. The program is adapted to execute in data memory and instruction memory. An optimizer receives the program to be optimized. The optimizer instructs the program to be compiled and executed. The optimizer observes execution of the program and identifies a subset of instructions that execute most often. The optimizer also identifies groups of instructions associated with the subset of instructions that execute most often. The identified groups of instructions include the identified subset of instructions that execute most often. The optimizer recompiles the program and stores the identified groups of instructions in instruction memory. The remaining instructions portions of the program are stored in the data memory. The instruction memory has a higher access rate and smaller capacity than the data memory. Once recompiled, subsequent execution of the program occurs using the recompiled program.

Claims

1. An automated method of optimizing execution of a program in a parallel processing environment, the program adapted to execute in data memory and instruction memory, the method comprising:

(a) receiving, at an optimizer, the program;

(b) compiling the program upon instruction by the optimizer;

(c) executing the program upon instruction by the optimizer;

(d) the optimizer observing the execution of the program and identifying a subset of instructions that execute most often;

(e) the optimizer identifying groups of instructions associated with the subset of instructions that execute most often, wherein the groups of instructions include the subset of instructions that execute most often;

(f) the optimizer recompiling the program and storing the identified groups of instructions in instruction memory, and storing remaining portions of the program in the data memory,

wherein the instruction memory has a higher access rate and smaller capacity than the data memory, wherein subsequent execution of the program occurs using the recompiled program.

2. The method of claim 1 wherein step (d) further comprises identifying a subset of instructions that execute most often in threads that have outputs that other threads are waiting to receive, wherein the groups of instructions further include the subset of instructions that execute most often in threads that have outputs that other threads are waiting to receive.