公开(公告)号：US08260751B2

公开(公告)日：2012-09-04

申请号：US12190247

申请日：2008-08-12

Applicant: William D. Johnson ,  Darel R. Stokes ,  David G. North ,  Robert Yellin

Inventor： William D. Johnson ,  Darel R. Stokes ,  David G. North ,  Robert Yellin

IPC: G06F17/30

CPC classification number: G06F11/3495 ,  G06F11/3476 ,  G06F2201/835 ,  G06F2221/2101 ,  H04L43/04 ,  H04L43/106

Abstract: In certain embodiments, a method for log file time sequence stamping is provided. The method includes connecting to a console port of one or more data sources and receiving data from the data sources. The data may be logged with both an independent time stamp and a sequence indicator. The independent time stamp provides a consistent time stamp of when the data was received at the system and the time sequence indicator represents an order in which the data was received at the system.

Abstract translation: 在某些实施例中，提供了用于日志文件时间序列冲压的方法。 该方法包括连接到一个或多个数据源的控制台端口并从数据源接收数据。 可以使用独立的时间戳和序列指示符来记录数据。 独立时间戳提供了在系统中接收到数据的时间标记，时间序列指示符表示系统接收到数据的顺序。

公开(公告)号：US20120151488A1

公开(公告)日：2012-06-14

申请号：US13307338

申请日：2011-11-30

Applicant: Mauro Arcese ,  Antonio Perrone ,  Sandro Piccinini ,  Stefano Sidoti

Inventor： Mauro Arcese ,  Antonio Perrone ,  Sandro Piccinini ,  Stefano Sidoti

IPC: G06F9/46

CPC classification number: G06F9/45504 ,  G06F3/04812 ,  G06F9/4881 ,  G06F11/34 ,  G06F11/3419 ,  G06F11/3476 ,  G06F11/36 ,  G06F2201/835 ,  G06F2201/87

Abstract: A mechanism modifies a deployment descriptor of each application component including at least one producer application component or consumer application component, by adding, for each producer application component or consumer application component, an application component identifier, a producer or consumer type, and a recipient identifier of a recipient the application component uses. Responsive to determining a match exists and the given application component is of producer type, the application server virtual machine logs an identifier of a recipient containing a message sent by the given application component, a correlation identifier of the given application component, and an execution start time. Responsive to determining a match exists and the given application component is of consumer type, the application server virtual machine logs an identifier of the recipient resource containing a message processed by the given application component, a correlation identifier of the given application component, and an execution end time.

Abstract translation: 机制通过针对每个生产者应用程序组件或消费者应用程序组件添加应用程序组件标识符，生产者或消费者类型以及接收者标识符来修改包括至少一个生产者应用程序组件或消费者应用程序组件的每个应用程序组件的部署描述符 应用程序组件使用的收件人。 响应于确定匹配存在并且给定应用组件是生产者类型，应用服务器虚拟机记录包含由给定应用组件发送的消息的接收者的标识符，给定应用组件的相关标识符和执行开始 时间。 响应于确定匹配存在并且给定的应用组件是消费者类型，应用服务器虚拟机记录包含由给定应用组件处理的消息的接收者资源的标识符，给定应用组件的相关标识符和执行 时间结束。

公开(公告)号：US20120005163A1

公开(公告)日：2012-01-05

申请号：US13234883

申请日：2011-09-16

Applicant: Matthew A. Ahrens ,  Mark J. Maybee

Inventor： Matthew A. Ahrens ,  Mark J. Maybee

IPC: G06F17/30

CPC classification number: G06F11/1451 ,  G06F11/1435 ,  G06F2201/835

Abstract: A method for backing up a file system, including obtaining a first indirect block comprising a first block pointer, obtaining a first birth time from the first block pointer, determining whether the first birth time is subsequent to a time of a last backup, and backing up a first block referenced by the first block pointer, if the first birth time is subsequent to the time of the last backup.

Abstract translation: 一种用于备份文件系统的方法，包括获得包括第一块指针的第一间接块，从第一块指针获取第一个出生时间，确定第一个出生时间是否在最后一个备份的时间之后，以及后台 如果第一个出生时间在上次备份的时间之后，则建立第一个块指针引用的第一个块。

公开(公告)号：US08046553B1

公开(公告)日：2011-10-25

申请号：US12609886

申请日：2009-10-30

Applicant: Raghu Krishnamurthy

Inventor： Raghu Krishnamurthy

IPC: G06F13/00

CPC classification number: G06F11/1469 ,  G06F11/1435 ,  G06F11/1456 ,  G06F11/1461 ,  G06F11/1474 ,  G06F2201/835

Abstract: An apparatus and method for faster recovery of validated continuous data protection time images. In one embodiment of the method, an image validation process is initiated. In response, a first write transaction is generated for writing first new data to a first image of a data object that existed at prior time T1. The first new data is written to a first storage. Thereafter data contents of the first storage are copied to a first memory object. Finally, the first memory object is linked with the first image.

Abstract translation: 一种用于更快恢复经过验证的连续数据保护时间图像的装置和方法。 在该方法的一个实施例中，启动图像验证过程。 作为响应，生成用于将第一新数据写入到在先前时间T1存在的数据对象的第一图像的第一写事务。 第一个新数据被写入第一个存储。 此后，第一存储器的数据内容被复制到第一存储器对象。 最后，第一个内存对象与第一个图像相关联。

公开(公告)号：US20110246651A1

公开(公告)日：2011-10-06

申请号：US13164737

申请日：2011-06-20

Applicant: Gueorgui N. Djabarov ,  Yevgeniy Gutnik ,  Omer Shakil

Inventor： Gueorgui N. Djabarov ,  Yevgeniy Gutnik ,  Omer Shakil

IPC: G06F15/173

CPC classification number: G06F11/3495 ,  G06F11/3075 ,  G06F11/3476 ,  G06F2201/835 ,  G06F2201/86

Abstract: Event information with respect to events that occur at a client is recorded. A current client real time clock (RTC) timestamp at the occurrence of each event is also recorded. Each event is assigned a unique sequence identification. Event data including the event information and the associated RTC timestamp and sequence identification information are transmitted to a server. The server reconstructs at least one of: a chronological order of the events on the client and the time when each event occurred at the client.

Abstract translation: 记录与在客户端发生的事件有关的事件信息。 还记录每个事件发生时的当前客户端实时时钟（RTC）时间戳。 每个事件都被分配一个唯一的序列识别。 包括事件信息和关联的RTC时间戳和序列识别信息的事件数据被发送到服务器。 服务器重建以下至少一个：客户端上的事件的时间顺序和每个事件在客户端发生的时间。

公开(公告)号：US20110246418A1

公开(公告)日：2011-10-06

申请号：US12754622

申请日：2010-04-06

Applicant: Philip Daniel Piwonka ,  Lev Novik ,  Sudarshan Anand Chitre

Inventor： Philip Daniel Piwonka ,  Lev Novik ,  Sudarshan Anand Chitre

IPC: G06F17/30

CPC classification number: G06F11/1446 ,  G06F11/006 ,  G06F11/14 ,  G06F11/1435 ,  G06F11/1464 ,  G06F11/1469 ,  G06F17/30309 ,  G06F2201/835 ,  H04L67/1095 ,  H04L69/40

Abstract: Architecture for restoring nodes. After restoring a node, fix-up occurs to make the node appears as a different node than before the restore operation. The node appears as a new node, which new node knows the data up to a certain point from when the new node had the prior identity. This allows for new changes generated by the new node to flow to the other nodes in the topology, as well as have the changes that the prior identity sent to other nodes flow back to the new node. In other words, the architecture maintains information to create the new node in the topology while maintaining prior data knowledge. Additionally, item level metadata of associated data items is updated to correlate with the updated data items so that changes can be correctly enumerated and applied. This metadata update occurs across scopes of which the data items are included.

Abstract translation: 用于恢复节点的体系结构。 恢复节点后，会发生修复，使节点出现与恢复操作之前不同的节点。 该节点显示为新节点，新节点从新节点具有先前身份时就知道数据到达某一点。 这允许新节点生成的新更改流向拓扑中的其他节点，以及发送到其他节点的先前身份流向新节点的更改。 换句话说，架构维护信息以在拓扑中创建新节点，同时保持先前的数据知识。 此外，相关联的数据项的项目级元数据被更新以与更新的数据项相关联，使得可以正确列举和应用改变。 此元数据更新发生在包含数据项的范围内。

公开(公告)号：US08028194B2

公开(公告)日：2011-09-27

申请号：US12179591

申请日：2008-07-25

Applicant: Rajeev Atluri ,  Srin Kumar ,  Sridhara Lanka ,  Jayesh Shah ,  Satish Kumar

Inventor： Rajeev Atluri ,  Srin Kumar ,  Sridhara Lanka ,  Jayesh Shah ,  Satish Kumar

IPC: G06F11/00

CPC classification number: G06F11/0751 ,  G06F11/0727 ,  G06F11/1464 ,  G06F2201/82 ,  G06F2201/835

Abstract: A method, apparatus, and system of a sequencing technique to account for a clock error in a storage area network are disclosed. In one embodiment, a system of a backup server includes a processing module to examine a data timestamped with a sequence of characters denoting a time according to a clock source, an analysis module to determine that the data has been timestamped at an earlier time than an other data previously received, a substitution module to provide the data an incremental sequence number placed with the data using an algorithm until a new data is received that includes a future timestamp with a later timestamp than the timestamp of the other data, and a storage module to store the data.

Abstract translation: 公开了一种用于考虑存储区域网络中的时钟误差的排序技术的方法，装置和系统。 在一个实施例中，备份服务器的系统包括处理模块，用于根据时钟源来检查表示时间的字符序列带有时间戳的数据;分析模块，用于确定数据已经比早于时间源的时间戳 替代模块，用于使用算法向数据提供与数据一起放置的增量序列号，直到接收到包括具有比其他数据的时间戳更晚的时间戳的未来时间戳的新数据，以及存储模块 存储数据。

公开(公告)号：US20110219376A1

公开(公告)日：2011-09-08

申请号：US12929743

申请日：2011-02-14

Applicant: Michael John Williams ,  John Michael Hallman ,  Edmond John Simon Ashfield

Inventor： Michael John Williams ,  John Michael Hallman ,  Edmond John Simon Ashfield

IPC: G06F9/44

CPC classification number: G06F11/3466 ,  G06F11/348 ,  G06F2201/835

Abstract: The present invention relates to the field of data processing, in particular, a method, apparatus 1 and trace module 12 for generating timestamps while tracing characteristics of a data processing apparatus or processing being performed by the data processing apparatus. When a predetermined event occurs, a timestamp request flag 18 is set to indicate that a timestamp request is pending. Upon generation of a following trace packet, it is determined whether the timestamp request flag indicates that a timestamp request is pending, and if a request is pending then a timestamp is generated corresponding to the following trace packet, and the timestamp request flag is set to indicate that there is no pending timestamp request.

Abstract translation: 数据处理领域本发明涉及一种数据处理领域，特别涉及用于在跟踪数据处理装置的特性或由数据处理装置执行的处理时产生时间戳的方法，装置1和跟踪模块12。 当发生预定事件时，设置时间戳请求标志18以指示时间戳请求正在等待。 在生成跟踪跟踪数据包时，确定时间戳请求标志是否指示时间戳请求正在等待，如果请求正在等待，则生成对应于以下跟踪数据包的时间戳，并将时间戳请求标志设置为 表示没有待处理的时间戳请求。

公开(公告)号：US07984238B2

公开(公告)日：2011-07-19

申请号：US12219748

申请日：2008-07-28

Applicant: Kazutaka Ogihara ,  Yoshihiro Tsuchiya ,  Masahisa Tamura ,  Tetsutaro Maruyama ,  Kazuichi Oe ,  Takashi Watanabe ,  Tatsuo Kumano

Inventor： Kazutaka Ogihara ,  Yoshihiro Tsuchiya ,  Masahisa Tamura ,  Tetsutaro Maruyama ,  Kazuichi Oe ,  Takashi Watanabe ,  Tatsuo Kumano

IPC: G06F12/00 ,  G06F3/06

CPC classification number: G06F11/2094 ,  G06F11/2071 ,  G06F2201/835

Abstract: A storage-management apparatus and method that manages storage areas. The storage-management apparatus includes a collecting unit that collects valid-area-determination information items, each of which shows whether a corresponding one of the storage areas is a valid or invalid area, and timestamp information items, each of which shows that a corresponding one of the storage areas has been accessed. In accordance with the valid-area-determination information items and the timestamp information items, data from a storage area which is selected from among valid areas and whose timestamp information item is oldest is copied to a storage area which is selected from among invalid areas and whose timestamp information item is oldest, and timestamp information items and valid-area-determination information items concerning the storage area from which the data is copied and concerning the storage area to which the data is copied is updated.

Abstract translation: 一种管理存储区域的存储管理装置和方法。 存储管理装置包括收集单元，其收集有效区域确定信息项目，每个存储区域确定信息项目显示相应的一个存储区域是有效区域还是无效区域，以及时间戳信息项目，每个时间戳记信息项目显示相应的 其中一个存储区已被访问。 根据有效区域确定信息项和时间戳信息项，将从有效区域中选择的时间戳信息项最早的存储区域的数据复制到从无效区域中选择的存储区域， 其时间戳信息项最早，并且更新与数据被复制的存储区域有关的涉及复制数据的存储区域的时间戳信息项和有效区域确定信息项。

公开(公告)号：US07937543B2

公开(公告)日：2011-05-03

申请号：US11857513

申请日：2007-09-19

Applicant: Bernard R Pierce ,  Elpida Tzortzatos ,  Dieter Wellerdiek

Inventor： Bernard R Pierce ,  Elpida Tzortzatos ,  Dieter Wellerdiek

IPC: G06F12/00

CPC classification number: G06F12/123 ,  G06F11/3419 ,  G06F11/3433 ,  G06F2201/81 ,  G06F2201/835 ,  G06F2201/88

Abstract: A method for automatically determining performance problems in a computer system due to a metric indicating a current memory peak load in the computer system is disclosed. In order to decrease CPU consumption in large memories it is proposed to perform the steps of: a) using a cyclic stealing algorithm used in prior art for stealing subunits, if the subunits were not referenced since the last cycle and writing the subunits to a secondary memory device, with an extension for determining the age of memory subunits, wherein the extension comprises the steps of: b) writing time stamps for a subselection of the memory subunits to a data storage always when the stealing routine has processed a subselection, wherein the current time of a current cycle and the preceding current time of a preceding cycle are stored in respective entries of the data storage, for generating age information for the memory subunits, c) calculating the metric based on average age calculations including differences between a respective one of the current time and a respective one of the preceding current time of one or more of the table entries, d) determining the occurrence of a peak load, when the metric is beyond a predetermined threshold level.

Abstract translation: 公开了一种用于在计算机系统中自动确定由于指示计算机系统中的当前存储器峰值负载的度量的度量而导致的性能问题的方法。 为了降低大存储器中的CPU消耗，建议执行以下步骤：a）使用现有技术中用于窃取子单元的循环窃取算法，如果从上次循环以来未参考子单元并将子单元写入次级 存储器设备，具有用于确定存储器子单元的年龄的扩展，其中所述扩展包括以下步骤：b）当所述窃取程序已经处理子选择时，总是将所述存储器子单元的子选择的时间戳写入数据存储器，其中， 当前周期的当前时间和前一周期的先前当前时间被存储在数据存储器的相应条目中，用于生成存储器子单元的年龄信息，c）基于平均年龄计算来计算包括相应一个 以及当前时间的一个或多个的前一当前时间中的相应一个，d）确定峰值的出现 当度量超过预定阈值水平时。