ARBEITSÜBERNAHME BEI EINER SPEICHERBEREINIGUNG MIT GLEICHZEITIGEM MARKIEREN MIT FINGERZEIGER

    公开(公告)号:DE112021004460T5

    公开(公告)日:2023-07-27

    申请号:DE112021004460

    申请日:2021-08-09

    Applicant: IBM

    Abstract: Es werden ein auf einem Computer implementiertes Verfahren, System und Computerprogrammprodukt bereitgestellt. Der Ansatz umfasst ein Abrufen einer ersten Aufgabe aus einer Warteschlange eines Speicherbereinigungs-Threads. Der Ansatz umfasst des Weiteren ein Identifizieren einer zweiten Aufgabe aus der abgerufenen ersten Aufgabe, wobei die zweite Aufgabe einem Bit einer Bitmap zugehörig ist und sich das Bit an einer Position innerhalb der Bitmap befindet, die noch nicht von einem Fingerzeiger durchlaufen wurde. Der Ansatz umfasst des Weiteren ein Verschieben der zweiten Aufgabe in die Warteschlange des Speicherbereinigungs-Threads.

    Tri-color bitmap array for garbage collection

    公开(公告)号:AU2021339989B2

    公开(公告)日:2024-04-18

    申请号:AU2021339989

    申请日:2021-09-02

    Applicant: IBM

    Abstract: A first object at a memory address is identified. A first index location in a bitmap that corresponds to that memory address is calculated. A bit is set at the first index location. A pointer to a child object within the first object is detected. A memory address of that child object is identified using the pointer. A second index location in the bitmap that corresponds to that memory address is calculated. A bit is set at the second index location. A bit is also set at a third index location, which is adjacent to the first index location.

    System for storing/managing object
    4.
    发明专利
    System for storing/managing object 有权
    存储/管理对象的系统

    公开(公告)号:JP2009064217A

    公开(公告)日:2009-03-26

    申请号:JP2007231126

    申请日:2007-09-06

    CPC classification number: G06F12/0276 G06F9/4428

    Abstract: PROBLEM TO BE SOLVED: To efficiently storing/managing an object.
    SOLUTION: A system includes a storage device for storing classifiably the old object that is the object with a reference period lapsed after generated, and the new object that is the object with a reference period not lapsed after generated. The system: selects the new object with the reference period lapsed after generated, from the storage device; retrieves the old object having a content equal to that of the selected new object, from the storage device; stores the selected new object as a new old-object into the storage device, on condition of not being retrieved; integrates a reference to the selected new object with a reference to the retrieved old object, on condition of being retrieved; and changes the reference to the selected new object into a reference to the stored old object, on condition that the old object is stored.
    COPYRIGHT: (C)2009,JPO&INPIT

    Abstract translation: 要解决的问题:有效地存储/管理对象。 解决方案:系统包括存储装置,用于可分类地存储作为对象的旧对象,该对象具有在生成之后经过的参考时期,并且作为参考周期的对象的新对象在生成之后不会失效。 系统:从存储设备中选择生成后参考时间段的新对象; 从存储装置检索具有与所选择的新对象的内容相同的内容的旧对象; 在未被检索的情况下,将所选择的新对象作为新旧对象存储到存储设备中; 在被检索的情况下,将对所选新对象的引用与对所检索的旧对象的引用进行整合; 并且在存储旧对象的条件下,将对所选新对象的引用更改为对所存储的旧对象的引用。 版权所有(C)2009,JPO&INPIT

    Compiler program, dynamic compiler program, reproducible compiler program, reproducible compiler, compiling method, and recording medium
    5.
    发明专利
    Compiler program, dynamic compiler program, reproducible compiler program, reproducible compiler, compiling method, and recording medium 有权
    编译程序,动态编译程序,可重复编译程序,可重复编译器,编译方法和记录介质

    公开(公告)号:JP2005215884A

    公开(公告)日:2005-08-11

    申请号:JP2004020213

    申请日:2004-01-28

    CPC classification number: G06F11/3612 G06F9/45516 G06F11/3636

    Abstract: PROBLEM TO BE SOLVED: To facilitate the debugging of a dynamic compiler by reproducing the same execution instruction sequence as an execution instruction sequence generated by the dynamic compiler. SOLUTION: A compiler program allows a computer to function in the following ways: an execution state acquisition section acquires the execution state of a program; a dynamic compiling section generates a different execution sequence in accordance with the execution state by compiling part of a program to be executed based on the execution state in the course of executing the program; an execution state recording section records the execution state on a storage region allocated to the memory of the computer; a file reading section reads a file including the contents of the storage region allocated to the memory saved on a storage device by the computer from the storage device; and a reproducible compiling section generates the same execution instruction sequence as the execution instruction sequence generated by the dynamic compiling section in the course of executing the program by compiling part of the program based on the execution state acquired from the file. COPYRIGHT: (C)2005,JPO&NCIPI

    Abstract translation: 要解决的问题:通过再现与动态编译器生成的执行指令序列相同的执行指令序列来促进动态编译器的调试。 解决方案:编译程序允许计算机以下列方式运行:执行状态获取部分获取程序的执行状态; 动态编译部分根据执行状态通过在执行程序的过程中基于执行状态编译要执行的程序的一部分来生成不同的执行序列; 执行状态记录部分将执行状态记录在分配给计算机的存储器的存储区域上; 文件读取部从存储装置读取包含由计算机分配给保存在存储装置上的存储器的存储区域的内容的文件; 并且可重现的编译部分根据从文件获取的执行状态编译程序的一部分,在执行程序的过程中产生与动态编译部分生成的执行指令序列相同的执行指令序列。 版权所有(C)2005,JPO&NCIPI

    Memory management method, program, and system
    6.
    发明专利
    Memory management method, program, and system 审中-公开
    内存管理方法,程序和系统

    公开(公告)号:JP2013033412A

    公开(公告)日:2013-02-14

    申请号:JP2011169705

    申请日:2011-08-03

    CPC classification number: G06F12/02 G06F9/46 G06F12/0253 G06F12/14 G06F12/1433

    Abstract: PROBLEM TO BE SOLVED: To provide a technique which detects characteristics of reading, writing, etc. with respect to data on a memory of a computer with low overhead.SOLUTION: A memory allocation profiler intermittently, namely, periodically or temporarily protects a page of an object process from access or write. At this time, the memory allocation profiler serves as a function of a page fault handler for an object address. When detecting a page fault, the memory allocation profiler notifies an object process of an address of the page fault and an access type and restores the page to an original state. When the access type indicates read access at this time, the page may be first changed so as to be read only (protected from write). On the basis of notified information, the object process sorts data into data (N) not to be accessed at all (after a certain time), data (R) to be accessed only for read, and data (W) to be read and written. On the basis of examination results, a memory allocation mechanism of the object process relocates data R and W in different pages respectively to continue measurement.

    Abstract translation: 要解决的问题:提供一种以低开销检测计算机的存储器上的数据的读取,写入等特性的技术。 解决方案:间歇性地分配内存分配器,即定期或临时地保护对象进程的页面不被访问或写入。 此时,内存分配分析器用作对象地址的页面错误处理程序的函数。 当检测到页面错误时,内存分配分析器通知对象进程页面错误的地址和访问类型,并将页面恢复到原始状态。 当访问类型表示此时的读取访问时,可以首先改变页面以便只读(保护写入)。 在通知信息的基础上,对象处理将数据分解为不被访问的数据(N)(一定时间之后),仅被读取的数据(R)和要被读取的数据(W)和 书面。 在检查结果的基础上,对象处理的存储器分配机制分别重新分配不同页面中的数据R和W以继续测量。 版权所有(C)2013,JPO&INPIT

    Source code conversion method, server system, and server program
    7.
    发明专利
    Source code conversion method, server system, and server program 有权
    源代码转换方法,服务器系统和服务器程序

    公开(公告)号:JP2010108076A

    公开(公告)日:2010-05-13

    申请号:JP2008277002

    申请日:2008-10-28

    Abstract: PROBLEM TO BE SOLVED: To provide a source code conversion method, a server system and a server program for automatically converting a source code created by a programmer into a source code with reduced overhead in converting a source code into a String class of a hyper text transfer protocol(HTTP) request.
    SOLUTION: The method for converting a source code of a program using a computer includes steps of: specifying a character string type variable s=new String(b, "UTF-8") for storing a character string (S210); converting the character string type variables into reference character string type variables s=new String(bb) for storing reference to a buffer for storing the character string (S220); and storing the source code obtained by converting the character string type variables into the reference character string type variables.
    COPYRIGHT: (C)2010,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种源代码转换方法,服务器系统和服务器程序,用于将由程序员创建的源代码自动转换为源代码,将源代码转换为String类的 超文本传输​​协议(HTTP)请求。 解决方案:使用计算机转换程序的源代码的方法包括以下步骤:指定用于存储字符串的字符串类型变量s = new String(b,“UTF-8”)(S210); 将字符串类型变量转换为引用字符串类型变量s = new String(bb),用于存储对用于存储字符串的缓冲区的引用(S220); 并将通过将字符串类型变量转换成参考字符串类型变量获得的源代码存储。 版权所有(C)2010,JPO&INPIT

    Method of ascertaining occurrence cause of memory consumption in program, and computer system and computer program for the same
    8.
    发明专利
    Method of ascertaining occurrence cause of memory consumption in program, and computer system and computer program for the same 有权
    计算机程序存储器消耗的原因及其计算机系统及其计算机程序的方法

    公开(公告)号:JP2010277421A

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

    申请号:JP2009130756

    申请日:2009-05-29

    Abstract: PROBLEM TO BE SOLVED: To provide a method of holding information for identifying a cause of memory consumption becoming problematic at a certain point during program execution, and presenting the information to a user. SOLUTION: The method is provided which ascertains the occurrence cause of memory consumption in a program, in a computer system that can present the status of memory consumption by the program. The method includes: a step of acquiring a first call path related to the creation of an object from a memory; a step of acquiring a second call path related to the connection to the object from the memory; and a step of determining a common part of the acquired first and second call paths, wherein the common part indicates the occurrence cause in the program. Further, a computer system and a computer program for ascertaining the occurrence cause of memory consumption in a program are provided. COPYRIGHT: (C)2011,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种在程序执行期间在某一点保存用于识别存储器消耗的原因成为问题的信息的方法,并将该信息呈现给用户。

    解决方案:提供了一种确定程序中存储器消耗的发生原因的方法,该计算机系统可以呈现程序的存储器消耗状态。 该方法包括:从存储器获取与创建对象相关的第一呼叫路径的步骤; 从存储器获取与对象的连接相关的第二呼叫路径的步骤; 以及确定所获取的第一和第二呼叫路径的公共部分的步骤,其中所述公共部分指示所述程序中的发生原因。 此外,提供了用于确定程序中存储器消耗的发生原因的计算机系统和计算机程序。 版权所有(C)2011,JPO&INPIT

    Method for operating character string, program, and information processor
    9.
    发明专利
    Method for operating character string, program, and information processor 有权
    操作字符串,程序和信息处理器的方法

    公开(公告)号:JP2007183905A

    公开(公告)日:2007-07-19

    申请号:JP2006115275

    申请日:2006-04-19

    Abstract: PROBLEM TO BE SOLVED: To provide a character string operation method for reducing the storage capacity of a storage part, a program, and an information processor.
    SOLUTION: The information processor 1 for operating character strings is provided with: a storage part 30 for storing a character string group including a plurality of character strings each of which is constituted of a plurality of character data; a reference part 41 for referring to a specific character string from the character string group; a character data detection part 422 for detecting character data which are not referred to as the specific character string from the character string group; and a character data deletion part 423 for deleting the character data detected from the character string group.
    COPYRIGHT: (C)2007,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种用于降低存储部件,程序和信息处理器的存储容量的字符串操作方法。 解决方案:用于操作字符串的信息处理器1设置有:存储部件30,用于存储包括由多个字符数据构成的多个字符串的字符串组; 用于从字符串组引用特定字符串的参考部分41; 字符数据检测部分422,用于从字符串组中检测不被称为特定字符串的字符数据; 以及字符数据删除部423,用于删除从字符串组检测到的字符数据。 版权所有(C)2007,JPO&INPIT

    VERFAHREN, SYSTEM UND COMPUTERPROGRAMMPRODUKT MIT EINEM DREIFARBEN-BITMAP-ARRAY ZUR GARBAGE-COLLECTION

    公开(公告)号:DE112021004729B4

    公开(公告)日:2025-04-24

    申请号:DE112021004729

    申请日:2021-09-02

    Applicant: IBM

    Abstract: Ein erstes Objekt wird an einer Speicheradresse identifiziert. In einer Bitmap, die dieser Speicheradresse entspricht, wird eine erste Indexspeicherposition berechnet. An der ersten Indexspeicherposition wird ein Bit gesetzt. In dem ersten Objekt wird ein Zeiger zu einem untergeordneten Objekt erfasst. Unter Verwendung des Zeigers wird eine Speicheradresse dieses untergeordneten Objekts identifiziert. In der Bitmap, die dieser Speicheradresse entspricht, wird eine zweite Indexspeicherposition berechnet. An der zweiten Indexspeicherposition wird ein Bit gesetzt. An einer dritten Indexspeicherposition, die der ersten Indexspeicherposition benachbart ist, wird ebenfalls ein Bit gesetzt.

Patent Agency Ranking