公开(公告)号：WO2004049670A3

公开(公告)日：2004-12-23

申请号：PCT/GB0304448

申请日：2003-10-15

Applicant: IBM ,  IBM UK

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

CPC classification number: H04L67/1008 ,  H04L67/1002 ,  H04L67/1012 ,  H04L67/1019 ,  H04L67/1097 ,  H04L67/327 ,  H04L69/329 ,  H04L2029/06054

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

Abstract translation: 智能路由器将用户请求路由到能够本地处理该请求的存储服务器，而不进行仿真。 请求将自动路由，不需要用户的任何指令或交互。 智能路由器包括一个存储槽状计算环境和一组智能路由器。 该智能路由器通过呈现单个网络IP地址，向用户显示单个实体。 当智能路由器接收到请求时，会检查协议类型，并将请求路由到相应的存储槽客户端之一。 智能路由器不会更改请求消息的内容，因此存储系统不会意识到智能路由器的存在。 因此，除非需要，任何返回消息都不需要经过智能路由器。

公开(公告)号：JP2008217795A

公开(公告)日：2008-09-18

申请号：JP2008053438

申请日：2008-03-04

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： RUU SHIN HOA ,  RIU SHAI SHA ,  SU HUI ,  YOUNG HONESTY CHENG

IPC: G06T11/20

CPC classification number: G06T11/206

Abstract: PROBLEM TO BE SOLVED: To provide a method and device for visualizing hierarchical data, including a plurality of levels, by using an angular chart. SOLUTION: One of the plurality of levels in the hierarchical data is determined as a base level. A data unit in the base level is visualized by using the angular chart. Each slice corresponds to the data unit in the hierarchical data. When the data unit in the succeeding level corresponding to the operated slice in the hierarchical data is visualized in response to the operation of a user with respect to the slice of the angular chart, the data unit in each level of the hierarchical data is hierarchically and clearly visualized even when the hierarchical data has the multiple levels or the multiple data units. Consequently, a problem that the angular chart seems to be disordered is solved, thereby allowing the user to customize angular chart visualization. Moreover, the angular chart is interactively visualized. COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：提供一种通过使用角度图来显示包括多个级别的分级数据的方法和装置。 解决方案：分层数据中的多个级别之一被确定为基本级别。 使用角度图可视化基层的数据单元。 每个切片对应于分层数据中的数据单元。 当响应于用户相对于角度图的切片的操作而可视化分层数据中与被操作的切片相对应的后续级别的数据单元时，分级数据的每个级别中的数据单元是分级和 即使分级数据具有多个级别或多个数据单元，也可以清楚地显示。 因此，解决了角度图似乎无序的问题，从而允许用户定制角度图可视化。 此外，角度图是交互式可视化的。 版权所有（C）2008，JPO＆INPIT

公开(公告)号：AU2003271982A1

公开(公告)日：2004-05-25

申请号：AU2003271982

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：CA2739639A1

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

申请号：CA2739639

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG

IPC: G06F11/16 ,  G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：DE60316466T2

公开(公告)日：2008-06-19

申请号：DE60316466

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

公开(公告)号：CA2503129C

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

申请号：CA2503129

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n + 1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：AT321300T

公开(公告)日：2006-04-15

申请号：AT03753821

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：CA2503129A1

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

申请号：CA2503129

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  NG SPENCER ,  YOUNG HONESTY CHENG ,  MENON JAISHANKAR MOOTHEDATH

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n + 1 physic al disks that are capable of storing n physical disks worth of data when any tw o disks fail, or when more than two dependent disks fail. Data is stored in da ta stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe , the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：DE60316466D1

公开(公告)日：2007-10-31

申请号：DE60316466

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

公开(公告)号：AU2003278310A8

公开(公告)日：2004-06-18

申请号：AU2003278310

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  YOUNG HONESTY CHENG ,  MENON JAISHANKAR MOOTHEDATH

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.