会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • System and method for handling an exception in a program
    • 在程序中处理异常的系统和方法
    • US07240343B2
    • 2007-07-03
    • US10189040
    • 2002-07-03
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F9/45
    • G06F8/4441
    • A technique for improving the execution speed of a computer system by effectively reducing the costs to perform a search operation for an exception handler during the exception handling process is established. A computer system comprises 1) a compiler for compiling a program written in a programming language having an exception handling mechanism and 2) an execution unit for executing the compiled program. The execution unit calculates an occurrence frequency of an execution context in which a search operation for an exception handler is performed for execution handling, and determines the execution context to be optimized based on the frequency data. The compiler determines the exception handler for handling an exception that occurs in the above execution context, and generate a code describing a process path from a point that throw the exception in said execution context to the exception handler. Specifically, the compiler deletes the code that throws the exception, and generates a code that branches to the corresponding exception handler.
    • 建立了一种通过在异常处理过程中有效降低执行异常处理程序的搜索操作的成本来提高计算机系统执行速度的技术。 计算机系统包括:1)用于编译以具有异常处理机制的编程语言编写的程序的编译器,以及2)用于执行编译程序的执行单元。 执行单元计算执行异常处理程序的搜索操作用于执行处理的执行上下文的出现频率,并且基于频率数据确定要优化的执行上下文。 编译器确定用于处理在上述执行上下文中发生的异常的异常处理程序,并且生成描述从在所述执行上下文中引发异常到异常处理程序的点的过程路径的代码。 具体来说,编译器会删除引发异常的代码,并生成分支到相应异常处理程序的代码。
    • 92. 发明申请
    • Writing to file by multiple application threads in parallel
    • 通过多个应用程序线程并行写入文件
    • US20070079061A1
    • 2007-04-05
    • US11241326
    • 2005-10-01
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F12/00
    • G06F9/544G06F9/52
    • Multiple application threads write to the same file in parallel. The file is written to on a file cluster-by-file cluster basis. For each file cluster of a number of file clusters of the file, a block of a memory cluster is allocated to an application thread, where the memory cluster corresponds to the file cluster, and the block is written to by the application thread until the block is finished, until all the blocks of the memory cluster are finished. A block may be finished where the application thread has completely written to the block, or the application thread has no further data to write to the block. Thereafter, the memory cluster is registered within a queue, from which it is read by a file writer thread, which writes the memory cluster to the file cluster. Each application thread that is to write to the file performs this process.
    • 多个应用程序线程并行写入同一个文件。 文件以逐个文件集群为基础写入文件。 对于文件的多个文件簇的每个文件簇,将内存集群的块分配给应用程序线程,其中内存集群对应于文件集群,并且该块由应用程序线程写入,直到块 完成后,直到内存集群的所有块完成。 可以在应用程序线程完全写入块的情况下完成块,或者应用程序线程没有进一步的数据写入块。 此后,将内存集群注册到队列中,由文件写入程序线程从该队列中读取内存集,该文件写入程序将内存集群写入文件集群。 要写入文件的每个应用程序线程执行此过程。
    • 93. 发明授权
    • Automatic transmission for vehicle
    • 汽车自动变速箱
    • US07174801B2
    • 2007-02-13
    • US10737926
    • 2003-12-18
    • Takeshi OgasawaraTakeshi SatohDaisuke KondoTakanori Mori
    • Takeshi OgasawaraTakeshi SatohDaisuke KondoTakanori Mori
    • B60K20/00
    • F16H61/32F16H59/10F16H2061/323F16H2061/326Y10T74/20018Y10T74/2003Y10T74/2014Y10T74/20146
    • In an automatic transmission apparatus (10) for a vehicle provided with a shift lever (20) manually changing a position of an automatic transmission (50), a torque detector (30) for detecting a changing operation force of the shift lever, and an assist force applying means (40) for applying a backup force to the manual operating force of the shift lever so as to transmit to the automatic transmission via a transmitting means (52–54), thereby changing to a desired position, a lever base (26) of the shift lever (20) is mounted to an input shaft (31a) of the rotation axis (31) of the torque detector (30), and an output gear (43) of the assist force applying means (40) is mounted to an output shaft (31b) of the rotation axis (31) of the torque detector (30), and the rotation axis of the shift lever (20), the rotation axis (31) of the torque detector (30) and the rotation axis of the assist force applying means (40) are arranged in a line.
    • 在设置有手动改变自动变速器(50)的位置的变速杆(20)的车辆用自动变速装置(10)中,用于检测变速杆的变更动作力的转矩检测器(30) 辅助力施加装置(40),用于对变速杆的手动操作力施加支撑力,以便经由传递装置(52-54)传递到自动变速器,从而变为所需位置,杆底座 变速杆(20)的输入齿轮(26)安装在转矩检测器(30)的旋转轴(31)的输入轴(31a)上,辅助力施加机构(40)的输出齿轮(43) 安装到转矩检测器(30)的旋转轴线(31)的输出轴(31b),变速杆(20)的旋转轴线,转矩检测器(30)的旋转轴线(31) 并且辅助力施加装置(40)的旋转轴线排列成一行。
    • 98. 发明授权
    • Determining a communication schedule between processors
    • 确定处理器之间的通信时间表
    • US06253372B1
    • 2001-06-26
    • US09361316
    • 1999-07-27
    • Hideaki KomatsuTakeshi Ogasawara
    • Hideaki KomatsuTakeshi Ogasawara
    • G06F945
    • 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的节点之间的距离的通信图。 每个通信图对应于处理器间通信的通信步骤。 通过通信图来整体地进行通信,通信图的边缘是指在某个通信步骤中执行的处理器间通信。 以这种方式,可以优化通信。
    • 99. 发明授权
    • Request processing system, method and program product
    • 请求处理系统,方法和程序产品
    • US09471374B2
    • 2016-10-18
    • US13406667
    • 2012-02-28
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F7/00G06F17/30G06F9/48G06F12/02
    • G06F9/4881G06F12/0269G06F17/30138G06F2209/485G06F2209/548
    • A processing method has been claimed for reducing the average wait time of requests in a queue in a system environment where garbage collection may occur. In the method, a computer system treats as a unit each request in a queue and a completion time of garbage collection that may occur at the time of processing the request, and processes requests preferentially and systematically in ascending order of the processing times of the units including the garbage collection times, thereby, reducing the average wait time of the requests. While, the computer system managing the queue knows the remaining amount of heap just before processing a certain request, the computer system statistically calculates in advance the amounts of heap to be consumed on a request type basis and holds the values.
    • 已经要求一种处理方法来减少在可能发生垃圾回收的系统环境中的队列中的请求的平均等待时间。 在该方法中,计算机系统将处理请求时可能发生的队列中的每个请求和垃圾收集的完成时间视为单位,并且按照单元的处理时间的升序优先和系统地处理请求 包括垃圾收集时间,从而减少请求的平均等待时间。 管理队列的计算机系统在处理特定请求之前知道剩余的堆量,计算机系统根据请求类型来预先统计计算要消耗的堆的数量并保存该值。