公开(公告)号：JP2013161186A

公开(公告)日：2013-08-19

申请号：JP2012021187

申请日：2012-02-02

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

Inventor： KAWACHIYA KIYOKUNI ,  ONODERA TAMIYA ,  TAKEUCHI MIKIO ,  SALIKH ZAKIROV

IPC: G06F9/44 ,  G06F12/00

CPC classification number: G06F12/0276 ,  G06F9/4428 ,  G06F12/0253 ,  G06F17/30097

Abstract: PROBLEM TO BE SOLVED: To increase variation in object hash codes in order to reduce conflicts between object hash codes, and enable object hash codes to be added to pinned objects.SOLUTION: A per-heap seed is provided in each heap area in which an object is placed in order to generate an object hash code, and at least an object address and the per-heap seed are combined to generate the object hash code. Further, it is determined whether an object hash code can be added to an object in a "01" state during GC. If it can be added, the object hash code is calculated and added to the object, and the state is changed to "10". If it cannot be added, the object hash code is calculated, placed outside the heap, and associated with the object, and the state is changed to "11", which represents a pinned object.

Abstract translation: 要解决的问题：增加对象哈希码的变化，以减少对象哈希码之间的冲突，并使对象哈希码被添加到固定对象。解决方案：每个堆区域中提供每堆种子，其中 放置对象以生成对象散列码，并且至少将对象地址和每堆种子组合以生成对象散列码。 此外，在GC期间确定是否可以将对象散列码添加到处于“01”状态的对象。 如果可以添加，则对象哈希码进行计算并添加到对象中，状态变为“10”。 如果不能添加，则对象散列码进行计算，放置在堆外部并与对象相关联，状态更改为“11”，表示固定对象。

公开(公告)号：JP2013092897A

公开(公告)日：2013-05-16

申请号：JP2011234338

申请日：2011-10-25

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

Inventor： KAWACHIYA KIYOKUNI ,  TACHIBORI MICHIAKI

IPC: G06F11/36

CPC classification number: G06F17/30011

Abstract: PROBLEM TO BE SOLVED: To provide a specification verification technique that is suitable for a document-centric architecture.SOLUTION: Documents are managed as "abstract documents" that are separated by ranges of values of metadata. The system of the present invention prepares a logical "document box", inserts multiple abstract documents of an initial condition into the document box, and applies operations that are possible for them. Separation and unification of the abstract documents are performed as required during the application of the operations. The operations are repeatedly applied to an abstract document group, and with respect to a state transition diagram at the point in time when the applied operations no longer make any change, it is verified whether all abstract documents reach a completion condition.

Abstract translation: 要解决的问题：提供适用于以文档为中心的架构的规范验证技术。

解决方案：将文档作为“抽象文档”进行管理，该文档由元数据值的范围分隔。 本发明的系统准备了一个逻辑“文件盒”，将多个初始条件的抽象文档插入到文档框中，并对其进行可能的操作。 摘要文件的分离和统一在执行操作过程中根据需要进行。 这些操作被重复地应用于抽象文档组，并且对于应用操作不再做任何改变的时间点的状态转换图，验证所有抽象文档是否达到完成条件。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2010198135A

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

申请号：JP2009039918

申请日：2009-02-23

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

Inventor： ENOKI MIKI ,  KAWACHIYA KIYOKUNI

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F17/3048

Abstract: PROBLEM TO BE SOLVED: To provide a method for speeding up a transaction when time stamps are different in a database system that issues a reference transaction by designating a time stamp. SOLUTION: Data structures are provided for making an inquiry about the latest value at a designated time by using a database in which values and information on times associated with the individual values are contained in a table. One of the data structures includes, for each of ID associated with the values inserted into the database, at least one time stamp that is sorted in chronological order (hereinafter referred to as a first time stamp); values belonging to the individual first time stamps; and a pointer that designates one of the first time stamps, the first time stamps indicating the times when the values become valid. The other of the data structures includes, for each ID, the designated first time stamp and a value belonging to the designated first time stamp. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种在通过指定时间戳发布参考交易的数据库系统中的时间戳不同时加快交易的方法。 解决方案：提供数据结构，用于通过使用数据库来查询指定时间的最新值，其中与各个值相关联的时间的值和信息包含在表中。 对于与插入数据库的值相关联的每个ID，数据结构之一包括按时间顺序排序的至少一个时间戳（以下称为第一时间戳）; 属于个人第一次邮票的价值; 以及指示第一时间戳之一的指针，第一时间戳指示值变为有效的时间。 数据结构中的另一个对于每个ID包括指定的第一时间戳和属于指定的第一时间戳的值。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：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

公开(公告)号：JP2010113585A

公开(公告)日：2010-05-20

申请号：JP2008286523

申请日：2008-11-07

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

Inventor： KAWACHIYA KIYOKUNI ,  TACHIBORI MICHIAKI

IPC: G06F9/52 ,  G06F9/48

CPC classification number: G06F9/3851 ,  G06F9/3004 ,  G06F9/30087 ,  G06F9/3834 ,  G06F9/526

Abstract: PROBLEM TO BE SOLVED: To provide a mechanism for adjusting timing wherein housekeeping processing is executed and timing wherein the lock of a shared external resource is acquired by a thread on a server and for not holding a lock for a long time.
SOLUTION: This computer system includes: a lock part for executing an instruction to acquire exclusive use and an instruction to release the exclusive use in the thread so as to prevent delay of an execution time of at least one instruction executed while exclusively using the external resource in computer program execution environment wherein at least one thread is executed; a counter part for increasing or decreasing a value of a counter associated to each thread according to the execution of the instruction to acquire the exclusive use or the instruction to release the exclusive use; and a control part controlling execution order of the instruction executed while exclusively using the external resource and an instruction causing the delay of the execution time of the instruction executed while exclusively using the external resource.
COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于调整定时的机制，其中执行管理处理和通过服务器上的线程获取共享外部资源的锁定并且不长时间保持锁定的定时。 解决方案：该计算机系统包括：用于执行获取专用的指令的锁定部分和释放线程中的专有用途的指令，以防止在专门使用时执行的至少一条指令的执行时间的延迟 计算机程序执行环境中的外部资源，其中执行至少一个线程; 根据用于获取专用的指令的执行或释放专用的指令，增加或减少与每个线程关联的计数器的值的计数器部分; 以及控制部分，其控制在专门使用外部资源的同时执行的指令的执行顺序，以及引导在专门使用外部资源的同时执行指令的执行时间的延迟的指令。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：DE69816154D1

公开(公告)日：2003-08-14

申请号：DE69816154

申请日：1998-02-02

Applicant: IBM

Inventor： KAWACHIYA KIYOKUNI ,  ISHIKAWA HIROSHI

IPC: G06F3/038 ,  G05G9/047

Abstract: A pointing device comprising a stick (1), a vector detection mechanism (3,11) placed away from the stick by a predetermined distance so as to turn around the longitudinal axis of the stick, for outputting a signal corresponding to a force vector of a force applied by the stick when the stick (1) contacts with the mechanism, and a detector (9) for detecting a force applied in the longitudinal direction of the stick (1). In response to a signal output from the vector detection mechanism, it is judged whether an evaluation value of the force vector satisfies a predetermined condition. When the evaluation value of the force vector satisfies the predetermined condition, execution of a first kind of manipulation according to the evaluation value is instructed. When the evaluation value does not satisfy the predetermined condition, execution of a second kind of manipulation is instructed.

公开(公告)号：JP2012088812A

公开(公告)日：2012-05-10

申请号：JP2010233085

申请日：2010-10-15

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

Inventor： KAWACHIYA KIYOKUNI ,  TACHIBORI MICHIAKI ,  ONODERA TAMIYA ,  INGLIS DEREK

IPC: G06F11/34

CPC classification number: G06F11/3644 ,  G06F8/4443

Abstract: PROBLEM TO BE SOLVED: To provide a technique for acquiring information on call context comprehensively at a low cost.SOLUTION: Suitably, an 8-bit ID is allocated to each call site, and call site IDs which are most recent and in four stages as preferable number are held as a call history of 32-bit data for each thread and are used as context information. For calling a method, a call history in a current frame is shifted by 8 bits to the left, and the call site ID of the call side is put in the low-order 8 bits and is stacked in a new frame. For returning from the method, the frame is put back to obtain the value of the original call history. For virtual calling, information of the call history is recorded in a profile table at a calling point in addition to determined jump destination information and the number of times of calling. This profile table is used in JIT compilation to specify a method to be inlined.

Abstract translation: 要解决的问题：提供以低成本全面地获取关于呼叫上下文的信息的技术。 解决方案：适当地，将8位ID分配给每个呼叫站点，并且呼叫最近和四个阶段的呼叫站点ID作为优选号码被保持为每个线程的32位数据的呼叫历史记录，并且是 用作上下文信息。 为了调用方法，当前帧中的呼叫历史向左移位8位，呼叫侧的呼叫位置ID被置于低位8位，并且堆叠成新的帧。 为了从该方法返回，将帧返回以获得原始呼叫历史的值。 对于虚拟呼叫，除了确定的跳转目的地信息和呼叫次数之外，呼叫历史的信息也记录在呼叫点的简档表中。 此配置文件表用于JIT编译，以指定要内联的方法。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2010277421A

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

申请号：JP2009130756

申请日：2009-05-29

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

Inventor： TACHIBORI MICHIAKI ,  KAWACHIYA KIYOKUNI ,  OGATA KAZUNORI

IPC: G06F11/30 ,  G06F11/28 ,  G06F11/34

CPC classification number: G06F11/3672 ,  G06F11/3409 ,  G06F11/3476 ,  G06F2201/80 ,  G06F2201/81 ,  G06F2201/865

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

公开(公告)号：JP2009230344A

公开(公告)日：2009-10-08

申请号：JP2008073506

申请日：2008-03-21

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

Inventor： HORII HIROSHI ,  KAWACHIYA KIYOKUNI ,  KOSEKI SATOSHI ,  TAKAHASHI TOSHIHIRO

IPC: G06F13/00 ,  G06T3/40

CPC classification number: G06T19/00 ,  G06N3/006 ,  G06T15/20

Abstract: PROBLEM TO BE SOLVED: To provide an image drawing system, an image drawing server, an image drawing method, and an image drawing computer program which can provide a 3D virtual world even for a low-performance client terminal. SOLUTION: The image drawing server 100 includes a panoramic image generator 111 which generates a panoramic image of 360-degree field from the viewpoint of an avatar of a user of a cellular phone 200, which is a client terminal and a solution converter 112 which converts the image generated in the panoramic image generator 111 into an image adjusted to the display of the destined cellular phone 200. The cellular phone 200 includes a combination-rendering unit 202 to edit necessary information, in order to display the virtual world on the cellular phone 200 in response to receiving image from the image-drawing server 100, and a panoramic image storage 220 necessary information necessary for displaying the virtual world on the cellular phone 200, to which the image has been transmitted from the image drawing server 100. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供即使对于低性能客户终端也可以提供3D虚拟世界的图像绘制系统，图像绘制服务器，图像绘制方法和图像绘制计算机程序。 解决方案：图像绘制服务器100包括全景图像生成器111，其从作为客户终端的蜂窝电话200的用户的头像和解转换器的角度生成360度场的全景图像 112，其将在全景图像生成器111中生成的图像转换为调整到目的地蜂窝电话200的显示器的图像。蜂窝电话200包括编辑必要信息的组合呈现单元202，以便显示虚拟世界 蜂窝电话200响应于从图像绘制服务器100接收到的图像，以及全景图像存储器220，从图像绘制服务器100发送了图像的蜂窝电话200上显示虚拟世界所需的必要信息 。版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2013033412A

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

申请号：JP2011169705

申请日：2011-08-03

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

Inventor： KAWACHIYA KIYOKUNI ,  OGATA KAZUNORI

IPC: G06F11/30 ,  G06F11/34

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