METHOD AND DEVICE FOR DYNAMIC GENERATION MANAGEMENT OF COMPUTER MEMORY

    公开(公告)号:JP2000047931A

    公开(公告)日:2000-02-18

    申请号:JP10048099

    申请日:1999-03-02

    Abstract: PROBLEM TO BE SOLVED: To execute a generation garbage collection in a computer memory by generating a new route array through the use of a prescribed marker when reference to a second object is stored after the execution of the second garbage collection. SOLUTION: When it is judged that a new generation pointer is not set (S746), the new generation pointer indicating that a pointer is connected from an old generation to the new one, is set (747). Then, the route array is assigned and a card mark is set so as to indicate the assigned route array (S748). Then, whether route array assignment has succeeded or not is judged (S749). When the assignment of the route array has succeeded, a route tracked by the route array is inserted (S750). In the meantime, at the time of failure in assignment, the card mark indicating that the route array overflows is set (S755).

    METHOD AND DEVICE FOR DYNAMICALLY AND INVERSELY OPTIMIZING COMPILED ACTIVATION

    公开(公告)号:JPH11237991A

    公开(公告)日:1999-08-31

    申请号:JP31974398

    申请日:1998-10-06

    Inventor: HOLZLE URS BAK LARS

    Abstract: PROBLEM TO BE SOLVED: To improve the efficiency of the dynamic decompile of a compiled method and the dynamically inverse optimization of a compiled frame by storing information on the compiled method and frame. SOLUTION: A program counter that is associated with a frame to be inversely optimized is acquired and is used at the time of accessing accessible information existing in a compiled method that is associated (S402). Interpreter activation is acquired to extract an interpreter state from an optimized frame by using the accessible information (S404). A pointer which migrates the interpreter activation and is to a frame array is stored in a corresponding frame (S406 and 408). The complied method is eliminated after the return address of a frame called by the inversely optimized frame is set to the address of an unpacking routine for the frame array (S410 and 412).

    MIXED EXECUTION STACK AND EXCEPTION PROCESSING

    公开(公告)号:JPH11237990A

    公开(公告)日:1999-08-31

    申请号:JP31973998

    申请日:1998-10-06

    Abstract: PROBLEM TO BE SOLVED: To incorporate an execution stack capable of maintaining the activation of a function incorporated by a different programming language by utilizing an entry frame that stores a pointer to the preceding frame on the execution stack. SOLUTION: A system stores a 1st frame on an execution stack for a 1st function written in one programming language (S401). When the 1st function calls a 2nd function written in a different programming language, one or plural pointers to the 1st frame are stored in a local storage device (S403). A 2nd frame is stored on an execution stack for the 2nd function written in the different programming language and a data block is stored on an execution stack including a pointer to the 1st frame on the execution stack (S405 and 407). The pointers stored in the local storage device are copied on a data block pushed on an execution stack that is upper than the 2nd frame for the 2nd function.

    METHOD AND DEVICE FOR REALIZING HIGH-SPEED CHECK OF SUB- CLASS AND SUB-TYPE

    公开(公告)号:JP2000039997A

    公开(公告)日:2000-02-08

    申请号:JP7769399

    申请日:1999-03-23

    Abstract: PROBLEM TO BE SOLVED: To efficiently check a sub-type by judging whether or not a candidate type obtained from the dynamic storage location of a class related to an object is the sub-type of the same type based on the compared result of the candidate type with the latently same type. SOLUTION: The result of the previous sub-type check is stored in a cache 268 as the dynamic storage location of a class 260. A cache 268 of the class 260 related to an object S 252 is compared with a type B. As a result, when the cache 268 is made coincident with the type B, the class 260 is judged as the sub-type of the type B. Then, the relation with the type B is stored in the cache 268 of the class 260 related with an object S 252. Thus, the result of the sub-type check to be stored in the cache 268 can be changed according as the check of the sub-type is executed.

    STATIC COUPLING OF CALL DISPATCHED DYNAMICALLY IN PRESENCE OF DYNAMIC LINKING AND DYNAMIC LOADING

    公开(公告)号:JPH11327906A

    公开(公告)日:1999-11-30

    申请号:JP7773299

    申请日:1999-03-23

    Abstract: PROBLEM TO BE SOLVED: To make static coupling of a call which is dispatched dynamically in the presence of dynamic linking and dynamic loading executable by adding class information regarding a process stage and subordinate information including signature information to a function. SOLUTION: A system adds the subordinate information to a method having been compiled. The subordinate information includes the classes, names, and signatures (parameter type) of respective virtual functions which are already optimized. The said compiled method has a header 603 and a compiled code 605. The header 603 specially contains subordinate information 607. The subordinate information is a list of the classes, names, and signatures of all virtual function class which are optimized in the compiled method. This information is stored in the form of a simple list and usable for other various storage technologies.

    METHOD AND DEVICE FOR EXECUTING BYTE CODE OPTIMIZATION DURING PAUSE

    公开(公告)号:JPH11237989A

    公开(公告)日:1999-08-31

    申请号:JP31973898

    申请日:1998-10-06

    Inventor: HOLZLE URS BAK LARS

    Abstract: PROBLEM TO BE SOLVED: To optimize the use of computer system resources by executing compilation and other activities during pause in the entire execution of a computer program. SOLUTION: Decision is made as to whether the execution of a program arrives in an idle period (S212). The idle period is a pause in the middle of program processing in which a program generally becomes inactive, e.g. a thinking pause. The thinking pause occurs while the program waits for an action from a user. When it is decided that an idle period exists, whether a hold task such as a compile exists is decided (S214). Such a task generally includes various tasks such as arranging unnecessary parts of the compile. When it is decided that tasks such as a hold compile exist through examining an execution list and a database list, the tasks are carried out (S216).

    IN-LINE DATA BASE FOR RECEIVER TYPE IN OBJECT-ORIENTED SYSTEM

    公开(公告)号:JP2000003280A

    公开(公告)日:2000-01-07

    申请号:JP31973798

    申请日:1998-10-06

    Inventor: BAK LARS HOLZLE URS

    Abstract: PROBLEM TO BE SOLVED: To obtain a system and method for realizing a message dispatch for an object-oriented program. SOLUTION: Receiver type information is collected at the site of a method for dispatching a message to a receiver object (701). The receiver type information is saved for the following execution of a program (703). The receiver type information is saved so that it is not necessary to re-collect the receiver information, and that it is possible to further efficiently execute the program. Moreover, not only the receiver type information but also in-lining information can be saved.

    COST REDUCTION TECHNIQUE FOR DYNAMIC CLASS INITIALIZATION CHECK IN ALREADY COMPILED CODE

    公开(公告)号:JPH11327916A

    公开(公告)日:1999-11-30

    申请号:JP7771899

    申请日:1999-03-23

    Abstract: PROBLEM TO BE SOLVED: To provide a cost reduction technique of dynamic class loading and initialization check in an already compiled code. SOLUTION: A virtual machine instruction is compiled to one or more native machine instructions even when request execution time execution information is not usable at the time of compilation. The native machine instruction can be provided with place holder data in a place where the request execution time execution information is to be present. The native machine instruction can be subscribed by the native machine instruction for transferring a control right to the section of a stab or a code for replacing the place holder data with the request execution time execution information at the time of execution at execution time.

    THREAD SYNCHRONIZATION METHOD FOR OBJECT BASE SYSTEM, COMPUTER SYSTEM AND ITS COMPUTER PROGRAM PRODUCT

    公开(公告)号:JPH1131081A

    公开(公告)日:1999-02-02

    申请号:JP31894097

    申请日:1997-11-04

    Abstract: PROBLEM TO BE SOLVED: To effectively track the status (state) of an object by acquiring the contents of an object header field and storing these contents at an inside position of a stack that is related to a thread. SOLUTION: A thread reads out the contents of the header field of an object (step 402). Based on these contents, it is checked whether or not the object is locked (404). If the object is not locked, the contents of the object header field are stored in a stack that is related to the thread (408). If the object is locked, it is decided whether or not the thread already holds the object lock (410). Then the indicator value is stored in the stack related to the thread (412).

    10.
    发明专利
    未知

    公开(公告)号:DE69932874T2

    公开(公告)日:2007-02-22

    申请号:DE69932874

    申请日:1999-02-26

    Abstract: The present invention relates to methods and apparatus for performing generational garbage collection within computer memory. According to one aspect of the present invention, a computer-implemented method for dynamically managing memory which includes a first memory section and a second memory section that is divided into a plurality of blocks each having an associated marker, includes performing a first garbage collection on the first memory section. The method also includes performing a second garbage collection on a selected one of the blocks in the second memory section. A third garbage collection is performed on the selected block in the second memory section. The third garbage collection includes determining whether the selected block includes a first object which references a second object which is not included in the selected block based at least in part on a status indicated by the marker associated with the selected block. The status includes an indication of whether the reference to the second object was stored after the second garbage collection was performed, and if the reference to the second object was stored after the second garbage collection was performed, a new root array is created using the selected marker.

Patent Agency Ranking