EP1763771A1 - Architecture informatique modifiee avec finalisation d'objets - Google Patents

Architecture informatique modifiee avec finalisation d'objets

Info

Publication number
EP1763771A1
EP1763771A1 EP05733436A EP05733436A EP1763771A1 EP 1763771 A1 EP1763771 A1 EP 1763771A1 EP 05733436 A EP05733436 A EP 05733436A EP 05733436 A EP05733436 A EP 05733436A EP 1763771 A1 EP1763771 A1 EP 1763771A1
Authority
EP
European Patent Office
Prior art keywords
computers
index
int
computer
info
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
EP05733436A
Other languages
German (de)
English (en)
Other versions
EP1763771A4 (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 EP1763771A1 publication Critical patent/EP1763771A1/fr
Publication of EP1763771A4 publication Critical patent/EP1763771A4/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
  • 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. Typically the speed of operation of such networks 14 is an order of magnitude slower than the speed of operation of the bus 4 in each of the individual machines Ml, M2, etc.
  • Each machine communicates with a common database but does not communicate directly with the other machines. Although each machine runs the same application, each machine is doing a different "job" and uses only its own memory. This is somewhat analogous to a number of windows each of which sell train tickets to the public. This approach does operate, is scalable and mainly suffers from the disadvantage that it is difficult to administer the network.
  • 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 "clean up" (or deletion or finahsation) operates in a consistent fashion across all the machines. It is this goal of consistent finalization that is the genesis of the present invention.
  • a method 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 all said identical objects are collectively deleted when each one of said plurality of computers no longer needs to refer to their corresponding object.
  • 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 needs, or no longer needs to refer to an object 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 a finalization routine which deletes a non-referenced object only if each one of said plurality of computers no longer needs to refer to their corresponding object.
  • a method of running at least one application program on a plurality of computers simultaneously said computers being interconnected by means of a communications network, said method comprising the steps of: (i) creating a like plurality of substantially identical objects each in the corresponding computer and each having a substantially identical name, and
  • a method 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, and in which objects in local memory physically associated with the computer processing each thread have corresponding objects in the local memory of each other said computer, the improvement comprising collectively deleting all said corresponding objects when each one of said plurality of computers no longer needs to refer to their corresponding object.
  • 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 JAVA code and thereby constitute a JAVA virtual machine
  • Fig. 7 is a drawing similar to Fig.
  • 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. 11 but illustrating an alternative embodiment
  • Fig. 13 illustrates multi-thread memory updating for the computers of Fig. 8, Fig.
  • 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 "clean up" or finalization routines
  • Fig. 17 is a flow chart illustrating the continuation or abortion of finalization 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. 20 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. 21 is a view similar to Fig. 20 but showing the Fig. 20 apparatus with one application operating on each computer
  • Fig. 22 is a view similar to Figs. 20 and 21 but showing the Fig. 20
  • Annexures A and C which provide actual code fragments which implement various aspects of the described embodiments.
  • Annexure A relates to fields and Annexure C to finalization.
  • 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.
  • 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. Turning now to 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 - 10 cycles of the central processing unit of the machine. This in large part accounts for the diminished performance of the multiple interconnected machines.
  • the identities and values of changed fields can be grouped into batches so as to further reduce the demands on the communication speed of the network 53 interconnecting the various 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 inte ⁇ nediate 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.
  • a machine (produced by any one of various manufacturers and having an operating system operating in any one of various different languages) can operate in the particular language of the application program 50, in this instance the JAVA language. That is, 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. However, the initialization routine ⁇ init> happens often, for example every time a new object 5 OX, 50 Y or 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 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 because for conventional operation each initialization routine is executed only once.
  • the single machine of Fig. 14 is able to easily keep track of whether the specific objects 50X-50Z are, in future, liable to be required for the program 50. This is done by maintaining a "handle count” or similar. This count keeps track of the number of places in the executable code where reference is made to a specific object. When the handle count for a specific object reaches zero, there is nowhere in the executable code which makes reference to the object. The object is then said to be "finalizable". Once this state has been achieved, the object can be safely deleted (or cleaned up or finalized) because it is no longer needed. The same procedure applies mutatis mutandis for classes.
  • the computer programmer when writing a program using the JAVA language and architecture need not write any specific code in order to provide for this cleaning up, deletion or finalization. Instead a single JAVA virtual machine 72 can keep track of the class and object handle counts and clean up (or carry out finalization) as necessary in an unobtrusive fashion.
  • 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 (as in Fig. 5 and realised by the DRT 71 of Fig. 8) and loaded with a common application program 50.
  • the modifier 51 or DRT 71 modifies the application code 50 to execute clean up routines across the plurality of 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 is finalized in a consistent fashion (with respect to the others).
  • the application program 50 is scrutinized in order to detect program steps which define a clean up routine. This scrutiny can take place either prior to loading, or during the loading procedure, or even after the loading procedure (but before execution of the relevant corresponding portion of the application code 50). It may be likened to a compilation procedure with the understanding that the term compilation normally involves a change in code or language, eg from source to object code or one language to another. However, in the present instance the term “compilation" (and its grammatical equivalents) is not so restricted and can also include embrace modifications within the same code or language.
  • the DRT 71/1 on the loading machine in this example JVM#1, asks the DRT's 71/2...71/n of all the other machines M2...Mn if the first object 5 OX, say, is utilized (ie not marked for deletion) by any other machine M2...Mn. If the answer to this question is yes, then the normal clean up procedure is turned off or disabled for the first object 5 OX on machine JVM#1. If the answer is no, (ie the first object 5 OX is marked for deletion on all other machines) then the normal clean up procedure is operated and the first object 5 OX is deleted not only on machine JVM#1 but on all other machines M2...Mn. Preferably the clean up task is allocated to the last machine Ml marking the object or class for deletion.
  • 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 50 (or programmes) on all machines Ml, M2...Mn simultaneously.
  • server machine X which is conveniently able to supply housekeeping functions, for example, and especially the clean up of structures, assets and resources.
  • 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.
  • 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(s).
  • Fig. 16 shows a preferred general procedure to be followed. After loading 161 has been commenced, the instructions to be executed are considered in sequence and all clean up routines are detected as indicated in step 162. In the JAVA language these are the "fmalize( )" routine (or method in JAVA terminology). Other languages use different terms.
  • a clean up routine is detected, it is modified at step 1 3, typically by inserting further instructions into the routine. Alternatively, the modifying instructions could be inserted prior to the routine.
  • 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) 50A, 50X...50Y which are possible candidates to be cleaned up have already been allocated a name or tag which can be used globally by all machines Ml, M2...Mn, as indicated by step 172.
  • This table also includes the "clean up status" of the class or object.
  • this table also includes a counter which stores a count of the number of machines which have marked this asset for deletion. Thus a total count value of less than (n-1) indicates a "do not clean up" status for the asset as a network whole.
  • step 17 if the global name is not marked for deletion on all other machines (ie all except on the machine proposing to carry out the clean up routine) then this means that the proposed clean up routine of the object or class should be aborted since the object or class is still required, as indicated by step 175. However, if the global name is marked for deletion on all machines, this means that no other machine requires this class or object. As a consequence, the regular clean up routine indicated in step 176 can be, and should be, carried out.
  • Fig. 18 shows the enquiry made by the machine proposing to execute a clean up routine (one of Ml, M2...Mn) to the server machine X.
  • the operation of this proposing machine is temporarily interrupted, as shown in step 181 and 182, until the reply is received from machine X, indicated by step 182.
  • Fig. 19 shows the activity carried out by machine X in response to such an enquiry.
  • the clean up status is determined as seen in step 192 and, if no - the named resource is not marked for deletion on (n-1) machines (ie is utilized elsewhere), the response to that effect is sent to the enquiring machine 194 but the "marked for deletion" counter is incremented by one (1), as shown by step 197.
  • the answer is yes - the corresponding reply is sent as indicated by steps 195.
  • the waiting enquiring machine 182 is then able to respond accordingly.
  • Annexure C is a typical code fragment from an unmodified finalize routine
  • Annexure C2 is an equivalent in respect of a modified finalize routine
  • Annexure C3 is an equivalent in respect of a modified finalize routine.
  • Annexures CI and C2 are the before and after excerpt of a finalize routine respectively.
  • the modified code that is added to the method is highlighted in bold.
  • the finalize method prints "Deleted" to the computer console on event of finalization (ie deletion) of this object.
  • each machine would re-finalize the same object, thus executing the finalize method more than once for a single globally-named object.
  • the application code is modified as it is loaded into the machine by changing the finalize method.
  • the changes made are the initial instructions that the finalize method executes.
  • the isLastReference() method of the DRT can optionally take an argument which represents a unique identifier for this object (See Annexure C3), for example the name of the object, a reference to the object in question, or a unique number representing this object across all nodes, to be used in the determination of the finalization status of this class.
  • a unique identifier for this object See Annexure C3
  • the DRT can support the finalization of multiple objects at the same time without becoming confused as to which of the multiple objects are already finalized and which are not, by using the unique identifier of each object to consult the correct record in the finalization table.
  • the DRT can determine the finalization state of the object in a number of ways. Preferably, it can ask each machine in turn if their local copy of this object has been marked for finalization, and if any machine replies false, 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 object has been marked for finalization by all machines except the current machine.
  • 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
  • a particular machine say machine M2 loads the clean up on itself, modifies it, and then loads each of the other machines Ml, M3 ... Mn
  • each of machines Ml, M3, ... Mn loads what it is given by machine M2.
  • machine M2 loads the clean up routine in unmodified form on machine M2 and then on the other machines deletes the clean up routine in its entirety and loads the modified code.
  • the modification is not a by-passing of the clean up routine but a deletion of it on all machines except one.
  • each machine receives the clean up 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 unmodified clean up routine and all other machines M2, M3 ... Mn do a modification to delete the original clean up 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 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 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 machine X, which returns a modified routine to each machine.
  • 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 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.
  • 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
  • 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. 21.
  • 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.
  • the box 310 can be dragged by means of the mouse 107 to the left as seen in Fig.
  • 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 finahsation or clean up routine is modified is based upon the assumption that either the run 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 finahsation routine. It is possible to leave the JAVA finahsation routine unamended and instead amend the LINUX or HOTSPOT routine which calls the JAVA finahsation routine, so that if the object or class is not to be deleted, then the JAVA finahsation routine is not called.
  • the run time system say, JAVA HOTSPOT VIRTUAL MACHINE written in C and JAVA
  • the operating system LINUX written in C and Assembler, for example
  • the term "finahsation routine” is to be understood to include within its scope both the JAVA finahsation routine and the "combination" of the JAVA finahsation routine and the LINUX or HOTSPOT code fragments which call or initiate the JAVA finahsation 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
  • object code packages or function unit or memory locations.
  • comprising (and its grammatical variations) as used herein is used in the inclusive sense of “having” or “including” and not in the exclusive sense of "consisting only of.
  • 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.
  • code[i+3] (byte) 184; // Invokestatic instruction for the // DRT.alertO method.
  • 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.getMulticastSocket () ; // 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 . isRunning () ) ⁇ 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 . getDeclaredField ( "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 alerts new Hashtable () ;
  • the ninth excerpt is the source-code of FieldSend, which propagates changes values alerted to it via FieldAlert.
  • DatagramPacket datagramPacket new DatagramPacket (buffer, 0, buffer .length) ; while ( ! Thread. interrupted 0 ) ⁇ // Make sure to reset length.
  • int globallD (int) ( (buffer [index++] & Oxff) « 24) I ( (buffe [index++] & Oxff) « 16) I ( (buffe [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.
  • Fiel U fields reference. getClass () .getDeclaredFields () ; while (index ⁇ length) ( // Decode the field id.
  • int fieldlD (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 .
  • Field[] fields FieldLoader . loadClass (name) . getDeclaredFields () ;
  • CONSTANT_Fieldref_info fi (CONSTANT_Fieldref_info) cf . constant_pool [ (int) ( ( (ca. code [z] [1] & Oxff) « 8)
  • CONSTANT_Class_info ci (CONSTANT_Class_info) cf . constant_pool [fi. class_index] ;
  • String className cf . constant_pool [ci.name_index] . toString () ; if (! name. equals (className) ) ⁇ throw new AssertionError ("This code only supports fields "local to this class”) ;
  • 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_info structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing ClassFile structures import java.lang.*; import java.io.*; import j ava . util . * ;
  • 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 constantjpool count; public cp_info[] constantjpool; public int access_flags; public int this_class; public int super lass; public int inte faces_count; public int[] interfaces; public int fields_count; public field_info[] fields; public int methods ount; public method_info [ ] 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.
  • Convience class for representing Code_attribute structures within ClassFiles import java.util.*; import java.lang.*; import java.io.*;
  • Convience class for representing CONSTANT_InterfaceMethodref_info structures within ClassFiles import j ava . lang . * ; import j ava . io . * ;
  • Convience class for representing cp_info structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing Deprecated attribute 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 field_info structures within ClassFiles import j ava . lang . * ; import java.io.*;
  • Convience class for representing InnerClasses_attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing method_info structures within ClassFiles import java.lang.*; import java.io.*;
  • Convience class for representing SourceFile _attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • a SourceFile attribute is an optional fixed_length attribute in * the attributes table. Only located in the ClassFile struct only * once.
  • Convience class for representing Synthetic_attribute structures within ClassFiles import java.lang.*; import java.io.*;
  • Hashtable hashCodeToGloballD new Hashtable
  • ServerSocket serverSocket new ServerSocket (serverPort) ; while ( !Thread. interrupted ( ) ) ⁇
  • Socket socket serverSocket . accept () ;
  • ca.code[l] [2] (byte) ( (cf. constantjpool .length-1) & Oxff); // Next add the IFNE instruction.
  • ca.code [2] new byte [3];
  • ca.code[2] [0] (byte) 154;
  • ca.code[2] [1] (byte) ((4 » 8) & Oxff);
  • ca.code[3] [0] (byte) 177; // Lastly, increment the CODE_LENGTH and ATTRIBUTE .ENGTH values . ca .

Abstract

La présente invention concerne une architecture informatique modifiée (50, 71, 72) qui permet l'exécution d'un programme d'applications (50) simultanément sur une pluralité d'ordinateurs (M1, . Mn). Une mémoire partagée au niveau de chaque ordinateur est mise à jour à l'aide de modifications et/ou de réécritures de sorte que l'ensemble des demandes de lecture mémoire sont satisfaites localement. Au cours du chargement de programme (75) initial, ou autre, des instructions qui entraînent la réécriture ou la manipulation de mémoire sont identifiées (92). Des instructions supplémentaires sont insérées (103) afin d'entraîner la mise à jour des emplacements de mémoire équivalents sur l'ensemble des ordinateurs. L'invention concerne notamment la finalisation de classes et d'objets en langage JAVA (162, 163), de sorte que la finalisation se produit uniquement lorsque la dernière classe ou le dernier objet présent sur l'ensemble des machines n'est plus nécessaire.
EP05733436A 2004-04-22 2005-04-22 Architecture informatique modifiee avec finalisation d'objets Withdrawn EP1763771A4 (fr)

Applications Claiming Priority (2)

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

Publications (2)

Publication Number Publication Date
EP1763771A1 true EP1763771A1 (fr) 2007-03-21
EP1763771A4 EP1763771A4 (fr) 2008-12-17

Family

ID=35197170

Family Applications (5)

Application Number Title Priority Date Filing Date
EP05733436A Withdrawn EP1763771A4 (fr) 2004-04-22 2005-04-22 Architecture informatique modifiee avec finalisation d'objets
EP20110002408 Withdrawn EP2341430A1 (fr) 2004-04-22 2005-04-22 Architecture informatique multiple avec synchronisation
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 After (4)

Application Number Title Priority Date Filing Date
EP20110002408 Withdrawn EP2341430A1 (fr) 2004-04-22 2005-04-22 Architecture informatique multiple avec synchronisation
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

Country Status (12)

Country Link
EP (5) EP1763771A4 (fr)
JP (4) JP2007534066A (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) WO2005103924A1 (fr)
ZA (1) ZA200608766B (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105490908A (zh) * 2014-09-16 2016-04-13 中兴通讯股份有限公司 目标资源占用情况的处理方法及装置

Families Citing this family (45)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7849452B2 (en) 2004-04-23 2010-12-07 Waratek Pty Ltd. Modification of computer applications at load time for distributed execution
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
US7707179B2 (en) 2004-04-23 2010-04-27 Waratek Pty Limited Multiple computer architecture with synchronization
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
WO2007041764A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Systeme a ordinateurs multiples resistant aux defaillances et procede associe
EP1934774A4 (fr) * 2005-10-10 2009-04-15 Waratek Pty Ltd Architecture de machine modifiee a mise a jour partielle de la memoire
WO2007041761A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Architecture de machine modifiee a redondance de machines
WO2007041760A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Architecture de machine modifiee a synchronisation amelioree
AU2006301908B2 (en) * 2005-10-10 2011-09-15 Waratek Pty Limited Modified machine architecture with machine redundancy
AU2006301911B2 (en) * 2005-10-10 2010-12-23 Waratek Pty Limited Failure resistant multiple computer system and method
WO2007041763A1 (fr) 2005-10-10 2007-04-19 Waratek Pty Limited Syseme a ordinateurs multiples a nettoyage ameliore de la memoire
WO2007041765A1 (fr) * 2005-10-10 2007-04-19 Waratek Pty Limited Replication de graphiques d'objets
CN101288062B (zh) * 2005-10-17 2012-03-21 瓦拉泰克有限公司 开销减少的多机器体系结构
US7849369B2 (en) 2005-10-25 2010-12-07 Waratek Pty Ltd. Failure resistant multiple computer system and method
US7761670B2 (en) 2005-10-25 2010-07-20 Waratek Pty Limited Modified machine architecture with advanced synchronization
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
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
WO2008040083A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Addition d'un ou de plusieurs ordinateurs à un système à ordinateurs multiples
US20080155127A1 (en) * 2006-10-05 2008-06-26 Holt John M Multi-path switching networks
US8095616B2 (en) 2006-10-05 2012-01-10 Waratek Pty Ltd. Contention detection
US20080130652A1 (en) * 2006-10-05 2008-06-05 Holt John M Multiple communication networks for multiple computers
WO2008040085A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Protocole de réseau pour communications de réseau
US7958329B2 (en) 2006-10-05 2011-06-07 Waratek Pty Ltd Hybrid replicated shared memory
US8473564B2 (en) 2006-10-05 2013-06-25 Waratek Pty Ltd. Contention detection and resolution
US20080140801A1 (en) * 2006-10-05 2008-06-12 Holt John M Multiple computer system with dual mode redundancy architecture
US20080133869A1 (en) * 2006-10-05 2008-06-05 Holt John M Redundant multiple computer architecture
US20080151902A1 (en) * 2006-10-05 2008-06-26 Holt John M Multiple network connections for multiple computers
US20080126506A1 (en) * 2006-10-05 2008-05-29 Holt John M Multiple computer system with redundancy architecture
US20080126503A1 (en) * 2006-10-05 2008-05-29 Holt John M Contention resolution with echo cancellation
US20080126322A1 (en) * 2006-10-05 2008-05-29 Holt John M Synchronization with partial memory replication
US20080133859A1 (en) * 2006-10-05 2008-06-05 Holt John M Advanced synchronization and contention resolution
US20080140973A1 (en) * 2006-10-05 2008-06-12 Holt John M Contention detection with data consolidation
US20080133862A1 (en) * 2006-10-05 2008-06-05 Holt John M Contention detection with modified message format
US20080114962A1 (en) * 2006-10-05 2008-05-15 Holt John M Silent memory reclamation
WO2008040073A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Résolution de contention avec réinitialisation de compteur
US20100054254A1 (en) 2006-10-05 2010-03-04 Holt John M Asynchronous data transmission
US20080140858A1 (en) * 2006-10-05 2008-06-12 Holt John M Switch protocol for network communications
WO2008040072A1 (fr) * 2006-10-05 2008-04-10 Waratek Pty Limited Détection de contention avancée
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
KR101778825B1 (ko) 2010-05-03 2017-09-14 메르크 파텐트 게엠베하 제형물 및 전자 소자
JP5625621B2 (ja) 2010-08-25 2014-11-19 富士通株式会社 検出装置、方法、及びプログラム
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 (6)

* 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
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
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
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

Family Cites Families (9)

* 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.
GB2353113B (en) * 1999-08-11 2001-10-10 Sun Microsystems Inc Software fault tolerant computer system
JP2002116917A (ja) * 2000-10-05 2002-04-19 Fujitsu Ltd オブジェクト指向型プログラミング言語によるソース・プログラムをコンパイルするコンパイラ
AU2002232411A1 (en) * 2000-11-28 2002-06-11 Gregory L. Gingerich A method and system for software and hardware multiplicity
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 (6)

* 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
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
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
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
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 (2)

* Cited by examiner, † Cited by third party
Title
A. SÁNCHEZ, L. VEIGA, P. FERREIRA: "Distributed garbage collection for wide area replicated memory" PROCEEDINGS OF THE 6TH CONFERENCE ON USENIX CONFERENCE ON OBJECT-ORIENTED TECHNOLOGIES AND SYSTEMS, [Online] vol. 6, 29 January 2001 (2001-01-29), pages 1-14, XP002502672 Berkeley, CA, USA Retrieved from the Internet: URL:http://portal.acm.org/citation.cfm?id= 1268246; http://citeseerx.ist.psu.edu/viewdoc/summa ry?doi=10.1.1.10.5675; http://www.gsd.inesc-id.pt/~lveiga/papers/ dgcwarm-coots-2001.pdf> [retrieved on 2008-10-27] *
See also references of WO2005103927A1 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105490908A (zh) * 2014-09-16 2016-04-13 中兴通讯股份有限公司 目标资源占用情况的处理方法及装置

Also Published As

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

Similar Documents

Publication Publication Date Title
US7844665B2 (en) Modified computer architecture having coordinated deletion of corresponding replicated memory locations among plural computers
CA2563900C (fr) Architecture d'ordinateur modifiee avec objets coordonnes
US20060095483A1 (en) Modified computer architecture with finalization of objects
US20060020913A1 (en) Multiple computer architecture with synchronization
US20050262513A1 (en) Modified computer architecture with initialization of objects
US8028299B2 (en) Computer architecture and method of operation for multi-computer distributed processing with finalization of objects
AU2005236088B2 (en) Modified computer architecture with finalization of objects
AU2005236087B2 (en) Modified computer architecture with coordinated objects
AU2005236086A1 (en) Multiple computer architecture with synchronization
AU2005236085A1 (en) Modified computer architecture with initialization of objects
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: 20081118

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 9/46 20060101AFI20081110BHEP

Ipc: G06F 15/16 20060101ALI20081110BHEP

Ipc: G06F 12/02 20060101ALI20081110BHEP

17Q First examination report despatched

Effective date: 20090313

RIN1 Information on inventor provided before grant (corrected)

Inventor name: HOLT, JOHN MATTHEW

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