中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

23 records (took 0.03 seconds)

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

    公开(公告)号：JP2009064217A

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

    申请号：JP2007231126

    申请日：2007-09-06

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

    Inventor： ONODERA TAMIYA ,  KOCHIYA KIYOKUNI ,  OGATA KAZUNORI

    IPC: G06F9/44 ,  G06F12/00

    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

    Technique for making exclusive control efficient
    12.
    发明专利
    Technique for making exclusive control efficient 有权
    制造独特控制效率的技术

    公开(公告)号：JP2008112400A

    公开(公告)日：2008-05-15

    申请号：JP2006296299

    申请日：2006-10-31

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

    Inventor： KOCHIYA KIYOKUNI ,  KOSEKI SATOSHI ,  ONODERA TAMIYA ,  JOHNSON GRAEME

    IPC: G06F9/52

    CPC classification number: G06F9/526 ,  G06F9/3004 ,  G06F9/30087 ,  G06F9/522

    Abstract: PROBLEM TO BE SOLVED: To achieve efficient exclusive control without using an indivisible operation instruction or a memory barrier instruction.
    SOLUTION: A system in this invention is provided with: a storage device having a first storage area for storing first information indicating the acquisition or trial of an exclusive right based on a first task and a second storage area for storing second information indicating the acquisition or trial of an exclusive right based on a second task; a first acquisition part for reading out the second storage area after issuing an instruction for writing the first information in the first storage area according to a request of the first task, and when the second information is not read out, replying an exclusive right acquisition success; and a second acquisition part for executing write reflection processing capable of referring to contents written in the first storage area by the first task from the second task, reading out the first storage area after completing the write reflection processing, and when the first information is not read out from the first storage area, replying the exclusive right acquisition success.
    COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题：在不使用不可分割的操作指令或存储器屏障指令的情况下实现高效的排他控制。 解决方案：本发明的系统具有：存储装置，具有第一存储区域，用于存储指示基于第一任务获取或试用排他权利的第一信息;以及第二存储区域，用于存储指示 基于第二项任务获得或审判专有权; 第一获取部分，用于根据第一任务的请求发出第一信息写入指令以读出第二存储区，并且当第二信息不被读出时，回答专有权获取成功 ; 以及第二获取部分，用于执行写入反射处理，其能够从第二任务中引用由第一任务写入第一存储区域中的内容，在完成写入反射处理之后读出第一存储区域，并且当第一信息不是 从第一个存储区读出，回答专有权获取成功。 版权所有（C）2008，JPO＆INPIT

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

    公开(公告)号：JP2005215884A

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

    申请号：JP2004020213

    申请日：2004-01-28

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

    Inventor： OGATA KAZUNORI ,  ONODERA TAMIYA ,  KOMATSU HIDEAKI

    IPC: G06F11/28 ,  G06F9/45

    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

    Method and device for lock management of object and method and device for unlocking object
    15.
    发明专利
    Method and device for lock management of object and method and device for unlocking object 有权
    用于对象和方法的锁定管理的方法和装置以及用于解锁对象的装置

    公开(公告)号：JP2000076086A

    公开(公告)日：2000-03-14

    申请号：JP24449798

    申请日：1998-08-31

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

    Inventor： ONODERA TAMIYA ,  KOCHIYA KIYOKUNI

    IPC: G06F9/52 ,  G06F9/46 ,  G06F15/173 ,  G06F17/30

    CPC classification number: G06F9/52 ,  Y10S707/99938

    Abstract: PROBLEM TO BE SOLVED: To provide a compound lock method not to decelerate the processing speed of a high-frequency path for locking, accessing and unlocking an object.
    SOLUTION: In a state of making plural sleds existent, when managing lock to the object by storing a bit showing the kind of lock and the identifier of a sled, which acquires lock corresponding to the lock of a first kind, or the identifier of lock of a second kind in a storage area provided corresponding to the object, this method executes a step for judging the bit showing the kind of lock for a certain object held by the first sled shows the lock of the first kind or not when the second sled tries to acquire the lock of a certain object and a step for putting up a competition bit when the bit shows the lock of the first kind.
    COPYRIGHT: (C)2000,JPO

    Abstract translation: 要解决的问题：提供一种不减速用于锁定，访问和解锁物体的高频路径的处理速度的复合锁定方法。 解决方案：在存在多个滑板的状态下，当通过存储显示锁的种类的位和与第一类的锁相对应的锁的标识符或锁定标识符来管理对象的锁定时 在与对象相对应的存储区域中的第二种类型的方法执行一个步骤，用于判断显示由第一滑架保持的某个对象的锁的种类的位表示当第二滑架 尝试获取某个对象的锁定，并且当该位显示第一种锁定时，设置一个竞争位的步骤。

    METHOD AND SYSTEM FOR CLUSTERING
    16.
    发明专利
    METHOD AND SYSTEM FOR CLUSTERING 失效

    公开(公告)号：JPH0816369A

    公开(公告)日：1996-01-19

    申请号：JP14444394

    申请日：1994-06-27

    Applicant: IBM

    Inventor： ONODERA TAMIYA

    IPC: G06F9/06 ,  G06F12/00

    Abstract: PURPOSE: To improve the spatial efficiency of clustering for each file. CONSTITUTION: According to this multiple version clustering, the beginning a difference due to correction added to the program information of one source file is accumulated to the same cluster as the program information of the original source file. This processing is the same as the clustering for each file. However, this processing is different from the clustering for each file in that each time the difference is accumulated, the cumulative amounts are judged, for example, by the number of byte units. Then, another cluster is prepared according as the cumulative amounts of the difference exceed certain scheduled amounts, and all the program information of the corrected source file but not the difference is stored in another cluster in that stage. Then, the difference due to the correction thereafter is accumulated on the new cluster, instead of the old cluster.

    Method, program and system for controlling operation of computer
    17.
    发明专利
    Method, program and system for controlling operation of computer 有权
    用于控制计算机操作的方法，程序和系统

    公开(公告)号：JP2012150716A

    公开(公告)日：2012-08-09

    申请号：JP2011009968

    申请日：2011-01-20

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

    Inventor： HORII HIROSHI ,  KAWACHIYA KIYOKUNI ,  ONODERA TAMIYA

    IPC: G06F9/44

    CPC classification number: G06F9/52

    Abstract: PROBLEM TO BE SOLVED: To provide processing for appropriately making sure of such a case that stack allocation is possible when the processing of fork() or join() is performed in the framework of Fork-Join.SOLUTION: In the framework of Fork-Join, following determination processing is implemented. In processing of inputting a task object to the queue of work stealing, it is determined that the task object does not escape. This processing is performed by, for example, fork(). In processing of waiting for the end of the task object input to the queue, it is determined that the task object does not escape. This processing is performed by, for example, join(). When the task object escapes in any case other than the above mentioned case, it is determined that the task object does not escape. When it is determined that the task object does not escape, the stack allocation of the task object is performed.

    Abstract translation: 要解决的问题：为了适当地确定在fork（）或join（）在Fork-Join的框架中执行的情况下可以进行堆栈分配的情况的处理。 解决方案：在Fork-Join的框架下，执行以下确定处理。 在将任务对象输入到工作队列中的处理中，确定任务对象不能逃脱。 该处理由例如fork（）来执行。 在处理等待输入到队列的任务对象的结束时，确定任务对象不会转义。 该处理通过例如join（）执行。 当任务对象在上述情况以外的任何情况下转义时，确定任务对象不能转义。 当确定任务对象不转义时，执行任务对象的堆栈分配。 版权所有（C）2012，JPO＆INPIT

    Code generation method, system, and program
    18.
    发明专利
    Code generation method, system, and program 有权
    代码生成方法，系统和程序

    公开(公告)号：JP2012053566A

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

    申请号：JP2010194224

    申请日：2010-08-31

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

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

    IPC: G06F9/44 ,  G06F9/45

    CPC classification number: G06F8/4443 ,  G06F9/45516

    Abstract: PROBLEM TO BE SOLVED: To efficiently achieve in-lining for code optimization.SOLUTION: When a method is a supposition multimethod, a distribution of types in execution of a group of actual arguments is inspected by type inference and profiling. If appearance of the group of actual arguments deviates, the method is specialized for the group of types of high frequency, and the method and the group of types are cached as a key. A code at a call source is optimized so as to call the specialized method by performing run-time inspection for several groups of types of high frequency. When the code of the specialized method is small enough, in-lining is achieved.

    Abstract translation: 要解决的问题：有效地实现代码优化的内联。

    解决方案：当一种方法是假设多方法时，通过类型推断和分析来检查实际参数组执行中的类型分布。 如果实际参数组的出现偏差，则该方法专门针对高频类型的组，并且方法和类型组被缓存为关键。 优化呼叫源上的代码，以便通过对几组高频类型执行运行时检查来调用专门的方法。 当专门方法的代码足够小时，可以实现内衬。 版权所有（C）2012，JPO＆INPIT

Patent Agency Ranking