Method for zero overhead switching of alternate algorithms in a computer program

• US 7,415,702 B1
• Filed: 01/20/2005
• Issued: 08/19/2008
• Est. Priority Date: 01/20/2005
• Status: Active Grant

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Paul, Derek William, Hoa, Jeffery
• Primary Examiner(s): Zhen; Wei Y.
• Assistant Examiner(s): DENG, ANNA CHEN
• Application Number:
  US11/039,314
• Time in Patent Office: 1,307 Days
• Field of Search: 717158-160, 717162-163
• US Class Current: 717/159
• CPC Class Codes: G06F 9/4486 Formation of subprogram jump address

Abstract

A system wherein a Caller Application is enabled to reduce latency after a First Call to a Data Link Library after which a stub function provides direct access to a selected algorithm'"'"'s work function for execution by a processor. A Hardware Abstraction Layer receives information from multiple CPU'"'"'s to determine the appropriately compatible algorithm for the processor that is to be utilized.

Claims

1. In a computer system having a Windows operating system which provides a Dynamic Link Library that is called by a Windows application for performing a selected worker function, wherein the selected worker function is selected by first accessing an import table provided for use by said application, a method for reducing latency in the calling of said worker function by said application when said selected worker function is a time-critical worker function and said application is a multiple-iteration application which requires multiple iterations of said time-critical worker function, said method comprising:

accessing by said multiple-iteration application of said import table to locate an address of said time-critical worker function;

calling by said multiple-iteration application of said time-critical worker function in response to the address located by said accessing;

executing the called time-critical worker function and also, on the first call of said time-critical worker function by said multiple-iteration application, utilizing a stub of code provided at the entry point of said time-critical worker function for patching the multiple-iteration application to said time-critical worker function by modifying said multiple-iteration application so that the multiple-iteration application will bypass said import table and directly call said time-critical worker function on subsequent iterations without having to access said import table; and

returning operation to said multiple-iteration application after completion of said time-critical worker function.

2. The method of claim 1, wherein said Dynamic Link Library is incorporated in a Hardware Abstraction Layer for use in selecting which of a plurality of different processor types is to be called by said multiple-iteration application.

3. The method of claim 1, wherein said Dynamic Link Library is used for selecting different encryption algorithms for a disk drive system.

4. The method of claim 1, wherein said method is repeated when a different multiple-iteration application calls a time-critical function in said Dynamic Link Library.

5. The method of claim 1, wherein said stub of code uses a return address of said multiple-iteration application to determine a location of the code in said multiple-iteration application which called the time-critical worker function.

6. The method of claim 1, wherein said return address is obtained from a memory stack provided for use with said application.