会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明专利
    • Information processing device, program, and job control method
    • 信息处理设备,程序和作业控制方法
    • JP2014049112A
    • 2014-03-17
    • JP2012251411
    • 2012-11-15
    • Fujitsu Ltd富士通株式会社Georgia Tech Research Corpジョージア・テック・リサーチ・コーポレーション
    • KANEMASA YASUHIKOKAWABA MOTOYUKIPU CARTONWANG JING YANG
    • G06F9/48
    • G06F9/4881G06F2209/485G06F2209/486
    • PROBLEM TO BE SOLVED: To provide an information processing device which suppresses violent fluctuations in a response time.SOLUTION: An information processing device classifies jobs to be executed by a server 4 into a plurality of groups, and ranks the groups in ascending order of workload to be imposed on the server 4 by the jobs belonging to the group. Counting means 1f counts the number of jobs which are being executed by the server 4 and also belong to the predetermined number of top-ranked groups. Inhibition means 1g determines processing requests of jobs belonging to the groups other than the predetermined number of top-ranked groups as inhibition targets, and inhibits the inhibition target processing requests from being transmitted to the server 4, when the number of counted jobs are equal to or more than a predetermined threshold and also there are jobs which belong to the predetermined number of top-ranked groups and are waiting to be processed.
    • 要解决的问题:提供一种抑制响应时间的剧烈波动的信息处理装置。解决方案:信息处理装置将由服务器4执行的作业分类成多个组,并以工作量的升序对组进行排序 由属于该组的作业施加在服务器4上。 计数装置1f计算由服务器4执行的作业的数目,并且也属于预定数量的顶级组。 抑制单元1g确定属于除预定数量的顶级组之外的组的作业的处理请求作为禁止目标,并且当计数作业的数目等于...时禁止向服务器4发送禁止目标处理请求 或大于预定阈值,并且还存在属于预定数量的顶级组并且正在等待被处理的作业。
    • 2. 发明专利
    • Information processing program, device and method
    • 信息处理程序,设备和方法
    • JP2012083918A
    • 2012-04-26
    • JP2010228982
    • 2010-10-08
    • Fujitsu Ltd富士通株式会社
    • KAWABA MOTOYUKI
    • G06F11/34G06F15/00
    • H04L51/22G06F17/30587
    • PROBLEM TO BE SOLVED: To identify, in messages that are not associated with other messages, a candidate of an association key for associating the messages with other messages.SOLUTION: An information processing method includes: a step of extracting messages including attribute values of a first attribute and the appearance time of each message from a message storage unit for storing messages including attribute values of one or plural attributes and the appearance time of each message associated with each other; a step of using the extracted data to calculate, for each attribute value of the first attribute, an existing period that is a difference between the earliest appearance time and the latest appearance time among the appearance time of the messages including the attribute value; a step of determining whether a rate of the existing period shorter than a predetermined period to the calculated existing periods is equal to or more than a predetermined threshold; and a step of storing data indicating that the first attribute is a candidate of an association key in a data storage unit when it is determined that the rate is equal to or more than the predetermined threshold.
    • 要解决的问题:为了在不与其他消息相关联的消息中识别用于将消息与其他消息相关联的关联密钥的候选。 解决方案:一种信息处理方法,包括:从包含一个或多个属性的属性值的消息的消息存储单元中提取包括第一属性的属性值和每个消息的出现时间的消息的步骤,以及出现时间 每个消息相互关联; 对于所述第一属性的每个属性值,在包括所述属性值的消息的出现时间之间,使用所提取的数据来计算作为所述最早出现时间与最近出现时间之间的差的现有期间的步骤; 确定比计算的现有周期短于预定周期的现有周期的速率是否等于或大于预定阈值的步骤; 以及当确定所述速率等于或大于所述预定阈值时,将指示所述第一属性是关联密钥的候选的数据存储在数据存储单元中的步骤。 版权所有(C)2012,JPO&INPIT
    • 3. 发明专利
    • Apparatus, method and program for message binding processing
    • 用于信息绑定处理的装置,方法和程序
    • JP2009282807A
    • 2009-12-03
    • JP2008135002
    • 2008-05-23
    • Fujitsu Ltd富士通株式会社
    • HOTTA YUJIKAWABA MOTOYUKITAKAHASHI HIDEKAZUHARADA RIRIAN
    • G06F9/50
    • G06F9/546
    • PROBLEM TO BE SOLVED: To thoroughly perform binding processing when dynamically adding or stopping a server or the like for performing message binding processing.
      SOLUTION: A message binding processing apparatus includes: a receiving means which receives a plurality of messages related to a plurality of transactions in random order; a plurality of binding processing means each of which classifies messages in a queue for storing messages related to a transaction in charge for each transaction, and then outputting the messages to a message processing part; a message distribution means which outputs received messages to any one of the binding processing means, which is specified by a transaction identifier of the messages and a distribution rule predetermined about the transaction identifier; and a configuration changing means for changing the distribution rule when the binding processing means is started or stopped. When the configuration changing means changes the distribution rule, each binding processing means outputs the messages stored in the queue to the message distribution means.
      COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:在动态添加或停止用于执行消息绑定处理的服务器等时彻底地执行绑定处理。 解决方案:消息绑定处理装置包括:接收装置,其以随机顺序接收与多个事务相关的多个消息; 多个装订处理装置,其中每一个将队列中的消息分类以存储与每个交易负责的交易有关的消息,然后将消息输出到消息处理部分; 将接收到的消息输出到由消息的事务标识符指定的绑定处理装置中的接收消息和关于事务标识符预先分配的分发规则的消息分发装置; 以及配置改变装置,用于当装订处理装置启动或停止时改变分配规则。 当配置改变装置改变分配规则时,每个装订处理装置将存储在队列中的消息输出到消息分发装置。 版权所有(C)2010,JPO&INPIT
    • 4. 发明专利
    • Linkage support apparatus and linkage support method
    • 链接支持设备和链接支持方法
    • JP2009238069A
    • 2009-10-15
    • JP2008085372
    • 2008-03-28
    • Fujitsu Ltd富士通株式会社
    • KAWABA MOTOYUKITAKAHASHI HIDEKAZUHOTTA YUJIHARADA RIRIAN
    • G06F15/00G06F13/00
    • G06F9/546
    • PROBLEM TO BE SOLVED: To provide a technology for supporting automatic design of a linkage system capable of carrying out linkage processing of high efficiency. SOLUTION: This linkage support apparatus for supporting linkage processing of linking mutually related messages in a plurality of messages sent and received among a plurality of communication terminals, comprises an information acquisition unit for acquiring the respective message types of the plurality of messages, character strings included in the plurality of messages, and the amount of data flow when the character strings are transferred; an unnecessary character string exclusion unit for excluding character strings unnecessary as keywords for linkage processing, out of a plurality of character strings acquired by the information acquisition unit, based on the information acquired by the information acquisition unit; and a processing order determination unit for determining order for using the plurality of character strings from which the unnecessary character strings are excluded by the unnecessary character string exclusion unit, in linkage processing based on the information acquired by the information acquisition unit. COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:提供一种支持自动设计能够执行高效率的联动处理的联动系统的技术。 解决方案:用于支持在多个通信终端之间发送和接收的多个消息中链接相互关联的消息的链接处理的联动支持装置包括:信息获取单元,用于获取多个消息的各个消息类型; 包括在多个消息中的字符串以及当字符串被传送时的数据流量; 一个不必要的字符串排除单元,用于根据由信息获取单元获取的信息,排除由信息获取单元获取的多个字符串中不必要的用于链接处理的关键字的字符串; 以及处理顺序确定单元,用于基于由信息获取单元获取的信息进行联动处理,确定使用由不需要的字符串排除单元排除不需要的字符串的多个字符串的顺序。 版权所有(C)2010,JPO&INPIT
    • 5. 发明专利
    • Program, analysis method, and information processor
    • 程序,分析方法和信息处理器
    • JP2013097783A
    • 2013-05-20
    • JP2012026293
    • 2012-02-09
    • Fujitsu Ltd富士通株式会社Georgia Tech Research Corpジョージア・テック・リサーチ・コーポレーション
    • KANEMASA YASUHIKOKAWABA MOTOYUKIPU CARTONWANG JING YANG
    • G06F11/34
    • G06F11/3419G06F11/323G06F11/3442G06F11/3452G06F11/3495G06F2201/875
    • PROBLEM TO BE SOLVED: To determine presence/absence of surplus of throughput of an analysis object device.SOLUTION: Calculation means 1c acquires information indicating an execution period of processing executed within an analysis object period in the analysis object device, from storage means 1b. Then, the calculation means 1c calculates the total processing time obtained by totalling the time consumed for execution of respective processing executed within a sum-up section for each sum-up section obtained by subdividing the analysis object period. Also, the calculation means 1c calculates the total advance amount obtained by totalling advance amounts of the respective processing executed within the sum-up section for each sum-up section. Determination means 1d determines a threshold of the total processing time at which an increase amount of the total advance amount to an increase amount of the total processing time becomes equal to or smaller than a prescribed value on the basis of the total processing time and the total advance amount of each sum-up section. Then, detection means 1e detects the sum-up section in which the total processing time is equal to or greater than the threshold.
    • 要解决的问题:确定分析对象设备的吞吐量过剩的存在/不存在。 解决方案:计算装置1c从存储装置1b获取指示在分析对象装置内的分析对象周期内执行的处理的执行周期的信息。 然后,计算装置1c计算通过对通过细分分析对象期间而获得的各个总计部分的总计部分内执行的各个处理所消耗的时间进行合计而获得的总处理时间。 此外,计算单元1c计算通过对于每个总计部分合计在总计部分内执行的各个处理的预先金额而获得的总预付金额。 确定装置1d基于总处理时间和总共处理时间确定总处理时间的增加量与总处理时间的增加量等于或小于规定值的总处理时间的阈值 每个总结部分的预付金额。 然后,检测装置1e检测总处理时间等于或大于阈值的总和部分。 版权所有(C)2013,JPO&INPIT
    • 8. 发明专利
    • Parallel linking processing system and method
    • 并行连接处理系统及方法
    • JP2011053919A
    • 2011-03-17
    • JP2009202305
    • 2009-09-02
    • Fujitsu Ltd富士通株式会社
    • KAWABA MOTOYUKI
    • G06F15/00
    • H04L12/66
    • PROBLEM TO BE SOLVED: To collect unlinked messages in a state that a response to a request is not returned. SOLUTION: In a system including a plurality of linking processing parts to perform the linking processing of related messages in parallel, the plurality of linking processing parts mutually exchange a plurality of combinations of key character strings and values included in a message group of not only received messages in charge but also unlinked messages to be linked, store the exchanged combinations in a trace data storage part, and extract other combinations related to a specific combination of a key character string and a value specified from a noticed message. By extracting messages related to the extracted combinations from the corresponding linking processing part, unlinked messages to be noticed are extracted and a problem or the like can be analyzed. COPYRIGHT: (C)2011,JPO&INPIT
    • 要解决的问题:在不返回对请求的响应的状态下收集未链接的消息。 解决方案:在包括并行执行相关消息的链接处理的多个链接处理部分的系统中,多个链接处理部分相互交换密钥字符串的多个组合以及包括在消息组 不仅收到负责的消息,还收到要链接的未链接消息,将交换的组合存储在跟踪数据存储部分中,并提取与密钥字符串的特定组合和从注意到的消息指定的值相关的其他组合。 通过从相应的链接处理部分提取与提取的组合相关的消息,提取要注意的未链接的消息,并且可以分析问题等。 版权所有(C)2011,JPO&INPIT
    • 9. 发明专利
    • Method and system for evaluating computer performance
    • 用于评估计算机性能的方法和系统
    • JP2004078338A
    • 2004-03-11
    • JP2002234536
    • 2002-08-12
    • Fujitsu Ltd富士通株式会社
    • KAWABA MOTOYUKI
    • G06F11/34
    • PROBLEM TO BE SOLVED: To easily determine a sampling trace length suitable for the extraction of a representative trace by clustering in a computer performance evaluation method.
      SOLUTION: This computer performance evaluation method uses the representative sampling trace obtained by sampling from the execution history of a program. Based on the total number of execution instructions when an objective program is run and specified measurement information, the number of variations in the behaviors of the program when the program is run is calculated and, based on the total number of the execution instructions and the number of variations when the program is run is calculated. Based on the total number of the execution instructions and the number of variations in the behavior, the trace length of the sampled sampling trace is calculated, the sampling trace is sampled from the objective program based on the trace length, the sampled sampling trace is clustered, and the representative sampling trace is determined for each cluster.
      COPYRIGHT: (C)2004,JPO
    • 要解决的问题:通过在计算机性能评估方法中聚类,容易地确定适合于提取代表性迹线的采样迹线长度。

      解决方案:该计算机性能评估方法使用通过从程序的执行历史进行抽样获得的代表性采样跟踪。 基于运行目标程序时的执行指令总数和指定的测量信息,计算程序运行时程序行为的变化次数,并根据执行指令的总数和编号 计算运行程序时的变化。 根据执行指令的总数和行为的变化次数,计算采样采样跟踪的跟踪长度,根据跟踪长度从目标程序采样采样跟踪,采样采样跟踪集群 ,并为每个集群确定代表性采样跟踪。 版权所有(C)2004,JPO

    • 10. 发明专利
    • ストレージシステム、情報処理装置の制御プログラム、およびストレージシステムの制御方法
    • 存储系统,信息处理设备的控制程序和存储系统的控制方法
    • JP2014232348A
    • 2014-12-11
    • JP2013111674
    • 2013-05-28
    • 富士通株式会社Fujitsu Ltd
    • OGIWARA KAZUTAKAOE KAZUICHIKAWABA MOTOYUKI
    • G06F3/06
    • G06F3/0611G06F3/0649G06F3/0665G06F3/0685
    • 【課題】負荷変動に対してアクセス性能を改善する。【解決手段】ストレージシステム1は、アクセス速度が遅い第1のストレージ装置2と、アクセス速度が速い第2のストレージ装置3と、情報処理装置10を備える。情報処理装置10は、仮想ボリューム4に割り当てられる割当単位領域5のアクセス頻度の変化に応じて、第1のストレージ装置2と第2のストレージ装置3とから割当単位領域5を構成することができる。評価部12は、割当単位領域5より小さなサイズの分割領域6ごとに、ユーザからのI/Oリクエストに対する評価情報を生成する。移動制御部13は、仮想ボリューム4への割当を、第1のストレージ装置2の割当単位領域5(第1の割当単位領域)から第2のストレージ装置3の割当単位領域5(第2の割当単位領域)に変更する場合、評価情報に基づいてデータを移動する。【選択図】図1
    • 要解决的问题:提高针对负载波动的访问性能。解决方案:存储系统1包括具有低访问速度的第一存储设备2,具有高访问速度的第二存储设备3和信息处理设备10.信息处理 根据分配给虚拟卷4的分配单元区域5的访问频率的变化,设备10能够使用第一存储设备2和第二存储设备3来配置分配单元区域5.评估单元12生成评估 信息与来自小于分配单元区域5的每个分割区域6的来自用户的I / O请求。移动控制单元13在从虚拟卷4分配到虚拟卷4的分配中基于评估信息移动数据 第一存储装置2的分配单位区域5(第一分配单位区域)到第二存储装置3的分配单位区域5(第二分配单位区域 N)。