公开(公告)号：JP2007095231A

公开(公告)日：2007-04-12

申请号：JP2005286513

申请日：2005-09-30

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

Inventor： WATANABE TERUE ,  ITAGAKI HIROSHI ,  NAKAYAMA KOICHI ,  NAGURA HIROHISA ,  KATAGIRI TAKASHI ,  OISHI YUTAKA ,  SHIRATORI TOSHIYUKI

IPC: G11B20/18 ,  G11B20/10

CPC classification number: G11B5/09 ,  G11B5/00821 ,  G11B20/10527 ,  G11B20/1201 ,  G11B2020/10666 ,  G11B2020/10759 ,  G11B2220/90

Abstract: PROBLEM TO BE SOLVED: To provide a write and read method for not performing a backhitch operation for avoiding the violation of a 4m rule while it is determined to write a sequential data set within 4m in a tape drive of LTO or the like. SOLUTION: The write and read control method for recording at least one data set in 4m in the length direction of a tape medium 550 comprises: a step of successively storing a plurality of blocks 510 of various sizes sent from a host in a buffer 500 divided by the segment 520 of a fixed size; a step of writing the contents of the segment to the tape medium as a data set when the segment 520 is prepared by at least one block 510 and writing a Null data set to the tape medium within 4m when the next segment 520 is not prepared while the tape medium moves for 4m; and a step of reading the data set to the segment of the buffer 500. COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：为了提供一种写入和读取方法，用于在确定在4T的磁带驱动器内写入4m内的顺序数据集时，不执行用于避免4m规则的违反操作的后退操作 。 解决方案：用于在带介质550的长度方向上记录至少一个4m数据集的写入和读取控制方法包括：将主机发送的各种尺寸的多个块510连续存储在 缓冲器500除以固定尺寸的段520; 当片段520由至少一个块510准备并且当下一个段520未准备好时将空的数据集写入磁带介质4m内时，将段的内容写入磁带介质作为数据集的步骤， 磁带介质移动4m; 以及读取缓冲器500的段的数据集的步骤。（C）2007，JPO＆INPIT

公开(公告)号：JP2001188639A

公开(公告)日：2001-07-10

申请号：JP37216199

申请日：1999-12-28

Applicant: IBM

Inventor： WATANABE TERUE

IPC: G06F3/048 ,  G06F3/033 ,  G06T3/40 ,  G06T11/80 ,  G09G5/36 ,  G06F3/00

Abstract: PROBLEM TO BE SOLVED: To provide a method and a device capable of easily discriminating a magnified/reduced area and a magnification/reduction ratio. SOLUTION: Graphic constitution information to be a profile information including interlocking information between a magnified/reduced graphic and the other graphics is stored and the positional information on a size changing end of the graphic selected as a graphic to be magnified/reduced and magnification/reduction ratio information to be the degree of change are obtained. The magnification/reduction ratio of each graphic is calculated from the obtained information and each graphic is displayed on the basis of display specification information such as color density or pattern density corresponding to the magnification/reproduction ratio. Since a reduced area is displayed in a thick color in order to indicate compression and a magnified area is displayed in a thin color, the reduced area and the magnified area can be recognized without comparing the scales of respective areas and the degrees of magnification and reduction can be easily discriminated.

公开(公告)号：JP2009086838A

公开(公告)日：2009-04-23

申请号：JP2007253430

申请日：2007-09-28

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

Inventor： FUJIWARA SHINOBU ,  INAGAKI TAKESHI ,  MIMA SHINSUKE ,  TSURUTA KAZUHIRO ,  WATANABE TERUE

IPC: G06F3/06 ,  G06F13/10

CPC classification number: G06F3/0635 ,  G06F3/0625 ,  G06F3/0649 ,  G06F3/067 ,  G06F3/0685 ,  Y02D10/154

Abstract: PROBLEM TO BE SOLVED: To determine a storage area, among multiple storage areas, which meets a predetermined requirement to be a target for access. SOLUTION: In a controller 20 for controlling a multi-hierarchical storage subsystem, the following components operate under the control of a file write unit 21 and a file read unit 22. First, a list acquiring unit 23 acquires a list of tiers that can meet file access requirements. A requisite energy calculating unit 24 calculates an additional energy amount necessary to satisfy file access requirements for each tier, and an allowable energy calculating unit 25 calculates an additional energy amount allowable for access, and a path acquiring unit 26 acquires a path to a tier to be accessed based on the energy amounts. An identifier acquiring unit 27 acquires a file identifier, and an access point generating unit 28 generates a file access point based on the path and the file identifier. COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：确定满足作为访问目标的预定要求的多个存储区域中的存储区域。 解决方案：在用于控制多层次存储子系统的控制器20中，以下组件在文件写入单元21和文件读取单元22的控制下操作。首先，列表获取单元23获取层级列表 这可以满足文件访问要求。 所需能量计算单元24计算满足每层的文件访问要求所需的附加能量，并且容许能量计算单元25计算允许访问的附加能量，路径获取单元26获取到 基于能量量进行访问。 标识符获取单元27获取文件标识符，并且接入点生成单元28基于路径和文件标识符生成文件接入点。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2009098941A

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

申请号：JP2007269971

申请日：2007-10-17

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

Inventor： WATANABE TERUE ,  FUJIWARA SHINOBU ,  INAGAKI TAKESHI ,  MIMA SHINSUKE ,  TSURUTA KAZUHIRO

IPC: G06F12/00 ,  G06F3/06

CPC classification number: G06F11/3485 ,  G06F3/0605 ,  G06F3/065 ,  G06F3/0653 ,  G06F3/0685 ,  G06F11/3419 ,  G06F11/3452

Abstract: PROBLEM TO BE SOLVED: To provide a technique for selecting the optimum storage device among the plurality of storage devices as the copy or movement source of data.
SOLUTION: A controller for connecting the different kinds of storage devices includes: a performance information storage part for storing performance information of each storage device; a list storage part for storing the list of data in each storage device; a monitor part for monitoring the load states of each storage device and the controller; a detecting part; an estimating part; and a determining part. When data is copied, etc., with respect to a certain storage device, the detecting part detects the storage devices for storing the data to be copied, based on the list. The estimating part estimates copying time with respect to the detected each storage device, based on performance information and load information. The determining part determines the storage device to be the copy source, based on the estimation result.
COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于选择多个存储装置中的最佳存储装置作为数据的复制或移动源的技术。 解决方案：用于连接不同种类的存储设备的控制器包括：性能信息存储部分，用于存储每个存储设备的性能信息; 列表存储部，用于存储每个存储装置中的数据列表; 用于监视每个存储设备和控制器的负载状态的监视器部分; 检测部 估计部分; 和决定部分。 当相对于某个存储装置复制数据等时，检测部分根据列表来检测用于存储要复制的数据的存储装置。 估计部分基于性能信息和负载信息来估计相对于检测到的每个存储设备的复制时间。 决定部基于估计结果来确定存储装置为复制源。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2012014778A

公开(公告)日：2012-01-19

申请号：JP2010149607

申请日：2010-06-30

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

Inventor： OISHI YUTAKA ,  TAKETOMI TOMOKO ,  HIRATA TAKAMASA ,  WATANABE TERUE ,  MASUDA SETSUKO ,  MORI YUKO

IPC: G11B20/10

CPC classification number: G11B5/00813 ,  G11B20/10527 ,  G11B20/18 ,  G11B2020/10759 ,  G11B2220/90

Abstract: PROBLEM TO BE SOLVED: To improve write performance to a tape medium while securing resistance to errors.SOLUTION: In a controller 16 for a tape drive, a CM input/output part 44 recognizes a tape format, a tape variable acquisition part 45 acquires a tape variable corresponding to the tape format, a set variable acquisition part 46 acquires a set variable, a minimum number calculation part 47 uses the tape variable and the set variable to calculate a minimum number m of a sub-data set to write so as to secure resistance to a burst error. When a command processing part 41 receives a synchronous command, a buffer management part 42 generates an n pieces of sub-data set for storing data in the buffer, when n is smaller than m, padding is performed to make m pieces of sub-data set write data, and when n is equal to or larger than m, n pieces of sub-data set is made the write data, and a channel input/output part 43 writes the write data to the tape.

Abstract translation: 要解决的问题：提高对磁带介质的写入性能，同时确保抵抗错误。 解决方案：在用于磁带驱动器的控制器16中，CM输入/输出部分44识别磁带格式，磁带可变获取部分45获取与磁带格式对应的磁带变量，设定变量获取部分46获取 设定变量，最小数量计算部分47使用磁带变量和设定变量来计算要写入的子数据集的最小数量m，以确保对突发错误的抵抗力。 当命令处理部分41接收到同步命令时，缓冲器管理部分42在n小于m时生成用于存储数据的n个子数据组，当n小于m时，执行填充以使m个子数据 设置写入数据，并且当n等于或大于m时，将n个子数据组设置为写入数据，并且通道输入/输出部分43将写入数据写入磁带。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2011113605A

公开(公告)日：2011-06-09

申请号：JP2009268918

申请日：2009-11-26

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

Inventor： OISHI YUTAKA ,  ITAGAKI HIROSHI ,  WATANABE TERUE ,  MASUDA SETSUKO

IPC: G11B20/12 ,  G11B20/10

CPC classification number: G11B27/107 ,  G11B27/032 ,  G11B2220/93

Abstract: PROBLEM TO BE SOLVED: To provide a tape recorder and a tape recording method for effectively using a tape by increasing a free space without losing necessary data on the tape.
SOLUTION: The tape recorder has a tape including at least one partition, and controls access to the tape. The tape recorder includes: a means for identifying the position of data on the tape; a means for sequentially reading necessary data areas in the data; a means for sequentially copying the necessary data areas to the beginning of a free space on the tape; a means for creating a continuous forward free space formed of unnecessary data areas and copy source areas of the necessary data areas on the tape; and a means for moving the beginning of the partition (BOP) to a position immediately after the forward free space and for updating positional information on the beginning of the partition.
COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：提供一种磁带记录器和磁带记录方法，用于通过增加自由空间而有效地使用磁带，而不会在磁带上丢失必要的数据。

解决方案：磁带录音机具有至少包含一个分区的磁带，并控制磁带的访问。 录像机包括：用于识别磁带上的数据位置的装置; 用于顺序读取数据中的必要数据区域的装置; 用于顺序地将所需数据区复制到磁带上的可用空间的开头的装置; 用于创建由不必要的数据区域形成的连续向前空闲空间并复制在磁带上的必要数据区域的源区域的装置; 以及用于将分区（BOP）的开始移动到紧接在前向空闲空间之后的位置并用于更新分区开始处的位置信息的装置。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：JP2004341925A

公开(公告)日：2004-12-02

申请号：JP2003139063

申请日：2003-05-16

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

Inventor： WATANABE TERUE

IPC: G06F12/00 ,  G06F3/06 ,  G11B20/10 ,  G11B20/12

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0682 ,  G11B20/1201

Abstract: PROBLEM TO BE SOLVED: To provide a storage which writes data to a recording medium at a high speed and efficiently concerning a storage, a control method thereof, a program therefor and a recording medium therefor which control the method of writing data in a data recording medium. SOLUTION: The storage which writes a plurality of writing data sequentially by a segment unit of the size decided beforehand to a data recording medium is provided with a sequential writing part which writes writing data at least in one segment of data recording medium, when the storage receives writing data corresponding to writing directions that the writing data are written to the data recording medium concerning a plurality of writing data respectively; and a connecting writing part which writes a plurality of writing data to the fewer number of segments comparing the segments necessary to write a plurality of writing data which are the connecting objects in the data recording medium, connecting a plurality of writing data written after one writing data among a plurality of writing data written in the data recording medium by the sequential writing part, when the size of one writing data is smaller than the prescribed size specified beforehand. COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：提供一种高速存储数据并高效地存储数据的存储器，其控制方法，程序及其记录介质，其控制将数据写入的方法 数据记录介质。 解决方案：将由预先决定的大小的段单元依次写入多个写入数据到数据记录介质的存储器设置有至少在数据记录介质的一个段中写入数据的顺序写入部分， 当存储器分别接收与写入数据相对应的写入数据的写入数据时，写入数据分别写入到数据记录介质中; 以及连接写入部分，其将多个写入数据写入较少数量的片段，比较写入作为数据记录介质中的连接对象的多个写入数据所需的片段，连接写入的多个写入数据 当一个写入数据的大小小于预先指定的规定大小时，顺序写入部分写入数据记录介质的多个写入数据之间的数据。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：DE112011102139T5

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

申请号：DE112011102139

申请日：2011-03-23

Applicant: IBM

Inventor： OISHI YUTAKA ,  WATANABE TERUE ,  HIRATA TAKAMASA ,  MASUDA SETSUKO ,  MORI YUHKO

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

Abstract: Die vorliegende Erfindung stellt ein Verfahren zum Schreiben von kleinen Vorgängen auf Band bereit. Eine erste Datei wird als eine Vielzahl von Datensätzen (DSs) mit fester Länge geschrieben (Schritt 1), die DS-Nummer des letzten DS in der Vielzahl von DSs und die WP-Nummer werden als #N (DS#N) bzw. als #M (WP#M) in einem Speicher gespeichert (Schritt 2), und das Ende der ersten Datei und die zweite Datei im DS, der auf den letzten DS (DS#N, WP#M) folgt, der die erste Datei enthält, werden in sequenzielle DS-Einheiten gepackt und geschrieben und als DS#N, DS#N + 1 usw. und WP#M + 1 im Speicher in einer sequenziellen Reihenfolge in DS gespeichert, welche die zweite Datei enthalten (Schritt 3). Die verbliebene erste, zweite oder dritte Datei wird verpackt und der DS#N mit WP#M wird als DS#N mit WP#M + 2 überschrieben und die verbliebenen #N in den DS-Nummern der zweiten Datei und die dritte Datei im nachfolgenden DS werden als DS#N + 1, N + 2 usw. mit WP#M + 2 geschrieben, und die DS#N, #N + 1, #N + 2 usw. mit WP#M + 2 werden im Speicher gespeichert.

公开(公告)号：GB2496773A

公开(公告)日：2013-05-22

申请号：GB201300578

申请日：2011-03-23

Applicant: IBM

Inventor： OISHI YUTAKA ,  HIRATA TAKAMASA ,  WATANABE TERUE ,  MASUDA SETSUKO ,  MORI YUHKO

IPC: G06F3/06

Abstract: Disclosed is a tape writing method for small transactions. For a data set of fixed length, (step 1) a first file is written as a plurality of DSs, and the DS number and the WP number of the last DS are stored into memory as #N (DS#N) and #M (WP#M), respectively; and (step 2) into the DS which follows the last DS (DS#N, WP#M) that includes the first file, the last first and second files are packed and sequentially written in units of DSs, and into the DS which includes the second file, DS#N, DS#N+1, ¦, and WP#M+1 are sequentially stored into memory. (Step 3) The remainder of the first, second, and third files are packed, and with DS#N at WP#M+2, the DS#N of WP#M is appended onto, and for after the DS number of the second and third files, the remaining portion of the #N is written as following DSs as DS#N+1, DS#N+2, ¦, at WP#M+2. With DS#N, #N+1, #N+2, ¦, the WP#M+2 is stored into memory.

公开(公告)号：MX2012014856A

公开(公告)日：2013-02-01

申请号：MX2012014856

申请日：2011-03-23

Applicant: IBM

Inventor： OISHI YUTAKA ,  HIRATA TAKAMASA ,  WATANABE TERUE

IPC: G06F3/06 ,  G11B20/10

Abstract: La presente invención proporciona un método de escritura descrita para transacciones pequeñas. Un primer archivo es escrito como una pluralidad de conjuntos de datos (DS) de longitud fija (Paso 1), el número de DS del DS final en la pluralidad de DS se almacena en la memoria como #N (DS#N) y el número WP como #M(WP#M) (Paso 2), y el primer archivo y el segundo archivo finales en el DS después del DS final DS(DS#N, WP#M) que contienen el primer archivo son empaquetados y escritos en unidades de DS secuenciales, y son almacenados en la memoria como DS#N, DS#N+1, etc. y WP#M+1 en orden secuencial en el DS que contiene el segundo archivo (Paso 3) . El primero, segundo y tercer archivos restantes son empaquetados y el DS#N con WP#M es sobrescrito como DS#N con WP#M+2 y el #N restante en los números de DS del segundo archivo y el tercer archivo en el DS subsecuentes, son descritos como DS#N+1, N+2, etc. con WP#M+2, y el DS#N, #N+1, #N+2, etc. con WP#M+2 son almacenados en la memoria.