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.
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.
Abstract:
PROBLEM TO BE SOLVED: To provide a method of efficiently tracing an object allocation site in a program from a run-time object of a heap space. SOLUTION: The present invention provides a data structure of a run-time object having a hash value field, the data structure allowing an object allocation site to be traced from the run-time object. The invention also provides the method and a computer system for tracing the object allocation site in the program from the run-time object, and a computer program. COPYRIGHT: (C)2010,JPO&INPIT
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:
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:
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:
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
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:
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:
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.