公开(公告)号：JP2007066313A

公开(公告)日：2007-03-15

申请号：JP2006232745

申请日：2006-08-29

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

Inventor： HAUSTEIN NILS ,  DANIEL J WINARSKI ,  TROPPENS ULF ,  CRAIG A KLEIN ,  JOSEF WEINGAND

IPC: G06F3/06 ,  G11B20/10 ,  G11B27/10

CPC classification number: B65G1/1371 ,  G06F3/0617 ,  G06F3/0631 ,  G06F3/0685 ,  G06F3/0686 ,  G06F11/1456 ,  G06F2201/80 ,  G11B27/002 ,  G11B2220/41

Abstract: PROBLEM TO BE SOLVED: To provide a method for storing data in data storage equipment. SOLUTION: The method includes a plurality of data storage media, an automated data library comprising a plurality of data storage devices, a first plurality of storage cells and a robotic accessor. The method further provides a storage vault comprising a second plurality of storage cells but no data storage devices. The method selects the (i)-th data storage medium, sets the (i)-th data state, where that (i)-th data state is selected from the group consisting of online, offline and vault. If the method sets the (i)-th data state to online, then the method mounts that (i)-th data storage medium in one of the data storage devices. If the method sets the (i)-th data state to offline, then the method removably places the (i)-th data storage medium in one of the first plurality of storage cells. If the method sets the (i)-th data state to vault, then the method places the (i)-th data storage medium in one of the plurality of second plurality of storage cells. COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供一种在数据存储设备中存储数据的方法。 解决方案：该方法包括多个数据存储介质，包括多个数据存储设备的自动数据库，第一多个存储单元和机器人访问器。 该方法还提供包括第二多个存储单元但不包括数据存储设备的存储库。 该方法选择第（i）个数据存储介质，设置第（i）个数据状态，其中第（i）个数据状态从由在线，离线和保险库组成的组中选择。 如果该方法将第（i）个数据状态设置为联机，则该方法将第（i）个数据存储介质安装在数据存储设备之一中。 如果方法将第（i）个数据状态设置为离线，则该方法可移除地将第（i）个数据存储介质放置在第一多个存储单元之一中。 如果该方法将第（i）个数据状态设置为保管库，则该方法将第（i）个数据存储介质放置在多个第二多个存储单元之一中。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：GB2525346B

公开(公告)日：2017-02-08

申请号：GB201513161

申请日：2013-12-16

Applicant: IBM

Inventor： NILS HAUSTEIN ,  HARALD SEIPP ,  ULF TROPPENS ,  DANIEL J WINARSKI

IPC: H04L9/32 ,  H04L47/31

Abstract: An approach for managing a data package is provided. Network throughput is determined to exceed a threshold. A sender computer determines a hash digest of the data package by using a hash function selected based on central processing unit utilization. If the hash digest is in a sender hash table, then without sending the data package, the sender computer sends the hash digest and an index referring to the hash digest so that a recipient computer can use the index to locate a matching hash digest and the data package in a recipient hash table. If the hash digest is not in the sender hash table, then the sender computer adds the data package and the hash digest to the sender hash table and sends the data package and the hash digest to the second computer to check the integrity of the data package based on the hash digest.