中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

647 records (took 0.023 seconds)

    CIRCULAR TIMELINE DISPLAYS OF TIMESTAMPED EVENT DATA
    151.
    发明申请
    CIRCULAR TIMELINE DISPLAYS OF TIMESTAMPED EVENT DATA 审中-公开

    公开(公告)号：US20170083585A1

    公开(公告)日：2017-03-23

    申请号：US15011517

    申请日：2016-01-30

    Applicant: Splunk Inc.

    Inventor： Peter Chen ,  Min Zhang ,  Feng Shao ,  Qianjie Zhong ,  Geng Qin ,  D. Randall Young ,  Roy Zhang ,  Aaron Zhang

    IPC: G06F17/30

    CPC classification number: G06F11/3452 ,  G06F11/3006 ,  G06F11/323 ,  G06F11/3409 ,  G06F16/248 ,  G06F2201/835 ,  G06F2201/86

    Abstract: Techniques and mechanisms are disclosed that enable a data intake and query system to generate and cause display of circular timelines of timestamped event data. As used herein, a circular timeline generally refers to a graphical display of timestamped events stored by a data intake and query system, wherein the timestamped events may be displayed as arcs of one or more concentric circles and located in a circular timeline area according to a chronological ordering associated with the events. One or more display attributes of each arc may further depend on other data associated with the corresponding events. For example, each arc of a circular time may be displayed at a particular radial distance, with a particular thickness, using a particular shading and/or color, etc., depending on various data values associated with the one or more events represented by the arc.

    SYSTEMS AND METHODS FOR CORRECTING TIMESTAMPS ON DATA RECEIVED FROM UNTRUSTED DEVICES
    152.
    发明申请
    SYSTEMS AND METHODS FOR CORRECTING TIMESTAMPS ON DATA RECEIVED FROM UNTRUSTED DEVICES 有权

    公开(公告)号：US20170083552A1

    公开(公告)日：2017-03-23

    申请号：US14859345

    申请日：2015-09-20

    Applicant: Google Inc.

    Inventor： Dan Abolafia ,  Igor Naverniouk

    IPC: G06F17/30

    CPC classification number: G06F11/3476 ,  G06F17/30306 ,  G06F17/30353 ,  G06F17/40 ,  G06F2201/835 ,  G06F2201/86

    Abstract: Aspects of the technology include receiving (202) an event log of events, each that are associated with wall clock and uptime clock timestamps, and extracting (204) a currently analyzed event from the event log. Further, aspects include associating (208) a processor time to the currently analyzed event as a trusted event time if the event is the first event. Aspects include calculating (212) an elapsed time from wall clock times associated with an immediately preceding event and the currently analyzed event where the immediately preceding event is a boot log event. Further aspects can include calculating (214) the elapsed time from uptime clock times associated with the immediately preceding event and the currently analyzed event where the immediately preceding event is not a boot log event. Finally, aspects can include calculating (216) a trusted time by deducting the elapsed time from a trusted event time.

    System and Method for Time Parameter Based Database Restoration
    153.
    发明申请
    System and Method for Time Parameter Based Database Restoration 审中-公开
    基于时间参数的数据库恢复系统与方法

    公开(公告)号：US20170075764A1

    公开(公告)日：2017-03-16

    申请号：US15139177

    申请日：2016-04-26

    Applicant: Richard Banister

    Inventor： Richard Banister

    IPC: G06F11/14

    CPC classification number: G06F11/1448 ,  G06F11/1451 ,  G06F11/1469 ,  G06F2201/80 ,  G06F2201/835 ,  G06F2201/84

    Abstract: A system and method are provided for the recovery and restoration of software records of a database server to record iterations previous to the current state of the selected records. This action may be taken in order to overcome the consequences of database corruption. An event-time may be designated which is applied to select some or all of the earlier but most recent versions of each selected record. The system and method presented include a local target database for the purpose of recording software records to an archive, and may include a remote source database, from which records may be transmitted to the local target database. A restore command may be detected by the database server as sent from the remote source server, as received in an electronic message, as received via an electronics communications network, or as directly input. The local target database may have access to multiple iterations or versions of a software record including the original record version as stored in an archive, and may, upon instruction or command, revert to a previous iteration of a software record stored in the archive if corruption of later iterations is suspected. Alternatively or additionally, the local target database may not be restored with earlier versions of records but the remote source database may be restored with the selected record versions. The software records may optionally be updated in a batch method, or may alternatively be updated in real time, as the software records are created.

    Abstract translation: 提供了一种系统和方法，用于恢复和恢复数据库服务器的软件记录，以记录所选记录的当前状态之前的迭代。 为了克服数据库损坏的后果，可采取这一行动。 可以指定事件时间，其被应用于选择每个所选记录的早期但最新版本的一些或全部。 所呈现的系统和方法包括用于将软件记录记录到存档的本地目标数据库，并且可以包括远程源数据库，可以从其发送记录到本地目标数据库。 数据库服务器可以通过电子通信网络接收到的电子消息中接收到的数据库服务器或远程源服务器作为直接输入来检测恢复命令。 本地目标数据库可以访问包括存储在归档中的原始记录版本的软件记录的多个迭代或版本，并且可以在指令或命令时恢复到存储在存档中的软件记录的先前迭代，如果腐败 以后的迭代被怀疑。 或者或另外，本地目标数据库可能不能与早期版本的记录一起还原，但远程源数据库可以使用所选记录版本进行还原。 随着软件记录被创建，软件记录可以可选地以批处理方式更新，或者可替代地实时更新。

    Synchronization of domain counters
    154.
    发明授权
    Synchronization of domain counters 有权
    域计数器的同步

    公开(公告)号：US09541949B2

    公开(公告)日：2017-01-10

    申请号：US14492179

    申请日：2014-09-22

    Applicant: Intel Corporation

    Inventor： Tal Kuzi ,  Nadav Shulman ,  Ofer J. Nathan ,  Ori Levy ,  Itai Feit

    IPC: G06F1/14 ,  G06F11/16 ,  G06F9/50

    CPC classification number: G06F1/14 ,  G06F9/50 ,  G06F11/1658 ,  G06F2201/835

    Abstract: In an embodiment, a processor includes a master counter to store a time stamp count for the processor, and multiple cores each including a core counter to store core time stamp counts. The processor also includes synchronization logic to, in response to a de-synchronization event in a core: obtain a value of the master counter; initiate a first core counter using the value of the master counter, where the first core counter is included in the first core; compare a synchronization digit of the first core counter to a synchronization signal indicating a value of a synchronization digit of the master counter; and in response to a determination that the synchronization digit does not match the synchronization signal, adjust a first subset of digits of the first core counter based on a latency value of the synchronization signal. Other embodiments are described and claimed.

    Abstract translation: 在一个实施例中，处理器包括用于存储处理器的时间戳计数的主计数器，以及多个核心，每个核心包括用于存储核心时间戳计数的核心计数器。 处理器还包括响应于核心中的去同步事件的同步逻辑：获得主计数器的值; 使用主计数器的值来启动第一核心计数器，其中第一核心计数器包括在第一核心中; 将第一核心计数器的同步数字与指示主计数器的同步数字的值的同步信号进行比较; 并且响应于所述同步数字与所述同步信号不匹配的确定，基于所述同步信号的等待时间值来调整所述第一核心计数器的第一数字子集。 描述和要求保护其他实施例。

    Data gap management in a remote data mirroring system
    155.
    发明申请
    Data gap management in a remote data mirroring system 审中-公开
    远程数据镜像系统中的数据间隙管理

    公开(公告)号：US20160378617A1

    公开(公告)日：2016-12-29

    申请号：US15261952

    申请日：2016-09-11

    Applicant: Axxana (Israel) Ltd.

    Inventor： Alex Winokur

    IPC: G06F11/14 ,  G06F3/06 ,  G06F11/20

    CPC classification number: G06F11/1471 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F11/1474 ,  G06F11/2058 ,  G06F11/2074 ,  G06F2201/805 ,  G06F2201/82 ,  G06F2201/835

    Abstract: A method includes monitoring a sequence of transactions in one or more volumes. The transactions are transferred to a primary storage (112) in a given order, and are replicated to a secondary storage (114). The volumes belong to a volume group (204) for which the transactions are guaranteed to be replicated while retaining the given order. Artificial write transactions (228) are periodically issued to a protection application field, which is predefined in a given volume (212) belonging to the volume group. Records indicative of the transactions, including the artificial transactions, are stored in a disaster-proof storage unit (144). Upon verifying that a given artificial transaction has been successfully replicated in the secondary storage, the records corresponding to the given artificial write transaction and the transactions that precede it in the sequence are deleted from the disaster-proof storage unit.

    Abstract translation: 一种方法包括监视一个或多个卷中的事务序列。 事务以给定的顺序被传送到主存储器（112），并被复制到辅助存储器（114）。 这些卷属于一个卷组（204），保留给定的顺序，保证交易的复制。 周期性地将人造写入事务（228）发布到属于卷组的给定卷（212）中预定义的保护应用字段。 表示交易的记录（包括人为交易）被存储在防灾存储单元（144）中。 在验证给定人造事务已经在辅助存储器中被成功复制的情况下，从防灾存储单元中删除与给定人造写入事务相对应的记录以及其中的顺序前的事务。

    Collective operation management in a parallel computer
    158.
    发明授权
    Collective operation management in a parallel computer 有权
    并行计算机中的集体操作管理

    公开(公告)号：US09461874B2

    公开(公告)日：2016-10-04

    申请号：US13827082

    申请日：2013-03-14

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Charles J. Archer ,  James E. Carey ,  Philip J. Sanders ,  Brian E. Smith

    IPC: G06F15/173 ,  H04L12/24 ,  G06F11/30 ,  G06F1/32 ,  G06F11/34

    CPC classification number: H04L41/00 ,  G06F1/32 ,  G06F11/30 ,  G06F11/3419 ,  G06F15/17318 ,  G06F2201/835 ,  Y02D10/34

    Abstract: Methods, apparatuses, and computer program products for collective operation management in a parallel computer are provided. Embodiments include a parallel computer having a first compute node operatively coupled for data communications over a tree data communications network with a plurality of child compute nodes. Embodiments also include each child compute node performing a first collective operation. The first compute rode, for each child compute node, receives from the child compute node, a result of the first collective operation performed by the child compute node. For each result received from a child compute node, the first compute node stores a timestamp indicating a time that the child compute node completed the first collective operation. The first compute node also manages, based on the stored timestamps, execution of a second collective operation over the tree data communications network.

    Abstract translation: 提供并行计算机中集体运行管理的方法，装置和计算机程序产品。 实施例包括具有第一计算节点的并行计算机，该第一计算节点可操作地耦合以用于通过树数据通信网络与多个子计算节点进行数据通信。 实施例还包括执行第一集合操作的每个子计算节点。 对于每个子计算节点，第一计算路径从子计算节点接收由子计算节点执行的第一集合操作的结果。 对于从子计算节点接收的每个结果，第一计算节点存储指示子计算节点完成第一集合操作的时间的时间戳。 第一计算节点还基于所存储的时间戳管理在树数据通信网络上执行第二集合操作。

    DETERMINING A COST OF AN APPLICATION
    160.
    发明申请
    DETERMINING A COST OF AN APPLICATION 审中-公开
    确定应用的成本

    公开(公告)号：US20160225043A1

    公开(公告)日：2016-08-04

    申请号：US14611918

    申请日：2015-02-02

    Applicant: LinkedIn Corporation

    Inventor： Cuong Tran ,  Badrinath Sridharan ,  Christopher Coleman ,  Toon Sripatanaskul ,  Thomas Goetze

    IPC: G06Q30/02 ,  G06F9/54 ,  H04L12/26

    CPC classification number: G06Q30/0283 ,  G06F8/34 ,  G06F8/71 ,  G06F11/3006 ,  G06F11/3433 ,  G06F11/3452 ,  G06F11/3466 ,  G06F11/362 ,  G06F11/3636 ,  G06F2201/835 ,  H04L41/064 ,  H04L43/0852

    Abstract: Techniques for generating and using service call graphs are provided. In one technique, trace data items generated by different services are correlated to generate a service call graph. Trace data indicates when certain services are called and their respective latencies as a result of a client request. A service call graph may reflect a single trace or multiple traces over a particular period of time. A service call graph may be analyzed to inform administrators of a web site how a web application and the services it relies on are performing. A service call graph may be used to determine whether there are sufficient resources to support a projected increase in traffic to a web application. A service call graph may be used to estimate a cost of a web application. Multiple service call graphs may be compared to determine one or more root causes of a performance problem.

    Abstract translation: 提供了生成和使用服务调用图的技术。 在一种技术中，由不同服务生成的跟踪数据项被相关联以生成服务调用图。 跟踪数据表示何时调用某些服务，以及由于客户端请求而产生的相应延迟。 服务调用图可以在特定时间段内反映单个跟踪或多个跟踪。 可以分析服务调用图，以通知网站的管理员Web应用程序及其依赖的服务正在执行。 可以使用服务调用图来确定是否有足够的资源来支持对web应用的流量的预计增加。 可以使用服务调用图来估计web应用的成本。 可以比较多个服务调用图来确定性能问题的一个或多个根本原因。

Patent Agency Ranking