Method and apparatus for downloading executable code in a non-disruptive manner

Abstract

A method and apparatus for achieving a non-disruptive code load that includes assigning an endpoint to a non-disruptive code loading new process, loading the process into a memory location of a system and starting the process, wherein a previous process is instructed to forward all messages on its queue to the new process to where all new signals are processed.

1 . An apparatus for non-disruptively replacing code in a system, comprising:
 a. a plurality of tasks, each task in the plurality of tasks having a task identifier;   b. a plurality of processes in executable form, each procedural code module in the plurality of procedural code modules having a code module identifier;   c. a table including mapping entries, each entry associating a particular task from the plurality of tasks with a particular procedural code module from the plurality of procedural code modules by mapping the task identifier of the task to the code module identifier of the procedural code module, wherein changing the association for a given task from a first procedural code module to a second procedural code module includes remapping of the task identifier of the given task to the code module identifier of the second procedural code module;   d. a signal sent from the first code procedural module to the second procedural code module, whereby the second procedural code module receives information relevant to the second procedural code module assuming task responsibilities from the first procedural code after the task identifier of the given task has been remapped; and   e. a first process causing a task to be performed by invoking a first procedural code module associated by the table at a first time with the task, and a second process causing the task to be performed by invoking a second procedural code module associated at a later time by the table with the task, wherein the system remains active between invocation of the first procedural code module and invocation of the second procedural code module.   
     
     
         2 . The apparatus of  claim 1 , wherein the signal includes data used to update a database that the second procedural code module accesses after the task identifier of the given task has been remapped. 
     
     
         3 . The apparatus of  claim 1 , wherein the table associates tasks with code modules without intervening association to object-oriented classes or objects. 
     
     
         4 . The apparatus of  claim 1 , further comprising:
 f. for each task, a request structure, said request structure remaining unchanged when the mapping entry changes from associating a first procedural code module with the task to a second procedural code module.   
     
     
         5 . A method for non-disruptively replacing code in a computer system, comprising:
 a. identifying a set of tasks to be performed, each task having a task identifier;   b. within a table, associating, each task identifier with a respective procedural code module in executable form, whereby a particular task is associated with a first procedural code module by a first task identifier;   c. obtaining by a first process a reference to the first procedural code module through its association with the first task identifier in the table;   d. using the reference to the first procedural code module, invoking the first procedural code module by the first process;   e. changing the table so that the first task identifier is associated with a second procedural code module;   f. sending a signal from the first procedural code module to a second procedural code module, whereby the second procedural code module receives information relevant to the second procedural code module assuming responsibility from the first procedural for performing the particular task;   g. obtaining by a second process, not necessarily distinct from the first process, a reference to the second procedural code module through its association with the first task identifier in the table; and   h. using the reference to the first procedural code module, invoking the second procedural code module by the second process, wherein the system remains active between invoking the first procedural code module and invoking the second procedural code module.   
     
     
         6 . The method of  claim 5 , wherein the signal includes data to update a database accessed by the second procedural code module. 
     
     
         7 . The method of  claim 5 , further comprising:
 i. assigning each task to a respective position in the table; and   j. retaining the assignment of each task to its respective position through one or more changes in association of the task with procedural code modules.   
     
     
         8 . The method of  claim 7 , further comprising:
 k. assigning to each task a request structure, said request structure remaining unchanged when the mapping entry changes from associating a first procedural code module with the task to a second procedural code module.   
     
     
         9 . The method of  claim 5 , wherein association, within the table, of each task with a respective procedural code module is done without intervening association to object-oriented classes or objects.