22.
    发明专利
    未知

    公开(公告)号:DE69817333T2

    公开(公告)日:2004-06-09

    申请号:DE69817333

    申请日:1998-06-05

    Applicant: IBM

    Abstract: A method for loading instruction codes to a first memory and linking said instruction codes is proposed, whereby at least one instruction code has as parameter an address which during a loading step is not determined. This address-parametered instruction code has assigned thereto an address place. A relocation information is loaded which during a linking step effects that the address becomes determined using a starting address and a relative address offset. The then determined address is put at the address place. During the loading step, directly after loading each address-parametered instruction code with its address place, the relocation information is loaded and the address is determined in the linking step.

    23.
    发明专利
    未知

    公开(公告)号:DE69814174T2

    公开(公告)日:2004-03-04

    申请号:DE69814174

    申请日:1998-11-12

    Applicant: IBM

    Abstract: A Java runtime system is proposed which comprises a stack-based interpreter executing a program that comprises bytecodes and class structures. The system further comprises a modified constant pool with internal information of use only during linking and with external information to be preserved for late code binding. The internal information is removed from the modified constant pool after linking.

    24.
    发明专利
    未知

    公开(公告)号:DE69903496T2

    公开(公告)日:2003-12-04

    申请号:DE69903496

    申请日:1999-04-22

    Applicant: IBM

    Abstract: Scheme for the distinguishing of reachable objects and non-reachable objects used by an object-based application in a system with volatile memory of limited size. The object-based application operates on n objects whereby Z objects thereof are root objects. The following steps are carried out for each root object: (a) traversing from said root object to any other object that can be reached from said root object; (b) marking all objects that were reached from said root object and storing, while marking, in said volatile memory a description of the path from said root object to the currently visited object; if the marking phase reaches an object and the respective path does not fit into said volatile memory, then this object is not marked but identified as an object which has to be processed later; and continuing the marking phase until all root objects identified as objects which have to be processed later are processed.

    25.
    发明专利
    未知

    公开(公告)号:DE69817333D1

    公开(公告)日:2003-09-25

    申请号:DE69817333

    申请日:1998-06-05

    Applicant: IBM

    Abstract: A method for loading instruction codes to a first memory and linking said instruction codes is proposed, whereby at least one instruction code has as parameter an address which during a loading step is not determined. This address-parametered instruction code has assigned thereto an address place. A relocation information is loaded which during a linking step effects that the address becomes determined using a starting address and a relative address offset. The then determined address is put at the address place. During the loading step, directly after loading each address-parametered instruction code with its address place, the relocation information is loaded and the address is determined in the linking step.

    26.
    发明专利
    未知

    公开(公告)号:DE69814174D1

    公开(公告)日:2003-06-05

    申请号:DE69814174

    申请日:1998-11-12

    Applicant: IBM

    Abstract: A Java runtime system is proposed which comprises a stack-based interpreter executing a program that comprises bytecodes and class structures. The system further comprises a modified constant pool with internal information of use only during linking and with external information to be preserved for late code binding. The internal information is removed from the modified constant pool after linking.

    27.
    发明专利
    未知

    公开(公告)号:DE69903496D1

    公开(公告)日:2002-11-21

    申请号:DE69903496

    申请日:1999-04-22

    Applicant: IBM

    Abstract: Scheme for the distinguishing of reachable objects and non-reachable objects used by an object-based application in a system with volatile memory of limited size. The object-based application operates on n objects whereby Z objects thereof are root objects. The following steps are carried out for each root object: (a) traversing from said root object to any other object that can be reached from said root object; (b) marking all objects that were reached from said root object and storing, while marking, in said volatile memory a description of the path from said root object to the currently visited object; if the marking phase reaches an object and the respective path does not fit into said volatile memory, then this object is not marked but identified as an object which has to be processed later; and continuing the marking phase until all root objects identified as objects which have to be processed later are processed.

Patent Agency Ranking