公开(公告)号：US08099396B1

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

申请号：US12576363

申请日：2009-10-09

Applicant: Yoram Novick ,  Erez Webman

Inventor： Yoram Novick ,  Erez Webman

IPC: G06F17/30

CPC classification number: G06F17/30312 ,  G06F17/30227 ,  Y10S707/99953 ,  Y10S707/99955

Abstract: A system and method enhances performance of a log adapted for use with a storage system. The log is illustratively organized into a plurality of regions, wherein each region comprises one or more entries and wherein each region is allocated to a consistency collection. As used herein, a consistency collection is defined as a set of one or more data containers among which it is desired to maintain transaction consistency, i.e., atomicity of updates of a transaction to those containers. Each entry of the region is adapted to store an update of data from a source, e.g., an application executing on the storage system. Thus, the consistency collection may comprise multiple data containers associated with one or more applications configured to maintain the atomicity of transaction updates to the collection of containers.

Abstract translation: 系统和方法提高适用于存储系统的日志的性能。 日志被示例性地组织成多个区域，其中每个区域包括一个或多个条目，并且其中每个区域被分配给一致性集合。 如本文所使用的，一致性集合被定义为一组一个或多个数据容器，其中希望维持事务一致性，即事务更新到这些容器的原子性。 该区域的每个条目适于存储来自源的数据的更新，例如在存储系统上执行的应用。 因此，一致性集合可以包括与被配置为将事务更新的原子性维持到容器的集合的一个或多个应用相关联的多个数据容器。

公开(公告)号：US06810523B2

公开(公告)日：2004-10-26

申请号：US09917720

申请日：2001-07-31

Applicant: Danit Segev ,  Gabriel Walder ,  Yoram Novick ,  Yigal Eisinger

Inventor： Danit Segev ,  Gabriel Walder ,  Yoram Novick ,  Yigal Eisinger

IPC: G06F954

CPC classification number: G06F9/4486

Abstract: A method that uses a single callback function for a multiphase service with possible discontinuation of execution between the phases. The method is based on assignment of a case in the callback function for each phase or state of the service and a stack of state descriptors. At each call to the callback function, the top descriptor is popped off the stack and the appropriate case in the callback function is run.

Abstract translation: 对于多相服务使用单个回调函数的方法，可能会中断执行阶段之间的执行。 该方法基于对于服务的每个阶段或状态和状态描述符的堆栈在回调函数中的分配。 在每次调用回调函数时，顶层描述符都从堆栈中弹出，并且回调函数中的适当大小写被运行。

公开(公告)号：US6148383A

公开(公告)日：2000-11-14

申请号：US112896

申请日：1998-07-09

Applicant: William Frank Micka ,  Yoram Novick

Inventor： William Frank Micka ,  Yoram Novick

IPC: G06F11/20 ,  G06F12/00

CPC classification number: G06F11/2074 ,  G06F11/2064

Abstract: A data storage system employs a universal timer to perform asynchronous peer-to-peer data mirroring, where primary and secondary controllers cooperatively perform periodic consistency checks according to the universal timer. The system includes multiple primary storage controllers each having a counterpart secondary controller. Primary and secondary controllers access a universal timer, such as a global positioning system (GPS). Each primary controller receives updates, and stores the updates in an order, providing each update with a sequence code according to its storage order. Each primary controller also transmits the updates and corresponding sequence codes to its secondary controller. Each secondary controller receives updates from its counterpart primary storage controller and stores the updates in a journal. Whenever a periodic timer interval of the universal timer expires, several things happen. Each primary controller sends its counterpart secondary controller a confirmation message useful in identifying all updates that were sent in the expired interval. Also, each secondary controller checks for receipt of the confirmation message, and if received, the secondary controller checks the journal for presence of all updates identified by the confirmation message. If each secondary controller finds all identified updates in its journal, all secondary controllers proceed to commit the journaled updates to secondary storage.

Abstract translation: 数据存储系统采用通用定时器来执行异步对等数据镜像，其中主控和辅助控制器根据通用定时器协同执行定期一致性检查。 该系统包括多个主存储控制器，每个具有对应的二级控制器。 主控制器和次控制器访问通用定时器，例如全球定位系统（GPS）。 每个主控制器接收更新，并按顺序存储更新，根据其存储顺序为每个更新提供序列码。 每个主控制器还将更新和相应的序列码发送到其次控制器。 每个辅助控制器从其对应的主存储控制器接收更新并将更新存储在日志中。 每当通用定时器的周期性定时器间隔过期时，会发生几件事情。 每个主控制器发送对应的辅助控制器一个确认消息，用于标识在过期间隔内发送的所有更新。 此外，每个次级控制器检查确认消息的接收，并且如果接收到，则辅助控制器检查日志以存在由确认消息标识的所有更新。 如果每个辅助控制器在其日志中查找所有标识的更新，则所有辅助控制器都会继续将日志更新提交到辅助存储。

公开(公告)号：US5940615A

公开(公告)日：1999-08-17

申请号：US799815

申请日：1997-02-13

Applicant: Yoram Novick ,  Ron Yair Pinter ,  Michael Rodeh ,  Alan Jay Wecker

Inventor： Yoram Novick ,  Ron Yair Pinter ,  Michael Rodeh ,  Alan Jay Wecker

IPC: G06F9/06 ,  G06F9/44 ,  G06F9/445

CPC classification number: G06F8/33

Abstract: Disclosed is a programming aid for enabling a computer program in source code form to be viewed using a general purpose document browser, which browser is responsive to a defined set of control tags determining the appearance of a document thereon, the programming aid comprising: a parser for generating a symbol table from an input file in which the program is stored; means to derive control tag locations from the symbol table; and an output file generator for inserting control tags into the program at the derived locations to generate an output file which can be viewed using the general purpose document browser. In this way, the full power of available general purpose document browsers may be used in software development and maintenance to view programs in a convenient way. A tool is provided that automatically marks up a program with control tags so that users are free to use the document browser of their choice as a powerful program browser.

Abstract translation: 公开了一种用于使得能够使用通用文档浏览器来查看源代码形式的计算机程序的编程辅助装置，该通用文档浏览器响应于确定其上的文档外观的一组定义的控制标签，编程辅助装置包括：解析器 用于从存储该程序的输入文件生成符号表; 用于从符号表导出控制标签位置的装置; 以及输出文件生成器，用于在导出的位置处将控制标签插入到程序中，以生成可以使用通用文档浏览器来查看的输出文件。 这样，可用的通用文档浏览器的全部功能可以用于软件开发和维护，以方便的方式查看程序。 提供了一种工具，可以使用控件标签自动标记程序，以便用户可以自由使用他们选择的文档浏览器作为强大的程序浏览器。

公开(公告)号：US5644791A

公开(公告)日：1997-07-01

申请号：US241982

申请日：1994-05-11

Applicant: James T. Brady ,  Joe-Ming Cheng ,  Oded Cohn ,  James W. Eldridge ,  Yoram Novick ,  Norman K. Ouchi ,  Danit Segev

Inventor： James T. Brady ,  Joe-Ming Cheng ,  Oded Cohn ,  James W. Eldridge ,  Yoram Novick ,  Norman K. Ouchi ,  Danit Segev

IPC: H04N13/04 ,  G02B27/22 ,  G06F3/06 ,  G09G3/02 ,  G11B20/00 ,  H04N13/00 ,  G06F13/00

CPC classification number: G11B20/00007 ,  G02B27/2271 ,  H04N13/0422 ,  H04N13/0488 ,  H04N13/0497 ,  H04N13/0203 ,  H04N13/0434 ,  H04N13/0438 ,  H04N13/0459

Abstract: A method for operating a data storage system that is comprised of at least one disk. The method includes a step of partitioning a data compression unit into n basic compression units, where n is greater than one. Each data compression unit is comprised of a plurality of disk sectors and each of n basic compression units begins with a different initial sector. A next step partitions the data compression unit into X intervals, where X is less than n. Each of the X intervals begins with a different initial sector and within one of the n basic compression units. Further steps of the method include storing, external to the at least one disk, a plurality of first pointers each of which points to the initial sector of one of the n basic compression units wherein the 1/X, 2/X, . . . , (X-1)/X intervals begin; storing, within each of the initial sectors of the individual ones of the n basic compression units wherein the 1/X, 2/X, . . . , (X-1)/X intervals begin, a second pointer to the initial sector of the interval that begins within the basic compression unit; and, in response to a disk read operation that reads a compressed data unit that begins with one of the sectors that is located within one of the X intervals, accessing the beginning sector of the compressed data unit in accordance with one of the first pointers and one of the second pointers. The step of allocating includes a step of determining an actual compression ratio for the record, determining a value of a longest run of identical characters within the record, and adjusting the actual compression ratio based on the value of the longest run of identical characters. The step of allocating also includes a step of adding at least one additional sector to the estimated number to enable the compressed record to be subsequently updated in place.

Abstract translation: 一种用于操作由至少一个盘组成的数据存储系统的方法。 该方法包括将数据压缩单元划分成n个大于1的基本压缩单元的步骤。 每个数据压缩单元由多个磁盘扇区组成，并且n个基本压缩单元中的每一个以不同的初始扇区开始。 下一步将数据压缩单元分成X个间隔，其中X小于n。 X间隔中的每一个以不同的初始扇区和n个基本压缩单元之一开始。 该方法的另外的步骤包括在至少一个盘的外部存储多个第一指针，每个第一指针指向n个基本压缩单元之一的初始扇区，其中1 / X，2 / X，...。 。 。 ，（X-1）/ X间隔开始; 存储在其中1 / X，2 / X，...的n个基本压缩单元中的各个初始扇区的每个初始扇区内。 。 。 ，（X-1）/ X间隔开始，指向在基本压缩单元内开始的间隔的初始扇区的第二指针; 并且响应于读取从位于所述X个间隔之一内的扇区之一开始的压缩数据单元的磁盘读取操作，根据所述第一指针和/或所述第一指针之一访问所述压缩数据单元的开始扇区 第二个指针之一。 分配步骤包括确定记录的实际压缩比的步骤，确定记录内相同字符的最长行程的值，并且基于相同字符的最长行程的值来调整实际压缩比。 分配步骤还包括将至少一个附加扇区添加到估计的数目以使压缩记录随后能够更新的步骤。

公开(公告)号：US5606679A

公开(公告)日：1997-02-25

申请号：US396038

申请日：1995-02-28

Applicant: Oded Cohn ,  William F. Micka ,  Yosef Moatti ,  Kenneth Nagin ,  Yoram Novick ,  Efaim Zeidner

Inventor： Oded Cohn ,  William F. Micka ,  Yosef Moatti ,  Kenneth Nagin ,  Yoram Novick ,  Efaim Zeidner

IPC: G06F3/06 ,  G06F13/14 ,  G06F12/02

CPC classification number: G06F3/0601 ,  G06F2003/0692

Abstract: A method and apparatus for improving storage controller throughput and reducing unit control block contention when selecting a Utility Volume for servicing non-specific read requests. Throughput is increased by enabling the storage controller to service non-specific read requests issued against a Utility Volume which is not the same as the device associated with the data that the non-specific read is requesting. The Utility Volume is dynamically selected by considering the current loads on the available devices for both specific and non-specific processing. A Penalty Index is assigned to each volume, wherein the Penalty Index is a weighted average of the specific and non-specific processing. The device having the lowest Penalty Index is selected as the Utility Volume for a session. A Penalty Index evaluation is made at a Reference Point which is further enabled by a random clock to ensure that sessions do not likely pick the same Utility Volume.

Abstract translation: 一种用于在选择用于服务非特定读请求的实用程序卷时改进存储控制器吞吐量并减少单元控制块争用的方法和装置。 通过使存储控制器能够服务于与非特定读取请求的数据相关联的设备不相同的公用程序卷发布的非特定读取请求来增加吞吐量。 通过考虑可用设备上的特定和非特定处理的当前负载来动态选择实用程序卷。 罚款指数被分配给每个卷，其中惩罚指数是特定和非特定处理的加权平均值。 选择具有最低罚款指数的设备作为会话的实用程序卷。 在参考点进行惩罚指数评估，该参考点通过随机时钟进一步启用，以确保会话不太可能选择相同的实用程序卷。

公开(公告)号：US20080243950A1

公开(公告)日：2008-10-02

申请号：US11692659

申请日：2007-03-28

Applicant: Erez Webman ,  Yoram Novick

Inventor： Erez Webman ,  Yoram Novick

IPC: G06F12/16

CPC classification number: G06F11/14

Abstract: An advanced clock synchronization technique is adapted for use with a replication service in a data backup and recovery storage environment. The storage environment includes a plurality of source storage systems and target storage systems, wherein the source storage systems are illustratively embodied as source replication nodes. The advanced clock synchronization technique establishes a software-only, loosely-accurate global clock based on a timestamp and an associated error boundary. Notably, the timestamp and its error boundary are used as global clock information to enable synchronization (i.e., ordering of storage requests) among the source replication nodes and/or the target storage systems, thereby ensuring consistent replication of the storage requests on the target storage systems.

Abstract translation: 高级时钟同步技术适用于数据备份和恢复存储环境中的复制服务。 存储环境包括多个源存储系统和目标存储系统，其中源存储系统被说明性地体现为源复制节点。 高级时钟同步技术基于时间戳和相关的错误边界建立了仅软件，松散精确的全局时钟。 值得注意的是，时间戳及其错误边界被用作全局时钟信息，以使能源复制节点和/或目标存储系统之间的同步（即，存储请求的排序），从而确保存储请求在目标存储上的一致复制 系统。

公开(公告)号：US06678787B2

公开(公告)日：2004-01-13

申请号：US09745328

申请日：2000-12-21

Applicant: Yael Petruschka ,  Erez Webman ,  Yoram Novick ,  Tal Sivan

Inventor： Yael Petruschka ,  Erez Webman ,  Yoram Novick ,  Tal Sivan

IPC: G06F1200

CPC classification number: G06F12/0866 ,  G06F11/1471 ,  G06F2212/312 ,  Y10S707/99953

Abstract: System for the storage and maintenance of data sets updates in a storage subsystem, that comprises direct access storage device(s) that serves as the main storage of the storage subsystem and on which the data sets are originally stored; a Cache memory storage device that enables fast interaction with the storage subsystem, on which a copy of the data sets is stored; a non-volatile storage device partitioned into a plurality of fixed size non-volatile memory pages. The system employs an update process, in which the changes to the data sets are applied to the data set copy stored on the Cache memory device; a journal of the changes that are being made to the data sets stored on the Cache memory device, utilizing the non-volatile memory pages to store update records reflecting the changes in the data sets; a reconstruction process in which the data sets are reconstructed utilizing the update records stored on the non-volatile memory pages, and the data sets stored on the direct access storage device; and a process for freeing arbitrary non-volatile pages from their prior association with data sets that are stored in the Cache memory.

Abstract translation: 用于在存储子系统中存储和维护数据集更新的系统，其包括用作存储子系统的主存储并且最初存储数据集的直接存取存储设备; 缓存存储器存储设备，其能够与存储有数据集的副本的存储子系统进行快速交互; 分离成多个固定大小的非易失性存储器页的非易失性存储设备。 系统采用更新过程，其中对数据集的改变被应用于存储在高速缓冲存储器设备上的数据组副本; 对存储在高速缓冲存储器设备上的数据集进行改变的日志，利用非易失性存储器页存储反映数据集中的变化的更新记录; 使用存储在非易失性存储器页面上的更新记录和存储在直接存取存储设备上的数据集来重建数据集的重建过程; 以及从任何非易失性页面与先前与存储在高速缓存存储器中的数据集相关联的过程。

公开(公告)号：US06611901B1

公开(公告)日：2003-08-26

申请号：US09347344

申请日：1999-07-02

Applicant: William Frank Micka ,  Yoram Novick ,  David Michael Shackelford

Inventor： William Frank Micka ,  Yoram Novick ,  David Michael Shackelford

IPC: G06F1200

CPC classification number: G06F3/065 ,  G06F3/0614 ,  G06F3/0676 ,  G06F11/1466 ,  G06F12/0866

Abstract: Disclosed is a method, system, program, and data structures for maintaining electronic data at a point-in-time. A first data structure indicates point-in-time data at one of a first storage location and a corresponding second storage location. A second data structure indicates point-in-time data at one of a first storage location and corresponding second storage location. A first relationship data structure indicates a relationship between the first storage location and corresponding second storage location and a second relationship data structure indicates a relationship between the first storage location and second storage location. A request to process the first storage location is processed by processing the first relationship data structure to determine the corresponding second storage location for the first storage location and processing the first data structure to determine whether data at the first storage location was transferred to the second storage location. A request to process the second storage location is processed by processing the second relationship data structure to determine the corresponding first storage location for the second storage location and processing the second data structure to determine whether the point-in-time data at the first storage location was transferred to the second storage location.

Abstract translation: 公开了一种用于在时间点维护电子数据的方法，系统，程序和数据结构。 第一数据结构指示在第一存储位置和对应的第二存储位置之一处的时间点数据。 第二数据结构指示在第一存储位置和对应的第二存储位置之一处的时间点数据。 第一关系数据结构指示第一存储位置与对应的第二存储位置之间的关系，第二关系数据结构指示第一存储位置与第二存储位置之间的关系。 通过处理第一关系数据结构来处理处理第一存储位置的请求，以确定第一存储位置的对应的第二存储位置，并处理第一数据结构，以确定第一存储位置的数据是否被传送到第二存储器 位置。 通过处理第二关系数据结构来处理处理第二存储位置的请求，以确定第二存储位置的对应的第一存储位置，并处理第二数据结构以确定第一存储位置处的时间点数据 被转移到第二个存储位置。

公开(公告)号：US5497483A

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

申请号：US949664

申请日：1992-09-23

Applicant: Brent C. Beardsley ,  William F. Micka ,  Yoram Novick

Inventor： Brent C. Beardsley ,  William F. Micka ,  Yoram Novick

IPC: G06F11/14 ,  G06F11/00

CPC classification number: G06F11/1466

Abstract: A method and system are disclosed for transferring backup copies of designated multi-track datasets which are stored in a plurality of storage subsystems to a host system via data channel during concurrent execution of an application. Upon receiving a request for a backup copy, execution of an application is temporarily suspended. A dataset logical-to-physical storage system address concordance is formed and execution of the application is resumed thereafter. Any application initiated updates to affected tracks within the designated datasets which occur prior to generation of a backup copy are processed by buffering the updates, copying the affected tracks to storage subsystem memory, updating the address concordance and writing the updates to the affected tracks within the dataset. Requests from the host system to transfer a selected sequence of tracks within the designated multi-track dataset are then examined to determine if the sequence includes affected tracks which have previously been copied to storage subsystem memory. An artificial track is then automatically substituted into the requested sequence of selected tracks for each affected track which has previously been copied to storage subsystem memory during transfer of the selected sequence of tracks such that the host system is made aware of the previous copying of these affected tracks.

Abstract translation: 公开了一种方法和系统，用于在并行执行应用程序期间通过数据通道将存储在多个存储子系统中的指定多轨数据集的备份副本传送到主机系统。 在接收到备份副本的请求时，应用程序的执行被暂停。 形成数据集逻辑到物理存储系统地址一致性，然后恢复应用程序的执行。 在生成备份副本之前发生的指定数据集内的受影响的轨道的任何应用程序启动的更新将通过缓存更新来处理，将受影响的轨道复制到存储子系统存储器，更新地址一致性，并将更新写入受影响的轨道内 数据集 然后检查从主机系统传送指定的多轨迹数据集内所选序列的轨迹的请求，以确定该序列是否包括先前已复制到存储子系统存储器的受影响的轨道。 然后，在所选择的轨道序列的传送期间，将人造轨道自动地替换为先前已经被复制到存储子系统存储器中的每个受影响的轨道的所选择的轨道的序列，使得主机系统知道这些受影响的先前复制 轨道