会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 31. 发明申请
    • REQUEST PROCESSING SYSTEM, METHOD AND PROGRAM PRODUCT
    • 请求处理系统,方法和程序产品
    • US20120215818A1
    • 2012-08-23
    • US13406667
    • 2012-02-28
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F17/30
    • 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.
    • 已经要求一种处理方法来减少在可能发生垃圾回收的系统环境中的队列中的请求的平均等待时间。 在该方法中,计算机系统将处理请求时可能发生的队列中的每个请求和垃圾收集的完成时间视为单位,并且按照单元的处理时间的升序优先和系统地处理请求 包括垃圾收集时间,从而减少请求的平均等待时间。 管理队列的计算机系统在处理特定请求之前知道剩余的堆量,计算机系统根据请求类型来预先统计计算要消耗的堆的数量并保存该值。
    • 32. 发明授权
    • Memory power control method and memory power control program
    • 存储器功率控制方法和存储器功率控制程序
    • US08140600B2
    • 2012-03-20
    • US12622470
    • 2009-11-20
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F17/30
    • G06F12/0276G06F2212/1028Y02D10/13
    • A method and a computer readable article of manufacture for controlling memory power consumption on a computer. The method includes a memory having a power saving mode and performs a garbage collection for collecting no-longer-needed objects in groups the no-longer-needed objects being allocated to memory blocks obtained by dividing a memory's address space by a predetermined constant size. The method includes the steps of dividing a heap area of the memory into a number of sub-heap areas; managing the sub-heap areas; and changing the number of sub-heap areas used for garbage collection based on a magnitude correlation between a required time for the garbage collection and a predefined target value.
    • 一种用于控制计算机上的存储器功耗的方法和计算机可读制品。 该方法包括具有省电模式的存储器,并且执行垃圾收集,用于将不再需要的对象分组用于将不需要的对象分配给通过将存储器的地址空间划分预定的常数大小而获得的存储器块。 该方法包括以下步骤:将存储器的堆区划分成多个子堆区; 管理子堆区; 并且基于垃圾收集的所需时间与预定义的目标值之间的大小相关性来改变用于垃圾收集的子堆区域的数量。
    • 34. 发明申请
    • CONTROL APPARATUS
    • 控制装置
    • US20100106932A1
    • 2010-04-29
    • US12606242
    • 2009-10-27
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F12/02G06F12/00
    • G06F9/526
    • A control apparatus, control method and computer readable article of manufacture for controlling data. The control apparatus includes a data storage unit; a plurality of entry storage units, and a plurality of registration units. The data storage unit stores data. Each of the entry storage units stores an entry for registering a pointer to data. If each of the registration units receives an instruction for registering data, then each registration unit (i) searches the entry storage units for an entry storage unit having an empty entry, (ii) registers a pointer to the data to be registered in the retrieved entry storage unit and (iii) stores the data to be registered and identification information of the retrieved entry storage unit in the data storage unit in such a manner that the data to be registered and the identification information is associated with each other.
    • 用于控制数据的控制装置,控制方法和计算机可读制造品。 控制装置包括数据存储单元; 多个入口存储单元和多个登记单元。 数据存储单元存储数据。 每个条目存储单元存储用于注册指向数据的条目。 如果每个注册单元接收到用于登记数据的指令,则每个注册单元(i)在入口存储单元中搜索具有空条目的条目存储单元,(ii)将注册的数据注册到所检索的数据中 入口存储单元,以及(iii)将要登记的数据和所检索的条目存储单元的识别信息以要登记的数据和识别信息相互关联的方式存储在数据存储单元中。
    • 35. 发明授权
    • Information processing and control
    • 信息处理和控制
    • US07703095B2
    • 2010-04-20
    • US12171063
    • 2008-07-10
    • Kiyokuni KawachiyaTakeshi OgasawaraHideaki Komatsu
    • Kiyokuni KawachiyaTakeshi OgasawaraHideaki Komatsu
    • G06F9/46G06F9/45G06F11/34
    • 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的发生次数计数器的计数值。
    • 36. 发明申请
    • METHOD FOR MANAGEMENT OF TIMEOUTS
    • 管理时间的方法
    • US20090320030A1
    • 2009-12-24
    • US12144780
    • 2008-06-24
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F9/46
    • G06F9/4825G06F9/542G06F2209/543
    • A method of managing a multithreaded computer system comprises instantiating, in response to each transaction initiated by a first thread of a plurality of threads, a timer object including a scheduled expiration time and a set of timeout handling information for the transaction in storage local to the first thread; registering, in response to each passing of a fixed time interval, each timer object in the storage local to the first thread for which the scheduled expiration time is earlier than the fixed time interval added to a current time in a timer processing component by adding a pointer referencing the timer object to a data structure managed by the timer processing component; and managing each timer object corresponding to a transaction initiated by the first thread that is not registered in the timer processing component in the storage local to the first thread. The timer processing component regularly processes each timer object referenced by the data structure for which the scheduled expiration time value is not earlier than the current time in accordance with the set of timeout handling information of the timer object.
    • 一种管理多线程计算机系统的方法包括:响应于由多个线程的第一线程发起的每个事务来实例化定时器对象,其包括调度的到期时间和一组超时处理信息,用于存储在本地 第一线 响应于固定时间间隔的每次通过,将定时处理组件中添加到当前时间的固定时间间隔早于第一线程的本地存储器中的每个定时器对象注册到计时器处理组件中的当前时间的固定时间间隔, 将定时器对象引用到由定时器处理组件管理的数据结构; 以及管理与由第一线程发起的事务相对应的每个定时器对象,该事务未被注册到第一线程的本地存储器中的定时器处理组件中。 定时器处理组件根据定时器对象的超时处理信息的集合,定期处理由调度的到期时间值不早于当前时间的数据结构引用的每个定时器对象。
    • 37. 发明申请
    • Minimizing variations of waiting times of requests for services handled by a processor
    • 最小化处理器处理的服务请求的等待时间的变化
    • US20080295108A1
    • 2008-11-27
    • US11753479
    • 2007-05-24
    • Takeshi OgasawaraHideaki Komatsu
    • Takeshi OgasawaraHideaki Komatsu
    • G06F9/46
    • G06F9/505G06F11/3419G06F2201/88G06F2209/5018G06F2209/504G06F2209/508Y02D10/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.
    • 由处理器处理的服务请求的等待时间的变化被最小化。 响应于处理器接收到对服务的请求,对服务请求的到达时间被记录并添加到对于服务的所有请求的总到达时间,并且对服务的等待请求的数量的计数器是 递增 响应于处理器处理请求,从总到达时间减去请求的到达时间,并且计数器递减。 在任一情况下,确定服务请求的平均等待时间,维持平均等待时间的历史,并且确定该历史中的变化。 在变化大于阈值的情况下,调整处理器资源以使处理器处理的所有服务的请求的等待时间内的变化最小化。
    • 38. 发明授权
    • Method and apparatus for precision optimization in compiled programs
    • 编译程序精度优化的方法和装置
    • US07143402B2
    • 2006-11-28
    • US10621281
    • 2003-07-16
    • Takeshi OgasawaraToshio Suganuma
    • Takeshi OgasawaraToshio Suganuma
    • G06F9/45
    • G06F8/4441
    • A compiler mounted on a computer generates a first object code of a target method in a double precision mode in the floating-point computation. If the target method is found to be frequently called in a single precision mode and a runtime cost may be reduced by executing the target method in the single precision mode, a second object code of the target method is generated in the single precision mode. Alternatively, regardless of whether a target method to be compiled will be called by the double precision mode or the single precision mode in the floating-point computation, the object code is generated by setting the precision mode depending on the type of the computation within the target method. Then, a code for matching the precision mode is generated and added based on a relation between the target code and its caller method.
    • 安装在计算机上的编译器在浮点计算中以双精度模式生成目标方法的第一目标代码。 如果发现目标方法在单精度模式中被频繁地调用,并且可以通过以单精度模式执行目标方法来减少运行时间成本,则以单精度模式生成目标方法的第二目标代码。 或者,无论在浮点计算中是否通过双精度模式或单精度模式调用要编译的目标方法,通过根据内部计算的计算类型设置精度模式来生成目标代码 目标法。 然后,基于目标代码与其调用方法之间的关系生成并添加用于匹配精度模式的代码。
    • 40. 发明授权
    • Method, apparatus, program and recording medium for memory access serialization and lock management
    • 用于存储器访问序列化和锁定管理的方法,设备,程序和记录介质
    • US06938131B2
    • 2005-08-30
    • US10413850
    • 2003-04-15
    • Takeshi Ogasawara
    • Takeshi Ogasawara
    • G06F9/38G06F9/46G06F9/52G06F12/00G06F12/06G06F12/14G06F15/177
    • G06F9/3834G06F9/3004G06F9/30087G06F9/3851G06F9/526
    • To improve the processing speed in a case where a program requiring memory access serialization is executed in a multiprocessor environment with a load instruction out-of-order execution function.Each of CPUs has the function of performing store forwarding (SF) when the address regions of a pair of store and load instructions coincide with each other. Each CPU stops SF and performs store forwarding avoidance (SFA) when the two address regions do not coincide with each other but have an overlap therebetween. Each of SF and SFA is executed with priority over out-of-order execution. Each CPU performs SFA effective in limiting out-of-order execution with respect to a predetermined store instruction on a program and a load instruction mated to the store instruction and given after the store instruction, and ensures that data relating to the store instruction can be observed from other CPUs.
    • 在需要存储器访问序列化的程序在具有加载指令无序执行功能的多处理器环境中执行的情况下,提高处理速度。 当一对存储和加载指令的地址区域彼此重合时,每个CPU具有执行存储转发(SF)的功能。 当两个地址区域彼此不一致但在它们之间有重叠时,每个CPU停止SF并执行存储转发避免(SFA)。 SF和SFA中的每一个优先于无序执行。 每个CPU执行SFA有效地限制关于程序上的预定存储指令和与存储指令配合并在存储指令之后给出的加载指令的无序执行,并且确保与存储指令相关的数据可以是 从其他CPU观察。