公开(公告)号：US08972365B2

公开(公告)日：2015-03-03

申请号：US13613046

申请日：2012-09-13

申请人： Toshihiro Ozawa ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Jun Kato ,  Ken Iizawa ,  Kazuichi Oe ,  Munenori Maeda

发明人： Toshihiro Ozawa ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Jun Kato ,  Ken Iizawa ,  Kazuichi Oe ,  Munenori Maeda

IPC分类号： G06F17/30

CPC分类号： H04L67/2852 ,  G06F3/061 ,  G06F3/0635 ,  G06F3/065 ,  G06F3/067 ,  H04L67/1097

摘要： A storage system having a plurality of storages. The each of the storages include a memory and a processor coupled to the memory. The processor executes a process including transmitting an update request for data which is commonly stored in the plurality of storages according to a predetermined transmission order indicating a path to transfer the update request. The process includes updating data when receiving an update request from another storage. The process includes changing the predetermined transmission order to a transmission order in which one or more storages included in the path are excluded according to the number of times the update request for the data is received.

摘要翻译： 一种具有多个存储器的存储系统。 每个存储器包括存储器和耦合到存储器的处理器。 处理器执行处理，包括根据指示传送更新请求的路径的预定传输顺序发送通常存储在多个存储器中的数据的更新请求。 该过程包括当从另一个存储器接收到更新请求时更新数据。 该过程包括根据接收到数据的更新请求的次数将预定的传输顺序改变为其中包括在路径中的一个或多个存储器被排除的传输顺序。

公开(公告)号：US08667186B2

公开(公告)日：2014-03-04

申请号：US13618466

申请日：2012-09-14

申请人： Kazuichi Oe ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Munenori Maeda ,  Ken Iizawa ,  Toshihiro Ozawa

发明人： Kazuichi Oe ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Munenori Maeda ,  Ken Iizawa ,  Toshihiro Ozawa

IPC分类号： G06F3/00 ,  G06F12/00

CPC分类号： G06F3/0676 ,  G06F3/0611 ,  G06F3/0653 ,  G06F3/0655

摘要： The disclosed method includes obtaining a result concerning a busy rate and the number of accesses per unit time for a storage device including first and second storage areas; determining, from the result, whether an event that a first indicator value for the busy rate is reset occurs; when the event occurred, notifying a controller that makes the number of accesses for the second storage area not greater than the notified number of accesses of the first number of accesses less than the second number of accesses, which was notified immediately before; obtaining another result; updating the first indicator value based on another result; calculating the third number of accesses so that a sum of busy rates corresponding to the third number of accesses and corresponding to the designated number of accesses becomes equal to the updated first indicator value; and notifying the controller of the third number of accesses.

摘要翻译： 所公开的方法包括获得关于包括第一和第二存储区域的存储设备的忙碌率和每单位时间的访问次数的结果; 从结果确定是否发生忙碌率的第一指示符值的复位事件; 当事件发生时，通知使第二存储区域的访问次数不超过紧接在之前通知的第二次访问次数的第一次访问次数的通知次数的控制器; 获得另一个结果; 基于另一结果更新第一指标值; 计算第三次访问次数，使得对应于第三访问次数的对应于指定访问次数的繁忙速率的总和变得等于更新的第一指示符值; 并通知控制器第三个访问次数。

公开(公告)号：US20130097341A1

公开(公告)日：2013-04-18

申请号：US13618466

申请日：2012-09-14

申请人： Kazuichi Oe ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Munenori Maeda ,  Ken Iizawa ,  Toshihiro Ozawa

发明人： Kazuichi Oe ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Munenori Maeda ,  Ken Iizawa ,  Toshihiro Ozawa

IPC分类号： G06F3/00

CPC分类号： G06F3/0676 ,  G06F3/0611 ,  G06F3/0653 ,  G06F3/0655

摘要： The disclosed method includes obtaining a result concerning a busy rate and the number of accesses per unit time for a storage device including first and second storage areas; determining, from the result, whether an event that a first indicator value for the busy rate is reset occurs; when the event occurred, notifying a controller that makes the number of accesses for the second storage area not greater than the notified number of accesses of the first number of accesses less than the second number of accesses, which was notified immediately before; obtaining another result; updating the first indicator value based on another result; calculating the third number of accesses so that a sum of busy rates corresponding to the third number of accesses and corresponding to the designated number of accesses becomes equal to the updated first indicator value; and notifying the controller of the third number of accesses.

摘要翻译： 所公开的方法包括获得关于包括第一和第二存储区域的存储设备的忙碌速率和每单位时间的访问次数的结果; 从结果确定是否发生忙碌率的第一指示符值的复位事件; 当事件发生时，通知使第二存储区域的访问次数不超过紧接在之前通知的第二次访问次数的第一次访问次数的通知次数的控制器; 获得另一个结果; 基于另一结果更新第一指标值; 计算第三次访问次数，使得对应于第三访问次数的对应于指定访问次数的繁忙速率的总和变得等于更新的第一指示符值; 并通知控制器第三个访问次数。

公开(公告)号：US08977897B2

公开(公告)日：2015-03-10

申请号：US13604682

申请日：2012-09-06

申请人： Masahisa Tamura ,  Yasuo Noguchi ,  Toshihiro Ozawa ,  Munenori Maeda ,  Tatsuo Kumano ,  Ken Iizawa ,  Jun Kato

发明人： Masahisa Tamura ,  Yasuo Noguchi ,  Toshihiro Ozawa ,  Munenori Maeda ,  Tatsuo Kumano ,  Ken Iizawa ,  Jun Kato

IPC分类号： G06F11/00

CPC分类号： G06F11/2071 ,  G06F11/2058 ,  G06F11/2082

摘要： An internode put requesting unit detects a time-out with respect to a put request issued to the next node in the order of a multiplexing chain and notifies a put/get executing unit of the time-out. The put/get executing unit sends an error to the previous node in the order of the multiplexing chain or a client and instructs a put-failed-data synchronizing unit to synchronize data failed to be put, and the put-failed-data synchronizing unit performs a synchronization process. A primary makes other put requests wait until completion of the synchronization process. Furthermore, when having received the error, the client issues a get request to the tail end of the multiplexing chain.

摘要翻译： 节点放置请求单元按照多路复用链的顺序检测对发出给下一个节点的放置请求的超时，并将放弃/获取执行单元通知超时。 投放/获取执行单元按照多路复用链或客户端的顺序向前一个节点发送错误，并且指示放置失败数据同步单元将未被置位的数据和丢失失败的数据同步单元 执行同步过程。 主要让其他放置请求等待，直到完成同步过程。 此外，当接收到错误时，客户机向多路复用链的尾端发出获取请求。

公开(公告)号：US20130138999A1

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

申请号：US13604682

申请日：2012-09-06

申请人： Masahisa TAMURA ,  Yasuo Noguchi ,  Toshihiro Ozawa ,  Munenori Maeda ,  Tatsuo Kumano ,  Ken Iizawa ,  Jun Kato

发明人： Masahisa TAMURA ,  Yasuo Noguchi ,  Toshihiro Ozawa ,  Munenori Maeda ,  Tatsuo Kumano ,  Ken Iizawa ,  Jun Kato

IPC分类号： G06F11/16

CPC分类号： G06F11/2071 ,  G06F11/2058 ,  G06F11/2082

摘要： An internode put requesting unit detects a time-out with respect to a put request issued to the next node in the order of a multiplexing chain and notifies a put/get executing unit of the time-out. The put/get executing unit sends an error to the previous node in the order of the multiplexing chain or a client and instructs a put-failed-data synchronizing unit to synchronize data failed to be put, and the put-failed-data synchronizing unit performs a synchronization process. A primary makes other put requests wait until completion of the synchronization process. Furthermore, when having received the error, the client issues a get request to the tail end of the multiplexing chain.

摘要翻译： 节点放置请求单元按照多路复用链的顺序检测对发出给下一个节点的放置请求的超时，并将放弃/获取执行单元通知超时。 投放/获取执行单元按照多路复用链或客户端的顺序向前一个节点发送错误，并且指示放置失败数据同步单元将未被置位的数据和丢失失败的数据同步单元 执行同步过程。 主要让其他放置请求等待，直到完成同步过程。 此外，当接收到错误时，客户机向多路复用链的尾端发出获取请求。

公开(公告)号：US08843672B2

公开(公告)日：2014-09-23

申请号：US13418714

申请日：2012-03-13

申请人： Kazuichi Oe ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Toshihiro Ozawa

发明人： Kazuichi Oe ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Toshihiro Ozawa

IPC分类号： G06F3/00 ,  G06F11/34

CPC分类号： G06F11/3409 ,  G06F11/3485 ,  G06F2201/81

摘要： An access method includes: obtaining, by a computer, a result of monitoring a busy rate and a number of access operations per unit time of a storage device, the storage device having a first storage area and a second storage area; calculating a characteristic of correlation between the busy rate and the number of access operations per unit time based on the result; calculating a second number of access operations per unit time based on the characteristic of the correlation such that a sum of a first busy rate corresponding to a first number of access operations per unit time and a second busy rate corresponding to a second number of access operations per unit time becomes equal to or lower than a given busy rate; and controlling a number of operations to access the second storage area per unit time based on the second number of access operations.

摘要翻译： 访问方法包括：由计算机获取监视存储设备每单位时间的繁忙率和访问次数的结果，所述存储设备具有第一存储区域和第二存储区域; 基于结果计算每单位时间的繁忙率和访问次数之间的相关性的特征; 基于所述相关性的特征来计算每单位时间的第二数量的访问操作，使得对应于每单位时间的第一次访问操作的第一繁忙速率和与第二次访问操作相对应的第二繁忙速率的总和 每单位时间变得等于或低于给定的繁忙率; 以及基于所述第二数量的访问操作来控制每单位时间访问所述第二存储区域的操作的数量。

公开(公告)号：US20120137086A1

公开(公告)日：2012-05-31

申请号：US13217552

申请日：2011-08-25

申请人： Kazuichi OE ,  Tatsuo Kumano ,  Yasuo Noguchi ,  Kazutaka Ogihara ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Toshihiro Ozawa

发明人： Kazuichi OE ,  Tatsuo Kumano ,  Yasuo Noguchi ,  Kazutaka Ogihara ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Toshihiro Ozawa

IPC分类号： G06F12/00

CPC分类号： G06F3/0644 ,  G06F3/061 ,  G06F3/0659 ,  G06F3/0676

摘要： A file server has a conversion table that stores therein, in a corresponding manner, logical addresses specified by a higher-level layer and physical addresses specified by a disk driver that are address information indicative of a storage area in a disk device. The file server accesses the disk device with a storage area indicated by a physical address as an access destination and counts up the number of access requests to each storage area in a given period of time for each of the logical addresses. The file server then updates the conversion table such that the physical addresses are lined up in a descending order of the logical addresses of a higher number of the access requests counted. Thereafter, the file server changes storage areas of data stored in the storage device based on the conversion table updated.

摘要翻译： 文件服务器具有转换表，其中以对应的方式存储由较高级别层指定的逻辑地址和由盘驱动器指定的指示盘设备中的存储区域的地址信息指定的物理地址。 文件服务器以由物理地址指示的存储区域作为访问目的地访问磁盘设备，并且在每个逻辑地址的给定时间段内对每个存储区域的访问请求数进行计数。 然后，文件服务器更新转换表，使得物理地址以更高数量的访问请求的逻辑地址的降序排列。 此后，文件服务器基于更新的转换表来改变存储在存储装置中的数据的存储区域。

公开(公告)号：US09053074B2

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

申请号：US13588415

申请日：2012-08-17

申请人： Toshihiro Ozawa ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Kazuichi Oe

发明人： Toshihiro Ozawa ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Kazuichi Oe

IPC分类号： G06F12/00 ,  G06F11/20

CPC分类号： G06F11/2089 ,  G06F11/2092

摘要： A computer-readable recording medium stores a program that causes a computer to execute a writing control process that includes receiving a writing request to write a first data to a first storage apparatus; determining a second data from among a series of data and based on a writing sequence of the series of data written to the computer and a count of storage areas at a second storage apparatus that sequentially selects from among the storage areas when data is received, a storage area to be over written by the received data, where the second data is written to the first storage apparatus and is identical to data that is stored in the storage area to be selected next at the second storage apparatus; and transmitting copy data of the first data to the second storage apparatus, when the second data has been written to the first storage apparatus.

摘要翻译： 计算机可读记录介质存储使计算机执行写入控制处理的程序，该程序包括接收将第一数据写入第一存储装置的写入请求; 从一系列数据中确定第二数据，并且基于写入计算机的一系列数据的写入顺序和在接收数据时从存储区域中顺次选择的第二存储装置的存储区域的计数， 存储区域被接收到的数据写入，其中第二数据被写入到第一存储装置，并且与在第二存储装置中接下来要选择的存储区域中存储的数据相同; 以及当所述第二数据已被写入到所述第一存储装置时，将所述第一数据的复制数据发送到所述第二存储装置。

公开(公告)号：US20130013871A1

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

申请号：US13533085

申请日：2012-06-26

申请人： Kazutaka OGIHARA ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Toshihiro Ozawa ,  Takashi Watanabe ,  Kazuichi Oe

发明人： Kazutaka OGIHARA ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Toshihiro Ozawa ,  Takashi Watanabe ,  Kazuichi Oe

IPC分类号： G06F12/00

CPC分类号： G06F11/1666 ,  G06F11/2089

摘要： An information processing system includes a first processor to store data segments in a first memory, to send the data segments to be stored in the first memory to a second processor, and to read the data segments from the first memory so as to store the data segments in a second memory; and the second processor to store the data segments to be stored sent from the first processor in a third memory, wherein when the first processor notifies the second processor about data that is permitted to be removed, the first processor sends ID information to the second processor that renders a particular data segment that was last stored in the second memory identifiable, and the second processor removes from the third memory the particular data segment and an older data segment stored previous to the particular data segment from the data segments stored in the third memory.

摘要翻译： 信息处理系统包括：第一处理器，用于将数据段存储在第一存储器中，将要存储在第一存储器中的数据段发送到第二处理器，以及从第一存储器读取数据段以存储数据 第二存储器中的段; 以及第二处理器，用于将要从第一处理器发送的要存储的数据段存储在第三存储器中，其中当第一处理器通知第二处理器关于允许被移除的数据时，第一处理器向第二处理器发送ID信息 其使得最后存储在可识别的第二存储器中的特定数据段，并且第二处理器从存储在第三存储器中的数据段从第三存储器中删除特定数据段和存储在特定数据段之前的较旧数据段 。

公开(公告)号：US20120265907A1

公开(公告)日：2012-10-18

申请号：US13418714

申请日：2012-03-13

申请人： Kazuichi OE ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Toshihiro Ozawa

发明人： Kazuichi OE ,  Kazutaka Ogihara ,  Yasuo Noguchi ,  Tatsuo Kumano ,  Masahisa Tamura ,  Yoshihiro Tsuchiya ,  Takashi Watanabe ,  Toshihiro Ozawa

IPC分类号： G06F3/00

CPC分类号： G06F11/3409 ,  G06F11/3485 ,  G06F2201/81

摘要： An access method includes: obtaining, by a computer, a result of monitoring a busy rate and a number of access operations per unit time of a storage device, the storage device having a first storage area and a second storage area; calculating a characteristic of correlation between the busy rate and the number of access operations per unit time based on the result; calculating a second number of access operations per unit time based on the characteristic of the correlation such that a sum of a first busy rate corresponding to a first number of access operations per unit time and a second busy rate corresponding to a second number of access operations per unit time becomes equal to or lower than a given busy rate; and controlling a number of operations to access the second storage area per unit time based on the second number of access operations.

摘要翻译： 访问方法包括：由计算机获取监视存储设备每单位时间的繁忙率和访问次数的结果，所述存储设备具有第一存储区域和第二存储区域; 基于结果计算每单位时间的繁忙率和访问次数之间的相关性的特征; 基于所述相关性的特征来计算每单位时间的第二数量的访问操作，使得对应于每单位时间的第一次访问操作的第一繁忙速率和与第二次访问操作相对应的第二繁忙速率的总和 每单位时间变得等于或低于给定的繁忙率; 以及基于所述第二数量的访问操作来控制每单位时间访问所述第二存储区域的操作的数量。