-
1.发明授权Storage area network methods and apparatus for communication and interfacing with multiple platforms 失效用于与多个平台进行通信和接口的存储区域网络方法和装置公开(公告)号：US07457846B2
公开(公告)日：2008-11-25
申请号：US09972010
申请日：2001-10-05
申请人： Duane Mark Baldwin , Zhengwen He , Allen Robert Heitman , Hans Hanhsia Lin , David Lynn Merbach
发明人： Duane Mark Baldwin , Zhengwen He , Allen Robert Heitman , Hans Hanhsia Lin , David Lynn Merbach
CPC分类号： H04L67/1097 , H04L29/06 , H04L69/329 , Y10S707/99932
摘要： A storage area network (SAN) has a plurality of components including digital data processors, e.g., hosts, coupled to a plurality of storage device. Common, platform-independent processes execute on the hosts, which can be of varied platform types, e.g., Unix™, Windows™, Solaris, and so forth. Those processes utilizes the command line interface of the host operating system to invoke platform-dependent processes on the respective hosts. The platform-dependent processes return data to the platform-independent processes, e.g., via Standard Output or Standard Error of the host operating system command line interface.
摘要翻译： 存储区域网络（SAN）具有多个组件，包括耦合到多个存储设备的数字数据处理器，例如主机。 在主机上执行常见的，与平台无关的进程，主机可以是不同的平台类型，例如Unix（TM），Windows TM，Solaris等等。 这些进程利用主机操作系统的命令行界面来调用相应主机上的平台相关进程。 平台相关过程将数据返回到与平台无关的进程，例如通过主机操作系统命令行界面的标准输出或标准错误。
-
2.发明授权Methods and apparatus for launching device specific applications on storage area network components 失效在存储区域网络组件上启动设备特定应用的方法和装置公开(公告)号：US08060587B2
公开(公告)日：2011-11-15
申请号：US09972362
申请日：2001-10-05
申请人： Farhan Ahmad , Gary Thomas Axberg , Zhengwen He , Raymond M. Li , David Lynn Merbach , Gregory John Tevis , William Roy Yonker
发明人： Farhan Ahmad , Gary Thomas Axberg , Zhengwen He , Raymond M. Li , David Lynn Merbach , Gregory John Tevis , William Roy Yonker
IPC分类号： G06F15/173 , G06F15/177 , G06F15/16
CPC分类号： H04L41/06 , H04L41/0681 , H04L41/069 , H04L41/0803 , H04L41/0893 , H04L41/22 , H04L41/509 , H04L43/00 , H04L43/045 , H04L43/16 , H04L67/1097 , H04L69/329
摘要： A storage area network (SAN) of the type has a plurality of components including one or more digital data processors in communication with one or more storage devices via a switching fabric. An interface process, e.g., resident on a manager digital data processor, permits the operator/administrator to effect execution of at least a process residing on the manager and at least one process, such as a management application, residing on another SAN component.
摘要翻译： 该类型的存储区域网络（SAN）具有多个组件，包括经由交换结构与一个或多个存储设备通信的一个或多个数字数据处理器。 接口过程，例如驻留在管理者数字数据处理器上，允许操作员/管理员执行至少驻留在管理者上的过程和驻留在另一个SAN组件上的至少一个过程，例如管理应用程序的执行。
-
3.发明授权Selectively removing entities from a user interface displaying network entities 失效从显示网络实体的用户界面中选择性删除实体公开(公告)号：US07613720B2
公开(公告)日：2009-11-03
申请号：US11007361
申请日：2004-12-07
IPC分类号： G06F17/30
CPC分类号： H04L43/0817 , H04L41/12 , H04L41/22 , Y10S707/99933 , Y10S707/99943
摘要： Provided are a method, system, and program for selectively removing entities from a user interface displaying network entities. A discovery database includes information on at least one network, and, for each network, information on entities in the network and a status of the entities. A user interface display is generated indicating the entities in one network that are available and unavailable. User selection is received of at least one entity in the network that is displayed as unavailable, wherein at least one displayed unavailable entity is not selected. User selection is received to remove the selected at least one entity and the selected at least one entity and any underlying entities within the selected entity are removed in response to the user selection to remove the selected at least one entity.
摘要翻译： 提供了一种用于从显示网络实体的用户界面选择性地移除实体的方法，系统和程序。 发现数据库包括关于至少一个网络的信息，并且针对每个网络，关于网络中的实体的信息和实体的状态。 生成用户界面显示，指示一个网络中可用且不可用的实体。 接收到显示为不可用的网络中的至少一个实体的用户选择，其中至少一个显示的不可用实体未被选择。 接收用户选择以移除所选择的至少一个实体，并且响应于用户选择去除所选择的至少一个实体，删除所选择的实体中的所选择的至少一个实体和任何基础实体。
-
4.发明授权Dynamically matching data service capabilities to data service level objectives 失效将数据服务功能与数据服务级目标动态匹配公开(公告)号：US08176180B2
公开(公告)日：2012-05-08
申请号：US11757671
申请日：2007-06-04
IPC分类号： G06F15/173
CPC分类号： H04L67/1097 , G06F3/0605 , G06F3/0631 , G06F3/0632 , G06F3/067 , H04L67/1008 , H04L67/1023 , H04L67/1034 , H04L67/2852
摘要： A method, system, and computer program product are provided for matching a storage dependent device to a storage subsystem. Storage requirements are identified for a storage dependent device that is coupled to a network. Additionally, a set of storage subsystems that are coupled to the network are identified. A determination is made as to whether at least one storage subsystem in the set of storage subsystems meets the storage requirements of the storage dependent device. An identified storage subsystem is formed by identifying the at least one storage subsystem that meets the storage requirements of the storage dependent device. Responsive to forming the identified storage subsystem, at least one storage subsystem is coupled to the storage dependent device, wherein the storage dependent device utilizes storage capabilities of the identified storage subsystem.
摘要翻译： 提供了一种方法，系统和计算机程序产品，用于将存储相关设备与存储子系统进行匹配。 为耦合到网络的存储相关设备识别存储要求。 另外，识别耦合到网络的一组存储子系统。 确定存储子系统集合中的至少一个存储子系统是否满足存储相关设备的存储要求。 通过识别满足存储依赖设备的存储要求的至少一个存储子系统来形成识别的存储子系统。 响应于形成所识别的存储子系统，至少一个存储子系统被耦合到所述存储相关设备，其中所述存储相关设备利用所识别的存储子系统的存储能力。
-
公开(公告)号：US20060122980A1
公开(公告)日：2006-06-08
申请号：US11007361
申请日：2004-12-07
申请人： Zhengwen He , David Merbach , William Yonker
发明人： Zhengwen He , David Merbach , William Yonker
IPC分类号： G06F17/30
CPC分类号： H04L43/0817 , H04L41/12 , H04L41/22 , Y10S707/99933 , Y10S707/99943
摘要： Provided are a method, system, and program for selectively removing entities from a user interface displaying network entities. A discovery database includes information on at least one network, and, for each network, information on entities in the network and a status of the entities. A user interface display is generated indicating the entities in one network that are available and unavailable. User selection is received of at least one entity in the network that is displayed as unavailable, wherein at least one displayed unavailable entity is not selected. User selection is received to remove the selected at least one entity and the selected at least one entity and any underlying entities within the selected entity are removed in response to the user selection to remove the selected at least one entity.
-
公开(公告)号：US20090187908A1
公开(公告)日：2009-07-23
申请号：US12017136
申请日：2008-01-21
IPC分类号： G06F9/46
CPC分类号： G06F9/4881
摘要： The present invention provides for a method and system for the disposition of tasks which failed to run during their originally scheduled time. The determination of whether to run missed or delayed tasks is based on calculated ratios rather than on fixed window sizes. A Lateness Ratio is calculated to determine if the time elapsed between the missed task and the scheduled run time is small enough to still allow a late task to run. A Closeness Ratio is calculated to determine if the next available run time for the missed task is close enough to the next scheduled execution of the task that the missed task will be run in place of the upcoming scheduled task. Each ratio is compared to a user defined ratio limit, so if the calculated ratio does not exceed the limit, then the missed task is executed at the first available opportunity.
摘要翻译： 本发明提供了一种用于处理在原始预定时间内未能运行的任务的方法和系统。 是否运行错过或延迟任务的确定是基于计算的比率而不是固定的窗口大小。 计算延迟比率，以确定错过的任务和计划的运行时间之间经过的时间是否足够小，以至于仍然允许迟到的任务运行。 计算闭合率以确定未完成任务的下一个可用运行时间是否足够接近任务的下一个计划执行，以使运行未完成任务代替即将到来的计划任务。 将每个比率与用户定义的比率限制进行比较，因此如果计算的比率不超过限制，则在第一个可用机会执行错过的任务。
-
公开(公告)号：US08141081B2
公开(公告)日：2012-03-20
申请号：US12017136
申请日：2008-01-21
CPC分类号： G06F9/4881
摘要： The present invention provides for a method and system for the disposition of tasks which failed to run during their originally scheduled time. The determination of whether to run missed or delayed tasks is based on calculated ratios rather than on fixed window sizes. A Lateness Ratio is calculated to determine if the time elapsed between the missed task and the scheduled run time is small enough to still allow a late task to run. A Closeness Ratio is calculated to determine if the next available run time for the missed task is close enough to the next scheduled execution of the task that the missed task will be run in place of the upcoming scheduled task. Each ratio is compared to a user defined ratio limit, so if the calculated ratio does not exceed the limit, then the missed task is executed at the first available opportunity.
摘要翻译： 本发明提供了一种用于处理在原始预定时间内未能运行的任务的方法和系统。 是否运行错过或延迟任务的确定是基于计算的比率而不是固定的窗口大小。 计算延迟比率，以确定错过的任务和计划的运行时间之间经过的时间是否足够小，以至于仍然允许迟到的任务运行。 计算闭合率以确定未完成任务的下一个可用运行时间是否足够接近任务的下一个计划执行，以使运行未完成任务代替即将到来的计划任务。 将每个比率与用户定义的比率限制进行比较，因此如果计算的比率不超过限制，则在第一个可用机会执行错过的任务。
-
8.发明授权Method and apparatus for determining unknown relationships between storage devices and storage device enclosures 有权用于确定存储设备和存储设备外壳之间的未知关系的方法和设备公开(公告)号：US06671789B1
公开(公告)日：2003-12-30
申请号：US09564612
申请日：2000-05-04
IPC分类号： G06F1200
CPC分类号： G06F3/0601 , G06F2003/0697 , H04L29/06 , H04L67/1097 , H04L69/329
摘要： Method, program product, and system for the probabilistic determination of storage device enclosure-to-storage device relationships in a storage system, when the exact relationship is unknown. A table is built at storage system startup representing the initial storage device enclosure to storage device relationship. For efficiency, as topology changes occur within the storage system, the table is not updated to reflect the topology change. When a user wishes to access a specific storage device enclosure, the table is opened, and the most recently added storage device entry for the selected enclosure is chosen. The chosen storage device is queried for its current physical location. If the storage device still resides within the selected enclosure, the user access the enclosure via the chosen storage device. If the chosen storage device does not reside within the disclosure, the storage device entry is moved to the enclosure entry where it now resides, and the next most recently added storage device within the selected enclosure entry is chosen. The storage device select/query process is repeated until a storage device referenced by the chosen storage device entry is determined to reside within the selected enclosure. If the list of storage devices for the selected enclosure entry is exhausted, the table is rebuilt.
摘要翻译： 方法，程序产品和系统，用于在存储系统中的存储设备存储设备关系的概率确定时，当确切的关系是未知的。 在存储系统启动时构建一个表，表示初始存储设备机柜与存储设备的关系。 为了提高效率，由于存储系统中发生拓扑变化，表不会更新以反映拓扑变化。 当用户希望访问特定的存储设备机箱时，将打开该表，并选择最近添加的所选机箱的存储设备条目。 根据当前的物理位置查询选定的存储设备。 如果存储设备仍驻留在所选机箱内，则用户通过所选择的存储设备访问机箱。 如果所选择的存储设备不在本公开范围内，则将存储设备条目移动到现在所在的机箱条目，并且选择所选机箱条目中的下一个最近添加的存储设备。 重复存储设备选择/查询过程，直到所选择的存储设备条目引用的存储设备被确定为驻留在所选择的外壳内。 如果所选机箱条目的存储设备列表用完，表将重新生成。
-
9.发明申请Dynamically Matching Data Service Capabilities to Data Service Level Objectives 失效将数据服务功能与数据服务级目标动态匹配公开(公告)号：US20080301255A1
公开(公告)日：2008-12-04
申请号：US11757671
申请日：2007-06-04
IPC分类号： G06F15/167
CPC分类号： H04L67/1097 , G06F3/0605 , G06F3/0631 , G06F3/0632 , G06F3/067 , H04L67/1008 , H04L67/1023 , H04L67/1034 , H04L67/2852
摘要： A method, system, and computer program product are provided for matching a storage dependent device to a storage subsystem. Storage requirements are identified for a storage dependent device that is coupled to a network. Additionally, a set of storage subsystems that are coupled to the network are identified. A determination is made as to whether at least one storage subsystem in the set of storage subsystems meets the storage requirements of the storage dependent device. An identified storage subsystem is formed by identifying the at least one storage subsystem that meets the storage requirements of the storage dependent device. Responsive to forming the identified storage subsystem, at least one storage subsystem is coupled to the storage dependent device, wherein the storage dependent device utilizes storage capabilities of the identified storage subsystem.
摘要翻译： 提供了一种方法，系统和计算机程序产品，用于将存储相关设备与存储子系统进行匹配。 为耦合到网络的存储相关设备识别存储要求。 另外，识别耦合到网络的一组存储子系统。 确定存储子系统集合中的至少一个存储子系统是否满足存储相关设备的存储要求。 通过识别满足存储依赖设备的存储要求的至少一个存储子系统来形成识别的存储子系统。 响应于形成所识别的存储子系统，至少一个存储子系统耦合到所述存储相关设备，其中所述存储相关设备利用所识别的存储子系统的存储能力。
-
-
-
-
-
-
-
-
搜索结果
9 条记录 (耗时 0.024 秒)
