公开(公告)号：JP2011120122A

公开(公告)日：2011-06-16

申请号：JP2009277182

申请日：2009-12-07

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

Inventor： HORII HIROSHI ,  KOSEKI SATOSHI ,  NAKAMURA HIROYOSHI ,  ONODERA TAMIYA

IPC: G06F13/00 ,  H04L12/24 ,  H04L12/70 ,  H04L12/761

CPC classification number: G06F11/3668 ,  H04L12/1854 ,  H04L12/1868 ,  H04L45/48

Abstract: PROBLEM TO BE SOLVED: To allow a plurality of clients to successively and stably transmit data to one server. SOLUTION: The present invention relates to a method for collecting data from a plurality of client computers to a server as a first mode, including the steps of: reconstructing a collection network of a tree structure with the server as a most-significant node and the plurality of client computers as slave nodes each time data are collected; broadcasting a parentage declaration from the server to the low-order nodes; and transferring data from each of nodes to high-order nodes. COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：允许多个客户端连续且稳定地向一个服务器发送数据。 解决方案：本发明涉及一种用于从多个客户计算机向服务器收集数据作为第一模式的方法，包括以下步骤：重建具有服务器的最重要的树结构的收集网络 节点和多个客户端计算机作为从节点，每次收集数据; 从服务器向低阶节点广播父母声明; 并将数据从每个节点传送到高阶节点。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：JP2010092222A

公开(公告)日：2010-04-22

申请号：JP2008260892

申请日：2008-10-07

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

Inventor： HORII HIROSHI ,  OZAWA YOSUKE ,  KAWACHIYA KIYOKUNI

IPC: G06F12/00

Abstract: PROBLEM TO BE SOLVED: To provide a cache configuration for effectively using a cache in Map-Reduce processing on the basis of an update frequency.
SOLUTION: A method for constructing a cache mechanism in a Map-Reduce processing system performing distributed processing for a plurality of items of data includes: a step of classifying the plurality of items of data to be processed into a plurality of groups on the basis of each update frequency of the data; a step of calculating a group update frequency that is each update frequency of the plurality of groups on the basis of data update frequency that is the update frequency of the data each constituting the plurality of groups; a step of generating a partial result of a Map-Reduce processing stage for the groups of which the group update frequency is not larger than a threshold among the plurality of groups; and a step of caching the generated partial result.
COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供基于更新频率在Map-Reduce处理中有效地使用高速缓存的高速缓存配置。 解决方案：一种在对多个数据项执行分布式处理的Map-Reduce处理系统中构建高速缓存机制的方法包括：将要处理的多个数据项目分类为多个组的步骤， 数据的每个更新频率的基础; 基于作为构成所述多个组的数据的更新频率的数据更新频率来计算作为所述多个组的每个更新频率的组更新频率的步骤; 生成所述组更新频率不大于所述组中的阈值的组的映射减少处理级的部分结果的步骤; 以及缓存生成的部分结果的步骤。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2009129169A

公开(公告)日：2009-06-11

申请号：JP2007303105

申请日：2007-11-22

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

Inventor： HORII HIROSHI

IPC: G06F12/00 ,  G06F3/06

CPC classification number: G06F9/466 ,  G06F11/2041 ,  G06F11/2097 ,  G06F17/30575

Abstract: PROBLEM TO BE SOLVED: To provide a replication system for improving obstacle resistance with low latency.
SOLUTION: A replication system composed by using a plurality of database server devices having replica relationships with one another transmits a first processing result after receptions and processing of transaction processing requests from client devices by all replicas, and the clients receive the first processing result as an optimistic processing result. The replicas mutually request generation of replicas, the system transmits committable shared transaction logs, as a second processing result, to the clients, and the clients receive the second processing result as an pessimistic processing result. The system may perform the transaction processing based on the plurality of client requests with low latency in a situation in which no collision of the transaction processing occurs. Thus, the replication system and the method for improving the obstacle resistance without increase in load of each server device may be provided.
COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于以低延迟提高障碍物阻力的复制系统。 解决方案：通过使用具有彼此复制关系的多个数据库服务器设备组成的复制系统在接收到所有副本的客户端设备的事务处理请求的处理和处理之后发送第一处理结果，并且客户端接收第一处理 结果是乐观的处理结果。 复制品相互请求生成副本，系统将提交的共享事务日志作为第二处理结果发送给客户端，客户端接收第二处理结果作为悲观的处理结果。 在不发生事务处理冲突的情况下，系统可以基于具有低等待时间的多个客户端请求来执行事务处理。 因此，可以提供复制系统和用于在不增加每个服务器设备的负载的情况下提高障碍物阻力的方法。 版权所有（C）2009，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

公开(公告)号：JP2012104038A

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

申请号：JP2010253987

申请日：2010-11-12

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

Inventor： HORII HIROSHI ,  KAWACHIYA KIYOKUNI

IPC: G06F9/44

CPC classification number: G06F9/4428 ,  G06F9/45504

Abstract: PROBLEM TO BE SOLVED: To fasten a heap objecting process.SOLUTION: In a processing system, an address A of a heap-objected stack object is added to a working set and a stack is scanned. Next, a stack frame to allocate the address A is detected and defined as a current stack frame. When a parameter indicating the address added to the working set is found in the current stack frame, that address is rewritten into an address of a corresponding heap object. When a field of the stack object in the current stack frame indicates the address included in the working set, in the processing system, the address of that stack object is added to the working set. If the stack frame viewed at present includes a pointer for the address included in the working set, processing is advanced to a next stack frame but if not, in the processing system, scanning of the stack is finished there.

Abstract translation: 要解决的问题：要紧固堆对象进程。 解决方案：在处理系统中，将堆对象堆栈对象的地址A添加到工作集中，并扫描堆栈。 接下来，检测分配地址A的堆栈帧并将其定义为当前堆栈帧。 当在当前堆栈帧中找到指示添加到工作集的地址的参数时，将该地址重写为相应堆对象的地址。 当当前堆栈帧中的堆栈对象的字段指示包含在工作集中的地址时，在处理系统中，将该堆栈对象的地址添加到工作集中。 如果当前查看的堆栈帧包括用于包括在工作集中的地址的指针，则处理进行到下一堆栈帧，但是如果不是，则在处理系统中，堆栈的扫描在那里完成。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2009172239A

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

申请号：JP2008015446

申请日：2008-01-25

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

Inventor： HORII HIROSHI ,  TAKAHASHI TOSHIHIRO

IPC: A63F13/12

CPC classification number: G06F17/30

Abstract: PROBLEM TO BE SOLVED: To efficiently control the communication of an information system which realizes a virtual world.
SOLUTION: A server apparatus is equipped with a storage unit, a searching section, a calculation section, and a transmission controlling section. In this case, the storage unit stores the history of activities in response to the operation of each client unit for each character in the virtual world. The searching section searches the history of activities in which a first character being activated by operating a first client unit has changed the state of a second character being activated by operating a second client unit from the storage unit. The calculation section calculates an index value indicating the size of a degree by which the first character has changed the state of the second character from the searched history. The transmission controlling section controls the state of the first character which is changed in order in response to the operation to the first client unit of a user conforming to the frequency of the transmission to the second client unit, and the calculated index value.
COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：有效地控制实现虚拟世界的信息系统的通信。 解决方案：服务器设备配备有存储单元，搜索部分，计算部分和传输控制部分。 在这种情况下，存储单元响应于虚拟世界中每个角色的每个客户单元的操作来存储活动的历史。 搜索部分通过操作第一客户机单元来激活正在激活的第一个字符的活动的历史已经通过从存储单元操作第二客户端单元而改变了正在激活的第二个字符的状态。 计算部分计算指示第一个字符已经从所搜索的历史中改变了第二个字符的状态的程度的大小的索引值。 传输控制部分控制响应于符合向第二客户机单元的传输频率的用户对第一客户机单元的操作而顺序改变的第一字符的状态和所计算的索引值。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2008165370A

公开(公告)日：2008-07-17

申请号：JP2006352292

申请日：2006-12-27

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

Inventor： MIYASHITA TAKASHI ,  TAI HIDEKI ,  HORII HIROSHI ,  TAKEUCHI MIKIO

IPC: G06F12/00 ,  G06F9/52

CPC classification number: G06F9/466 ,  G06F9/5038 ,  G06F2209/5017

Abstract: PROBLEM TO BE SOLVED: To provide a system allowing scalable execution of a transaction by dividing the transaction and executing in distributed environment.
SOLUTION: This system includes: a means dividing transaction processing into (optimistic) processing wherein contention is difficult to occur and (pessimistic) processing wherein the contention is easy to occur; a first server; and a second server. The first server has: a first transaction execution part executing the optimistic processing; and a transaction log transmission part for transmitting an execution result of the optimistic processing to the second server. The second server has: a transaction log reception part for receiving a transaction log; and a second transaction execution part executing the pessimistic processing.
COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：提供通过划分事务并在分布式环境中执行来允许事务可扩展执行的系统。 解决方案：该系统包括：将事务处理分解为（乐观）处理的手段，其中难以发生争用并且（悲观）处理，其中争用容易发生; 第一台服务器 和第二个服务器。 第一个服务器具有执行乐观处理的第一个事务执行部分; 以及用于将乐观处理的执行结果发送到第二服务器的事务日志发送部分。 第二服务器具有：用于接收事务日志的事务日志接收部分; 以及执行悲观处理的第二事务执行部。 版权所有（C）2008，JPO＆INPIT

公开(公告)号：JP2006185211A

公开(公告)日：2006-07-13

申请号：JP2004378560

申请日：2004-12-28

Applicant: IBM

Inventor： MIYASHITA TAKASHI ,  HORII HIROSHI ,  OZAWA YOSUKE ,  TAKEUCHI MIKIO

IPC: G06F9/44 ,  G06F11/28

Abstract: PROBLEM TO BE SOLVED: To allow execution of a black box test for even a system wherein correspondence of input/output is not uniquely determined, by allowing analysis of a causal relation (dependency relation) of a program in state units of objects to analyze a causal relation of input and output in the test. SOLUTION: This program analysis system includes a causal relation extraction part 10 and a text execution part 20. The causal relation extraction part 10 executes a target program step by step and acquires change histories of fields of objects and information of fields of objects causing the changes, in each step and extracts causal relations in state units of each object, and the text execution part 20 takes a prescribed object as a verification target and analyzes a causal relation to the object being the verification target, on the basis of inter-object causal relations extracted by the causal relation extraction part 10 and executes a test on the basis of an assertion of the test, which is set between the object being the verification target and an object being a cause. COPYRIGHT: (C)2006,JPO&NCIPI

公开(公告)号：JP2013033345A

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

申请号：JP2011168461

申请日：2011-08-01

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

Inventor： HORII HIROSHI

IPC: G06F12/00

CPC classification number: G06F17/30377 ,  G06F9/466 ,  G06F17/30348 ,  G06F17/30362

Abstract: PROBLEM TO BE SOLVED: To implement distributed transactions on a KVS having a simple configuration without unnecessarily causing rollbacks.SOLUTION: Management maps 412a to 412d are prepared, each of which includes a global transaction ID as a key and {a state of transaction, wait-for-end global transaction IDs} as a value. In start processing of a global transaction, a management local transaction is started on one of the servers 106a to 106d that manage the key of the respective management map. In processing of waiting for the end of the global transaction, a wait-for-lock-release local transaction is started to wait for the end of competing transactions, on the server that manages the key of the management map.

Abstract translation: 要解决的问题：在具有简单配置的KVS上实现分布式事务，而不必不必要地导致回滚。

解决方案：准备管理图412a至412d，其中每个包括作为关键字的全局事务ID，以及交易状态，等待端全局事务ID}作为值。 在全局事务的开始处理中，管理本地事务在管理相应管理映射的密钥的服务器106a至106d之一上启动。 在等待全局事务结束的处理中，在管理管理映射的密钥的服务器上启动等待解锁本地事务等待竞争事务的结束。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2012078927A

公开(公告)日：2012-04-19

申请号：JP2010221450

申请日：2010-09-30

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

Inventor： ENOKI MIKI ,  OZAWA YOSUKE ,  HORII HIROSHI

IPC: G06F12/00 ,  G06F12/08 ,  G06F12/12

CPC classification number: G06F17/30902 ,  G06F12/0891

Abstract: PROBLEM TO BE SOLVED: To efficiently create an index for invalidation for accessing a cache of a database within a limited memory space.SOLUTION: In order to maintain a cache hit rate for an index for invalidation within a limited size, a field for a count is provided in a table of indices for invalidation for each of hash-divided regions, the count is made increment in response to data update, and the count is made decrement in response to data reference. Rows of indices for invalidation are merged in response to the field for the count being larger than a predetermined threshold value, and a division of the rows of indices for invalidation is started in order from a row having a minimum count value as many as the number of rows which are made empty by merging. Therefore, the size of the index for invalidation is kept valid, and the cache hit rate is improved for reference access.

Abstract translation: 要解决的问题：为了有效地创建用于访问受限存储器空间内的数据库的高速缓存的无效索引。

解决方案：为了在有限大小内保持无效索引的缓存命中率，在每个哈希分割区域的无效索引表中提供计数字段，计数增量 响应于数据更新，并且响应于数据引用使计数减少。 响应于计数的字段大于预定阈值而合并无效索引的行，并且从具有最小计数值的行的数量开始按顺序排列无效索引行的划分数， 通过合并制成空的行。 因此，无效索引的大小保持有效，缓存命中率提高了参考访问。 版权所有（C）2012，JPO＆INPIT