Ca, Inc.

Ai Huang

Hai Feng Liu

According to one embodiment of the present disclosure, a method for multiplex backup using next relative addresses may be provided. The method may include receiving a first chunk and a second chunk that are each associated with a first file. A next relative address may be appended to the first chunk. The next relative address may indicate a position in a storage device. The first chunk with the next relative address may be written to the storage device at a first address. The method may further include writing the second chunk to the storage device at the position indicated by the next relative address of the first chunk.

Multiplex backup using next relative addressing

A service level management document is modeled by a multi-path, navigable graph. The graph is comprised of nodes connected by lines where each node represents part of a modeled service level management document and each line represents the relationship between connected nodes. Each node has a predetermined shape that corresponds to the role of each node in the graph, such as by designating whether the node is a root node, branch node, leaf node, or branch graph node. Moreover, the shape can distinguish whether the node is optional or required. The background color of each node is indicative of the state of the information within a configuration page linked to a corresponding node. The configuration pages of a graph collectively describe the content of the modeled service level management document.

Navigable graph of a service level management document

A next task in a queue of tasks is considered for execution. In response to the next task having no dependent tasks, executing the next task. In response to the next task having dependent tasks, wherein the dependent tasks have been executed, executing the next task. In response to the next task having dependent tasks that have not completed execution, placing the next task into the set of waiting tasks. In response to placing the next task into the set of waiting tasks, determining if each dependent task of the next task is in the set of unfinished dependent tasks, placing each dependent task of the next task that is not in the set of unfinished dependent tasks into the set of unfinished dependent tasks, and establishing a link between the next task and each of its dependent tasks in the set of unfinished dependent tasks.

Scheduling periodic tasks with dependencies and determining improper loop dependencies between tasks placed in a waiting tasks set and in a unfinished dependent tasks set

A computer system monitors the execution time of each of a plurality of tasks over a plurality of time periods. The system receives a first input that selects a particular time period from the plurality of time periods, and further monitors the execution time of the plurality of tasks in the selected time period. The system receives a second input that selects a particular task from the particular time period, and monitors the execution time of the particular task in the particular time period.

Monitoring overtime of tasks

According to one embodiment of the present disclosure, a method for multiplex restore using next relative address may be provided. The method may include identifying an address of a first data chunk of a file stored on a storage device. The first data chunk may be read by accessing the storage device at the address of the first data chunk. A next relative address appended to the first data chunk may be identified. The next relative address may indicate a position of a next chunk. The next chunk may comprise a next data chunk of the file or an empty chunk associated with the file. The method may further include reading the next chunk by accessing the storage device at the position indicated by the next relative address.

Growing community of inventors

Beijing, China

Ai Huang