专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06363521B1 Process for processing programs, process for detecting depth of frame associated with specified method, detection method, and computer 失效
标题翻译：处理程序的过程，用于检测与指定方法相关联的帧深度的处理，检测方法和计算机
公开(公告)号：US06363521B1
公开(公告)日：2002-03-26
申请号：US09306007
申请日：1999-05-06
申请人： Toshiaki Yasue , Hideaki Komatsu , Takeshi Ogasawara
发明人： Toshiaki Yasue , Hideaki Komatsu , Takeshi Ogasawara
IPC分类号： A61F224
CPC分类号： G06F9/4491
摘要： The present invention is directed to expanding the scope of execution optimization by method inlining in a language with a security facility such as Java. More particularly, the present invention is directed to a step of generating a code necessary for looping by a tail recursion for a first method including an invocation of a method whose process after its invocation is indefinite and which includes a self recursion, and a step of generating a code for counting the number of iterations of the loop are included. SecurityManager corrects the depth of the frame associated with a second method in the storage area by using the count value by the code for counting the number of iterations of the loop. It also includes the steps of: inlining a code of the first method into the second method, wherein the second method includes an invocation of the first method whose process after its invocation is indefinite; getting the invocation relationship information between the first and the second methods in a state before inlining the code of the first method, and storing the invocation relationship information into a storage area available later; and generating a code for storing information about the first method being executed when the code of the inlined first method is executed. SecurityManager traces the stack with generated invocation relationship information.
摘要翻译：本发明旨在通过利用诸如Java之类的安全设施的语言内联方法来扩展执行优化的范围。更具体地说，本发明是针对第一种方法，通过尾递归生成循环所必需的代码的步骤，该第一方法包括调用其调用后的过程不确定并包括自递归的方法的调用，以及步骤生成用于对循环的迭代次数进行计数的代码。 SecurityManager通过使用计数值来计算存储区域中与第二种方法相关联的帧的深度来计算循环次数。它还包括以下步骤：将第一种方法的代码内联到第二种方法中，其中第二种方法包括调用其调用后的过程不确定的第一种方法; 在第一方法的代码内嵌之前的状态下获取第一和第二方法之间的调用关系信息，并将调用关系信息存储在稍后可用的存储区域中; 以及当执行所述内联第一方法的代码时，生成用于存储关于正在执行的所述第一方法的信息的代码。 SecurityManager跟踪生成的调用关系信息的堆栈。

2. 发明授权

US08108874B2 Minimizing variations of waiting times of requests for services handled by a processor 失效
标题翻译：最小化处理器处理的服务请求的等待时间的变化
公开(公告)号：US08108874B2
公开(公告)日：2012-01-31
申请号：US11753479
申请日：2007-05-24
申请人： Takeshi Ogasawara , Hideaki Komatsu
发明人： Takeshi Ogasawara , Hideaki Komatsu
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： G06F9/505 , G06F11/3419 , G06F2201/88 , G06F2209/5018 , G06F2209/504 , G06F2209/508 , Y02D10/22
摘要： Variations of waiting times of requests for services handled by a processor are minimized. In response to the processor receiving a request for a service, an arrival time of the request for the service is recorded and added to a total arrival time for all requests for the service, and a counter of a number of waiting requests for the service is incremented. In response to the processor processing the request, the arrival time of the request is subtracted from the total arrival time, and the counter is decremented. In either case, an average waiting time of requests for the service is determined, a history of the average waiting times is maintained, and the variation within this history is determined. Where the variation is greater than a threshold, processor resources are adjusted to minimize variations within waiting times of requests for all the services handled by the processor.
摘要翻译：由处理器处理的服务请求的等待时间的变化最小化。响应于处理器接收到对服务的请求，对服务请求的到达时间被记录并添加到对于服务的所有请求的总到达时间，并且对服务的等待请求的数量的计数器是递增响应于处理器处理请求，从总到达时间减去请求的到达时间，并且计数器递减。在任一情况下，确定服务请求的平均等待时间，维持平均等待时间的历史，并且确定该历史中的变化。在变化大于阈值的情况下，调整处理器资源以使处理器处理的所有服务的请求的等待时间内的变化最小化。

3. 发明申请

US20090019444A1 Information processing and control 失效
公开(公告)号：US20090019444A1
公开(公告)日：2009-01-15
申请号：US12171063
申请日：2008-07-10
申请人： Kiyokuni Kawachiya , Takeshi Ogasawara , Hideaki Komatsu
发明人： Kiyokuni Kawachiya , Takeshi Ogasawara , Hideaki Komatsu
IPC分类号： G06F9/46
CPC分类号： G06F9/46
摘要： Information processing apparatus, including occurrence number counter counting events that occurred in each of a plurality of CPUs. Apparatus performs functions of; storing accumulated occurrence number of events, which occurred while the thread is being executed by each of the CPUs, in a thread storage area of the thread associating accumulated occurrence number with CPU; storing, in the thread storage area, a value of occurrence number counter of the CPU, the value having been counted before the thread is resumed by the CPU; and adding, to accumulated occurrence number which has been stored in accumulated number storing unit while corresponding to the CPU, a difference value obtained by subtracting a counter value, which has been stored in the start-time number storing unit of the thread, from a counter value of the occurrence number counter of the CPU, in a case where the CPU terminates an execution of the thread.

4. 发明授权

US6126331A Determining a communication schedule between processors 失效
标题翻译：确定处理器之间的通信时间表
公开(公告)号：US6126331A
公开(公告)日：2000-10-03
申请号：US869902
申请日：1997-06-05
申请人： Hideaki Komatsu , Takeshi Ogasawara
发明人： Hideaki Komatsu , Takeshi Ogasawara
IPC分类号： G06F13/00 , G06F15/173 , G06F9/45
CPC分类号： G06F15/17368
摘要： To generate an optimum communication schedule when data is transmitted or received between processors which constitute a parallel computer or a distributed multiprocessor system.Processors which each perform inter-processor communication are sorted into a plurality of groups. A communication graph is generated whose nodes correspond to the groups and edges correspond to the communications. Communication graphs are generated for distances between nodes from one through N-1. Each communication graph corresponds to a communication step of the inter-processor communication. Communication is grasped as a whole by the communication graph and the edge of the communication graph means the inter-processor communication which is performed in a certain communication step. In this way, the communication can be optimized.
摘要翻译：当在构成并行计算机或分布式多处理器系统的处理器之间发送或接收数据时，生成最佳通信调度。每个执行处理器间通信的处理器被分类成多个组。生成其节点对应于组和边缘对应于通信的通信图。生成从1到N-1的节点之间的距离的通信图。每个通信图对应于处理器间通信的通信步骤。通过通信图来整体地进行通信，通信图的边缘是指在某个通信步骤中执行的处理器间通信。以这种方式，可以优化通信。

5. 发明申请

US20080276256A1 Method and System for Speeding Up Mutual Exclusion 失效
标题翻译：加快相互排斥的方法和系统
公开(公告)号：US20080276256A1
公开(公告)日：2008-11-06
申请号：US12173551
申请日：2008-07-15
申请人： Takeshi Ogasawara , Akira Koseki , Hideaki Komatsu , Kiyokuni Kawachiya , Tamiya Onodera
发明人： Takeshi Ogasawara , Akira Koseki , Hideaki Komatsu , Kiyokuni Kawachiya , Tamiya Onodera
IPC分类号： G06F9/44
CPC分类号： G06F9/52 , G06F9/3004 , G06F9/30087 , G06F9/526
摘要： In a multiprocessor computer system, a lock operation is maintained with a thread using non-atomic instructions. Identifiers are assigned to each thread. Flags in conjunction with the thread identifiers are used to determine the continuity of the lock with a thread. However, in the event continuity of the lock with the thread ceases, a compare-and-swap operation is executed to reset the lock with the same thread or another thread. Similarly, in the event there has been a collision between two or more threads requesting the lock, a compare-and-swap operation is executed to assign the lock to one of the requesting threads. Accordingly, prolonged ownership of a lock operation by a thread is encouraged to mitigate use of atomic operations in granting of the lock to a non-owning thread.
摘要翻译：在多处理器计算机系统中，使用非原子指令的线程来维护锁定操作。标识符分配给每个线程。与线程标识符一起使用的标志用于确定带有线程的锁的连续性。但是，在线程的锁定的连续性停止的情况下，执行比较和交换操作以使用相同的线程或其他线程重置锁定。类似地，如果两个或多个请求锁的线程之间发生冲突，则执行比较和交换操作以将锁分配给请求线程之一。因此，鼓励延长线程锁定操作的所有权，以减轻使用原子操作来授予对非拥有线程的锁定。

6. 发明授权

US07058935B2 Program compilation and optimization 有权
公开(公告)号：US07058935B2
公开(公告)日：2006-06-06
申请号：US09814324
申请日：2001-03-21
申请人： Motohiro Kawahito , Takeshi Ogasawara , Hideaki Komatsu
发明人： Motohiro Kawahito , Takeshi Ogasawara , Hideaki Komatsu
IPC分类号： G06F9/45 , G06F9/44 , G06F11/00
CPC分类号： G06F8/443 , G06F2209/481
摘要： It is one object of the present invention to provide effective optimization for a program that includes commands that may cause exception processes. A novel compiler for converting source code for a program written in a programming language into object code in a machine language comprises: an optimization execution unit for performing an optimization process for an object program written in a machine language; and a pre-processor and a post-processor for modifying the object program in order to absorb a difference in content between the point of origin of an exception process, which occurs in response to the execution of a command in the object program, and a location whereat the exception process is performed.

7. 发明申请

US20060090168A1 Method and system for speeding up mutual exclusion 审中-公开
公开(公告)号：US20060090168A1
公开(公告)日：2006-04-27
申请号：US10952142
申请日：2004-09-28
申请人： Takeshi Ogasawara , Akira Koseki , Hideaki Komatsu , Kiyokuni Kawachiya , Tamiya Onodera
发明人： Takeshi Ogasawara , Akira Koseki , Hideaki Komatsu , Kiyokuni Kawachiya , Tamiya Onodera
IPC分类号： G06F9/44
CPC分类号： G06F9/52 , G06F9/3004 , G06F9/30087 , G06F9/526
摘要： In a multiprocessor computer system, a lock operation is maintained with a thread using non-atomic instructions. Identifiers are assigned to each thread. Flags in conjunction with the thread identifiers are used to determine the continuity of the lock with a thread. However, in the event continuity of the lock with the thread ceases, a compare-and-swap operation is executed to reset the lock with the same thread or another thread. Similarly, in the event there has been a collision between two or more threads requesting the lock, a compare-and-swap operation is executed to assign the lock to one of the requesting threads. Accordingly, prolonged ownership of a lock operation by a thread is encouraged to mitigate use of atomic operations in granting of the lock to a non-owning thread.

8. 发明授权

US07703095B2 Information processing and control 失效
标题翻译：信息处理和控制
公开(公告)号：US07703095B2
公开(公告)日：2010-04-20
申请号：US12171063
申请日：2008-07-10
申请人： Kiyokuni Kawachiya , Takeshi Ogasawara , Hideaki Komatsu
发明人： Kiyokuni Kawachiya , Takeshi Ogasawara , Hideaki Komatsu
IPC分类号： G06F9/46 , G06F9/45 , G06F11/34
CPC分类号： G06F9/46
摘要： Information processing apparatus, including occurrence number counter counting events that occurred in each of a plurality of CPUs. Apparatus performs functions of; storing accumulated occurrence number of events, which occurred while the thread is being executed by each of the CPUs, in a thread storage area of the thread associating accumulated occurrence number with CPU; storing, in the thread storage area, a value of occurrence number counter of the CPU, the value having been counted before the thread is resumed by the CPU; and adding, to accumulated occurrence number which has been stored in accumulated number storing unit while corresponding to the CPU, a difference value obtained by subtracting a counter value, which has been stored in the start-time number storing unit of the thread, from a counter value of the occurrence number counter of the CPU, in a case where the CPU terminates an execution of the thread.
摘要翻译：信息处理装置，包括在多个CPU中的每一个中发生的发生次数计数事件。仪器执行功能; 在所述线程关联累积发生次数与所述线程的线程存储区域中存储在所述CPU中执行所述线程时发生的事件的累计发生次数; 在线程存储区域中存储CPU的发生次数计数器的值，该值在CPU恢复线程之前已被计数; 并且对与CPU相对应地存储在累积数量存储单元中的累计发生次数相加，将从线程的开始时间数存储单元中存储的计数器值减去得到的差值从在CPU终止执行线程的情况下，CPU的发生次数计数器的计数值。

9. 发明申请

US20080295108A1 Minimizing variations of waiting times of requests for services handled by a processor 失效
标题翻译：最小化处理器处理的服务请求的等待时间的变化
公开(公告)号：US20080295108A1
公开(公告)日：2008-11-27
申请号：US11753479
申请日：2007-05-24
申请人： Takeshi Ogasawara , Hideaki Komatsu
发明人： Takeshi Ogasawara , Hideaki Komatsu
IPC分类号： G06F9/46
CPC分类号： G06F9/505 , G06F11/3419 , G06F2201/88 , G06F2209/5018 , G06F2209/504 , G06F2209/508 , Y02D10/22
摘要： Variations of waiting times of requests for services handled by a processor are minimized. In response to the processor receiving a request for a service, an arrival time of the request for the service is recorded and added to a total arrival time for all requests for the service, and a counter of a number of waiting requests for the service is incremented. In response to the processor processing the request, the arrival time of the request is subtracted from the total arrival time, and the counter is decremented. In either case, an average waiting time of requests for the service is determined, a history of the average waiting times is maintained, and the variation within this history is determined. Where the variation is greater than a threshold, processor resources are adjusted to minimize variations within waiting times of requests for all the services handled by the processor.
摘要翻译：由处理器处理的服务请求的等待时间的变化被最小化。响应于处理器接收到对服务的请求，对服务请求的到达时间被记录并添加到对于服务的所有请求的总到达时间，并且对服务的等待请求的数量的计数器是递增响应于处理器处理请求，从总到达时间减去请求的到达时间，并且计数器递减。在任一情况下，确定服务请求的平均等待时间，维持平均等待时间的历史，并且确定该历史中的变化。在变化大于阈值的情况下，调整处理器资源以使处理器处理的所有服务的请求的等待时间内的变化最小化。

10. 发明授权

US06253372B1 Determining a communication schedule between processors 失效
标题翻译：确定处理器之间的通信时间表
公开(公告)号：US06253372B1
公开(公告)日：2001-06-26
申请号：US09361316
申请日：1999-07-27
申请人： Hideaki Komatsu , Takeshi Ogasawara
发明人： Hideaki Komatsu , Takeshi Ogasawara
IPC分类号： G06F945
CPC分类号： G06F15/17368
摘要： To generate an optimum communication schedule when data is transmitted or received between processors which constitute a parallel computer or a distributed multiprocessor system. Processors which each perform inter-processor communication are sorted into a plurality of groups. A communication graph is generated whose nodes correspond to the groups and edges correspond to the communications. Communication graphs are generated for distances between nodes from one through N−1. Each communication graph corresponds to a communication step of the inter-processor communication. Communication is grasped as a whole by the communication graph and the edge of the communication graph means the inter-processor communication which is performed in a certain communication step. In this way, the communication can be optimized.
摘要翻译：当在构成并行计算机或分布式多处理器系统的处理器之间发送或接收数据时，生成最佳通信调度。每个进行处理器间通信的处理器分为多个组。生成其节点对应于组和边缘对应于通信的通信图。生成从1到N-1的节点之间的距离的通信图。每个通信图对应于处理器间通信的通信步骤。通过通信图来整体地进行通信，通信图的边缘是指在某个通信步骤中执行的处理器间通信。以这种方式，可以优化通信。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式