Patents by Inventor Frank B. Schmuck

Frank B. Schmuck has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20190278659
    Abstract: A method, computer system, and a computer program product for enhanced application write operations is provided. The present invention may include performing a write operation by an application node. The present invention may then include committing the write operation to a local buffer cache. The present invention may then include sending the application node an indication that the write operation was successful. The present invention may then include flushing the local buffer cache to a disk based on a buffer flush trigger, and the present invention may lastly include sending a Remote Procedure Call (RPC) to at least one gateway node, wherein functionality of the gateway node is located on different physical nodes which are separated from the application node over the network.
    Type: Application
    Filed: May 24, 2019
    Publication date: September 12, 2019
    Inventors: Shankar Balasubramanian, Venkateswara R. Puvvada, Frank B. Schmuck
  • Publication number: 20190235964
    Abstract: A computer-implemented method according to one embodiment includes identifying one or more accessible server nodes within a plurality of nodes of a failed clustered system, retrieving a plurality of fragments of configuration data from the one or more accessible server nodes, and constructing a backup state for the failed clustered system, utilizing the plurality of fragments of the configuration data.
    Type: Application
    Filed: April 9, 2019
    Publication date: August 1, 2019
    Inventors: Ralf Eberhard, Manfred Haubrich, Simon Lorenz, Frank B. Schmuck
  • Publication number: 20190235758
    Abstract: Autonomic compression including balancing performance of a compression technique and storage space savings in data storage based on an access characteristic is provided. The access characteristic of file data is determined including a read access and/or a write access. A space management action is dynamically selected to be applied to the file data. The selection automatically balances between a storage size and an access performance of the file data based on the access characteristic. The selected space management action is applied on the file data including changing a state of compression of the data.
    Type: Application
    Filed: January 29, 2018
    Publication date: August 1, 2019
    Applicant: International Business Machines Corporation
    Inventors: M. Corneliu Constantinescu, Leo Shyh-Wei Luan, Wayne A. Sawdon, Frank B. Schmuck
  • Publication number: 20190212929
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Application
    Filed: March 18, 2019
    Publication date: July 11, 2019
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Publication number: 20190212928
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Application
    Filed: March 18, 2019
    Publication date: July 11, 2019
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Publication number: 20190212927
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Application
    Filed: March 18, 2019
    Publication date: July 11, 2019
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Patent number: 10331523
    Abstract: A computer-implemented method according to one embodiment includes identifying one or more accessible server nodes within a plurality of nodes of a failed clustered system, retrieving a plurality of fragments of configuration data from the one or more accessible server nodes, and constructing a backup state for the failed clustered system, utilizing the plurality of fragments of the configuration data.
    Type: Grant
    Filed: April 4, 2017
    Date of Patent: June 25, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ralf Eberhard, Manfred Haubrich, Simon Lorenz, Frank B. Schmuck
  • Patent number: 10331878
    Abstract: An identification system that may be used in heterogeneous computing environments provides a fail-free path to providing identifiers from a single canonical namespace. Objects or gateways requiring an identifier for access are accessed using an identifier for the canonical namespace. If an entity requests access using an identifier from another namespace, an external database is consulted to determine if a mapping exists for the identifier to another identifier the canonical namespace. If no mapping exists, or the external database is unavailable, then an identifier is automatically generated in the canonical namespace and is used for the access. An internal database is updated with the automatically generated identifier, providing a mechanism to add mappings without administrative intervention. To access resources requiring an identifier from another particular namespace, a canonical namespace identifier may be mapped to another identifier in the particular namespace, or a generic identifier may be used.
    Type: Grant
    Filed: April 21, 2016
    Date of Patent: June 25, 2019
    Assignee: SERVICENOW, INC.
    Inventors: Demyn Lee Plantenberg, Frank B. Schmuck, Yuri Volobuev
  • Patent number: 10324799
    Abstract: A method, computer system, and a computer program product for enhanced application write operations is provided. The present invention may include performing a write operation by an application node. The present invention may then include committing the write operation to a local buffer cache. The present invention may then include sending the application node an indication that the write operation was successful. The present invention may then include flushing the local buffer cache to a disk, and the present invention may lastly include sending a Remote Procedure Call (RPC) to a gateway node.
    Type: Grant
    Filed: September 28, 2017
    Date of Patent: June 18, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shankar Balasubramanian, Venkateswara R. Puvvada, Frank B. Schmuck
  • Patent number: 10311026
    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression for efficient random access to the data. A first partition of a first data block of a compression group is compressed. The first compressed partition is stored in a first compression entity. An in-memory table is maintained, which includes updating the in-memory table with data associated with an address of the stored compressed first partition. At such time as it is determined that the first compression entity is full, the in-memory table is compressed and written to the first compression entity. Accordingly, the in-memory table, which stores partition compression data, is store with the compression entity.
    Type: Grant
    Filed: May 27, 2016
    Date of Patent: June 4, 2019
    Assignee: International Business Machines Corporation
    Inventors: M. Corneliu Constantinescu, Leo Shyh-Wei Luan, Wayne A. Sawdon, Frank B. Schmuck
  • Patent number: 10282115
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Grant
    Filed: April 13, 2017
    Date of Patent: May 7, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Publication number: 20190095284
    Abstract: A method, computer system, and a computer program product for enhanced application write operations is provided. The present invention may include performing a write operation by an application node. The present invention may then include committing the write operation to a local buffer cache. The present invention may then include sending the application node an indication that the write operation was successful. The present invention may then include flushing the local buffer cache to a disk, and the present invention may lastly include sending a Remote Procedure Call (RPC) to a gateway node.
    Type: Application
    Filed: September 28, 2017
    Publication date: March 28, 2019
    Inventors: Shankar Balasubramanian, Venkateswara R. Puvvada, Frank B. Schmuck
  • Patent number: 10235068
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Grant
    Filed: January 30, 2018
    Date of Patent: March 19, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Publication number: 20180336219
    Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.
    Type: Application
    Filed: July 27, 2018
    Publication date: November 22, 2018
    Inventors: M. Corneliu Constantinescu, Marc A. Kaplan, Leo Luan, Sven Oehme, Wayne A. Sawdon, Frank B. Schmuck
  • Publication number: 20180300068
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Application
    Filed: April 13, 2017
    Publication date: October 18, 2018
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Publication number: 20180300069
    Abstract: A storage system in a clustered system may receive a first input/output (I/O) request. The storage system may include one or more storage nodes. Each of the one or more storage nodes may have a copy of a particular object stored thereon. The storage system may execute the first I/O request. Executing the first I/O request may modify data of a first object in a first storage node. The first object may be a copy of the particular object. The storage system may transfer the modified data of the first object to a master storage node. The master storage node may include a master object update descriptor list.
    Type: Application
    Filed: January 30, 2018
    Publication date: October 18, 2018
    Inventors: Ralf Eberhard, Erik Rueger, Rolf Schaefer, Frank B. Schmuck
  • Publication number: 20180285211
    Abstract: A computer-implemented method according to one embodiment includes identifying one or more accessible server nodes within a plurality of nodes of a failed clustered system, retrieving a plurality of fragments of configuration data from the one or more accessible server nodes, and constructing a backup state for the failed clustered system, utilizing the plurality of fragments of the configuration data.
    Type: Application
    Filed: April 4, 2017
    Publication date: October 4, 2018
    Inventors: Ralf Eberhard, Manfred Haubrich, Simon Lorenz, Frank B. Schmuck
  • Patent number: 10089319
    Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.
    Type: Grant
    Filed: February 20, 2015
    Date of Patent: October 2, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: M. Corneliu Constantinescu, Marc A. Kaplan, Leo Luan, Sven Oehme, Wayne A. Sawdon, Frank B. Schmuck
  • Publication number: 20180189305
    Abstract: One embodiment provides a method for storage management in a hierarchical file system. The method includes tracking directories for sub-file systems of the hierarchical file system. A request for creation of an additional directory in the hierarchical file system is received. In response to the request, the additional directory is created in a sub-file system of the hierarchical file system while providing that each directory resides in only one sub-file system. If the additional directory is a child directory, the additional directory is created in the sub-file system containing the parent directory of the child directory.
    Type: Application
    Filed: January 3, 2017
    Publication date: July 5, 2018
    Inventors: Deepavali M. Bhagwat, Marc Eshel, Dean Hildebrand, Manoj P. Nalk, Wayne A. Sawdon, Frank B. Schmuck, Renu Tewari
  • Publication number: 20180189304
    Abstract: One embodiment provides a method for storage management in an aggregated file system. The method includes tracking inode numbers for sub-file systems of the aggregated file system. A request for a unique range of inode numbers in the aggregated file system is received. The unique range of inode numbers is provided to one or more sub-file systems of the aggregated file system while providing that each sub-file system of the aggregated file system has a required range of inode numbers and that no two sub-file systems have overlapping inode numbers.
    Type: Application
    Filed: January 3, 2017
    Publication date: July 5, 2018
    Inventors: Deepavali M. Bhagwat, Marc Eshel, Dean Hildebrand, Wayne A. Sawdon, Frank B. Schmuck