公开(公告)号：DE102021124373A1

公开(公告)日：2022-04-28

申请号：DE102021124373

申请日：2021-09-21

Applicant: IBM

Inventor： HORIE MICHIHIRO ,  OGATA KAZUNORI ,  HORII HIROSHI

IPC: G06F9/50

Abstract: Ein computerumgesetztes Verfahren zum Verwalten von Speicherbereinigungs(GC)-Sicherheitspunkten (Garbage Collection (GC) safepoints) wird bereitgestellt. Das Verfahren enthält ein Bestimmen, ob ein GC-Sicherheitspunkt für ein natives Zielverfahren entfernt werden kann, durch Überprüfen eines Anhäufungsbelegungsverhältnisses (heap occupancy ratio) vor einem Ausführen des nativen Zielverfahrens. Das Verfahren enthält ferner ein Entfernen des GC-Sicherheitspunktes als Reaktion darauf, dass das Anhäufungsbelegungsverhältnis vor dem Ausführen des nativen Zielverfahrens kleiner als ein Schwellenwertbelegungsmengen-Prozentsatz ist. Das Verfahren enthält auch ein Bestimmen, ob der GC-Sicherheitspunkt für das native Zielverfahren entfernt werden kann, durch Überprüfen einer letzten GC-Pausenzeit. Das Verfahren enthält zusätzlich ein Entfernen des GC-Sicherheitspunktes als Reaktion darauf, dass die letzte GC-Pausenzeit um einen Schwellenwertpausenzeitmengen-Prozentsatz kürzer ist als eine Ausführungszeit des nativen Zielverfahrens.

公开(公告)号：JP2010277440A

公开(公告)日：2010-12-09

申请号：JP2009131016

申请日：2009-05-29

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： OGATA KAZUNORI ,  KAWACHIYA KIYOKUNI ,  ISHIZAKI KAZUAKI

IPC: G06F9/44

CPC classification number: G06F8/443 ,  G06F8/4434 ,  G06F8/4441

Abstract: PROBLEM TO BE SOLVED: To provide a mechanism of creating a program with high execution efficiency without deteriorating the productivity of the program. SOLUTION: In a computer system that executes the program including the processing of a character string, a method for optimizing the processing of the character string upon the execution of the program by using characteristic information showing the characteristic of the character string associated with the character string is provided. The method includes a step of determining from the characteristic of a first character string and arithmetic processing regarding the first character string, the character string characteristic information for at least one of the first character string and a second character string which is a result of the arithmetic processing, and a step of making the determined characteristic information associated with at least one character string. Furthermore, a computer system and a computer program for executing the program including the processing of the character string and optimizing the processing of the character string upon execution of the program using the characteristic information are provided. COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：提供一种创建具有高执行效率的程序的机制，而不会降低程序的生产率。 解决方案：在执行包括处理字符串的程序的计算机系统中，通过使用表示与...相关联的字符串的特性的特征信息来优化程序执行时的字符串的处理的方法 提供字符串。 该方法包括从第一字符串的特性和关于第一字符串的算术处理确定作为算术结果的第一字符串和第二字符串中的至少一个的字符串特征信息的步骤 处理和与至少一个字符串相关联的所确定的特征信息的步骤。 此外，提供了一种用于执行程序的计算机系统和计算机程序，包括处理字符串，并且在使用特征信息执行程序时优化字符串的处理。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：JP2001154853A

公开(公告)日：2001-06-08

申请号：JP32699099

申请日：1999-11-17

Applicant: IBM

Inventor： YASUE TOSHIAKI ,  OGATA KAZUNORI ,  ISHIZAKI KAZUAKI ,  KOMATSU HIDEAKI

IPC: G06F9/45

Abstract: PROBLEM TO BE SOLVED: To provide a program execution method for realizing much higher level optimization. SOLUTION: A program executing device 1 realizes transition between a compile processing and interpreter processing in the middle of the execution of a method. When there is not any problem on execution even if moving a transition point to the entrance of a loop, the transition point of a code is moved to the entrance of a loop, and when the transition point is positioned inside the loop, a point for post dominating the entrance of the loop and the transition point is copied just before the loop. Thus, the transition point is allowed to have information for generating a re-calculation code so that re- execution can be executed.

公开(公告)号：JPH11175349A

公开(公告)日：1999-07-02

申请号：JP30821297

申请日：1997-11-11

Applicant: IBM

Inventor： OGATA KAZUNORI ,  KOMATSU HIDEAKI ,  MOMOSE HIROYUKI

IPC: G06F9/45 ,  G06F9/455

Abstract: PROBLEM TO BE SOLVED: To provide a compiler capable of executing the byte code of Java at a high speed with limited resources. SOLUTION: The byte code 14 is converted to an intermediate code 102 whose operation code is the address of processing routines corresponding to the respective byte codes and the processing routines are executed in the order of the intermediate codes. At the time, the intermediate code is turned to a fixed length and the bit position of the operation code is also fixed in it. Also, the processing routines are arranged in successive areas on a memory and an offset from the leading address of a processing routine group 104 is used for the operation code. Further, the vacancy of the pipeline of a CPU is utilized and a part (generation of operand and jump) of an instruction group for jumping to the processing routine of the next intermediate code and a part (pre-fetch of intermediate code and address calculation of processing routine) of the instruction group for jumping to the processing routine of the intermediate code after the next are executed parallelly to the original processing for the intermediate code.

公开(公告)号：JP2012064252A

公开(公告)日：2012-03-29

申请号：JP2012000276

申请日：2012-01-04

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： OGATA KAZUNORI ,  KAWACHIYA KIYOKUNI ,  ISHIZAKI KAZUAKI

IPC: G06F9/44

Abstract: PROBLEM TO BE SOLVED: To provide a mechanism for producing a program of high execution efficiency without lowering productivity of the program.SOLUTION: There is provided a method of optimizing processing on character strings in program execution using characteristic information representing characteristics of the character strings made to correspond to the character strings in a computer system which executes a program including processing on character strings. The method includes the steps of: determining characteristic information on at least one character string of a first character string and a second character string as a result of arithmetic processing based on characteristics as to the first character string and the arithmetic processing the relating to the first character string; and making the determined characteristic information correspond to the at least one character string. The present invention relates to the computer system that executes the program including the processing on the character strings and optimizes the processing on the character strings in the program execution using the characteristic information, and the computer program.

Abstract translation: 要解决的问题：提供一种用于生产高执行效率的程序的机制，而不降低程序的生产率。 提供了一种使用表示在执行包括对字符串的处理的程序的计算机系统中与字符串相对应的字符串的特征的特征信息来优化程序执行中的字符串的处理的方法。 该方法包括以下步骤：根据第一字符串的特性和与第一字符串相关的算术处理，确定作为算术处理结果的第一字符串和第二字符串的至少一个字符串的特征信息 字符串 并且使所确定的特征信息对应于所述至少一个字符串。 本发明涉及执行包括对字符串的处理的程序的计算机系统，并且使用特征信息优化对程序执行中的字符串的处理以及计算机程序。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2001084146A

公开(公告)日：2001-03-30

申请号：JP24317699

申请日：1999-08-30

Applicant: IBM

Inventor： OGATA KAZUNORI ,  KOMATSU HIDEAKI

IPC: G06F9/45 ,  G06F9/38

Abstract: PROBLEM TO BE SOLVED: To successively quickly execute a Java byte code or the like. SOLUTION: An interpreter 326 prepares n pieces of processing routines corresponding to n bytes included in the word of a CPU, and reuses a byte code loaded for processing a certain processing routine for the following processing routines, and minimizes the number of times that the CPU loads the byte code. Moreover, the interpreter 326 speculatively decodes the candidate of the the second byte code ahead by using the dead pipe line of the CPU for masking any overhead generated at the time of decoding the byte code.

公开(公告)号：JP2000222220A

公开(公告)日：2000-08-11

申请号：JP1933599

申请日：1999-01-28

Applicant: IBM

Inventor： OGATA KAZUNORI ,  KOMATSU HIDEAKI ,  DOUSHI HIROSHI

IPC: G06F9/45 ,  G06F9/44 ,  G06F9/455

Abstract: PROBLEM TO BE SOLVED: To efficiently execute a byte code by combining an interpreter and a compiler. SOLUTION: In the case where an instruction to execute is a backward condition branching instruction in executing a byte code by the interpreter, whether the condition branching instruction is the back edge of a loop or not is judge S2. In the case where it is judged to be the back edge of the loop, the number of the times of the loop is predicted S3 and the predicted number of the times of the loop is stored in a storing device. According to the predicted number of the times of the loop, the execution mode of the byte code is selected S4. This execution mode includes a mode to immediately compile a method including the loop and a mode to execute the byte code by the interpreter.