-
Patent Agency Ranking
公开(公告)号：JP2004038932A
公开(公告)日：2004-02-05
申请号：JP2003080011
申请日：2003-03-24
Applicant: Network Appliance Inc , ネットワーク・アプライアンス・インコーポレイテッド
Inventor： LEONG JAMES , SUNDARAM RAJESH , DOUCETTE DOUGLAS P , SCHOENTHAL SCOTT , STRANGE STEPHEN H , VISWANATHAN SRINIVASAN
CPC classification number: G06F3/0601 , G06F3/061 , G06F3/0611 , G06F3/0655 , G06F3/0659 , G06F3/0689 , G06F9/4881 , G06F11/2087
Abstract: PROBLEM TO BE SOLVED: To implement an I/O task architecture in which a data access request (for example, stripe writing) is decomposed into a plurality of independently schedulable lower-level synchronous I/O tasks. SOLUTION: Resources needed by lower-level I/O tasks are dynamically assigned, as needed, for effective load and resource use balance to thereby achieve high scalability. A hierarchical order is assigned to the I/O tasks to ensure that there is a forward progression of their higher-level I/O task and to ensure that resources do not become deadlocked. COPYRIGHT: (C)2004,JPO
-
2.发明专利
公开(公告)号：JP2008269638A
公开(公告)日：2008-11-06
申请号：JP2008149382
申请日：2008-06-06
Applicant: Network Appliance Inc , ネットワーク アプライアンス, インコーポレイテッド
Inventor： KLEIMAN STEVEN R , STRANGE STEPHEN H
CPC classification number: G06F11/1662 , G06F11/1092 , G06F11/2082 , G06F11/2094
Abstract: PROBLEM TO BE SOLVED: To provide a method and a system capable of maintaining data reliability, capable of deleting logically a failure disk, and capable of minimizing calculation and an access to a disk, for transferring or restoring the data or for executing recalculation of a parity.
SOLUTION: A storage system transfers only a disk block including the allocated data, when the disk is failed (210), and treats an unallocated disk block logically zero when possible. When having no spare disk, a source data block is logically set to zero and the parity is recalculated for the RAID stripe related to the source data block (223). When having a spare, the unallocated block on the spare is logically or physically set to zero when transferred (222). A write operation into the failed disk is re-instructed to other non-failed disks, and a record in a using disk is transferred to the other non-failed disks to be maintained.
COPYRIGHT: (C)2009,JPO&INPITAbstract translation: 要解决的问题：提供能够保持数据可靠性的方法和系统，能够逻辑地删除故障盘，并且能够最小化计算和访问磁盘，用于传送或恢复数据或执行 重新计算平价。 解决方案：当磁盘发生故障（210）时，存储系统仅传输包括分配的数据的磁盘块（210），并且尽可能将未分配的磁盘块视为零。 当没有备用磁盘时，源数据块在逻辑上设置为零，并重新计算与源数据块相关的RAID条带的奇偶校验（223）。 当备用时，备用磁盘上的未分配块在传输时逻辑或物理设置为零（222）。 对故障磁盘的写入操作被重新指示给其他非故障磁盘，并且使用磁盘中的记录被传送到要维护的其他未发生故障的磁盘。 版权所有（C）2009，JPO＆INPIT
-
3.发明专利
公开(公告)号：JP2003296038A
公开(公告)日：2003-10-17
申请号：JP2003080010
申请日：2003-03-24
Applicant: Network Appliance Inc , ネットワーク・アプライアンス・インコーポレイテッド
Inventor： KLEIMAN STEVEN R , SUNDARAM RAJESH , DOUCETTE DOUGLAS P , STRANGE STEPHEN H , VISWANATHAN SRINIVASAN
CPC classification number: G06F3/0613 , G06F3/0643 , G06F3/0655 , G06F3/0689 , G06F11/1076
Abstract: PROBLEM TO BE SOLVED: To provide a method for controlling storage of data in a plurality of storage devices, for example, in a RAID array. SOLUTION: This method includes receiving a plurality of write requests associated with data and buffering the write requests. A file system defines a group of storage blocks, responsive to disk topology information. The group includes a plurality of storage blocks in each of the plurality of storage devices. Each data block of the data to be written is associated with a respective one of the storage blocks, for transmitting the association to the plurality of storage devices. COPYRIGHT: (C)2004,JPO
Abstract translation: 要解决的问题：提供一种用于控制例如在RAID阵列中的多个存储设备中的数据存储的方法。 解决方案：该方法包括接收与数据相关联的多个写入请求并缓冲写入请求。 文件系统根据磁盘拓扑信息定义一组存储块。 该组包括多个存储装置中的每一个中的多个存储块。 要写入的数据的每个数据块与相应的一个存储块相关联，用于将关联发送到多个存储设备。 版权所有（C）2004，JPO
-
公开(公告)号：AU2003278864A1
公开(公告)日：2004-01-06
申请号：AU2003278864
申请日：2003-06-24
Applicant: NETWORK APPLIANCE INC
Inventor： KLEIMAN STEVEN R , STRANGE STEPHEN H
Abstract: On disk failure, the storage system migrates only those disk blocks that included allocated data, and treats unallocated disk blocks as being logically zero when possible. When there is no spare disk, the source data block is logically set to zero and parity is recalculated for the RAID stripe associated with the source data block. When there is a spare, unallocated blocks on the spare are logically or physically set to zero upon migration. Write operations for the failed disk are redirected to other non-failing disks, and a record of which in-use disk blocks have been thus "migrated" to those other non-failing disks in maintained. Unused disk blocks are proactively set to zero. A target mirror copy is created using information regarding allocated disk blocks, by copying those blocks including allocated data or parity, and by clearing at the mirror those blocks not including any allocated data or parity.
-
5.发明公开
公开(公告)号：EP1535154A4
公开(公告)日：2008-09-10
申请号：EP03742221
申请日：2003-06-24
Applicant: NETWORK APPLIANCE INC
Inventor： KLEIMAN STEVEN R , STRANGE STEPHEN H
CPC classification number: G06F11/1662 , G06F11/1092 , G06F11/2082 , G06F11/2094
Abstract: On disk failure (210), the storage system migrates only those disk blocks that included allocated data, and treats unallocated disk blocks as being logically zero when possible. When there is no spare disk, the source disk block is logically set to zero and parity is recalculated for the RAID stripe associated with the source disk block (223). When there is a spare, unallocated blocks on the spare are logically or physically set to zero upon migration (222). Write operations for the failed disk are redirected to other non-failing disks, and a record of which in-use disk blocks have been thus 'migrated' to those other non-failing disks in maintained. Unused disk blocks are proactively set to zero. A target mirror copy is created using information regarding allocated disk blocks, by copying those blocks including allocated data or parity, and by clearing at the mirror those blocks not including any allocated.
-
-
-
-
Search Results
5
records
(took 0.05 seconds)
