公开(公告)号：JP2006146913A

公开(公告)日：2006-06-08

申请号：JP2005326925

申请日：2005-11-11

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

Inventor： CHANG CHUN-SHI ,  KNOP FELIPE ,  LIN TSENG-HUI ,  SCHMUCK FRANK B

IPC: G06F11/20 ,  G06F15/177 ,  G06F9/46 ,  G06F9/48 ,  G06F11/16 ,  G06F13/00 ,  H04L12/28 ,  H04L29/06 ,  H04L29/14

CPC classification number: H04L12/2801 ,  H04L69/40

Abstract: PROBLEM TO BE SOLVED: To provide a system and method for determining node "liveness" in a distributed data processing network.
SOLUTION: The determination of node and/or adapter liveness in a distributed network data processing system is carried out via one messaging protocol that can be assisted by a second messaging protocol which is significantly less susceptible to delay, especially memory blocking delays encountered by daemons running on other nodes. The switching of protocols is accompanied by controlled grace periods for needed responses. This messaging protocol flexibility is also adapted for use as a mechanism for controlling the deliberate activities of node addition (birth) and node deletion (death).
COPYRIGHT: (C)2006,JPO&NCIPI

Abstract translation: 要解决的问题：提供一种用于在分布式数据处理网络中确定节点“活跃性”的系统和方法。 解决方案：分布式网络数据处理系统中的节点和/或适配器活动的确定通过一个消息协议进行，该消息协议可以被第二消息协议辅助，第二消息协议显然不太容易受到延迟的影响，特别是遇到的存储器阻塞延迟 通过在其他节点上运行的守护进程。 协议的切换伴随着所需响应的受控宽限期。 这种消息协议灵活性也适用于控制节点添加（出生）和节点删除（死亡）的故意活动的机制。 版权所有（C）2006，JPO＆NCIPI

公开(公告)号：JP2005018758A

公开(公告)日：2005-01-20

申请号：JP2004173180

申请日：2004-06-10

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

Inventor： CURRAN ROBERT J ,  MCNABB DANIEL L ,  MICHALAROS DEMETRIOS K ,  WAYNE A SOODON ,  SCHMUCK FRANK B ,  WYLLIE JAMES C

IPC: G06F12/00 ,  G06F11/14 ,  G06F12/16

CPC classification number: G06F11/1451 ,  G06F11/1464 ,  Y10S707/99955

Abstract: PROBLEM TO BE SOLVED: To provide a method for the backup of a large file system.
SOLUTION: The backup of the file system is executed by generating at first a list of i-nodes including related i-node numbers changed after the last backup operation in order of the i-node numbers. A table having file names and the i-node numbers of all the files included in the file system in the present is also generated therein. The list is sorted by the i-node numbers, the table and the list are merged, and structure is provided thereby to determine that any of the files has to be backed up. This means that the related i-nodes and file names are provided by a single constitutional element. The structure generated based on an merge operation is suitable, in particular, for reading-out by a block unit, and backup operations are thereby executed in parallel.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：提供用于备份大文件系统的方法。 解决方案：文件系统的备份通过首先生成i节点的列表来执行，包括按照i节点号的顺序在上次备份操作之后改变的相关i节点编号。 还在其中生成具有文件名和包括在文件系统中的所有文件的i节点编号的表。 该列表按i节点编号排序，表和列表合并，从而提供结构，以确定任何文件必须进行备份。 这意味着相关的i节点和文件名由单个组成元素提供。 基于合并操作生成的结构特别适用于通过块单元读出，从而并行执行备份操作。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2005018757A

公开(公告)日：2005-01-20

申请号：JP2004173175

申请日：2004-06-10

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

Inventor： CURRAN ROBERT J ,  WAYNE A SOODON ,  SCHMUCK FRANK B

IPC: G06F13/10 ,  G06F3/06 ,  G06F11/14 ,  G06F12/00 ,  G06F15/16

CPC classification number: G06F11/1435 ,  G06F11/1469 ,  Y10S707/99953

Abstract: PROBLEM TO BE SOLVED: To allow both limited file access and complete file access under a file system restoration operation.
SOLUTION: File system restoration is made flexible by the use of indicators in individual file restoration statuses through the whole restoration processing. The indicators are useful, for example, in the restoration of such a large-scale file system that the number of files comes to a range of about several hundred-millions, in particular. The present invention provides various degrees of individual file accesses even when the restoration processing in the progress of execution, because the restoration of the large-scale file system requires a relatively long time. The file access is made complete or limited with respect to an attribute of the file during the file system restoration. The invention provides most advantageously the complete access driven dynamically (of on-demand) even when the file system restoration is in the course of operation.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：允许在文件系统还原操作下限制文件访问和完整文件访问。 解决方案：通过整个恢复处理，通过在单个文件恢复状态中使用指示器来灵活地进行文件系统恢复。 这些指标是有用的，例如，恢复这样一个大型文件系统，特别是文件数量达到几亿。 本发明即使在执行进行中的恢复处理由于大规模文件系统的恢复需要较长的时间而提供了各种文件访问的程度。 在文件系统恢复期间文件访问是完整的或限制文件的属性。 本发明最有利地提供了即使在文件系统恢复正在运行的过程中动态（按需）驱动的完全访问。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2003030165A

公开(公告)日：2003-01-31

申请号：JP2002124292

申请日：2002-04-25

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

Inventor： CHANG CHUN-SHI ,  KNOP FELIPE ,  LIN TSENG-HUI ,  SCHMUCK FRANK B

IPC: G06F15/177 ,  G06F9/46 ,  G06F9/48 ,  G06F13/00 ,  H04L12/28 ,  H04L29/14

CPC classification number: H04L12/2801 ,  H04L69/40

Abstract: PROBLEM TO BE SOLVED: To provide a system and method for determining a node 'liveness' state in a distributed data processing network. SOLUTION: The determination of node and/or adapter liveness in a distributed network data processing system is carried out via a first messaging protocol that can be assisted by a second messaging protocol, which is significantly less susceptible to delay, especially memory blocking delays encountered by daemons running on other nodes, compared with the first message protocol. The switching of the protocols is accompanied by controlled grace periods for needed responses. The messaging protocol flexibility is also adapted for use as a mechanism for controlling the deliberate activities of node addition (birth) and node deletion (death).

Abstract translation: 要解决的问题：提供一种用于在分布式数据处理网络中确定节点“活跃”状态的系统和方法。 解决方案：分布式网络数据处理系统中的节点和/或适配器活动的确定通过可由第二消息协议辅助的第一消息协议进行，第二消息协议显着地不太容易延迟，特别是由 与第一个消息协议相比，在其他节点上运行的守护进程。 协议的切换伴随着所需响应的受控宽限期。 消息协议灵活性还适用于控制节点添加（出生）和节点删除（死亡）的故意活动的机制。

公开(公告)号：CA2851200C

公开(公告)日：2019-09-10

申请号：CA2851200

申请日：2012-10-17

Applicant: IBM

Inventor： GUPTA KARAN ,  NAIK MANOJ P ,  SCHMUCK FRANK B ,  SHAH MANSI A ,  TEWARI RENU

IPC: G06F16/178

Abstract: Embodiments of the invention relate to synchronization of data in a shared pool of configurable computer resources. An image of the filesystem changes, including data and metadata, is captured in the form of a consistency point. Sequential consistency points are created, with changes to data and metadata in the filesystem between sequential consistency captured and placed in a queue for communication to a target filesystem at a target site. The changes are communicated as a filesystem operation, with the communication limited to the changes captured and reflected in the consistency point.

公开(公告)号：CA2719673A1

公开(公告)日：2011-01-18

申请号：CA2719673

申请日：2010-11-05

Applicant: IBM CANADA

Inventor： BAE MYUNG M ,  BUCKLER ANDREW D ,  CHAN YUE FONG Y ,  GARCIA-ARELLANO CHRISTIAN M ,  HURAS MATTHEW A ,  MUELLER MARKUS ,  SACHEDINA AAMER ,  SCHMUCK FRANK B ,  VOLOBUEV YURI

IPC: G06F11/07 ,  G06F15/16

Abstract: An illustrative embodiment of a computer-implemented process for fencing shared cluster resources in event of a possible split-brain, identifies a failing resource of a node within a set of shared resources to form an identified failing resource, fences a subset of the set of shared resources to form a winning subset of shared resources and prevents the identified failing resource from communicating with the winning subset of shared resources using a white list maintained at each database system of the winning subset of shared resources. The computer-implemented process further determines whether the identified failing resource has been cleared to form a cleared failing resource and responsive to a determination that the identified failing resource has been cleared, rejoins the cleared failing resource with the winning subset of the set of shared resources absent a re-boot of the cleared failing resource.

公开(公告)号：DE69838367T2

公开(公告)日：2008-05-29

申请号：DE69838367

申请日：1998-06-17

Applicant: IBM

Inventor： SCHMUCK FRANK B ,  KANDADAI RADHA R ,  ZLOTEK ANTHONY J ,  CURRAN ROBERT J ,  KISH WILLIAM A

IPC: G06F9/46 ,  G06F11/14 ,  G06F17/30

Abstract: A computer system having a shared disk file system running on multiple computers each having their own instance of an operating system and being coupled for parallel data sharing access to files residing on network attached shared disks. Methods are provided for use as a parallel file system in a shared disk environment by use of a scalable directory service for the system with a stable cursor, a segmented allocation map. Dynamic prefetch and cached balance pools for multiple accesses improve the system. Extended file attributes are used for implementation of Access Control Lists in a parallel file system.

公开(公告)号：CA2242833A1

公开(公告)日：1999-01-11

申请号：CA2242833

申请日：1998-07-09

Applicant: IBM

Inventor： SCHMUCK FRANK B ,  ZLOTEK ANTHONY J ,  KANDADAI RADHA R ,  WYLLIE JAMES C ,  CURRAN ROBERT J ,  KISH WILLIAM A ,  SHMUELI BOAZ

IPC: G06F17/30 ,  G06F15/16 ,  G06F15/167

Abstract: A computer system having a shared disk file system running on multiple computers each having their own instance of an operating system and being coupled for parallel data sh aring access to files residing on network attached shared disks. Methods are provided for use as a par allel file system in a shared disk environment by use of a scalable directory service for the system with a stable cursor, a segmented allocation map. Dynamic prefetch and cached balance pools for multip le accesses improve the system. Extended file attributes and attribute value sharing are use d for implementation of access control lists in a parallel file system. A metadata node manages file metadata for parallel read and write actions. For our system, tokens are used for metadata node select ion and identification. Enhanced token modes for controlling file size, as well as smart caching of byte range tokens using file access patterns and a byte range lock algorithm using a byte r ange token interface are provided. Locking techniques reduce the overhead of a token manager which is also used in the file system recovery if a computer participating in the management of shared dis ks becomes unavailable or failed. Synchronous and asynchronous takeover of a metadata node occurs for correction of metadata which was under modification. Locks are not constantly re quired to allocate new blocks on behalf of a user. Recoverable local shares for quota management ar e provided. A quota server and a quota client are provided for each file system, and a quota c heck utility allows parallel environments with minimal interference to other applications which requ ire the use of quotas.

公开(公告)号：DE69841034D1

公开(公告)日：2009-09-17

申请号：DE69841034

申请日：1998-06-16

Applicant: IBM

Inventor： SCHMUCK FRANK B ,  SCHMUELI BOAZ ,  ZLOTEK ANTHONY J

IPC: G06F17/30

Abstract: A computer system having a shared disk file system running on multiple computers each having their own instance of an operating system and being coupled for parallel data sharing access to files residing on network attached shared disks. Methods are provided for use as a parallel file system in a shared disk environment by use of a scalable directory service for the system with a stable cursor, a segmented allocation map. Dynamic prefetch and cached balance pools for multiple accesses improve the system. Extended file attributes are used for implementation of Access Control Lists in a parallel file system.

公开(公告)号：DE69840905D1

公开(公告)日：2009-07-30

申请号：DE69840905

申请日：1998-06-17

Applicant: IBM

Inventor： SCHMUCK FRANK B ,  MCNABB DANIEL LLOYD ,  WYLLIE JAMES C ,  SCHMUELI BOAZ

IPC: G06F17/30

Abstract: A computer system having a shared disk file system running on multiple computers each having their own instance of an operating system and being coupled for parallel data sharing access to files residing on network attached shared disks. Methods are provided for use as a parallel file system in a shared disk environment by use of a scalable directory service for the system with a stable cursor, a segmented allocation map. Dynamic prefetch and cached balance pools for multiple accesses improve the system. Extended file attributes are used for implementation of Access Control Lists in a parallel file system.