EP1763772A1 - Architecture informatique modifiee avec des objets d'initialisation - Google Patents

Architecture informatique modifiee avec des objets d'initialisation

Info

Publication number
EP1763772A1
EP1763772A1 EP05733638A EP05733638A EP1763772A1 EP 1763772 A1 EP1763772 A1 EP 1763772A1 EP 05733638 A EP05733638 A EP 05733638A EP 05733638 A EP05733638 A EP 05733638A EP 1763772 A1 EP1763772 A1 EP 1763772A1
Authority
EP
European Patent Office
Prior art keywords
computers
computer
application program
index
int
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP05733638A
Other languages
German (de)
English (en)
Other versions
EP1763772A4 (fr
Inventor
John Matthew Holt
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Waratek Pty Ltd
Original Assignee
Waratek Pty Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from AU2004902146A external-priority patent/AU2004902146A0/en
Application filed by Waratek Pty Ltd filed Critical Waratek Pty Ltd
Publication of EP1763772A1 publication Critical patent/EP1763772A1/fr
Publication of EP1763772A4 publication Critical patent/EP1763772A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs

Definitions

  • the present invention relates to computers and, in particular, to a modified machine architecture which enables the operation of an application program simultaneously on a plurality of computers interconnected via a communications network.
  • Fig. 1 that single prior art machine 1 is made up from a central processing unit, or CPU, 2 which is connected to a memory 3 via a bus 4. Also connected to the bus 4 are various other functional units of the single machine 1 such as a screen 5, keyboard 6 and mouse 7.
  • a fundamental limit to the performance of the machine 1 is that the data to be manipulated by the CPU 2, and the results of those manipulations, must be moved by the bus 4.
  • the bus 4 suffers from a number of problems including so called bus "queues" formed by units wishing to gain an access to the bus, contention problems, and the like. These problems can, to some extent, be alleviated by various stratagems including cache memory, however, such stratagems invariably increase the administrative overhead of the machine 1.
  • a further possibility of increased computer power through the use of a plural number of machines arises from the prior art concept of distributed computing which is schematically illustrated in Fig. 3.
  • a single application program (Ap) is partitioned by its author (or another programmer who has become familiar with the application program) into various discrete tasks so as to run upon, say, three machines in which case n in Fig. 3 is the integer 3.
  • the intention here is that each of the machines Ml ...M3 runs a different third of the entire application and the intention is that the loads applied to the various machines be approximately equal.
  • the machines communicate via a network 14 which can be provided in various forms such as a communications link, the internet, intranets, local area networks, and the like.
  • a j-urther prior art arrangement is known as network computing via "clusters" as is schematically illustrated in Fig. 4.
  • the entire application is loaded onto each of the machines Ml , M2 ....Mn.
  • Each machine communicates with a common database but does not communicate directly with the other machines.
  • the present invention discloses a computing environment in which an application program operates simultaneously on a plurality of computers. In such an environment it is necessary to ensure that the abovementioned initialization routines operate in a consistent fashion across all the machines. It is this goal of consistent initialization that is the genesis of the present invention.
  • a multiple computer system having at least one application program running simultaneously on a plurality of computers interconnected by a communications network, wherein a like plurality of substantially identical objects are created, each in the corresponding computer and each having a substantially identical name, and wherein the initial contents of each of said identically named objects is substantially the same.
  • a plurality of computers interconnected via a communications link and operating at least one application program simultaneously wherein each said computer in operating said at least one application program creates objects only in local memory physically located in each said computer, the contents of the local memory utilized by each said computer is fundamentally similar but not, at each instant, identical, and every one of said computers has distribution update means to distribute to all other said computers objects created by said one computer.
  • a multiple thread processing computer operation in which individual threads of a single application program are simultaneously being processed each on a corresponding one of a plurality of computers interconnected via a communications link, the improvement comprising communicating objects created in local memory physically associated with the computer processing each thread to the local memory of each other said computer via said communications link.
  • a seventh aspect of the present invention there is disclosed a method of ensuring consistent initialization of an application program to be run simultaneously on a plurality of computers interconnected via a communications network, said method comprising the steps of: (i) scrutinizing said application program at, or prior to, or after loading to detect each program step defining an initialization routine, and
  • a computer program product comprising a set of program instructions stored in a storage medium and operable to permit a plurality of computers to carry out the abovementioned methods.
  • Fig. 1 is a schematic view of the internal architecture of a conventional computer
  • Fig. 2 is a schematic illustration showing the internal architecture of known symmetric multiple processors
  • Fig. 3 is a schematic representation of prior art distributed computing
  • Fig. 4 is a schematic representation of a prior art network computing using clusters
  • Fig. 5 is a schematic block diagram of a plurality of machines operating the same application program in accordance with a first embodiment of the present invention
  • Fig. 6 is a schematic illustration of a prior art computer arranged to operate
  • FIG. 7 is a drawing similar to Fig. 6 but illustrating the initial loading of code in accordance with the preferred embodiment
  • Fig. 8 is a drawing similar to Fig. 5 but illustrating the interconnection of a plurality of computers each operating JAVA code in the manner illustrated in Fig. 7,
  • Fig. 9 is a flow chart of the procedure followed during loading of the same application on each machine in the network
  • Fig. 10 is a flow chart showing a modified procedure similar to that of Fig. 9
  • Fig. 11 is a schematic representation of multiple thread processing carried out on the machines of Fig. 8 utilizing a first embodiment of memory updating
  • Fig. 12 is a schematic representation similar to Fig.
  • Fig. 13 illustrates multi-thread memory updating for the computers of Fig. 8
  • Fig. 14 is a schematic illustration of a prior art computer arranged to operate in JAVA code and thereby constitute a JAVA virtual machine
  • Fig. 15 is a schematic representation of n machines running the application program and serviced by an additional server machine X
  • Fig. 16 is a flow chart of illustrating the modification of initialization routines
  • Fig. 17 is a flow chart illustrating the continuation or abortion of initialization routines
  • Fig. 18 is a flow chart illustrating the enquiry sent to the server machine X
  • Fig. 19 is a flow chart of the response of the server machine X to the request of Fig. 18, Fig.
  • FIG. 20 is a flowchart illustrating a modified initialization routine for the ⁇ clinit instruction
  • Fig. 21 is a flowchart illustrating a modified initialization routine for the ⁇ init> instruction
  • Fig. 22 is a schematic representation of two laptop computers interconnected to simultaneously run a plurality of applications, with both applications running on a single computer
  • Fig. 23 is a view similar to Fig. 22 but showing the Fig. 22 apparatus with one application operating on each computer
  • Fig. 24 is a view similar to Figs. 22 and 23 but showing the Fig. 22 apparatus with both applications operating simultaneously on both computers.
  • Annexures A and B which provide actual program fragments which implement various aspects of the described embodiments.
  • Annexure A relates to fields and Annexure B relates to initialization.
  • a single application program 50 can be operated simultaneously on a number of machines Ml , M2...Mn communicating via network 53.
  • each of the machines Ml, M2...Mn operates with the same application program 50 on each machine Ml, M2...Mn and thus all of the machines Ml, M2...Mn have the same application code and data 50.
  • each of the machines Ml, M2...Mn operates with the same (or substantially the same) modifier 51 on each machine Ml, M2...Mn and thus all of the machines Ml, M2...Mn have the same (or substantially the same) modifier 51 with the modifier of machine M2 being designated 51/2.
  • each application 50 has been modified by the corresponding modifier 51 according to the same rules (or substantially the same rules since minor optimising changes are permitted within each modifier 51/1 ...51/n).
  • Ml, M2...Mn has, say, a shared memory capability of 10MB, then the total shared memory available to each application 50 is not, as one might expect, lOn MB but rather only 10MB. However, how this results in improved operation will become apparent hereafter.
  • each machine Ml, M2...Mn has an unshared memory capability.
  • the unshared memory capability of the machines Ml, M2...Mn are normally approximately equal but need not be.
  • a machine produced by one of various manufacturers and having an operating system operating in one of various different languages
  • a virtual machine as schematically illustrated in Fig. 6.
  • the prior art arrangement of Fig. 6 takes the form of the application 50 written in the Java language and executing within a Java Virtual Machine 61.
  • the intended language of the application is the language JAVA
  • a JAVA virtual machine is created which is able to operate code in JAVA irrespective of the machine manufacturer and internal details of the machine.
  • the JAVA Virtual Machine Specification 2 nd Edition by T. Lindholm & F. Yellin of Sun Microsystems Inc. of the USA.
  • DRT 71 distributed run time
  • the application 50 is loaded onto the Java Virtual Machine 72 via the distributed runtime system 71 through the loading procedure indicated by arrow 75.
  • a distributed run time system is available from the Open Software Foundation under the name of Distributed Computing Environment (DCE).
  • DCE Distributed Computing Environment
  • the distributed runtime 71 comes into operation during the loading procedure indicated by arrow 75 of the JAVA application 50 so as to initially create the JAVA virtual machine 72.
  • the sequence of operations during loading will be described hereafter in relation to Fig. 9.
  • Fig. 8 shows in modified form the arrangement of Fig. 5 utilising JAVA virtual machines, each as illustrated in Fig. 7. It will be apparent that again the same application 50 is loaded onto each machine Ml, M2...Mn. However, the communications between each machine Ml, M2...Mn, and indicated by arrows 83, although physically routed through the machine hardware, are controlled by the individual DRT's 71/1...71/n within each machine. Thus, in practice this may be conceptionalised as the DRT's 71/1...71/n communicating with each other via the network 73 rather than the machines Ml, M2...Mn themselves.
  • Figs. 7 and 9 during the loading procedure 75, the program 50 being loaded to create each JAVA virtual machine 72 is modified.
  • This modification commences at 90 in Fig. 9 and involves the initial step 91 of detecting all memory locations (termed fields in JAVA - but equivalent terms are used in other languages) in the application 50 being loaded. Such memory locations need to be identified for subsequent processing at steps 92 and 93.
  • the DRT 71 during the loading procedure 75 creates a list of all the memory locations thus identified, the JAVA fields being listed by object and class. Both volatile and synchronous fields are listed.
  • the next phase (designated 92 in Fig. 9) of the modification procedure is to search through the executable application code in order to locate every processing activity that manipulates or changes field values corresponding to the list generated at step 91 and thus writes to fields so the value at the corresponding memory location is changed.
  • an "updating propagation routine" is inserted by step 93 at this place in the program to ensure that all other machines are notified that the value of the field has changed.
  • the loading procedure continues in a normal way as indicated by step 94 in Fig. 9.
  • Fig. 10 An alternative form of initial modification during loading is illustrated in Fig. 10.
  • start and listing steps 90 and 91 and the searching step 92 are the same as in Fig. 9.
  • an "alert routine” is inserted at step 103.
  • the "alert routine” instructs a thread or threads not used in processing and allocated to the DRT, to carry out the necessary propagation.
  • This step 103 is a quicker alternative which results in lower overhead.
  • a thread 121/2 has become aware of a change of field value at step 113, it instructs DRT processing 120 (as indicated by step 125 and arrow 127) that another thread(s) 121/1 allocated to the DRT processing 120 is to propagate in accordance with step 128 via the network 53 to all other machines M2...Mn the identity of the changed field and the changed value detected at step 113.
  • This is an operation which can be carried out quickly and thus the processing of the initial thread 111/2 is only interrupted momentarily as indicated in step 125 before the thread 111/2 resumes processing in step 115.
  • the other thread 121/1 which has been notified of the change (as indicated by arrow 127) then communicates that change as indicated in step 128 via the network 53 to each of the other machines M2...Mn.
  • This second arrangement of Fig. 12 makes better utilisation of the processing power of the various threads 111/1...111/3 and 121/1 (which are not, in general, subject to equal demands) and gives better scaling with increasing size of "n", (n being an integer greater than or equal to 2 which represents the total number of machines which are connected to the network 53 and which run the application program 50 simultaneously). Irrespective of which arrangement is used, the changed field and identities and values detected at step 113 are propagated to all the other machines M2...Mn on the network.
  • Fig. 13 This is illustrated in Fig. 13 where the DRT 71/1 and its thread 121/1 of Fig. 12 (represented by step 128 in Fig. 13) sends via the network 53 the identity and changed value of the listed memory location generated at step 113 of Fig. 12 by processing in machine M 1 , to each of the other machines M2... Mn.
  • Each of the other machines M2...Mn carries out the action indicated by steps 135 and 136 in Fig. 13 for machine Mn by receiving the identity and value pair from the network 53 and writing the new value into the local corresponding memory location.
  • memory accesses from one machine's software to memory physically located on another machine are permitted by the network interconnecting the machines.
  • such memory accesses can result in delays in processing of the order of 10 6 - 10 7 cycles of the central processing unit of the machine. This in large part accounts for the diminished performance of the multiple interconnected machines.
  • each DRT 71 when initially recording the fields, for each field there is a name or identity which is common throughout the network and which the network recognises.
  • the memory location corresponding to a given named field will vary over time since each machine will progressively store changed field values at different locations according to its own internal processes.
  • the table in each of the DRTs will have, in general, different memory locations but each global "field name" will have the same "field value” stored in the different memory locations.
  • a particular machine say machine M2
  • loads the application code on itself modifies it, and then loads each of the other machines Ml,
  • each machine receives the application code, but modifies it and loads the modified code on that machine. This enables the modification carried out by each machine to be slightly different being optimized based upon its architecture and operating system, yet still coherent with all other similar modifications.
  • a particular machine say Ml, loads the unmodified code and all other machines M2, M3 ... Mn do a modification to delete the original application code and load the modified version.
  • the supply can be branched (ie M2 supplies each of Ml, M3, M4, etc directly) or cascaded or sequential (ie M2 applies Ml which then supplies M3 which then supplies M4, and so on).
  • the machines Ml to Mn can send all load requests to an additional machine (not illustrated) which is not running the application program, which performs the modification via any of the aforementioned methods, and returns the modified routine to each of the machines Ml to Mn which then load the modified routine locally.
  • machines Ml to Mn forward all load requests to this additional machine which returns a modified routine to each machine.
  • the modifications performed by this additional machine can include any of the modifications covered under the scope of the present invention.
  • the first is to make the modification in the original (source) language.
  • the second is to convert the original code (in say JAVA) into an intermediate representation (or intermediate language). Once this conversion takes place the modification is made and then the conversion is reversed. This gives the desired result of modified JAVA code.
  • the third possibility is to convert to machine code (either directly or via the abovementioned intermediate language). Then the machine code is modified before being loaded and executed.
  • the fourth possibility is to convert the original code to an intermediate representation, which is then modified and subsequently converted into machine code.
  • the present invention encompasses all four modification routes and also a combination of two, three or even all four, of such routes.
  • Fig. 14 there is illustrated a schematic representation of a single prior art computer operated as a JAVA virtual machine.
  • a machine produced by any one of various manufacturers and having an operating system operating in any one of various different languages
  • a JAVA virtual machine 72 is able to operate code 50 in the JAVA language, and utilize the JAVA architecture irrespective of the machine manufacturer and the internal details of the machine.
  • the initialization routine ⁇ clinit> happens only once when a given class file 50A is loaded.
  • the initialization routine ⁇ init> happens often, for example every time a new object 5 OX, 50 Y and 50Z is created.
  • classes are loaded prior to objects so that in the application program illustrated in Fig. 14, having a single class 50A and three objects 50X-50Z, the first class 50A is loaded first, then the first object 50X is loaded, then second object 50Y is loaded and finally third object 50Z is loaded.
  • there is only a single computer or machine 72 then no conflict or inconsistency arises in the running of the initialization routines intended to operate during the loading procedure.
  • Fig. 8 (and also in Figs.
  • a plurality of individual computers or machines Ml, M2 Mn are provided each of which are interconnected via a communications network 53 and each of which is provided with a modifier 51 and loaded with a common application program 50.
  • the modifier 51 is to replicate an identical memory structure and contents on each of the individual machines Ml, M2...Mn. It follows therefore that in such a computing environment it is necessary to ensure that each of the individual machines Ml, M2...Mn is initialized in a consistent fashion.
  • the modifying function of the modifier 51 of Fig. 5 is provided by the DRT 71 in Fig. 8.
  • the application program 50 is scrutinized in order to detect program steps which define an initialization routine.
  • ⁇ clinit> routines are initially looked for and when found a modifying code (typically several instructions) is inserted so as to give rise to a modified ⁇ clinit> routine.
  • This modified routine is to load the class 50A on one of the machines, for example JVM#1, and tell all the other machines M2...Mn that such a class 50A exists and its present state.
  • this modification and loading can be carried out.
  • the DRT 71 on the loading machine in this example
  • JVM#1 asks the DRT's 71/2...71/n of all the other machines if the first class 50A has already been initialized. If the answer to this question is yes, then the normal initialization procedure is turned off or disabled. If the answer is no, then the normal initialization procedure is operated and the consequential changes brought about during that procedure are transferred to all other machines as indicated by arrows 83 in Fig. 8.
  • a modification to the general arrangement of Fig. 8 is provided in that machines Ml, M2...Mn are as before and run the same application program (or programmes) 50 on all machines Ml, M2...Mn simultaneously.
  • a server machine X which is conveniently able to supply a housekeeping function, and especially the initialisation of structures, assets and resources.
  • Such a server machine X can be a low value commodity computer such as a PC since its computational load is low.
  • two server machines X and X+1 can be provided for redundancy purposes to increase the overall reliability of the system. Where two such server machines X and X+1 are provided, they are preferably operated as dual machines in a cluster.
  • the additional machine X+1 is optional as indicated by the broken lines in Fig. 15.
  • a server machine X it is not necessary to provide a server machine X as its computational load can be distributed over machines Ml, M2...Mn.
  • a database operated by one machine in a master/slave type operation can be used for the housekeeping function.
  • Fig. 16 shows a preferred general procedure to be followed. After a loading step 161 has been commenced, the instructions to be executed are considered in sequence and all initialization routines are detected as indicated in step 162. In the JAVA language these are the ⁇ init> and ⁇ clinit> routines (or methods in JAVA terminology). Other languages use different terms.
  • step 162 Where an initialization routine is detected in step 162, it is modified in step 163, typically by inserting further instructions into the routine. Alternatively, the modifying instructions could be inserted prior to the routine. Once the modification step 163 has been completed the loading procedure continues, as indicated in step 164.
  • Fig. 17 illustrates a particular form of modification.
  • the structures, assets or resources (in JAVA termed classes or objects) to be initialised are, in step 172, allocated a name or tag which can be used globally by all machines. This is most conveniently done via a table maintained by server machine X of Fig 15. This table also includes the status of the class or object to be initialised.
  • steps 173 and 174 determine that the global name is not already initialised elsewhere (ie on a machine other than the machine carrying out the loading) then this means that the object or class can be initialised in the normal fashion by carrying out step 176 since it is the first such object or class to be created.
  • steps 173 and 174 determine that the global name is already utilised elsewhere, this means that another machine has already initialised this class or object. As a consequence, the regular initialisation routine is aborted in its entirety, by carrying out step 175.
  • Fig. 18 shows the enquiry made by the loading machine (one of Ml, M2...Mn) to the server machine X of Fig. 15.
  • the operation of the loading machine is temporarily interrupted as indicated by step 181 until the reply is received from machine X, as indicated by step 182.
  • Fig. 19 shows the activity carried out by machine X of Fig. 15 in response to such an enquiry as step 181 of Fig. 18.
  • the initialisation status is determined in steps 192 and 193 and, if already initialised, the response to that effect is sent to the enquiring machine by carrying out step 194.
  • the initialisation status is uninitialized, the corresponding reply is sent by carrying out steps 195 and 196.
  • the waiting enquiring machine created by step 182 is then able to respond accordingly.
  • Annexures A1-A10 illustrate actual code in relation to fields
  • Annexure Bl is a typical code fragment from an unmodified ⁇ clinit> instruction
  • Annexure B2 is an equivalent in respect of a modified ⁇ clinit> instruction
  • Annexure B3 is a typical code fragment from an unmodified ⁇ init> instruction
  • Annexure B4 is an equivalent in respect of a modified ⁇ init> instruction
  • Annexure B5 is an alternative to the code of Annexure B2
  • Annexure B6 is an alternative to the code of Annexure B4.
  • Annexure B7 is the source-code of InitClient, which queries an "initialization server" for the initialization status of the relevant class or object.
  • Annexure B8 is the source-code of InitServer, which receives an initialization status query by InitClient and in response returns the corresponding status.
  • Annexure B9 is the source-code of the example application used in the before/after examples of Annexure B1-B6.
  • Fig. 20 the procedure followed to modify the ⁇ clinit> routine relating to classes so as to convert from the code fragment of Annexure Bl to the code fragment of Annexure B2 is indicated.
  • the initial loading of the application program 50 onto the JAVA virtual machine 72 is commenced at step 201, and each line of code is scrutinized in order to detect those instructions which represent the ⁇ clinit> routine by carrying out step 202.
  • the ⁇ clinit> routine is modified as indicated in Annexure B2 by carrying out step 203.
  • step 204 after the modification is completed the loading procedure is then continued.
  • Annexures Bl and B2 are the before and after excerpt of a ⁇ clinit> instruction respectively.
  • the modified code that is added to the method is highlighted in bold.
  • the application code is modified as it is loaded into the machine by changing the ⁇ clinit> method.
  • the changes made are the initial instructions that the ⁇ clinit> method executes. These added instructions check if this class has already been loaded by calling the isAlreadyLoaded() method, which returns either true or false corresponding to the loaded state of this class.
  • the isAlreadyLoadedO method of the DRT can optionally take an argument which represents a unique identifier for this class (See ANNEXURE B5 and B6), for example the name of the class, or a class object representing this class, or a unique number representing this class across all machines, to be used in the determination of the loaded status of this class.
  • a unique identifier for this class See ANNEXURE B5 and B6
  • the DRT can support the loading of multiple classes at the same time without becoming confused as to which of the multiple classes are already loaded and which are not, by using the unique identifier of each class to consult the correct record in the isAlreadyLoaded table.
  • the DRT can determine the loaded state of the class in a number of ways. Preferably, it can ask each machine in turn if this class is loaded, and if any machine replies true, then return true, otherwise false. Alternatively, the DRT on the local machine can consult a shared record table (perhaps on a separate machine (eg machine X), or a coherent shared record table on the local machine, or a database) to determine if this class has been loaded or not.
  • a shared record table perhaps on a separate machine (eg machine X), or a coherent shared record table on the local machine, or a database
  • the application program's ⁇ init> instructions initialise a memory location (field) with the timestamp of the loading time.
  • the application could use this, for example, to record when this object was created.
  • special treatment is necessary to make sure that the timestamp of the first-loaded peer object is not overwritten by later peer objects.
  • the disassembled instruction sequence after modification has taken place is set out in Annexure B4 and the modified/inserted instructions are highlighted in bold.
  • the modifying instructions are often required to be placed after the "invokespecial" instruction, instead of at the very beginning. The reasons for this are driven by the JAVA Virtual Machine specification. Other languages often have similar subtle designs nuances.
  • machine M2 loads the ⁇ clinit> routine in unmodified form on machine M2 and then modifies the class by deleting the initialization routine in its entirety and loads the modified class on the other machines.
  • the modification is not a by-passing of the initialization routine but a deletion of it on all machines except one.
  • each machine receives the initialization routine, but modifies it and loads the modified routine on that machine. This enables the modification carried out by each machine to be slightly different being optimized based upon its architecture and operating system, yet still coherent with all other similar modifications.
  • a particular machine say Ml, loads the class and all other machines M2, M3 ... Mn do a modification to delete the initialization routine and load the modified version.
  • the supply can be branched (ie M2 supplies each of Ml, M3, M4, etc directly) or cascaded or sequential (ie M2 applies Ml which then supplies M3 which then supplies M4, and so on).
  • the initial machine say M2
  • the information provided to machine Mn is, in general, different from the initial state loaded into machine M2.
  • each entry in the table can be accompanied by a counter which is incremented on each occasion that a class is loaded.
  • This "on demand" mode increases the overhead of each computer but reduces the volume of traffic on the communications network which interconnects the computers.
  • the machines Ml to Mn can send all load requests to an additional machine X (of Fig. 15), which performs the modification via any of the afore mentioned methods, and returns the modified class to each of the machines Ml to Mn which then load the class locally.
  • machines Ml to Mn do not maintain a table of records for any class, and instead, they forward all load requests to machine X, which maintains the table of loaded classes, and returns a modified class to each machine dependant on whether or not it is the first time a given class is loaded on machines Ml to Mn.
  • the modifications performed by machine X can include any of the modifications covered under the scope of the present invention.
  • the first is to make the modification in the original (source) language.
  • the second is to convert the original code (in say JAVA) into an intermediate representation (or intermediate language). Once this conversion takes place the modification is made and then the conversion is reversed. This gives the desired result of modified JAVA code.
  • the third possibility is to convert to machine code (either directly or via the abovementioned intermediate language). Then the machine code is modified before being loaded and executed.
  • the fourth possibility is to convert the original code to an intermediate representation, which is thus modified and subsequently converted into machine code.
  • the present invention encompasses all four modification routes and also a combination of two, three or even all four, of such routes.
  • the computers 101 and 102 are not necessarily identical and indeed, one can be an IBM or IBM-clone and the other can be an APPLE computer.
  • the computers 101 and 102 have two screens 105, 115 two keyboards 106, 116 but a single mouse 107.
  • the two machines 101, 102 are interconnected by a means of a single coaxial cable or twisted pair cable 314.
  • Two simple application programs are downloaded onto each of the machines 101, 102, the programs being modified as they are being loaded as described above.
  • the first application is a simple calculator program and results in the image of a calculator 108 being displayed on the screen 105.
  • the second program is a graphics program which displays four coloured blocks 109 which are of different colours and which move about at random within a rectangular box 310. Again, after loading, the box 310 is displayed on the screen 105.
  • Each application operates independently so that the blocks 109 are in random motion on the screen 105 whilst numerals within the calculator 108 can be selected (with the mouse 107) together with a mathematical operator (such as addition or multiplication) so that the calculator 108 displays the result.
  • the mouse 107 can be used to "grab" the box 310 and move same to the right across the screen 105 and onto the screen 115 so as to arrive at the situation illustrated in Fig. 23.
  • the calculator application is being conducted on machine 101 whilst the graphics application resulting in display of box 310 is being conducted on machine 102.
  • JAVA includes both the JAVA language and also JAVA platform and architecture.
  • memory locations include, for example, both fields and array types.
  • the above description deals with fields and the changes required for array types are essentially the same mutatis mutandis.
  • the present invention is equally applicable to similar programming languages (including procedural, declarative and object orientated) to JAVA including Micrsoft.NET platform and architecture (Visual Basic, Visual C/C ++ , and C#) FORTRAN, C/C ++ , COBOL, BASIC etc.
  • the abovementioned embodiment in which the code of the JAVA initialisation routine is modified is based upon the assumption that either the rim time system (say, JAVA HOTSPOT VIRTUAL MACHINE written in C and JAVA) or the operating system (LINUX written in C and Assembler, for example) of each machine Ml ...Mn will call the JAVA initialisation routine. It is possible to leave the JAVA initialisation routine unamended and instead amend the LINUX or HOTSPOT routine which calls the JAVA initialisation routine, so that if the object or class is already loaded, then the JAVA initialisation routine is not called.
  • the rim time system say, JAVA HOTSPOT VIRTUAL MACHINE written in C and JAVA
  • LINUX written in C and Assembler, for example
  • initialisation routine is to be understood to include within its scope both the JAVA initialisation routine and the "combination" of the JAVA initialisation routine and the LINUX or HOTSPOT code fragments which call or initiates the JAVA initialisation routine.
  • object and class used herein are derived from the JAVA environment and are intended to embrace similar terms derived from different environments such as dynamically linked libraries (DLL), or object code packages, or function unit or memory locations.
  • DLL dynamically linked libraries
  • This first excerpt is part ofthe modification code. It searches through the code array, and when it finds a putstatic instruction (opcode 178), it implements the modifications.
  • This third excerpt is part ofthe DRT Sending.
  • This code fragment shows the DRT in a separate thread, after being notified, sending the value across the network.
  • MulticastSocket ms DRT. get ulticastSocke ( ) ; // The multicast socket // used by the DRT for // communication.
  • byte nameTag 33; // This is the "name tag" on the network for this // field.
  • Field field modifiedClass . getDeclaredField ( "myFieldl”) ; // Stores // the field // from the // modified // class.
  • the field is a byte field, while (DRT.isRunningO ) ⁇ synchronized (ALERT_LOCK) ⁇ ALERT_LOCK . wait ( ) ; // The DRT thread is waiting for the alert // method to be called.
  • byte[] b new byte [ ] ⁇ nameTag, field. getByte (null) ⁇ ; // Stores // the // nameTag // and the // value // of the // field from // the modified // class in a // buffer.
  • DatagramPacket dp new DatagramPacket (b, 0, b. length); ms . send(dp) ; // Send the buffer out across the network.
  • the fourth excerpt is part ofthe DRT receiving. This is a fragment of code to receive a DRT sent alert over the network.
  • MulticastSocket ms DRT.get ulticastSocket ( ) ; // The multicast socket // used by the DRT for // communication.
  • Field field modifiedClass . getDeclaredFiel ("myFieldl") ; // Stores the // field from // the modified // class.
  • the seventh excerpt is the source-code ofthe example application used in excerpt 5 and 6. import java.lang.*; public class example ⁇
  • Hashtable new Hashtable
  • the ninth excerpt is the source-code of FieldSend, which propagates changes values alerted to it via FieldAlert.
  • Hashtable objectToGloballD new Hashtable () ;
  • int globallD (int) ( ( (buffer [index++] & Oxff) « 24) I ( (buffer [index++] & Oxff) « 16) I ( (buffer [index++] & Oxff) « 8) I (buffer [index++] & Oxff)); // Now, need to resolve the object in question.
  • Object reference globallDToObject .get ( new Integer (globallD) ) ; // Next, get the array of fields for this object.
  • Field [] fields reference. getClass () .getDeclaredFields () ; while (index ⁇ length) ⁇ // Decode the field id.
  • int fieldID (int) ( ( (buffer [index++] & Oxff) « 24) I ( (buffer [index++] & Oxff) « 16) I ( (buffer [index++] & Oxff) « 8) I (buffer [index++] & Oxff)); // Determine value length based on corresponding field // type.
  • setChar reference, v
  • Field [] fields FieldLoader.loadClass (name) .getDeclaredFields () ;
  • This exce ⁇ t is the source-code of FieldLoader, which modifies an application as it is being loaded.
  • ca.code[z+3] new byte[3];
  • ca.code[z+3] [0] (byte) 184;
  • ca.code[z+3] [1] (byte) ((alertindex » 8) & Oxff) ;
  • ca.code [z+3] [2] (byte) (alertindex & Oxff) ;
  • Convience class for representing attribute nfo structures within ClassFiles import java.lang. * ; import java . io . * ;
  • the ClassFile follows verbatim from the JVM specification. */ public final class ClassFile ⁇ public int magic; public int minor_version; public int major_version; public int constant_pool_count; public cpjnfof] constant_pool; public int access_flags; public int this_class; public int super_class; public int interfaces_count; public int[] interfaces; public int fields_count; public field_info[] fields; public int methods_count; public methodJnfo[] methods; public int attributes_count; public attribute_info [] attributes; /** Constructor. Takes in a byte stream representation and transforms * each of the attributes in the ClassFile into objects to allow for * easier manipulation.
  • writeChar fields_count
  • Convience class for representing Code_attribute structures within ClassFiles import java.util.*; import java.lang.*; import java.io.*;
  • name_and_type_mdex name_and_type_mdex; ⁇ /** Used during input serialization by ClassFile only.
  • Utf8 subtype of a constant pool entry * We internally represent the Utf8 info byte array * as a String. */ public final class CONSTANT_Utf8_info extends cp_info ⁇ /** Length of the byte array. */ public int length; /** The actual bytes, represented by a String. */ public String bytes; /** This constructor should be used for the purpose * of part creation. It does not set the parent * ClassFile reference.
  • Convience class for representing cpjnfo structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing Deprecatedjattribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing Exceptions_attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing fieldjnfo structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing InnerClasses_attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing methodjnfo structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing SourceFile_attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing Synthetic_attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Hashtable hashCodeToGloballD new Hashtable
  • ANNEXURE B8 This excerpt is the source-code of InitServer, which receives an initialisation status query by InitClient and in response returns the corresponding status.
  • ServerSocket serverSocket new ServerSocket (serverPort) ; while ( ! Thread. interrupted ( ) ) ⁇
  • Socket socket serverSocket . accept () ;
  • This exce ⁇ t is the source-code of InitLoader, which modifies an application as it is being loaded.
  • ca.code[0] [2] (byte) ( (cf. constant_pool . length-7) & Oxff); // Now Add the INVOKESTATIC instruction.
  • ca.code[l] new byte [3];
  • ca.code[l] [0] (byte) 184;
  • ca.codefl] [1] (byte) (( (cf. constant_pool . length-1) » 8) &
  • ca.code[l] [2] (byte) ( (cf. constant_pool . length-1) & Oxff); // Next add the IFEQ instruction.

Abstract

La présente invention concerne une architecture informatique modifiée qui (50, 71, 72) permet à un programme d'applications (50) de fonctionner simultanément au niveau d'une pluralité d'ordinateurs (M1, Mn). Une mémoire partagée au niveau de chaque ordinateur est mise à jour au moyen d'amendements et/ou de réécritures, de telle manière que toutes les demandes de lecture de mémoire sont satisfaites localement. Pendant le chargement d'un programme initial (75) ou similaire, sont identifiées (92) des instructions qui débouchent sur une mémoire réécrite ou manipulée. Des instructions supplémentaires sont insérées (103) de manière à provoquer la mise à jour des emplacements de mémoire équivalents au niveau de tous les ordinateurs. Notamment, cette invention a pour objet l'initialisation des classes et des objets en langage JAVA (162, 163), de telle manière que tous les emplacements de mémoire pour tous les ordinateurs sont initialisés de façon similaire.
EP05733638A 2004-04-22 2005-04-22 Architecture informatique modifiee avec des objets d'initialisation Withdrawn EP1763772A4 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
AU2004902146A AU2004902146A0 (en) 2004-04-22 Modified Computer Architecture
PCT/AU2005/000578 WO2005103924A1 (fr) 2004-04-22 2005-04-22 Architecture informatique modifiee avec des objets d'initialisation

Publications (2)

Publication Number Publication Date
EP1763772A1 true EP1763772A1 (fr) 2007-03-21
EP1763772A4 EP1763772A4 (fr) 2008-12-17

Family

ID=35197170

Family Applications (5)

Application Number Title Priority Date Filing Date
EP20110002408 Withdrawn EP2341430A1 (fr) 2004-04-22 2005-04-22 Architecture informatique multiple avec synchronisation
EP05733436A Withdrawn EP1763771A4 (fr) 2004-04-22 2005-04-22 Architecture informatique modifiee avec finalisation d'objets
EP05733669A Active EP1763774B1 (fr) 2004-04-22 2005-04-22 Architecture a multiples ordinateurs avec des champs de memoire dupliques
EP05733639A Withdrawn EP1763773A4 (fr) 2004-04-22 2005-04-22 Architecture de plusieurs ordinateurs avec synchronisation
EP05733638A Withdrawn EP1763772A4 (fr) 2004-04-22 2005-04-22 Architecture informatique modifiee avec des objets d'initialisation

Family Applications Before (4)

Application Number Title Priority Date Filing Date
EP20110002408 Withdrawn EP2341430A1 (fr) 2004-04-22 2005-04-22 Architecture informatique multiple avec synchronisation
EP05733436A Withdrawn EP1763771A4 (fr) 2004-04-22 2005-04-22 Architecture informatique modifiee avec finalisation d'objets
EP05733669A Active EP1763774B1 (fr) 2004-04-22 2005-04-22 Architecture a multiples ordinateurs avec des champs de memoire dupliques
EP05733639A Withdrawn EP1763773A4 (fr) 2004-04-22 2005-04-22 Architecture de plusieurs ordinateurs avec synchronisation

Country Status (12)

Country Link
EP (5) EP2341430A1 (fr)
JP (4) JP2007534065A (fr)
KR (1) KR101209023B1 (fr)
CN (2) CN1965308B (fr)
BR (1) BRPI0508929A (fr)
CA (1) CA2563900C (fr)
EA (1) EA009926B1 (fr)
IL (1) IL178527A (fr)
MX (1) MXPA06012209A (fr)
NZ (1) NZ550480A (fr)
WO (5) WO2005103925A1 (fr)
ZA (1) ZA200608766B (fr)

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7707179B2 (en) 2004-04-23 2010-04-27 Waratek Pty Limited Multiple computer architecture with synchronization
US7849452B2 (en) 2004-04-23 2010-12-07 Waratek Pty Ltd. Modification of computer applications at load time for distributed execution
US7844665B2 (en) 2004-04-23 2010-11-30 Waratek Pty Ltd. Modified computer architecture having coordinated deletion of corresponding replicated memory locations among plural computers
US20060253844A1 (en) 2005-04-21 2006-11-09 Holt John M Computer architecture and method of operation for multi-computer distributed processing with initialization of objects
WO2007041761A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Architecture de machine modifiee a redondance de machines
EP1934776A4 (fr) * 2005-10-10 2009-05-06 Waratek Pty Ltd Replication de graphiques d'objets
WO2007041764A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Systeme a ordinateurs multiples resistant aux defaillances et procede associe
WO2007041760A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Architecture de machine modifiee a synchronisation amelioree
EP1934774A4 (fr) * 2005-10-10 2009-04-15 Waratek Pty Ltd Architecture de machine modifiee a mise a jour partielle de la memoire
AU2006301908B2 (en) * 2005-10-10 2011-09-15 Waratek Pty Limited Modified machine architecture with machine redundancy
WO2007041763A1 (fr) 2005-10-10 2007-04-19 Waratek Pty Limited Syseme a ordinateurs multiples a nettoyage ameliore de la memoire
AU2006301911B2 (en) * 2005-10-10 2010-12-23 Waratek Pty Limited Failure resistant multiple computer system and method
JP2009512081A (ja) * 2005-10-17 2009-03-19 ワラテック プロプライエタリー リミテッド オーバヘッドを低減したマルチマシーンアーキテクチャ
US8015236B2 (en) 2005-10-25 2011-09-06 Waratek Pty. Ltd. Replication of objects having non-primitive fields, especially addresses
US7660960B2 (en) * 2005-10-25 2010-02-09 Waratek Pty, Ltd. Modified machine architecture with partial memory updating
US7761670B2 (en) 2005-10-25 2010-07-20 Waratek Pty Limited Modified machine architecture with advanced synchronization
US7849369B2 (en) 2005-10-25 2010-12-07 Waratek Pty Ltd. Failure resistant multiple computer system and method
US7958322B2 (en) 2005-10-25 2011-06-07 Waratek Pty Ltd Multiple machine architecture with overhead reduction
US7581069B2 (en) 2005-10-25 2009-08-25 Waratek Pty Ltd. Multiple computer system with enhanced memory clean up
US20080133690A1 (en) 2006-10-05 2008-06-05 Holt John M Contention detection and resolution
WO2008040076A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Résolution de contention avec annulation d'écho
US20080133859A1 (en) * 2006-10-05 2008-06-05 Holt John M Advanced synchronization and contention resolution
US20080114899A1 (en) * 2006-10-05 2008-05-15 Holt John M Switch protocol for network communications
US20080114943A1 (en) * 2006-10-05 2008-05-15 Holt John M Adding one or more computers to a multiple computer system
US7962697B2 (en) 2006-10-05 2011-06-14 Waratek Pty Limited Contention detection
US20080140982A1 (en) 2006-10-05 2008-06-12 Holt John M Redundant multiple computer architecture
US20080114853A1 (en) * 2006-10-05 2008-05-15 Holt John M Network protocol for network communications
WO2008040080A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Récupération silencieuse de mémoire
US20080120477A1 (en) * 2006-10-05 2008-05-22 Holt John M Contention detection with modified message format
WO2008040078A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Synchronisation avec réplication de mémoire partielle
US20080126506A1 (en) * 2006-10-05 2008-05-29 Holt John M Multiple computer system with redundancy architecture
US20080127214A1 (en) * 2006-10-05 2008-05-29 Holt John M Contention detection with counter rollover
WO2008040063A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Réseaux de commutation multivoies
US20080140801A1 (en) * 2006-10-05 2008-06-12 Holt John M Multiple computer system with dual mode redundancy architecture
US8090926B2 (en) 2006-10-05 2012-01-03 Waratek Pty Ltd. Hybrid replicated shared memory
US20080151902A1 (en) * 2006-10-05 2008-06-26 Holt John M Multiple network connections for multiple computers
US20080130652A1 (en) * 2006-10-05 2008-06-05 Holt John M Multiple communication networks for multiple computers
US20080133869A1 (en) * 2006-10-05 2008-06-05 Holt John M Redundant multiple computer architecture
US20080140975A1 (en) * 2006-10-05 2008-06-12 Holt John M Contention detection with data consolidation
WO2008040070A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Transmission asynchrone de données
US8316190B2 (en) 2007-04-06 2012-11-20 Waratek Pty. Ltd. Computer architecture and method of operation for multi-computer distributed processing having redundant array of independent systems with replicated memory and code striping
CN105949177B (zh) 2010-05-03 2019-02-01 默克专利有限公司 制剂和电子器件
JP5625621B2 (ja) 2010-08-25 2014-11-19 富士通株式会社 検出装置、方法、及びプログラム
CN105490908A (zh) * 2014-09-16 2016-04-13 中兴通讯股份有限公司 目标资源占用情况的处理方法及装置
EP3451259A1 (fr) * 2017-09-01 2019-03-06 Unify Patente GmbH & Co. KG Méthode informatisée permettant la réalisation d'une session collaborative en temps réel, plateforme collaborative pour la réalisation en temps réel de sessions de collaboration, et objet collaboratif de type chat-post
CN110069243B (zh) * 2018-10-31 2023-03-03 上海奥陶网络科技有限公司 一种java程序线程优化方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995008809A2 (fr) * 1993-09-24 1995-03-30 Oracle Corporation Procede et dispositif de reproduction de donnees
US6324587B1 (en) * 1997-12-23 2001-11-27 Microsoft Corporation Method, computer program product, and data structure for publishing a data object over a store and forward transport
WO2003084116A1 (fr) * 2002-03-25 2003-10-09 Eternal Systems, Inc. Replication passive et semi-active transparente, uniforme de programmes d'application multitransactionnels

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2656543B2 (ja) * 1988-05-26 1997-09-24 東京電力株式会社 ブロードキャストメモリ方式分散コンピュータシステム
JPH02132543A (ja) * 1988-11-12 1990-05-22 Nec Corp 情報処理装置
ATE180586T1 (de) * 1990-11-13 1999-06-15 Ibm Paralleles assoziativprozessor-system
FR2691559B1 (fr) * 1992-05-25 1997-01-03 Cegelec Systeme logiciel a objets repliques exploitant une messagerie dynamique, notamment pour installation de controle/commande a architecture redondante.
US5960087A (en) * 1996-07-01 1999-09-28 Sun Microsystems, Inc. Distributed garbage collection system and method
US6072953A (en) * 1997-09-30 2000-06-06 International Business Machines Corporation Apparatus and method for dynamically modifying class files during loading for execution
GB2353113B (en) * 1999-08-11 2001-10-10 Sun Microsystems Inc Software fault tolerant computer system
US6662359B1 (en) * 2000-07-20 2003-12-09 International Business Machines Corporation System and method for injecting hooks into Java classes to handle exception and finalization processing
JP2002116917A (ja) * 2000-10-05 2002-04-19 Fujitsu Ltd オブジェクト指向型プログラミング言語によるソース・プログラムをコンパイルするコンパイラ
WO2002044835A2 (fr) * 2000-11-28 2002-06-06 Gingerich Gregory L Procede et systeme d'execution d'une multiplicite d'objets logiciels dans une multiplicite de systemes materiels
US20040073828A1 (en) * 2002-08-30 2004-04-15 Vladimir Bronstein Transparent variable state mirroring
US7774750B2 (en) * 2005-07-19 2010-08-10 Microsoft Corporation Common concurrency runtime

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995008809A2 (fr) * 1993-09-24 1995-03-30 Oracle Corporation Procede et dispositif de reproduction de donnees
US6324587B1 (en) * 1997-12-23 2001-11-27 Microsoft Corporation Method, computer program product, and data structure for publishing a data object over a store and forward transport
WO2003084116A1 (fr) * 2002-03-25 2003-10-09 Eternal Systems, Inc. Replication passive et semi-active transparente, uniforme de programmes d'application multitransactionnels

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO2005103924A1 *

Also Published As

Publication number Publication date
BRPI0508929A (pt) 2007-08-14
EP1763774B1 (fr) 2012-12-05
EP1763771A1 (fr) 2007-03-21
ZA200608766B (en) 2008-08-27
MXPA06012209A (es) 2007-04-17
WO2005103924A1 (fr) 2005-11-03
JP2007534063A (ja) 2007-11-22
KR101209023B1 (ko) 2012-12-10
CN101908001A (zh) 2010-12-08
KR20070022253A (ko) 2007-02-26
CN1965308A (zh) 2007-05-16
EP1763774A4 (fr) 2008-12-03
CN1965308B (zh) 2010-08-04
CN101908001B (zh) 2014-05-14
IL178527A (en) 2011-11-30
EP1763772A4 (fr) 2008-12-17
EP2341430A1 (fr) 2011-07-06
WO2005103925A1 (fr) 2005-11-03
WO2005103926A1 (fr) 2005-11-03
EP1763773A4 (fr) 2008-12-17
WO2005103928A1 (fr) 2005-11-03
NZ550480A (en) 2010-02-26
CA2563900C (fr) 2015-01-06
JP2007534066A (ja) 2007-11-22
EP1763771A4 (fr) 2008-12-17
WO2005103927A1 (fr) 2005-11-03
EA009926B1 (ru) 2008-04-28
CA2563900A1 (fr) 2005-11-03
JP2007534064A (ja) 2007-11-22
EA200601942A1 (ru) 2007-04-27
EP1763774A1 (fr) 2007-03-21
IL178527A0 (en) 2007-02-11
JP2007534065A (ja) 2007-11-22
EP1763773A1 (fr) 2007-03-21

Similar Documents

Publication Publication Date Title
US20050262513A1 (en) Modified computer architecture with initialization of objects
US7844665B2 (en) Modified computer architecture having coordinated deletion of corresponding replicated memory locations among plural computers
WO2005103924A1 (fr) Architecture informatique modifiee avec des objets d'initialisation
US20060095483A1 (en) Modified computer architecture with finalization of objects
US20060020913A1 (en) Multiple computer architecture with synchronization
US7818296B2 (en) Computer architecture and method of operation for multi-computer distributed processing with synchronization
AU2005236087B2 (en) Modified computer architecture with coordinated objects
AU2005236088B2 (en) Modified computer architecture with finalization of objects
AU2005236085A1 (en) Modified computer architecture with initialization of objects
AU2005236086A1 (en) Multiple computer architecture with synchronization
AU2005236089A1 (en) Multiple computer architecture with replicated memory fields
AU2006238334A1 (en) Modified computer architecture for a computer to operate in a multiple computer system

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20061117

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR LV MK YU

A4 Supplementary search report drawn up and despatched

Effective date: 20081113

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 15/16 20060101ALI20081107BHEP

Ipc: G06F 9/46 20060101AFI20081107BHEP

17Q First examination report despatched

Effective date: 20090313

RIN1 Information on inventor provided before grant (corrected)

Inventor name: HOLT, JOHN MATTHEW

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 9/52 20060101AFI20170109BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20170331