-
公开(公告)号：US20220150065A1
公开(公告)日：2022-05-12
申请号：US17095522
申请日：2020-11-11
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Gregory T. KISHI , Joseph W. DAIN , Abhishek JAIN , Nilesh Prabhakar BHOSALE
Abstract: Provided are a computer program product, system, and method for determining an encryption technique for a modified data object to backup. Deep data inspection is performed on an object using a natural language processing module to determine facets for the object. The facets provide facet values for instances of sensitive information in the object. The facet values for the object are processed to determine a cumulative facet value. A determination is made of an encryption technique comprising one of a plurality of different encryption techniques to use on the object based on the cumulative facet value. The determined encryption technique is used to encrypt the object to transfer to a backup storage.
-
2.发明申请COLLISION AVOIDANCE USING DYNAMIC TARGET VOLUME ALLOCATION FROM A SHARED RESOURCE POOL 有权使用来自共享资源池的动态目标量分配的冲突避免公开(公告)号：US20150286428A1
公开(公告)日：2015-10-08
申请号：US14243319
申请日：2014-04-02
Applicant: International Business Machines Corporation
Inventor： Joseph W. DAIN , Gregory T. KISHI , Osnat SHASHA , Christopher ZAREMBA
IPC: G06F3/06
CPC classification number: G06F3/0619 , G06F3/0608 , G06F3/0647 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F3/0688 , G06F3/0689 , G06F11/1446 , G06F11/1469 , G06F2003/0692
Abstract: Dynamically reuse from a global pool of allocated resources an existing Flashcopy target volume containing an older Flashcopy backup and a consistency group for one of a mount operation, a restore operation, and a clone operation when dynamically allocating a new Flashcopy target volume for the new Flashcopy backup.
Abstract translation: 在动态分配新的Flashcopy新的Flashcopy目标卷时，从分配资源的全局池动态地重新使用现有的包含较早版本的Flashcopy备份的Flashcopy目标卷和一个安装操作，还原操作和克隆操作的一致性组 备份。
-
3.发明申请EFFICIENT REPOSITORY INGEST OF A TARGET VOLUME WITHOUT BREAKING A FLASHCOPY CHAIN 有权有效的记录在目标音量之内，没有打破闪光链公开(公告)号：US20150286427A1
公开(公告)日：2015-10-08
申请号：US14243288
申请日：2014-04-02
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Shay H. AKIRAV , Joseph W. DAIN , Gregory T. KISHI , Osnat SHASHA
IPC: G06F3/06
CPC classification number: G06F3/0619 , G06F3/0608 , G06F3/0647 , G06F3/065 , G06F3/0655 , G06F3/067 , G06F3/0688 , G06F3/0689
Abstract: Dynamically creates a cloned target volume by cloning a production volume without breaking a Flashcopy chain for continuing an ingestion of a FlashCopy backup target volume.
Abstract translation: 通过克隆生产卷而不中断Flashcopy链以继续摄取FlashCopy备份目标卷来动态创建克隆的目标卷。
-
公开(公告)号：US20220156111A1
公开(公告)日：2022-05-19
申请号：US16952307
申请日：2020-11-19
Applicant: International Business Machines Corporation
Inventor： Scott BREWER , Theodore Timothy HARRIS, JR. , Sara Megan CORONADO , Raul E. SABA , Drew OLSON , Joseph W. DAIN , Gregory T. KISHI
IPC: G06F9/48 , G06F16/182 , G06F16/17
Abstract: A method includes scanning, by a device of a plurality of devices, a directory of a file system. The directory includes a plurality of subdirectories, and each device of the plurality of devices corresponds to a different queue of a plurality of queues. The method also includes inserting, by the device, a plurality of scanning tasks into a subset of the plurality of queues in a round robin fashion. The plurality of scanning tasks correspond to the plurality of subdirectories and responding to a scanning task of the plurality of scanning tasks includes scanning a subdirectory of the plurality of subdirectories.
-
公开(公告)号：US20180285379A1
公开(公告)日：2018-10-04
申请号：US15475540
申请日：2017-03-31
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Joseph W. DAIN , Itzhack GOLDBERG , Gregory T. KISHI
Abstract: Embodiments for optimized deduplicated object storage system by one or more processors. An uncompressed and non-deduplicated copy of an object may be stored on a node in a distributed object storage system and one or more compressed and deduplicated copies of the uncompressed and non-deduplicated copy of the object may be distributed on one or more alternative nodes in the distributed object storage system.
-
Patent Agency Ranking
公开(公告)号：US20150286540A1
公开(公告)日：2015-10-08
申请号：US14243237
申请日：2014-04-02
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Joseph W. DAIN , Gregory T. KISHI , Osnat SHASHA , Christopher ZAREMBA
IPC: G06F11/14
CPC classification number: G06F11/1469 , G06F11/1435 , G06F11/1448 , G06F11/1451 , G06F11/1458 , G06F11/1464 , G06F2201/82 , G06F2201/84
Abstract: A collision is avoided between a new Flashcopy backup and an existing Flashcopy target volume containing an older Flashcopy backup being ingested during one of a mount operation, a restore operation, and a clone operation by dynamically allocating a new Flashcopy target volume for the new Flashcopy backup.
Abstract translation: 在新的Flashcopy备份与现有的Flashcopy目标卷之间避免了冲突，该卷包含一个较早的Flashcopy备份，在其中一个装载操作，还原操作和克隆操作期间通过为新的Flashcopy备份动态分配新的Flashcopy目标卷 。
-
7.发明申请EFFICIENT FLASHCOPY BACKUP TARGET VOLUME ALLOCATION FROM A SHARED RESOURCE POOL WHILE INGESTING A FLASHCOPY BACKUP IN A REPOSITORY 有权有效的闪存备份目标在共享资源池中的容量分配在一个记录中创建一个闪存备份公开(公告)号：US20150286433A1
公开(公告)日：2015-10-08
申请号：US14243463
申请日：2014-04-02
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Joseph W. DAIN , Gregory T. KISHI , Osnat SHASHA , Christopher ZAREMBA
IPC: G06F3/06
CPC classification number: G06F3/0619 , G06F3/065 , G06F3/0655 , G06F3/0665 , G06F3/0688 , G06F3/0689 , G06F11/1448 , G06F11/1451 , G06F11/1458 , G06F11/1466 , G06F11/1469 , G06F2003/0692 , G06F2201/82 , G06F2201/84
Abstract: Avoiding a collision between a new FlashCopy backup and an existing FlashCopy target volume containing an older FlashCopy backup being ingested into a repository by dynamically allocating a new FlashCopy target volume for the new FlashCopy backup.
Abstract translation: 通过为新的FlashCopy备份动态分配新的FlashCopy目标卷，避免新的FlashCopy备份与现有的FlashCopy目标卷之间发生冲突，该卷包含被摄入到存储库中的较旧的FlashCopy备份。
-
8.发明申请EFFICIENT FLASHCOPY BACKUP AND MOUNT, CLONE, OR RESTORE COLLISION AVOIDANCE USING DYNAMIC VOLUME ALLOCATION FROM A SHARED RESOURCE POOL 有权使用分享资源池的动态体积分配进行有效的闪存备份和安装，克隆或恢复冲突避免公开(公告)号：US20150286430A1
公开(公告)日：2015-10-08
申请号：US14243360
申请日：2014-04-02
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Joseph W. DAIN , Gregory T. KISHI , Osnat SHASHA , Christopher ZAREMBA
IPC: G06F3/06
CPC classification number: G06F11/14 , G06F11/1446 , G06F11/1448 , G06F11/1451 , G06F11/1458 , G06F11/1469 , G06F2201/82 , G06F2201/84
Abstract: For efficient Flashcopy backup and a mount, clone, or restore task collision avoidance using dynamic volume allocation with reuse and from a shared resource pool, dynamically using a Flashcopy target volume for the Flashcopy backup from a global pool of Flashcopy backup target volumes shared by a plurality of device classes for avoiding a collision between the Flashcopy backup and the mount, the clone, or the restore task.
Abstract translation: 对于高效的Flashcopy备份和使用动态卷分配（从重用和共享资源池）进行挂载，克隆或还原任务冲突避免，可以从Flashcopy备份目标卷动态使用Flashcopy目标卷，从Flashcopy备份目标卷共享的全局池 多个设备类，用于避免Flashcopy备份与安装，克隆或恢复任务之间的冲突。
-
公开(公告)号：US20220156276A1
公开(公告)日：2022-05-19
申请号：US16953157
申请日：2020-11-19
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Joseph W. DAIN , Gregory T. KISHI , Deepavali M. BHAGWAT , Lukas RUPPRECHT , Constantine ARNOLD
Abstract: A dataset formatted in a first format is generated, wherein the dataset formatted in the first format includes at least a plurality of data elements that comprise data. A selection is made of machine learning framework, wherein the machine learning framework operates on datasets formatted in a second format that is different from the first format. The dataset is converted from the first format to the second format and links are generated from the converted dataset formatted in the second format to the plurality of data elements of the dataset formatted in the first format to avoid creating additional copies of the plurality of data elements.
-
公开(公告)号：US20180081917A1
公开(公告)日：2018-03-22
申请号：US15826967
申请日：2017-11-30
Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventor： Gregory T. KISHI
CPC classification number: G06F17/30303 , G06F3/0619 , G06F3/064 , G06F3/0683 , G06F11/106 , G06F12/0866
Abstract: Various embodiments for scrubbing data within a data storage subsystem are disclosed. An event is detected in which utilization of the data storage subsystem has fallen below a dynamically adjusted threshold value. A storage element is selected from a plurality of storage elements within the data storage subsystem. Data modifications are temporarily suspended on the selected storage element while simultaneously maintaining read access to the selected storage element. A scrubbing operation is performed on the selected storage element after the temporary designation, wherein the scrubbing operation automatically initiates when a quantity of active data to be scrubbed reaches a predetermined quantity threshold, the predetermined quantity threshold of active data comprising a total threshold number of bytes or blocks corresponding to a greatest frequency of access thereof.
-
-
-
-
-
-
-
-
-
Search Results
28
records
(took 0.02 seconds)
