US7337285B2 - Buffer allocation based upon priority - Google Patents

Buffer allocation based upon priority Download PDF

Info

Publication number
US7337285B2
US7337285B2 US10/861,460 US86146004A US7337285B2 US 7337285 B2 US7337285 B2 US 7337285B2 US 86146004 A US86146004 A US 86146004A US 7337285 B2 US7337285 B2 US 7337285B2
Authority
US
United States
Prior art keywords
buffer
buffer area
amount
priority degree
host
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US10/861,460
Other versions
US20040250026A1 (en
Inventor
Kazunori Tanoue
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Assigned to NEC CORPORATION reassignment NEC CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: TANOUE, KAZUNORI
Publication of US20040250026A1 publication Critical patent/US20040250026A1/en
Application granted granted Critical
Publication of US7337285B2 publication Critical patent/US7337285B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0656Data buffering arrangements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061Improving I/O performance
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0689Disk arrays, e.g. RAID, JBOD

Definitions

  • the present invention relates to an information recording apparatus, a buffer allocation method, and a computer-readable recording medium storing a computer program, and particularly relates to an information recording apparatus having a function for immediate data transfer which is defined by iSCSI.
  • a SCSI (Small Computer System Interface) interface is used at the input/output of an HDD (Hard Disk Drive), a disk array apparatus, etc.
  • iSCSI allows this SCSI interface to be used on TCP/IP (Transmission Control Protocol/Internet Protocol).
  • TCP/IP Transmission Control Protocol/Internet Protocol
  • IETF Internet Engineering Task Force
  • iSCSI transfers data by encapsulating SCSI commands, responses, etc. in a TCP packet and replacing the SCSI transport with a transport for an IP network.
  • Immediate data transfer is one of transfers by iSCSI, and is described in a document on the Internet “drafi-ieff-ips-iscsi-20.text” URL: “http colon backslash backslash www dot haifa dot il dot ibm dot corn backslash satran backslash ips backslash draft dash ietfdash ips dash iscsi dash 20 dot txt”.
  • the disk array apparatus sends a request for data to the host. After this, the host starts data transfer to the disk array apparatus.
  • the host starts data transfer to the disk array apparatus without waiting for a data request from the disk array apparatus. Since in the immediate data transfer, the disk array apparatus simultaneously receives a command and data, a sufficient free space is required in the buffer of the disk array apparatus.
  • the immediate data buffer of the disk array apparatus By using immediate data transfer, it becomes possible to build an IP-based SAN (Storage Area Network). Specifically, it becomes possible for a disk array apparatus installed on a network to be logged into by a plurality of hosts. However, the capacity of the immediate data buffer of the disk array apparatus is limited. Therefore, when the disk array apparatus allocates its immediate data buffer to all the hosts logging into the disk array apparatus, the capacity of the immediate data buffer may not be enough. More specifically, in order to allow all the hosts to perform immediate data transfer, the immediate data buffer of the disk array apparatus needs to have capacity corresponding to number of sessions ⁇ maximum number of I/Os. Accordingly, if the number of sessions or the number of hosts increases, the immediate data buffer cannot secure necessary capacity required for all the hosts to perform immediate data transfer.
  • IP-based SAN Storage Area Network
  • the disk array apparatus is designed to allocate 10 mega bytes of the immediate data buffer to each host.
  • the memory capacity required in the immediate data buffer is 2 giga bytes. If the memory installed on the disk array apparatus has less than 2 giga bytes, the disk array apparatus cannot allocate the immediate data buffer to all the hosts that can log in.
  • the capacity of the immediate data buffer that is allocated to each host is the value obtained by dividing the total capacity of the immediate data buffer of the disk array apparatus by the maximum number of hosts that can log in. For example, in a case where a disk array apparatus having an immediate data buffer of 1 mega byte can be logged into by 200 hosts, the capacity of the immediate data buffer that is usable by each host is only 5 kilo bytes.
  • the disk array apparatus can allow only a limited number of hosts to perform immediate data transfer thereto. For example, in a case where the immediate data buffer of the disk array apparatus has 10 mega bytes and the disk array apparatus allocates 1 mega byte of the immediate data buffer to each host, all the capacity of the immediate data buffer is occupied by the first ten hosts that log in. Therefore, any hosts that log in after this cannot use the immediate data buffer or perform immediate data transfer.
  • the present invention was made in view of the above-described problem, and an object of the present invention is to improve the performance of the iSCSI apparatus of a disk array apparatus and as a result the performance of the whole system, by allocating the immediate data buffer appropriately in accordance with the condition of each occasion.
  • Another object of the present invention is to make the most of the ability of a host that is high in a priority order, by efficiently utilizing the immediate data buffer of an information recording apparatus suited to immediate data transfer.
  • an information recording apparatus is an information recording apparatus storing data received from a plurality of host computers, and comprises:
  • a buffer memory having a buffer area for temporarily storing the data
  • a memory storing a priority degree for each of the host computers, the priority degree being dynamically updated based on a status of the data received from corresponding one of the host computers;
  • a buffer allocation unit dynamically allocating portions of the buffer area to the host computers, the portions of the buffer area allocated to the host computers having respective amounts determined based on the priority degrees of the host computers.
  • the priority degree for each of the host computers by storing the priority degree for each of the host computers and by determining the amount of a portion of the buffer area based on the priority degree, it is possible to increase the amount of a portion of the buffer area for a host computer whose command should be processed preferentially, and to reduce the amount of a portion of the buffer area for a host computer whose command needs not be processed preferentially. Accordingly, the ability of the host computer that is high in the priority order can be fully utilized, and the process performance of the whole system can be improved due to the effective use of the buffer memory.
  • the information recording apparatus may further comprise a login determination unit determining whether or not a host computer logged into the information recording apparatus,
  • the memory may store an initial priority degree which is pre-set for each of the host computers, and a reference priority degree representing a threshold level for the initial priority degrees,
  • the login determination unit may determine whether or not the initial priority degree of a host computer stored in the memory is higher than the reference priority degree stored in the memory, when the host computer logs into the information recording apparatus, and
  • the buffer allocation unit may allocate a portion of the buffer area corresponding to the determined amount to the host computer, in a case where the login determination unit determines that the initial priority degree of the host computer is higher than the reference priority degree.
  • the priority degree may be a numerical value, the value being large when the priority degree is high, while being small when the priority degree is low, and the buffer allocation unit may determine an amount of a portion of the buffer area to be allocated to a host computer by “(the priority degree of the host computer/total of the priority degrees of all host computers to which portions of the buffer area are allocated) ⁇ a whole capacity of the buffer memory”.
  • the information recording apparatus may further comprise a buffer freeing unit freeing portions of the buffer area already allocated to host computers, on a basis of host computer by host computer, and
  • the buffer allocation unit cannot secure a portion of the buffer area corresponding to the determined amount in the buffer memory when attempting to allocate a portion of the buffer area to a host computer
  • the buffer freeing unit may free a portion of the buffer area already allocated to another host computer for which a priority degree lower than that of the host computer is set, based on a predetermined condition, and
  • the buffer allocation unit may allocate a portion of the buffer area corresponding to the determined amount to the host computer, in a case where a portion of the buffer area corresponding to the determined amount can be secured in the buffer memory due to the freeing of the portion of the buffer area by the buffer freeing unit.
  • the information recording apparatus may further comprise a priority degree determination unit,
  • the memory may store for each host computer data representing the status corresponding to an amount of data and/or a usage degree of various commands received from the host computer and from a time the host computer logged into the information recording apparatus,
  • the priority degree determination unit may determine the priority degree of each host computer that is stored in the memory and updating the stored priority degree, based on the amount of data and/or the usage degree of various commands and the initial priority degree stored in the memory, and
  • the buffer allocation unit may determine a reallocation amount of a portion of the buffer area to be allocated to each host computer that has been logged into the information recording apparatus based on the priority degree determined by the priority degree determination unit, and allocate a portion of the buffer area corresponding to the determined reallocation amount to each host computer.
  • the priority degree may be a numerical value, the value being large when the priority degree is high, while being small when the priority degree is low, and the priority degree determination unit may determine the priority degree of a host computer by “(the amount of data transferred from the host computer/total amounts of data transferred from all host computers to which portions of the buffer area are allocated)+(the usage degree of various commands from the host computer/total of usage degrees of various commands from all host computers to which portions of the buffer area are allocated)+the initial priority degree of the host computer”.
  • the information recording apparatus may further comprise a login determination unit determining whether or not a host computer logged into the information recording apparatus, and
  • the freeing of the portion of the buffer area already allocated to a host computer by the buffer freeing unit may be achieved in a manner that the buffer freeing unit requests the host computer to re-log into the information recording apparatus, and
  • the login determination unit rejects allocation of a portion of the buffer area to the host computer, when the host computer re-logs into the information recording apparatus.
  • the allocation of the portion of the buffer area corresponding to the determined reallocation amount to each host computer by the buffer allocation unit may be achieved in a manner that
  • the buffer allocation unit requests each host computer to re-log into the information recording apparatus
  • the login determination unit changes an amount of a portion of the buffer area to be allocated to each host computer, when each host computer re-logs into the information recording apparatus.
  • a method according to a second aspect of the present invention is a method for receiving data from a plurality of host computers and storing the received data in an information recording apparatus, and comprises the steps of:
  • the priority degree being dynamically updated based on a status of the data received from corresponding one of the host computers
  • a buffer allocation method is a method which allocates a portion of a buffer area of a buffer memory for temporarily storing data and included in a subordinate apparatus which stores data received from a plurality of superordinate apparatuses to each superordinate apparatus, and comprises:
  • an allocation amount determination step of determining an amount of a portion of the buffer area to be allocated to each superordinate apparatus, based on a priority degree which is set for each superordinate apparatus and stored in a memory of the subordinate apparatus;
  • an amount of a portion of the buffer area to be newly allocated to a new superordinate apparatus to which a portion of the buffer area has not yet been allocated may be determined, and
  • the buffer allocating step may include:
  • the buffer freeing step may include:
  • the freeing of portions of the buffer area in the buffer freeing step may be realized by rejection of allocation of a portion of the buffer area in the allocation rejecting step.
  • the buffer allocation method may further comprise a priority degree changing step of changing the priority degree of each superordinate apparatus stored in the memory,
  • a reallocation amount of a portion of the buffer area to be allocated to each superordinate apparatus that has been logged into the subordinate apparatus may be determined based on the priority degree changed in the priority degree changing step, and
  • a portion of the buffer area corresponding to the reallocation amount determined in the allocation amount determination step may be allocated to each superordinate apparatus.
  • the buffer allocating step may include:
  • the allocation of a portion of the buffer area corresponding to the reallocation amount to each superordinate apparatus in the buffer allocating step may be realized by changing of the amount of the portion of the buffer area to be allocated to each superordinate apparatus in the amount changing step.
  • a computer-readable recording medium storing a computer program according to a fourth aspect of the present invention is a medium storing a computer program for receiving data from a plurality of host computers and storing the received data in an information recording apparatus, and the computer program comprises the steps of:
  • the priority degree being dynamically updated based on a status of the data received from corresponding one of the host computers
  • a computer-readable recording medium storing a computer program according to a fifth aspect of the present invention is a medium storing a computer program for allocating a portion of a buffer area of a buffer memory for temporarily storing data and included in a subordinate apparatus which stores data received from a plurality of superordinate apparatuses to each superordinate apparatus, and the computer program comprises:
  • an allocation amount determination step of determining an amount of a portion of the buffer area to be allocated to each superordinate apparatus, based on a priority degree which is set for each superordinate apparatus and stored in a memory of the subordinate apparatus;
  • an amount of a portion of the buffer area to be newly allocated to a new superordinate apparatus to which a portion of the buffer area has not yet been allocated may be determined, and
  • the buffer allocating step may include:
  • the buffer freeing step may include:
  • the freeing of portions of the buffer area in the buffer freeing step may be realized by rejection of allocation of a portion of the buffer area in the allocation rejecting step.
  • the computer program may further comprise a priority degree changing step of changing the priority degree of each superordinate apparatus stored in the memory,
  • a reallocation amount of a portion of the buffer area to be allocated to each superordinate apparatus that has been logged into the subordinate apparatus may be determined based on the priority degree changed in the priority degree changing step, and
  • a portion of the buffer area corresponding to the reallocation amount determined in the allocation amount determination step may be allocated to each superordinate apparatus.
  • the buffer allocating step may include:
  • the allocation of a portion of the buffer area corresponding to the reallocation amount to each superordinate apparatus in the buffer allocating step may be realized by changing of the amount of the portion of the buffer area to be allocated to each superordinate apparatus in the amount changing step.
  • FIG. 1 is a block diagram showing a configuration of a system including a disk array apparatus according to an embodiment of the present invention
  • FIG. 2 is a block diagram showing a functional configuration of a host adaptor shown in FIG. 1 ;
  • FIG. 3 is a block diagram showing a physical configuration of the host adaptor shown in FIG. 1 ;
  • FIG. 4A and FIG. 4B are diagrams showing examples of tables stored in a data storage area shown in FIG. 2 ;
  • FIG. 5 is a flowchart for explaining a process for allocating an immediate data buffer to a host when the host logs in;
  • FIG. 6 is a flowchart for explaining a priority value recalculation process in step A 5 of FIG. 5 ;
  • FIG. 7 is a flowchart for explaining a buffer allocation process in step A 6 of FIG. 5 ;
  • FIG. 8 is a flowchart for explaining a process for dynamic reallocation of the immediate data buffer.
  • FIG. 1 is a block diagram showing the configuration of a system including a disk array apparatus according to an embodiment of the information recording apparatus of the present invention.
  • a plurality of host computers (hosts) 1 a , 1 b , . . . , 1 n and a disk array apparatus 2 which is one example of the information recording apparatus of the present invention are connected via an IP (Internet Protocol) network 10 .
  • the host 1 corresponds to the superordinate apparatus, if the disk array apparatus 2 is regarded as the subordinate apparatus.
  • the host 1 sends data to be stored in the disk array apparatus 2 to the disk array apparatus 2 , and receives data stored in the disk array apparatus 2 from the disk array apparatus 2 .
  • the disk array apparatus 2 has a function as an iSCSI apparatus directly connected to the IP network 10 .
  • the disk array apparatus 2 comprises a host adaptor 3 , a disk adaptor 6 , and a plurality of disks 7 .
  • the disk array apparatus 2 reads and writes data from and to the disks 7 in accordance with a request from the host 1 sent via the IP network 10 .
  • the host adaptor 3 includes a processor, a memory, etc., and mainly performs a process for data transfer between the host 1 and the disk array apparatus 2 , a process for accepting login, etc.
  • the disk adaptor 6 mainly performs writing and reading of data to and from the disks 7 by controlling the disks 7 .
  • FIG. 2 is a block diagram showing the functional configuration of the host adaptor 3 .
  • the host adaptor 3 has a function for allocating an immediate data buffer to the host 1 .
  • the host adaptor 3 comprises a host communication unit 31 , a login determination unit 32 , an immediate data buffer 33 , a data storage area 34 , a buffer allocation unit 35 , a priority value recalculation unit 36 , a buffer freeing unit 37 , and a disk input/output unit 38 .
  • the host communication unit 31 is connected to the IP network 10 , and processes a login/logout performed by the host 1 to the disk array apparatus 2 and data transfer, etc.
  • the login determination unit 32 conducts a negotiation between the host 1 and the disk array apparatus 2 when the host 1 logs into the disk array apparatus 2 , and determines various parameters related to immediate data transfer defined by iSCSI.
  • the immediate data buffer 33 temporarily stores transfer data (write data) received from the host 1 in immediate data transfer after the host 1 issues a write command to the disk array apparatus 2 .
  • the immediate data buffer 33 has a buffer area, and a portion of the buffer area of the immediate data buffer 33 is allocated to the host 1 .
  • the data storage area 34 stores various tables used for allocating the immediate data buffer 33 to the plurality of hosts 1 .
  • the buffer allocation unit 35 allocates a part of the buffer capacity (size) of the immediate data buffer 33 to each of the plurality of hosts 1 .
  • the priority value recalculation unit 36 recalculates a priority value set for each of the plurality of hosts 1 if necessity arises.
  • the priority value is a numerical value representing the degree of priority of each host over other hosts in buffer allocation when a plurality of hosts uses the immediate data buffer 33 .
  • a large priority value is set for a host that is high in the priority order
  • a small priority value is set for a host that is low in the priority order.
  • the buffer freeing unit 37 frees the immediate data buffer 33 that is allocated to a host having a small priority value to secure a buffer to be allocated to a host having a large priority value in a predetermined case.
  • the disk input/output unit 38 is connected to the disk adaptor 6 , and transfers data exchanged between the disks 7 and the host 1 .
  • Various parameters determined by a negotiation between the host 1 and the disk array apparatus 2 related to immediate data transfer include an immediate data parameter, a first burst length parameter, etc.
  • the immediate data parameter is a parameter for determining use/non-use of immediate data transfer.
  • the first burst length parameter is a parameter indicating the maximum data length in immediate data transfer.
  • immediate data transfer becomes possible between the host 1 and the disk array apparatus 2 .
  • the maximum data length in the immediate data transfer is determined by first burst length keys declared by the host 1 and the disk array apparatus 2 to each other. Specifically, the smallest one of the key values declared by them is adopted. In a case where the transfer data length declared by the disk array apparatus 2 is shorter than the transfer data length declared by the host 1 , the host 1 cannot perform the immediate data transfer that exceeds the key value adopted.
  • FIG. 3 is a block diagram showing the physical configuration of the host adaptor 3 .
  • a processor 52 performs calculation in accordance with a process instruction stored in a memory 53 , and controls a memory 53 and interfaces 54 and 55 via a bus 51 .
  • the interface 54 is connected to the IP network 10
  • the interface 55 is connected to the disk adaptor 6 .
  • the operation of the host communication unit 31 constituting the host adaptor 3 shown in FIG. 2 is realized by the processor 52 controlling the interface 54 , etc.
  • the operation of the disk input/output unit 38 is realized by the processor 52 controlling the interface 55 , etc.
  • the operations of the login determination unit 32 , the buffer allocation unit 35 , the priority value recalculation unit 36 , and the buffer freeing unit 37 are realized by the processor 52 controlling the memory 53 , etc.
  • the data storage area 34 and the immediate data buffer 33 are realized by some part of the memory 53 .
  • FIG. 4A and FIG. 4B are diagrams showing examples of tables stored in the data storage area 34 .
  • FIG. 4A shows an initial priority value table T 1 on which identification information (host ID) of every host that is permitted to log into the disk array apparatus 2 and an initial priority value of every host are registered.
  • host ID an identifier used in network communication such as initiator name parameter and initiator alias parameter defined by iSCSI, authentication key, IP address for TCP/IP, MAC address, etc. is used.
  • the initial priority value is the initial value of the priority value, and can be set arbitrarily by the manager of the disk array apparatus 2 .
  • the manager sets a large value as the initial priority value for a host to which the immediate data buffer 33 should be allocated preferentially, and sets a small value as the initial priority value for a host which needs not to be taken care of preferentially.
  • the host ID and initial priority value are managed host by host.
  • FIG. 4B shows a priority value table T 2 on which identification number (host ID), initial priority value, total amount of data transferred after login, command importance degree after login, current priority value, and buffer allocation amount of the host which is actually logging into the disk array apparatus 2 are registered. These registered data are managed host by host.
  • the priority value table T 2 is referred to when priority values are recalculated by the priority value recalculation unit 36 , when the buffer allocation amount is changed, etc.
  • the total amount of data transferred and command importance degree are values used for calculating the priority value of each host.
  • the total amount of data transferred is used for increasing the priority value of a host which sends a large amount of data.
  • the command importance degree is used for increasing the priority value of a host which uses many important commands.
  • the total amount of data transferred and command importance degree of each host are updated as needed by the host communication unit 31 , and registered on the priority value table T 2 .
  • the total amount of data transferred is calculated by accumulating the amount of data which has been transferred when transfer of write data is completed.
  • the command importance degree is obtained by quantifying the frequency of usage of various commands issued by the host 1 to the disk array apparatus 2 , based on the degree of importance of each command.
  • weighted value of each command from a host is pre-set by the manager, and the command importance degree is calculated by accumulating the weighted values each time 110 (Input/Output) by a command from a host is processed.
  • the manager may set a large value for a write command for user data, and set a small value for a command for monitoring the condition of the disk array apparatus 2 or for a command for manipulating statistical information.
  • the command importance degree of a host that frequently writes user data becomes a large value
  • the command importance degree of such a host as a managing terminal that checks the operational condition of the disk array apparatus 2 becomes a small value.
  • a table of values to be accumulated at each I/O which are used for calculating the command importance degree is stored in the data storage area 34 .
  • various values are stored in addition to the initial priority value table T 1 , the priority value table T 2 , the table of values to be accumulated at each I/O.
  • a login reference value to be described later is stored in the data storage area 34 .
  • This login reference value is a reference priority value as a border used by the login determination unit 32 to determine whether or not to permit the host 1 to perform immediate data transfer when the host 1 requests immediate data transfer to the disk array apparatus 2 .
  • the login determination unit 32 compares the initial priority value of the host 1 which requests immediate data transfer with the login reference value, and permits the host 1 to perform immediate data transfer when the initial priority value is equal to or greater than the login reference value.
  • the login reference value can be arbitrarily set by the manager of the disk array apparatus 2 . The manager sets the login reference value together with the initial priority value of each host.
  • FIG. 5 is a flowchart for explaining a process in which the disk array apparatus 2 allocates the immediate data buffer 33 to the host 1 a when the host 1 a logs into the disk array apparatus 2 .
  • the login determination unit 32 refers to the initial priority value table T 1 in the data storage area 34 to refer to the initial priority value of the host 1 a based on the host ID included in the login request (step A 1 ).
  • a login negotiation for determining various parameters related to immediate data transfer defined by iSCSI is started between the host 1 a and the login determination unit 32 (step A 2 ).
  • the login determination unit 32 determines whether or not the host 1 a requests immediate data transfer (step A 3 ). In a case where the host 1 a sends a parameter for requesting use of immediate data transfer (step A 3 : Yes), the login determination unit 32 determines whether or not the initial priority value referred to in step A 1 is equal to or greater than the login reference value stored in the data storage area 34 (step A 4 ).
  • immediate data transfer is not performed but ordinary data transfer is performed between the new login host 1 a and the disk array apparatus 2 .
  • step A 4 the priority value of every host 1 that has already logged in and is now permitted to perform immediate data transfer is recalculated based on the total amount of data transferred and command importance degree, etc. on the priority table T 2 to update the priority value on the priority value table T 2 (step A 5 ).
  • the process for priority value recalculation will be specifically described later.
  • a buffer allocation amount representing the capacity (size) of immediate data buffer to be allocated to the new login host 1 a is calculated based on the priority value of the new login host 1 a .
  • the buffer allocation unit 35 attempts to secure this buffer allocation amount in the immediate data buffer 33 .
  • the immediate data buffer 33 is already allocated to other hosts 1 and the buffer allocation amount of the new login host 1 a can not be fully secured in the immediate data buffer 33 .
  • the buffer allocation unit 35 attempts to secure the buffer allocation amount of the new login host 1 a in the immediate data buffer 33 by applying capacity of immediate data buffer already allocated to other hosts 1 that have a smaller priority value than the new login host 1 a to the buffer allocation amount of the new login host 1 a.
  • step A 7 it is determined whether or not the allocation of the immediate data buffer 33 to the new login host 1 a in the buffer allocation process in step A 6 is successful (step A 7 ).
  • step A 7 the allocation is unsuccessful (step A 7 : No)
  • step A 5 in FIG. 5 the priority value recalculation process in step A 5 in FIG. 5 will be specifically explained with reference to a flowchart shown in FIG. 6 .
  • the priority value of every host 1 that has already logged in and is currently permitted to perform immediate data transfer is recalculated.
  • the recalculation of priority value is done by calculating a write command ratio and a command importance degree ratio for each host and adding the write command ratio, the command importance degree, and the initial priority value.
  • the write command ratio of each host is calculated (step B 1 ).
  • the write command ratio is calculated based on the total amount of data transferred registered on the priority value table T 2 shown in FIG. 4B .
  • step B 2 the command importance degree ratio of each host is calculated (step B 2 ). The command importance degree ratio is calculated based on the command importance degree registered on the priority value table T 2 .
  • command importance degree ratio of the host 1 b command importance degree of host 1 b /sum total of command importance degrees of all hosts 1 currently permitted to perform immediate data transfer” is performed.
  • the priority value of each host is calculated (step B 3 ). Specifically, in a case where the priority value of the host 1 b is calculated, calculation of “priority value of host 1 b write command ratio of host 1 b +command importance degree ratio of host 1 b +initial priority value of host 1 b ” is performed.
  • the priority value recalculation unit 36 recalculates the priority value of every host 1 that is currently permitted to perform immediate data transfer, and updates the priority value registered on the priority value table T 2 in the data storage area 34 (step 134 ).
  • the priority value is recalculated using both of the write command ratio of the host and the command importance degree ratio of the host.
  • the priority value may be recalculated using either one of them.
  • step A 6 of FIG. 5 the buffer allocation process in step A 6 of FIG. 5 will be specifically explained with reference to a flowchart shown in FIG. 7 .
  • the buffer allocation unit 35 calculates a buffer allocation amount of the new login host 1 a based on the priority value registered on the priority value table T 2 shown in FIG. 4B (step C 1 ).
  • a predetermined reference value represents the minimum capacity of immediate data buffer that the disk array apparatus 2 allocates to one host.
  • the reference value is pre-set by the manager based on the process performance, buffer capacity, etc. of the disk array apparatus 2 , and is stored in the data storage area 34 . This reference value is set because if the capacity of immediate data buffer to be allocated to each host is too small, the process performance can not be improved. If the calculated buffer allocation amount is smaller than this predetermined reference value (step C 2 : No), the buffer allocation is unsuccessful (step C 10 ). In this case, allocation of the immediate data buffer 33 to the new login host 1 a is not performed.
  • step C 2 If the calculated buffer allocation amount is equal to or greater than the predetermined reference value (step C 2 : Yes), the buffer allocation unit 35 attempts to secure the buffer allocation amount of the new login host 1 a in the immediate data buffer 33 (step C 3 ). Next, it is determined whether or not the buffer allocation amount is secured (step C 4 ). If there is enough free space in the immediate data buffer 33 , the buffer allocation amount is secured (step C 4 : Yes), and the buffer allocation is regarded as successful (step C 9 ).
  • step C 4 the buffer allocation amount calculated for the new login host 1 a can not be secured.
  • the flow goes to step C 5 , and thereafter, the buffer freeing unit 37 frees the buffer allocation amount in the immediate data buffer 33 allocated to a host 1 having a smaller priority value than the new login host 1 a , and applies the freed buffer allocation amount to the buffer allocation amount of the new login host 1 a.
  • the buffer allocation unit 35 extracts hosts 1 whose buffer allocation amounts are reallocated to the new login host 1 a from the hosts 1 to which the immediate data buffer 33 is now allocated (step C 5 ). Specifically, the buffer allocation unit 35 searches for hosts 1 having a smaller priority value than the new login host 1 a in the order of smaller priority value, among the hosts 1 which are now logging in and using the immediate data buffer 33 . This search is continued until “sum total of buffer allocation amounts of searched-out hosts 1 ⁇ buffer allocation amount of new login host 1 a ” is satisfied.
  • the buffer allocation unit 35 stops searching at the time the accumulated value of buffer allocation amounts of the searched-out hosts 1 reaches the buffer allocation amount of the new login host 1 a , and extracts the searched-out hosts 1 as the hosts 1 whose buffer allocation amounts are reallocated to the new login host 1 a .
  • the priority value table T 2 is referred to for this search.
  • step C 6 it is determined whether or not the extraction of hosts in step C 5 is successful (step C 6 ). If the extraction is successful, i.e., in a case where it is turned out that the buffer allocation amount of the new login host 1 a can be secured by freeing the buffer allocation amount of one or more hosts 1 having a smaller priority value (step C 6 : Yes), the buffer freeing unit 37 requests re-login to the extracted hosts 1 for making them to re-log into the disk array apparatus 2 (step C 7 ). This re-login request is made by the buffer freeing unit 37 performing an operation that anticipates re-login of the hosts 1 .
  • Such an operation includes sending of an Asynchronous Message defined by iSCSI, and disconnection of the connection by FIN or RST of TCP/IP protocol, etc.
  • the hosts 1 that receive the re-login request once log out from the disk array apparatus 2 . Since the resource occupied by the hosts 1 is freed due to the logout of the hosts 1 , the immediate data buffer 33 allocated to the hosts 1 that have logged out is freed and the buffer allocation amount of the new login host 1 a is secured (step C 8 ). If the buffer allocation amount is secured in this way, the buffer allocation is regarded as successful (step C 9 ).
  • step C 6 determines whether extraction of hosts is unsuccessful (step C 6 : No) or not.
  • step C 10 allocation of the immediate data buffer 33 to the new login host 1 a is not performed because it is determined that the buffer allocation amount of the new login host 1 a cannot be secured.
  • the procedure of recalculating the priority value in step A 5 is not indispensable. Therefore, the flow may advance from step A 4 to step A 6 .
  • the priority value before recalculation or the initial priority value may be used instead of a priority value obtained after recalculation.
  • the manner of recalculating the priority value shown in FIG. 6 is not limited to the one described above, but the priority value may be recalculated in other manners. For example, it may be recalculated in such a manner that the priority value of a host that has not performed immediate data transfer for a predetermined period of time is decreased. In FIG.
  • the immediate data buffer allocated to other hosts is transferred to the new login host in steps C 5 to C 8 .
  • the disk array apparatus 2 performs recalculation of the priority value of the host 1 regularly or upon an arbitrary trigger, and reallocates the immediate data buffer 33 to each host 1 that logs in based on the recalculated value. That is, the buffer allocation amount can be dynamically changed upon a trigger.
  • the trigger for performing the dynamic reallocation may be an operation or a setting by the manager, detection of login by a new host, detection of logout by a host, etc.
  • the disk array apparatus 2 may track the usage of the immediate data buffer 33 , and may perform reallocation when the usage frequency of a given host reaches or exceeds a predetermined level.
  • step D 1 the priority value of each host 1 that is logging in is recalculated.
  • This recalculation is performed by the priority value recalculation unit 36 in the same way as steps B 1 to B 3 in FIG. 6 . Due to this, the priority value registered on the priority value table T 2 shown in FIG. 4B is updated. Next, it is determined whether or not the priority value is changed as the result of the recalculation (step D 2 ).
  • step D 2 In a case where there is no change in the priority value of any host 1 as the result of the recalculation, it is not necessary to change the buffer allocation amount and the process is therefore terminated (step D 2 : No). In a case where there is a change in the priority value (step D 2 : Yes), the flow goes to step D 3 , wherein and whereafter the buffer allocation unit 35 performs reallocation of the immediate data buffer 33 .
  • the buffer allocation unit 35 calculates the buffer allocation amount of each host 1 (step D 3 ). However, unlike step C 1 , the buffer allocation unit 35 calculates the buffer allocation amount of all the hosts 1 that log in.
  • a predetermined reference value represents the minimum capacity of immediate data buffer that the disk array apparatus 2 allocates to one host. The reference value is pre-set by the manager based on the process performance, buffer capacity, etc. of the disk array apparatus 2 , and is stored in the data storage area 34 .
  • the buffer allocation unit 35 updates the buffer allocation amount on the priority value table T 2 shown in FIG. 4B , and requests re-login to the host 1 whose calculated buffer allocation amount is equal to or greater than the reference value, for making this host 1 to re-log into the disk array apparatus 2 (step D 5 ).
  • the login determination unit 32 sets the recalculated buffer allocation amount of the host 1 which receives the re-login request to a parameter (first burst length key value), in the negotiation performed at the time of re-login. Due to this, the first burst length key is changed and the intended change in the buffer allocation amount is achieved.
  • the buffer allocation unit 35 also requests re-login to the host 1 whose calculated buffer allocation amount is smaller than the reference value (step D 6 ).
  • the login determination unit 32 declares “immediate data no” to the host 1 which receives the re-login request, in the negotiation performed at the time of re-login. Due to this, buffer allocation for them is rejected and this host 1 is not permitted to use the immediate data buffer.
  • the priority value of each host is recalculated in step A 5 . Therefore, the buffer allocation amount of each host may be changed based on the priority value recalculated in step A 5 , not by recalculating the priority value in step D 1 .
  • the disk array apparatus manages the priority value for each host that logs in, and determines the buffer allocation amount based on the priority value. Due to this, the disk array apparatus can increase the buffer allocation amount of the host whose command should be processed preferentially, and can decrease the buffer allocation amount of the host whose command needs not be processed preferentially. Therefore, according to the present invention, the ability of the host which is high in the priority order is fully utilized, and the process performance of the whole system is improved.
  • the disk array apparatus changes the parameter by recalculating the priority value regularly or upon an arbitrary trigger, requesting re-login to the hosts, and re-performing login negotiation. Therefore, according to the present invention, the buffer allocation amount can be dynamically changed based on the recalculated priority value, and a buffer allocation state that is best suited to the condition at each occasion can be built.
  • the information recording apparatus according to the present invention may be other apparatuses than a disk array apparatus.
  • Immediate data transfer on iSCSI has been described in the above embodiments, but the present invention can be widely applied to apparatuses that use a protocol adopting a transfer method where data transfer is started without waiting for a data transfer request from the command reception side after a write command is issued.
  • permission or rejection of immediate data transfer is determined or the first burst length key value is changed by re-login.
  • the present invention may be designed such that other iSCSI parameters like Max Connections that can only be set in the negotiation at the time of login are changed at the time of re-login.
  • the priority value recalculation unit 36 in FIG. 2 may determine the degree of priority (priority degree) such as, for example, an order of priority of the host 1 .
  • the host adaptor 3 may be realized not by a dedicated device but by an ordinary computer system.
  • the computer program may be recorded on a computer-readable recording medium such as a floppy disk, a CD-ROM, a hard disk, etc., or may be uploaded on a server on a network. Then, the computer program may be installed on a computer through distribution in a recording medium or downloading via a network.

Abstract

An information recording apparatus according to the present invention manages a priority value for each host that can log in, and allocates an immediate data buffer to each host based on the priority value. The priority value changes in accordance with data transfer amount, command importance degree, etc. The information recording apparatus recalculates the priority value regularly or arbitrary, and re-performs login negotiation by requesting re-login to the hosts. The amount of buffer allocated is dynamically changed by this login negotiation, and a buffer allocation state best suited to each occasion is built. Since the present invention can dynamically determine or change the allocation amount of the immediate data buffer in accordance with the condition of each occasion, the performance of an iSCSI apparatus can be improved.

Description

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to an information recording apparatus, a buffer allocation method, and a computer-readable recording medium storing a computer program, and particularly relates to an information recording apparatus having a function for immediate data transfer which is defined by iSCSI.
2. Description of the Related Art
A SCSI (Small Computer System Interface) interface is used at the input/output of an HDD (Hard Disk Drive), a disk array apparatus, etc. iSCSI allows this SCSI interface to be used on TCP/IP (Transmission Control Protocol/Internet Protocol). iSCSI is authorized by the IETF (Internet Engineering Task Force). iSCSI transfers data by encapsulating SCSI commands, responses, etc. in a TCP packet and replacing the SCSI transport with a transport for an IP network.
Immediate data transfer is one of transfers by iSCSI, and is described in a document on the Internet “drafi-ieff-ips-iscsi-20.text” URL: “http colon backslash backslash www dot haifa dot il dot ibm dot corn backslash satran backslash ips backslash draft dash ietfdash ips dash iscsi dash 20 dot txt”. For example, in an ordinary data transfer, when a host issues a write command to a disk array apparatus, the disk array apparatus sends a request for data to the host. After this, the host starts data transfer to the disk array apparatus. In contrast, in an immediate data transfer, after issuing a write command to the disk array apparatus, the host starts data transfer to the disk array apparatus without waiting for a data request from the disk array apparatus. Since in the immediate data transfer, the disk array apparatus simultaneously receives a command and data, a sufficient free space is required in the buffer of the disk array apparatus.
By using immediate data transfer, it becomes possible to build an IP-based SAN (Storage Area Network). Specifically, it becomes possible for a disk array apparatus installed on a network to be logged into by a plurality of hosts. However, the capacity of the immediate data buffer of the disk array apparatus is limited. Therefore, when the disk array apparatus allocates its immediate data buffer to all the hosts logging into the disk array apparatus, the capacity of the immediate data buffer may not be enough. More specifically, in order to allow all the hosts to perform immediate data transfer, the immediate data buffer of the disk array apparatus needs to have capacity corresponding to number of sessions×maximum number of I/Os. Accordingly, if the number of sessions or the number of hosts increases, the immediate data buffer cannot secure necessary capacity required for all the hosts to perform immediate data transfer.
For example, assume that the disk array apparatus is designed to allocate 10 mega bytes of the immediate data buffer to each host. In this case, if 200 hosts log in, the memory capacity required in the immediate data buffer is 2 giga bytes. If the memory installed on the disk array apparatus has less than 2 giga bytes, the disk array apparatus cannot allocate the immediate data buffer to all the hosts that can log in.
In a case where the disk array apparatus is designed to uniformly allocate the immediate data buffer to all the hosts that can log in, the capacity of the immediate data buffer that is allocated to each host is the value obtained by dividing the total capacity of the immediate data buffer of the disk array apparatus by the maximum number of hosts that can log in. For example, in a case where a disk array apparatus having an immediate data buffer of 1 mega byte can be logged into by 200 hosts, the capacity of the immediate data buffer that is usable by each host is only 5 kilo bytes.
If the disk array apparatus allocates a sufficient capacity of the immediate data buffer to each host that logs in, the disk array apparatus can allow only a limited number of hosts to perform immediate data transfer thereto. For example, in a case where the immediate data buffer of the disk array apparatus has 10 mega bytes and the disk array apparatus allocates 1 mega byte of the immediate data buffer to each host, all the capacity of the immediate data buffer is occupied by the first ten hosts that log in. Therefore, any hosts that log in after this cannot use the immediate data buffer or perform immediate data transfer.
SUMMARY OF THE INVENTION
The present invention was made in view of the above-described problem, and an object of the present invention is to improve the performance of the iSCSI apparatus of a disk array apparatus and as a result the performance of the whole system, by allocating the immediate data buffer appropriately in accordance with the condition of each occasion.
Another object of the present invention is to make the most of the ability of a host that is high in a priority order, by efficiently utilizing the immediate data buffer of an information recording apparatus suited to immediate data transfer.
To achieve the above objects, an information recording apparatus according to a first aspect of the present invention is an information recording apparatus storing data received from a plurality of host computers, and comprises:
a buffer memory having a buffer area for temporarily storing the data;
a memory storing a priority degree for each of the host computers, the priority degree being dynamically updated based on a status of the data received from corresponding one of the host computers; and
a buffer allocation unit dynamically allocating portions of the buffer area to the host computers, the portions of the buffer area allocated to the host computers having respective amounts determined based on the priority degrees of the host computers.
As described above, by storing the priority degree for each of the host computers and by determining the amount of a portion of the buffer area based on the priority degree, it is possible to increase the amount of a portion of the buffer area for a host computer whose command should be processed preferentially, and to reduce the amount of a portion of the buffer area for a host computer whose command needs not be processed preferentially. Accordingly, the ability of the host computer that is high in the priority order can be fully utilized, and the process performance of the whole system can be improved due to the effective use of the buffer memory.
The information recording apparatus may further comprise a login determination unit determining whether or not a host computer logged into the information recording apparatus,
the memory may store an initial priority degree which is pre-set for each of the host computers, and a reference priority degree representing a threshold level for the initial priority degrees,
the login determination unit may determine whether or not the initial priority degree of a host computer stored in the memory is higher than the reference priority degree stored in the memory, when the host computer logs into the information recording apparatus, and
the buffer allocation unit may allocate a portion of the buffer area corresponding to the determined amount to the host computer, in a case where the login determination unit determines that the initial priority degree of the host computer is higher than the reference priority degree.
By arranging that a portion of the buffer area should not be allocated in a case where the initial priority degree pre-set for each host computer is lower than the reference priority degree, it is possible to avoid a situation that the buffer area is occupied by host computers having a low priority degree and therefore a buffer area cannot be allocated to host computer which logs in afterwards.
In the information recording apparatus, the priority degree may be a numerical value, the value being large when the priority degree is high, while being small when the priority degree is low, and the buffer allocation unit may determine an amount of a portion of the buffer area to be allocated to a host computer by “(the priority degree of the host computer/total of the priority degrees of all host computers to which portions of the buffer area are allocated)×a whole capacity of the buffer memory”.
Due to this, it is possible to allocate a large portion of the buffer area to a host computer having a high priority degree, and to achieve an effective use of the buffer memory.
The information recording apparatus may further comprise a buffer freeing unit freeing portions of the buffer area already allocated to host computers, on a basis of host computer by host computer, and
in a case where the buffer allocation unit cannot secure a portion of the buffer area corresponding to the determined amount in the buffer memory when attempting to allocate a portion of the buffer area to a host computer,
the buffer freeing unit may free a portion of the buffer area already allocated to another host computer for which a priority degree lower than that of the host computer is set, based on a predetermined condition, and
the buffer allocation unit may allocate a portion of the buffer area corresponding to the determined amount to the host computer, in a case where a portion of the buffer area corresponding to the determined amount can be secured in the buffer memory due to the freeing of the portion of the buffer area by the buffer freeing unit.
With this design, in a case where there is not enough free space in the buffer memory when a host computer newly logs in, it is possible to compare the priority degrees and to allocate a potion of the buffer area allocated to an already logging-in host computer to the newly logging-in host computer.
The information recording apparatus may further comprise a priority degree determination unit,
the memory may store for each host computer data representing the status corresponding to an amount of data and/or a usage degree of various commands received from the host computer and from a time the host computer logged into the information recording apparatus,
the priority degree determination unit may determine the priority degree of each host computer that is stored in the memory and updating the stored priority degree, based on the amount of data and/or the usage degree of various commands and the initial priority degree stored in the memory, and
the buffer allocation unit may determine a reallocation amount of a portion of the buffer area to be allocated to each host computer that has been logged into the information recording apparatus based on the priority degree determined by the priority degree determination unit, and allocate a portion of the buffer area corresponding to the determined reallocation amount to each host computer.
By determining the priority degree regularly or in response to an arbitrary trigger and dynamically changing the allocation amount of a portion of the buffer area of each host computer based on the determined priority degree, it is possible to realize a buffer area allocation state that is suitable for the condition at each occasion.
In the information recording apparatus, the priority degree may be a numerical value, the value being large when the priority degree is high, while being small when the priority degree is low, and the priority degree determination unit may determine the priority degree of a host computer by “(the amount of data transferred from the host computer/total amounts of data transferred from all host computers to which portions of the buffer area are allocated)+(the usage degree of various commands from the host computer/total of usage degrees of various commands from all host computers to which portions of the buffer area are allocated)+the initial priority degree of the host computer”.
By highly setting the priority degree of a host computer from which large amount of data is transferred and whose usage degree of various commands is high, it is possible to allocate a large portion of the buffer area to a host computer that needs to be processed preferentially.
The information recording apparatus may further comprise a login determination unit determining whether or not a host computer logged into the information recording apparatus, and
the freeing of the portion of the buffer area already allocated to a host computer by the buffer freeing unit may be achieved in a manner that the buffer freeing unit requests the host computer to re-log into the information recording apparatus, and
the login determination unit rejects allocation of a portion of the buffer area to the host computer, when the host computer re-logs into the information recording apparatus.
In the information recording apparatus, the allocation of the portion of the buffer area corresponding to the determined reallocation amount to each host computer by the buffer allocation unit may be achieved in a manner that
the buffer allocation unit requests each host computer to re-log into the information recording apparatus, and
the login determination unit changes an amount of a portion of the buffer area to be allocated to each host computer, when each host computer re-logs into the information recording apparatus.
A method according to a second aspect of the present invention is a method for receiving data from a plurality of host computers and storing the received data in an information recording apparatus, and comprises the steps of:
storing a priority degree for each of the host computers in a memory, the priority degree being dynamically updated based on a status of the data received from corresponding one of the host computers;
determining respective amounts of portions of a buffer area of a buffer memory to be allocated to respective host computers based on the priority degrees of the host computers; and
dynamically allocating the portions of the buffer area of the buffer memory having the amounts determined in the determining step, to the host computers.
A buffer allocation method according to a third aspect of the present invention is a method which allocates a portion of a buffer area of a buffer memory for temporarily storing data and included in a subordinate apparatus which stores data received from a plurality of superordinate apparatuses to each superordinate apparatus, and comprises:
an allocation amount determination step of determining an amount of a portion of the buffer area to be allocated to each superordinate apparatus, based on a priority degree which is set for each superordinate apparatus and stored in a memory of the subordinate apparatus; and
a buffer allocating step of allocating a portion of the buffer area corresponding to the amount determined in the allocation amount determination step to a superordinate apparatus for which a high priority degree is set, preferentially over a superordinate apparatus for which a low priority degree is set.
In the buffer allocation method, in the allocation amount determination step, an amount of a portion of the buffer area to be newly allocated to a new superordinate apparatus to which a portion of the buffer area has not yet been allocated, may be determined, and
the buffer allocating step may include:
an amount securing determination step of determining whether or not a portion of the buffer area corresponding to the amount determined in the allocation amount determination step can be secured in the buffer memory;
a buffer freeing step of freeing portions of the buffer area already allocated to some or all of superordinate apparatuses for which a priority degree lower than that of the new superordinate apparatus is set, in a case where it is determined in the amount securing determination step that the portion of the buffer area cannot be secured; and
a newly allocating step of allocating a portion of the buffer area corresponding to the amount determined in the allocation amount determination step to the new superordinate apparatus, by assigning amounts of portions of the buffer area freed in the buffer freeing step to the amount determined in the allocation amount determination step.
In the buffer allocation method, the buffer freeing step may include:
a re-login requesting step of requesting a superordinate apparatus to which a portion of the buffer area is already allocated, to re-log into the subordinate apparatus; and
an allocation rejecting step of rejecting allocation of a portion of the buffer area to the superordinate apparatus, when the superordinate apparatus re-logs into the subordinate apparatus in accordance with a request in the re-login requesting step, and
the freeing of portions of the buffer area in the buffer freeing step may be realized by rejection of allocation of a portion of the buffer area in the allocation rejecting step.
The buffer allocation method may further comprise a priority degree changing step of changing the priority degree of each superordinate apparatus stored in the memory,
in the allocation amount determination step, a reallocation amount of a portion of the buffer area to be allocated to each superordinate apparatus that has been logged into the subordinate apparatus may be determined based on the priority degree changed in the priority degree changing step, and
in the buffer allocating step, a portion of the buffer area corresponding to the reallocation amount determined in the allocation amount determination step may be allocated to each superordinate apparatus.
In the buffer allocation method, the buffer allocating step may include:
a re-login requesting step of requesting each superordinate apparatus that has been logged into the subordinate apparatus to re-log into the subordinate apparatus; and
an amount changing step of changing the amount of the portion of the buffer area to be allocated to each superordinate apparatus, when each superordinate apparatus re-logs into the subordinate apparatus in accordance with a request in the re-login requesting step, and
the allocation of a portion of the buffer area corresponding to the reallocation amount to each superordinate apparatus in the buffer allocating step may be realized by changing of the amount of the portion of the buffer area to be allocated to each superordinate apparatus in the amount changing step.
A computer-readable recording medium storing a computer program according to a fourth aspect of the present invention is a medium storing a computer program for receiving data from a plurality of host computers and storing the received data in an information recording apparatus, and the computer program comprises the steps of:
storing a priority degree for each of the host computers in a memory, the priority degree being dynamically updated based on a status of the data received from corresponding one of the host computers;
determining respective amounts of portions of a buffer area of a buffer memory to be allocated to respective host computers based on the priority degrees of the host computers; and
dynamically allocating the portions of the buffer area of the buffer memory having the amounts determined in the determining step, to the host computers.
A computer-readable recording medium storing a computer program according to a fifth aspect of the present invention is a medium storing a computer program for allocating a portion of a buffer area of a buffer memory for temporarily storing data and included in a subordinate apparatus which stores data received from a plurality of superordinate apparatuses to each superordinate apparatus, and the computer program comprises:
an allocation amount determination step of determining an amount of a portion of the buffer area to be allocated to each superordinate apparatus, based on a priority degree which is set for each superordinate apparatus and stored in a memory of the subordinate apparatus; and
a buffer allocating step of allocating a portion of the buffer area corresponding to the amount determined in the allocation amount determination step to a superordinate apparatus for which a high priority degree is set, preferentially over a superordinate apparatus for which a low priority degree is set.
In the computer-readable recording medium storing the computer program,
in the allocation amount determination step, an amount of a portion of the buffer area to be newly allocated to a new superordinate apparatus to which a portion of the buffer area has not yet been allocated, may be determined, and
the buffer allocating step may include:
an amount securing determination step of determining whether or not a portion of the buffer area corresponding to the amount determined in the allocation amount determination step can be secured in the buffer memory;
a buffer freeing step of freeing portions of the buffer area already allocated to some or all of superordinate apparatuses for which a priority degree lower than that of the new superordinate apparatus is set, in a case where it is determined in the amount securing determination step that the portion of the buffer area cannot be secured; and
a newly allocating step of allocating a portion of the buffer area corresponding to the amount determined in the allocation amount determination step to the new superordinate apparatus, by assigning amounts of portions of the buffer area freed in the buffer freeing step to the amount determined in the allocation amount determination step.
In the computer-readable recording medium storing the computer program the buffer freeing step may include:
a re-login requesting step of requesting a superordinate apparatus to which a portion of the buffer area is already allocated, to re-log into the subordinate apparatus; and
an allocation rejecting step of rejecting allocation of a portion of the buffer area to the superordinate apparatus, when the superordinate apparatus re-logs into the subordinate apparatus in accordance with a request in the re-login requesting step, and
the freeing of portions of the buffer area in the buffer freeing step may be realized by rejection of allocation of a portion of the buffer area in the allocation rejecting step.
In the computer-readable recording medium storing the computer program,
the computer program may further comprise a priority degree changing step of changing the priority degree of each superordinate apparatus stored in the memory,
in the allocation amount determination step, a reallocation amount of a portion of the buffer area to be allocated to each superordinate apparatus that has been logged into the subordinate apparatus may be determined based on the priority degree changed in the priority degree changing step, and
in the buffer allocating step, a portion of the buffer area corresponding to the reallocation amount determined in the allocation amount determination step may be allocated to each superordinate apparatus.
In the computer-readable recording medium storing the computer program,
the buffer allocating step may include:
a re-login requesting step of requesting each superordinate apparatus that has been logged into the subordinate apparatus to re-log into the subordinate apparatus; and
an amount changing step of changing the amount of the portion of the buffer area to be allocated to each superordinate apparatus, when each superordinate apparatus re-logs into the subordinate apparatus in accordance with a request in the re-login requesting step, and
the allocation of a portion of the buffer area corresponding to the reallocation amount to each superordinate apparatus in the buffer allocating step may be realized by changing of the amount of the portion of the buffer area to be allocated to each superordinate apparatus in the amount changing step.
BRIEF DESCRIPTION OF THE DRAWINGS
These objects and other objects and advantages of the present invention will become more apparent upon reading of the following detailed description and the accompanying drawings in which:
FIG. 1 is a block diagram showing a configuration of a system including a disk array apparatus according to an embodiment of the present invention;
FIG. 2 is a block diagram showing a functional configuration of a host adaptor shown in FIG. 1;
FIG. 3 is a block diagram showing a physical configuration of the host adaptor shown in FIG. 1;
FIG. 4A and FIG. 4B are diagrams showing examples of tables stored in a data storage area shown in FIG. 2;
FIG. 5 is a flowchart for explaining a process for allocating an immediate data buffer to a host when the host logs in;
FIG. 6 is a flowchart for explaining a priority value recalculation process in step A5 of FIG. 5;
FIG. 7 is a flowchart for explaining a buffer allocation process in step A6 of FIG. 5; and
FIG. 8 is a flowchart for explaining a process for dynamic reallocation of the immediate data buffer.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Embodiments of the present invention will be specifically explained with reference to the attached drawings. FIG. 1 is a block diagram showing the configuration of a system including a disk array apparatus according to an embodiment of the information recording apparatus of the present invention. A plurality of host computers (hosts) 1 a, 1 b, . . . , 1 n and a disk array apparatus 2 which is one example of the information recording apparatus of the present invention are connected via an IP (Internet Protocol) network 10. The host 1 corresponds to the superordinate apparatus, if the disk array apparatus 2 is regarded as the subordinate apparatus. The host 1 sends data to be stored in the disk array apparatus 2 to the disk array apparatus 2, and receives data stored in the disk array apparatus 2 from the disk array apparatus 2. The disk array apparatus 2 has a function as an iSCSI apparatus directly connected to the IP network 10. The disk array apparatus 2 comprises a host adaptor 3, a disk adaptor 6, and a plurality of disks 7. The disk array apparatus 2 reads and writes data from and to the disks 7 in accordance with a request from the host 1 sent via the IP network 10. The host adaptor 3 includes a processor, a memory, etc., and mainly performs a process for data transfer between the host 1 and the disk array apparatus 2, a process for accepting login, etc. The disk adaptor 6 mainly performs writing and reading of data to and from the disks 7 by controlling the disks 7.
FIG. 2 is a block diagram showing the functional configuration of the host adaptor 3. The host adaptor 3 has a function for allocating an immediate data buffer to the host 1. The host adaptor 3 comprises a host communication unit 31, a login determination unit 32, an immediate data buffer 33, a data storage area 34, a buffer allocation unit 35, a priority value recalculation unit 36, a buffer freeing unit 37, and a disk input/output unit 38. The host communication unit 31 is connected to the IP network 10, and processes a login/logout performed by the host 1 to the disk array apparatus 2 and data transfer, etc. The login determination unit 32 conducts a negotiation between the host 1 and the disk array apparatus 2 when the host 1 logs into the disk array apparatus 2, and determines various parameters related to immediate data transfer defined by iSCSI. The immediate data buffer 33 temporarily stores transfer data (write data) received from the host 1 in immediate data transfer after the host 1 issues a write command to the disk array apparatus 2. The immediate data buffer 33 has a buffer area, and a portion of the buffer area of the immediate data buffer 33 is allocated to the host 1. The data storage area 34 stores various tables used for allocating the immediate data buffer 33 to the plurality of hosts 1. The buffer allocation unit 35 allocates a part of the buffer capacity (size) of the immediate data buffer 33 to each of the plurality of hosts 1. The priority value recalculation unit 36 recalculates a priority value set for each of the plurality of hosts 1 if necessity arises. The priority value is a numerical value representing the degree of priority of each host over other hosts in buffer allocation when a plurality of hosts uses the immediate data buffer 33. In this embodiment, a large priority value is set for a host that is high in the priority order, and a small priority value is set for a host that is low in the priority order. The buffer freeing unit 37 frees the immediate data buffer 33 that is allocated to a host having a small priority value to secure a buffer to be allocated to a host having a large priority value in a predetermined case. The disk input/output unit 38 is connected to the disk adaptor 6, and transfers data exchanged between the disks 7 and the host 1.
A negotiation performed by the login determination unit 32 related to immediate data transfer will now be explained.
Various parameters determined by a negotiation between the host 1 and the disk array apparatus 2 related to immediate data transfer include an immediate data parameter, a first burst length parameter, etc. The immediate data parameter is a parameter for determining use/non-use of immediate data transfer. The first burst length parameter is a parameter indicating the maximum data length in immediate data transfer.
If both of the host 1 and the disk array apparatus 2 declare “immediate data=yes” in a negotiation, immediate data transfer becomes possible between the host 1 and the disk array apparatus 2. The maximum data length in the immediate data transfer is determined by first burst length keys declared by the host 1 and the disk array apparatus 2 to each other. Specifically, the smallest one of the key values declared by them is adopted. In a case where the transfer data length declared by the disk array apparatus 2 is shorter than the transfer data length declared by the host 1, the host 1 cannot perform the immediate data transfer that exceeds the key value adopted.
FIG. 3 is a block diagram showing the physical configuration of the host adaptor 3. A processor 52 performs calculation in accordance with a process instruction stored in a memory 53, and controls a memory 53 and interfaces 54 and 55 via a bus 51. The interface 54 is connected to the IP network 10, and the interface 55 is connected to the disk adaptor 6.
The operation of the host communication unit 31 constituting the host adaptor 3 shown in FIG. 2 is realized by the processor 52 controlling the interface 54, etc. The operation of the disk input/output unit 38 is realized by the processor 52 controlling the interface 55, etc. Further, the operations of the login determination unit 32, the buffer allocation unit 35, the priority value recalculation unit 36, and the buffer freeing unit 37 are realized by the processor 52 controlling the memory 53, etc. The data storage area 34 and the immediate data buffer 33 are realized by some part of the memory 53.
FIG. 4A and FIG. 4B are diagrams showing examples of tables stored in the data storage area 34. FIG. 4A shows an initial priority value table T1 on which identification information (host ID) of every host that is permitted to log into the disk array apparatus 2 and an initial priority value of every host are registered. As the host ID, an identifier used in network communication such as initiator name parameter and initiator alias parameter defined by iSCSI, authentication key, IP address for TCP/IP, MAC address, etc. is used. The initial priority value is the initial value of the priority value, and can be set arbitrarily by the manager of the disk array apparatus 2. The manager sets a large value as the initial priority value for a host to which the immediate data buffer 33 should be allocated preferentially, and sets a small value as the initial priority value for a host which needs not to be taken care of preferentially. The host ID and initial priority value are managed host by host.
FIG. 4B shows a priority value table T2 on which identification number (host ID), initial priority value, total amount of data transferred after login, command importance degree after login, current priority value, and buffer allocation amount of the host which is actually logging into the disk array apparatus 2 are registered. These registered data are managed host by host. The priority value table T2 is referred to when priority values are recalculated by the priority value recalculation unit 36, when the buffer allocation amount is changed, etc.
The total amount of data transferred and command importance degree are values used for calculating the priority value of each host. The total amount of data transferred is used for increasing the priority value of a host which sends a large amount of data. The command importance degree is used for increasing the priority value of a host which uses many important commands. The total amount of data transferred and command importance degree of each host are updated as needed by the host communication unit 31, and registered on the priority value table T2. The total amount of data transferred is calculated by accumulating the amount of data which has been transferred when transfer of write data is completed. The command importance degree is obtained by quantifying the frequency of usage of various commands issued by the host 1 to the disk array apparatus 2, based on the degree of importance of each command. For example, weighted value of each command from a host is pre-set by the manager, and the command importance degree is calculated by accumulating the weighted values each time 110 (Input/Output) by a command from a host is processed. For example, the manager may set a large value for a write command for user data, and set a small value for a command for monitoring the condition of the disk array apparatus 2 or for a command for manipulating statistical information. By such setting, the command importance degree of a host that frequently writes user data becomes a large value, and the command importance degree of such a host as a managing terminal that checks the operational condition of the disk array apparatus 2 becomes a small value. A table of values to be accumulated at each I/O which are used for calculating the command importance degree is stored in the data storage area 34.
In the data storage area 34, various values are stored in addition to the initial priority value table T1, the priority value table T2, the table of values to be accumulated at each I/O.
For example, a login reference value to be described later is stored in the data storage area 34. This login reference value is a reference priority value as a border used by the login determination unit 32 to determine whether or not to permit the host 1 to perform immediate data transfer when the host 1 requests immediate data transfer to the disk array apparatus 2. The login determination unit 32 compares the initial priority value of the host 1 which requests immediate data transfer with the login reference value, and permits the host 1 to perform immediate data transfer when the initial priority value is equal to or greater than the login reference value. The login reference value can be arbitrarily set by the manager of the disk array apparatus 2. The manager sets the login reference value together with the initial priority value of each host.
The operation of the host adaptor 3 configured as described above will now be explained with reference to FIG. 5 and following drawings. FIG. 5 is a flowchart for explaining a process in which the disk array apparatus 2 allocates the immediate data buffer 33 to the host 1 a when the host 1 a logs into the disk array apparatus 2. First, when the host communication unit 31 receives a login request from the host 1 a, the login determination unit 32 refers to the initial priority value table T1 in the data storage area 34 to refer to the initial priority value of the host 1 a based on the host ID included in the login request (step A1).
After this, a login negotiation for determining various parameters related to immediate data transfer defined by iSCSI is started between the host 1 a and the login determination unit 32 (step A2). Next, the login determination unit 32 determines whether or not the host 1 a requests immediate data transfer (step A3). In a case where the host 1 a sends a parameter for requesting use of immediate data transfer (step A3: Yes), the login determination unit 32 determines whether or not the initial priority value referred to in step A1 is equal to or greater than the login reference value stored in the data storage area 34 (step A4).
In a case where a host 1 a which newly requests login (a new login host) does not request immediate data transfer (step A3: No) or in a case where the initial priority value of the new login host 1 a is smaller than the login reference value (step A4: No), the login determination unit 32 sends a login response representing that “immediate data=no”, i.e., immediate data transfer is not permitted, to the new login host 1 a (step A9). In this case, immediate data transfer is not performed but ordinary data transfer is performed between the new login host 1 a and the disk array apparatus 2.
In a case where the initial priority value of the new login host 1 a is equal to or greater than the login reference value in step A4 (step A4: Yes), the priority value of every host 1 that has already logged in and is now permitted to perform immediate data transfer is recalculated based on the total amount of data transferred and command importance degree, etc. on the priority table T2 to update the priority value on the priority value table T2 (step A5). The process for priority value recalculation will be specifically described later.
After this, allocation of the immediate data buffer 33 to the new login host 1 a is performed based on the recalculated priority values (step A6). The buffer allocation process will be described in detail later, but the outline of the process will now be explained. First, a buffer allocation amount representing the capacity (size) of immediate data buffer to be allocated to the new login host 1 a is calculated based on the priority value of the new login host 1 a. The buffer allocation unit 35 attempts to secure this buffer allocation amount in the immediate data buffer 33. However, in some case, the immediate data buffer 33 is already allocated to other hosts 1 and the buffer allocation amount of the new login host 1 a can not be fully secured in the immediate data buffer 33. In this case, the buffer allocation unit 35 attempts to secure the buffer allocation amount of the new login host 1 a in the immediate data buffer 33 by applying capacity of immediate data buffer already allocated to other hosts 1 that have a smaller priority value than the new login host 1 a to the buffer allocation amount of the new login host 1 a.
Next, it is determined whether or not the allocation of the immediate data buffer 33 to the new login host 1 a in the buffer allocation process in step A6 is successful (step A7).
In a case where the allocation of the immediate data buffer 33 is successful (step A7: Yes), the login determination unit 32 sends a login response representing that immediate data=yes to the new login host 1 a (step A8). In this case, immediate data transfer is performed between the new login host 1 a and the disk array apparatus 2. On the contrary, in a case where the allocation is unsuccessful (step A7: No), the login determination unit 32 sends a login response representing that immediate data=no to the new login host 1 a (step A9). In this case, ordinary data transfer is performed between the new login host 1 a and the disk array apparatus 2.
Next, the priority value recalculation process in step A5 in FIG. 5 will be specifically explained with reference to a flowchart shown in FIG. 6.
In this priority value recalculation process, the priority value of every host 1 that has already logged in and is currently permitted to perform immediate data transfer is recalculated. The recalculation of priority value is done by calculating a write command ratio and a command importance degree ratio for each host and adding the write command ratio, the command importance degree, and the initial priority value. First, the write command ratio of each host is calculated (step B1). The write command ratio is calculated based on the total amount of data transferred registered on the priority value table T2 shown in FIG. 4B. Specifically, for example, in a case where the host 1 b is one of the hosts that are currently permitted to perform immediate data transfer and thus the write command ratio of the host 1 b is to be calculated, calculation of “write command ratio of host 1 b=total amount of data transferred of host 1 b/sum total of total amounts of data transferred of all hosts 1 currently permitted to perform immediate data transfer” is performed. Next, the command importance degree ratio of each host is calculated (step B2). The command importance degree ratio is calculated based on the command importance degree registered on the priority value table T2. Specifically, for example in a case where the command importance degree ratio of the host 1 b is to be calculated, calculation of “command importance degree ratio of host 1 b=command importance degree of host 1 b/sum total of command importance degrees of all hosts 1 currently permitted to perform immediate data transfer” is performed. After this, the priority value of each host is calculated (step B3). Specifically, in a case where the priority value of the host 1 b is calculated, calculation of “priority value of host 1 b write command ratio of host 1 b+command importance degree ratio of host 1 b+initial priority value of host 1 b” is performed. The priority value recalculation unit 36 recalculates the priority value of every host 1 that is currently permitted to perform immediate data transfer, and updates the priority value registered on the priority value table T2 in the data storage area 34 (step 134).
In this process, the priority value is recalculated using both of the write command ratio of the host and the command importance degree ratio of the host. However, the priority value may be recalculated using either one of them.
Next, the buffer allocation process in step A6 of FIG. 5 will be specifically explained with reference to a flowchart shown in FIG. 7.
The buffer allocation unit 35 calculates a buffer allocation amount of the new login host 1 a based on the priority value registered on the priority value table T2 shown in FIG. 4B (step C1). The buffer allocation amount of the new login host 1 a is calculated by, for example, “immediate data buffer allocation amount of host 1 a=(priority value of host 1 a/sum total of priority values of all hosts 1 currently permitted to perform immediate data transfer)×maximum buffer capacity”. Note that buffer allocation amount≦predetermined maximum value must be satisfied. Next, it is determined whether or not the calculated buffer allocation amount is equal to or greater than a predetermined reference value (step C2). This reference value represents the minimum capacity of immediate data buffer that the disk array apparatus 2 allocates to one host. The reference value is pre-set by the manager based on the process performance, buffer capacity, etc. of the disk array apparatus 2, and is stored in the data storage area 34. This reference value is set because if the capacity of immediate data buffer to be allocated to each host is too small, the process performance can not be improved. If the calculated buffer allocation amount is smaller than this predetermined reference value (step C2: No), the buffer allocation is unsuccessful (step C10). In this case, allocation of the immediate data buffer 33 to the new login host 1 a is not performed.
If the calculated buffer allocation amount is equal to or greater than the predetermined reference value (step C2: Yes), the buffer allocation unit 35 attempts to secure the buffer allocation amount of the new login host 1 a in the immediate data buffer 33 (step C3). Next, it is determined whether or not the buffer allocation amount is secured (step C4). If there is enough free space in the immediate data buffer 33, the buffer allocation amount is secured (step C4: Yes), and the buffer allocation is regarded as successful (step C9).
On the contrary, there might be a case where the immediate data buffer 33 has been allocated to several hosts 1 at the time in question and there is not enough free space, and the buffer allocation amount calculated for the new login host 1 a can not be secured (step C4: No). In this case, the flow goes to step C5, and thereafter, the buffer freeing unit 37 frees the buffer allocation amount in the immediate data buffer 33 allocated to a host 1 having a smaller priority value than the new login host 1 a, and applies the freed buffer allocation amount to the buffer allocation amount of the new login host 1 a.
First, the buffer allocation unit 35 extracts hosts 1 whose buffer allocation amounts are reallocated to the new login host 1 a from the hosts 1 to which the immediate data buffer 33 is now allocated (step C5). Specifically, the buffer allocation unit 35 searches for hosts 1 having a smaller priority value than the new login host 1 a in the order of smaller priority value, among the hosts 1 which are now logging in and using the immediate data buffer 33. This search is continued until “sum total of buffer allocation amounts of searched-out hosts 1≧buffer allocation amount of new login host 1 a” is satisfied. The buffer allocation unit 35 stops searching at the time the accumulated value of buffer allocation amounts of the searched-out hosts 1 reaches the buffer allocation amount of the new login host 1 a, and extracts the searched-out hosts 1 as the hosts 1 whose buffer allocation amounts are reallocated to the new login host 1 a. The priority value table T2 is referred to for this search.
Next, it is determined whether or not the extraction of hosts in step C5 is successful (step C6). If the extraction is successful, i.e., in a case where it is turned out that the buffer allocation amount of the new login host 1 a can be secured by freeing the buffer allocation amount of one or more hosts 1 having a smaller priority value (step C6: Yes), the buffer freeing unit 37 requests re-login to the extracted hosts 1 for making them to re-log into the disk array apparatus 2 (step C7). This re-login request is made by the buffer freeing unit 37 performing an operation that anticipates re-login of the hosts 1. Such an operation includes sending of an Asynchronous Message defined by iSCSI, and disconnection of the connection by FIN or RST of TCP/IP protocol, etc. The hosts 1 that receive the re-login request once log out from the disk array apparatus 2. Since the resource occupied by the hosts 1 is freed due to the logout of the hosts 1, the immediate data buffer 33 allocated to the hosts 1 that have logged out is freed and the buffer allocation amount of the new login host 1 a is secured (step C8). If the buffer allocation amount is secured in this way, the buffer allocation is regarded as successful (step C9). In a case where the buffer allocation is successful the login determination unit 32 declares “immediate data=no” in the negotiation performed when the hosts 1 that have been extracted for re-login request re-log into the disk array apparatus 2. Due to this, buffer allocation for them is rejected and immediate data transfer is not permitted.
On the contrary, in a case where it is determined in step C6 that extraction of hosts is unsuccessful (step C6: No), that is, in a case where the necessary allocation amount cannot be secured by freeing all the buffer allocation amounts of the hosts 1 having a smaller priority value than the new login host 1 a, the buffer allocation is regarded as unsuccessful (step C10). In this case, allocation of the immediate data buffer 33 to the new login host 1 a is not performed because it is determined that the buffer allocation amount of the new login host 1 a cannot be secured.
By controlling the disk array system in accordance with the processes shown in FIG. 5, FIG. 6, and FIG. 7, it is possible to allocate the immediate data buffer preferentially to the host which is high in the priority order and to achieve an effective use of the immediate data buffer thus improvement in the performance of the whole system.
In the process shown in FIG. 5 for allocating the buffer to the host that newly logs in, the procedure of recalculating the priority value in step A5 is not indispensable. Therefore, the flow may advance from step A4 to step A6. In this case, for example, the priority value before recalculation or the initial priority value may be used instead of a priority value obtained after recalculation. The manner of recalculating the priority value shown in FIG. 6 is not limited to the one described above, but the priority value may be recalculated in other manners. For example, it may be recalculated in such a manner that the priority value of a host that has not performed immediate data transfer for a predetermined period of time is decreased. In FIG. 7, in a case where there is not enough free space of immediate data buffer to be allocated to the new login host, the immediate data buffer allocated to other hosts is transferred to the new login host in steps C5 to C8. However, in this case, it may be determined that the buffer allocation is unsuccessful.
Next, a process for dynamic reallocation of the immediate data buffer 33 in the disk array apparatus 2 will be explained with reference to FIG. 8. The disk array apparatus 2 according to the present invention performs recalculation of the priority value of the host 1 regularly or upon an arbitrary trigger, and reallocates the immediate data buffer 33 to each host 1 that logs in based on the recalculated value. That is, the buffer allocation amount can be dynamically changed upon a trigger. The trigger for performing the dynamic reallocation may be an operation or a setting by the manager, detection of login by a new host, detection of logout by a host, etc. The disk array apparatus 2 may track the usage of the immediate data buffer 33, and may perform reallocation when the usage frequency of a given host reaches or exceeds a predetermined level.
As shown in FIG. 8, in the reallocation of the immediate data buffer 33, when the trigger for performing the dynamic reallocation is pulled, the priority value of each host 1 that is logging in is recalculated (step D1). This recalculation is performed by the priority value recalculation unit 36 in the same way as steps B1 to B3 in FIG. 6. Due to this, the priority value registered on the priority value table T2 shown in FIG. 4B is updated. Next, it is determined whether or not the priority value is changed as the result of the recalculation (step D2). In a case where there is no change in the priority value of any host 1 as the result of the recalculation, it is not necessary to change the buffer allocation amount and the process is therefore terminated (step D2: No). In a case where there is a change in the priority value (step D2: Yes), the flow goes to step D3, wherein and whereafter the buffer allocation unit 35 performs reallocation of the immediate data buffer 33. First, as in step C1 of FIG. 7, the buffer allocation unit 35 calculates the buffer allocation amount of each host 1 (step D3). However, unlike step C1, the buffer allocation unit 35 calculates the buffer allocation amount of all the hosts 1 that log in. For example, the buffer allocation amount of the host 1 b is calculated by “immediate data buffer allocation amount of host 1 b=(priority value of host 1 b/sum total of priority values of all hosts 1 that currently log in)×maximum buffer capacity”. Note that buffer allocation amount≦predetermined maximum value must be satisfied. Next, as in step C2 of FIG. 7, it is determined whether or not the calculated buffer allocation amount is equal to or greater than a predetermined reference value (step D4). This reference value represents the minimum capacity of immediate data buffer that the disk array apparatus 2 allocates to one host. The reference value is pre-set by the manager based on the process performance, buffer capacity, etc. of the disk array apparatus 2, and is stored in the data storage area 34.
If the calculated buffer allocation amount is equal to or greater than the predetermined reference value (step D4: Yes), the buffer allocation unit 35 updates the buffer allocation amount on the priority value table T2 shown in FIG. 4B, and requests re-login to the host 1 whose calculated buffer allocation amount is equal to or greater than the reference value, for making this host 1 to re-log into the disk array apparatus 2 (step D5). The login determination unit 32 sets the recalculated buffer allocation amount of the host 1 which receives the re-login request to a parameter (first burst length key value), in the negotiation performed at the time of re-login. Due to this, the first burst length key is changed and the intended change in the buffer allocation amount is achieved.
In a case where the calculated buffer allocation amount is smaller than the predetermined reference value (step D4: No), the buffer allocation unit 35 also requests re-login to the host 1 whose calculated buffer allocation amount is smaller than the reference value (step D6). The login determination unit 32 declares “immediate data no” to the host 1 which receives the re-login request, in the negotiation performed at the time of re-login. Due to this, buffer allocation for them is rejected and this host 1 is not permitted to use the immediate data buffer.
By performing reallocation of the immediate data buffer 33 in this manner, it is possible to realize a buffer allocation state that is best suited to the condition at each occasion.
In the process shown in FIG. 5 for allocating the buffer to the host that newly logs in, the priority value of each host is recalculated in step A5. Therefore, the buffer allocation amount of each host may be changed based on the priority value recalculated in step A5, not by recalculating the priority value in step D1.
As specifically explained above, the disk array apparatus according to an embodiment of the present invention manages the priority value for each host that logs in, and determines the buffer allocation amount based on the priority value. Due to this, the disk array apparatus can increase the buffer allocation amount of the host whose command should be processed preferentially, and can decrease the buffer allocation amount of the host whose command needs not be processed preferentially. Therefore, according to the present invention, the ability of the host which is high in the priority order is fully utilized, and the process performance of the whole system is improved.
The disk array apparatus according to an embodiment of the present invention changes the parameter by recalculating the priority value regularly or upon an arbitrary trigger, requesting re-login to the hosts, and re-performing login negotiation. Therefore, according to the present invention, the buffer allocation amount can be dynamically changed based on the recalculated priority value, and a buffer allocation state that is best suited to the condition at each occasion can be built.
The preferred embodiments of the present invention have been explained as described above. The present invention can be structured as various other embodiments. For example, the information recording apparatus according to the present invention may be other apparatuses than a disk array apparatus. Immediate data transfer on iSCSI has been described in the above embodiments, but the present invention can be widely applied to apparatuses that use a protocol adopting a transfer method where data transfer is started without waiting for a data transfer request from the command reception side after a write command is issued. In the above-described embodiments, permission or rejection of immediate data transfer is determined or the first burst length key value is changed by re-login. In addition, the present invention may be designed such that other iSCSI parameters like Max Connections that can only be set in the negotiation at the time of login are changed at the time of re-login. The priority value recalculation unit 36 in FIG. 2 may determine the degree of priority (priority degree) such as, for example, an order of priority of the host 1.
Further, the host adaptor 3 may be realized not by a dedicated device but by an ordinary computer system.
For example, by installing on a computer, a computer program for controlling the computer to perform the above-described operations, it is possible to make this computer to function as the host adaptor 3. The computer program may be recorded on a computer-readable recording medium such as a floppy disk, a CD-ROM, a hard disk, etc., or may be uploaded on a server on a network. Then, the computer program may be installed on a computer through distribution in a recording medium or downloading via a network.
Various embodiments and changes may be made thereunto without departing from the broad spirit and scope of the invention. The above-described embodiments are intended to illustrate the present invention, not to limit the scope of the present invention. The scope of the present invention is shown by the attached claims rather than the embodiments. Various modifications made within the meaning of an equivalent of the claims of the invention and within the claims are to be regarded to be in the scope of the present invention.
This application is based on Japanese Patent Application No. 2003-162789 filed on Jun. 6, 2003 and including specification, claims, drawings and summary. The disclosure of the above Japanese Patent Application is incorporated herein by reference in its entirety.

Claims (13)

1. An information recording apparatus storing data received from a plurality of host computers, said information recording apparatus comprising:
a buffer memory having a buffer area for temporarily storing said data;
a memory storing a priority degree for each of said host computers, said priority degree being dynamically updated based on a status of said data received from corresponding one of said host computers;
a buffer allocation unit dynamically allocating portions of said buffer area to said host computers, said portions of said buffer area allocated to said host computers having respective amounts determined based on said priority degrees of said host computers;
a login determination unit determining whether or not a host computer logged into said information recording apparatus; and
a priority degree determination unit;
wherein:
said memory stores an initial priority degree which is pre-set for each of said host computers, and a reference priority degree representing a threshold level for the initial priority degrees;
said login determination unit determines whether or not the initial priority degree of a host computer stored in said memory is higher than the reference priority degree stored in said memory, when said host computer logs into said information recording apparatus;
said buffer allocation unit allocates a portion of said buffer area corresponding to the determined amount to said host computer, in a case where said login determination unit determines that the initial priority degree of said host computer is higher than the reference priority degree;
said memory stores for each host computer data representing the status corresponding to an amount of data and/or a usage degree of various commands received from the host computer and from a time the host computer logged into said information recording apparatus;
said priority degree determination unit determines the priority degree of each host computer that is stored in said memory and updating the stored priority degree, based on the amount of data and/or the usage degree of various commands and the initial priority degree stored in said memory;
said buffer allocation unit determines a reallocation amount of a portion of said buffer area to be allocated to each host computer that has been logged into said information recording apparatus based on the priority degree determined by said priority degree determination unit, and allocates a portion of said buffer area corresponding to the determined reallocation amount to each host computer;
the priority degree is a numerical value, said value being large when the priority degree is high, while being small when the priority degree is low; and
said priority degree determination unit determines the priority degree of a host computer by “(the amount of data transferred from said host computer/total amounts of data transferred from all host computers to which portions of said buffer area are allocated)+(the usage degree of various commands from said host computer/total of usage degrees of various commands from all host computers to which portions of said buffer area are allocated)+the initial priority degree of said host computer”.
2. An information recording apparatus storing data received from a plurality of host computers, said information recording apparatus comprising:
a buffer memory having a buffer area for temporarily storing said data;
a priority degree determination unit;
a memory storing a priority degree for each of said host computers, said priority degree being dynamically updated based on a status of said data received from corresponding one of said host computers; and
a buffer allocation unit dynamically allocating portions of said buffer area to said host computers, said portions of said buffer area allocated to said host computers having respective amounts determined based on said priority degrees of said host computers;
wherein:
the priority degree is a numerical value, said value being large when the priority degree is high, while being small when the priority degree is low, wherein said priority degree determination unit determines the priority degree of each of said host computers by “(an amount of data transferred from said host computer/total amounts of data transferred from all host computers to which portions of said buffer area are allocated)+(a usage degree of various commands from said host computer/total of usage degrees of various commands from all host computers to which portions of said buffer area are allocated)+an initial priority degree of said host computer”; and
said buffer allocation unit determines an amount of a portion of said buffer area to be allocated to each of said host computers by “(the priority degree of said host computer/total of the priority degrees of all host computers to which portions of the buffer area are allocated) a whole capacity of said buffer memory”.
3. The information recording apparatus according to claim 1, further comprising a login determination unit determining whether or not a host computer logged into said information recording apparatus,
wherein:
said memory stores an initial priority degree which is pre-set for each of said host computers, and a reference priority degree representing a threshold level for the initial priority degrees;
said login determination unit determines whether or not the initial priority degree of a host computer stored in said memory is higher than the reference priority degree stored in said memory, when said host computer logs into said information recording apparatus; and
said buffer allocation unit allocates a portion of said buffer area corresponding to the determined amount to said host computer, in a case where said login determination unit determines that the initial priority degree of said host computer is higher than the reference priority degree.
4. The information recording apparatus according to claim 1, further comprising a buffer freeing unit freeing portions of said buffer area already allocated to host computers, on a basis of host computer by host computer,
wherein in a case where said buffer allocation unit cannot secure a portion of said buffer area corresponding to the determined amount in said buffer memory when attempting to allocate a portion of said buffer area to a host computer:
said buffer freeing unit frees a portion of said buffer area already allocated to another host computer for which a priority degree lower than that of said host computer is set, based on a predetermined condition; and
said buffer allocation unit allocates a portion of said buffer area corresponding to the determined amount to said host computer, in a case where a portion of said buffer area corresponding to the determined amount can be secured in said buffer memory due to the freeing of the portion of said buffer area by said buffer freeing unit.
5. The information recording apparatus according to claim 3, further comprising a priority degree determination unit,
wherein:
said memory stores for each host computer data representing the status corresponding to an amount of data and/or a usage degree of various commands received from the host computer and from a time the host computer logged into said information recording apparatus;
said priority degree determination unit determines the priority degree of each host computer that is stored in said memory and updating the stored priority degree, based on the amount of data and/or the usage degree of various commands and the initial priority degree stored in said memory; and
said buffer allocation unit determines a reallocation amount of a portion of said buffer area to be allocated to each host computer that has been logged into said information recording apparatus based on the priority degree determined by said priority degree determination unit, and allocates a portion of said buffer area corresponding to the determined reallocation amount to each host computer.
6. An information recording apparatus storing data received from a plurality of host computers, said information recording apparatus comprising:
a buffer memory having a buffer area for temporarily storing said data;
a priority degree determination unit;
a memory storing a priority degree for each of said host computers, said priority degree being dynamically updated based on a status of said data received from corresponding one of said host computers, wherein said priority degree determination unit determines the priority degree of each of said host computers by “(an amount of data transferred from said host computer/total amounts of data transferred from all host computers to which portions of said buffer area are allocated)+(a usage degree of various commands from said host computer/total of usage degrees of various commands from all host computers to which portions of said buffer area are allocated)+an initial priority degree of said host computer”;
a buffer allocation unit dynamically allocating portions of said buffer area to said host computers, said portions of said buffer area allocated to said host computers having respective amounts determined based on said priority degrees of said host computers;
a buffer freeing unit freeing portions of said buffer area already allocated to host computers, on a basis of host computer by host computer;
a login determination unit determining whether or not a host computer logged into said information recording apparatus;
wherein in a case where said buffer allocation unit cannot secure a portion of said buffer area corresponding to the determined amount in said buffer memory when attempting to allocate a portion of said buffer area to a host computer:
said buffer freeing unit frees a portion of said buffer area already allocated to another host computer for which a priority degree lower than that of said host computer is set, based on a predetermined condition; and
said buffer allocation unit allocates a portion of said buffer area corresponding to the determined amount to said host computer, in a case where a portion of said buffer area corresponding to the determined amount can be secured in said buffer memory due to the freeing of the portion of said buffer area by said buffer freeing unit; and
wherein the freeing of the portion of said buffer area already allocated to a host computer by said buffer freeing unit is achieved in a manner that:
said buffer freeing unit requests said host computer to re-log into said information recording apparatus; and
said login determination unit rejects allocation of a portion of said buffer area to said host computer, when said host computer re-logs into said information recording apparatus.
7. The information recording apparatus according to claim 5,
wherein the allocation of the portion of said buffer area corresponding to the determined reallocation amount to each host computer by said buffer allocation unit is achieved in a manner that:
said buffer allocation unit requests each host computer to re-log into said information recording apparatus; and
said login determination unit changes an amount of a portion of said buffer area to be allocated to each host computer, when each host computer re-logs into said information recording apparatus.
8. A buffer allocation method of allocating a portion of a buffer area of a buffer memory for temporarily storing data and included in a subordinate apparatus which stores data received from a plurality of superordinate apparatuses to each superordinate apparatus, said method comprising:
a priority degree determination step;
an allocation amount determination step of determining an amount of a portion of said buffer area to be allocated to each superordinate apparatus, based on a priority degree which is set for each superordinate apparatus and stored in a memory of said subordinate apparatus, wherein said priority degree determination step determines the priority degree of each of said superordinate apparatuses by “(an amount of data transferred from said superordinate apparatus/total amounts of data transferred from all superordinate apparatuses to which portions of said buffer area are allocated)+(a usage degree of various commands from said superordinate apparatus/total of usage degrees of various commands from all superordinate apparatuses to which portions of said buffer area are allocated)+an initial priority degree of said superordinate apparatus”; and
a buffer allocating step of allocating a portion of said buffer area corresponding to the amount determined in said allocation amount determination step to a superordinate apparatus for which a high priority degree is set, preferentially over a superordinate apparatus for which a low priority degree is set;
wherein in said allocation amount determination step, an amount of a portion of said buffer area to be newly allocated to a new superordinate apparatus to which a portion of said buffer area has not yet been allocated, is determined, and
said buffer allocating step includes:
an amount securing determination step of determining whether or not a portion of said buffer area corresponding to the amount determined in said allocation amount determination step can be secured in said buffer memory;
a buffer freeing step of freeing portions of said buffer area already allocated to some or all of superordinate apparatuses for which a priority degree lower than that of said new superordinate apparatus is set, in a case where it is determined in said amount securing determination step that the portion of said buffer area cannot be secured; and
a newly allocating step of allocating a portion of said buffer area corresponding to the amount determined in said allocation amount determination step to said new superordinate apparatus, by assigning amounts of portions of said buffer area freed in said buffer freeing step to the amount determined in said allocation amount determination step;
said buffer freeing step includes:
a re-login requesting step of requesting a superordinate apparatus to which a portion of said buffer area is already allocated, to re-log into said subordinate apparatus; and
an allocation rejecting step of rejecting allocation of a portion of said buffer area to said superordinate apparatus, when said superordinate apparatus re-logs into said subordinate apparatus in accordance with a request in said re-login requesting step, and the freeing of portions of said buffer area in said buffer freeing step is realized by rejection of allocation of a portion of said buffer area in said allocation rejecting step.
9. The buffer allocation method according to claim 8, further comprising a priority degree changing step of changing the priority degree of each superordinate apparatus stored in said memory,
wherein:
in said allocation amount determination step, a reallocation amount of a portion of said buffer area to be allocated to each superordinate apparatus that has been logged into said subordinate apparatus is determined based on the priority degree changed in said priority degree changing step; and
in said buffer allocating step, a portion of said buffer area corresponding to the reallocation amount determined in said allocation amount determination step is allocated to each superordinate apparatus.
10. The buffer allocation method according to claim 9,
wherein
said buffer allocating step includes:
a re-login requesting step of requesting each superordinate apparatus that has been logged into said subordinate apparatus to re-log into said subordinate apparatus; and
an amount changing step of changing the amount of the portion of said buffer area to be allocated to each superordinate apparatus, when each superordinate apparatus re-logs into said subordinate apparatus in accordance with a request in said re-login requesting step, and
the allocation of a portion of said buffer area corresponding to the reallocation amount to each superordinate apparatus in said buffer allocating step is realized by changing of the amount of the portion of said buffer area to be allocated to each superordinate apparatus in said amount changing step.
11. A computer-readable recording medium storing a computer program for allocating a portion of a buffer area of a buffer memory for temporarily storing data and included in a subordinate apparatus which stores data received from a plurality of superordinate apparatuses to each superordinate apparatus, said computer program comprising:
a priority degree determination step;
an allocation amount determination step of determining an amount of a portion of said buffer area to be allocated to each superordinate apparatus, based on a priority degree which is set for each superordinate apparatus and stored in a memory of said subordinate apparatus, wherein said priority degree determination step determines the priority degree of each of said superordinate apparatuses by “(an amount of data transferred from said superordinate apparatus/total amounts of data transferred from all superordinate apparatuses to which portions of said buffer area are allocated)+(a usage degree of various commands from said superordinate apparatus/total of usage degrees of various commands from all superordinate apparatuses to which portions of said buffer area are allocated)+an initial priority degree of said superordinate apparatus”; and
a buffer allocating step of allocating a portion of said buffer area corresponding to the amount determined in said allocation amount determination step to a superordinate apparatus for which a high priority degree is set, preferentially over a superordinate apparatus for which a low priority degree is set;
wherein in said allocation amount determination step, an amount of a portion of said buffer area to be newly allocated to a new superordinate apparatus to which a portion of said buffer area has not yet been allocated, is determined, and
said buffer allocating step includes:
an amount securing determination step of determining whether or not a portion of said buffer area corresponding to the amount determined in said allocation amount determination step can be secured in said buffer memory;
a buffer freeing step of freeing portions of said buffer area already allocated to some or all of superordinate apparatuses for which a priority degree lower than that of said new superordinate apparatus is set, in a case where it is determined in said amount securing determination step that the portion of said buffer area cannot be secured; and
a newly allocating step of allocating a portion of said buffer area corresponding to the amount determined in said allocation amount determination step to said new superordinate apparatus, by assigning amounts of portions of said buffer area freed in said buffer freeing step to the amount determined in said allocation amount determination step;
said buffer freeing step includes:
a re-login requesting step of requesting a superordinate apparatus to which a portion of said buffer area is already allocated, to re-log into said subordinate apparatus; and
an allocation rejecting step of rejecting allocation of a portion of said buffer area to said superordinate apparatus, when said superordinate apparatus re-logs into said subordinate apparatus in accordance with a request in said re-login requesting step, and the freeing of portions of said buffer area in said buffer freeing step is realized by rejection of allocation of a portion of said buffer area in said allocation rejecting step.
12. The computer-readable recording medium storing the computer program according to claim 11,
wherein:
said computer program further comprises a priority degree changing step of changing the priority degree of each superordinate apparatus stored in said memory;
in said allocation amount determination step, a reallocation amount of a portion of said buffer area to be allocated to each superordinate apparatus that has been logged into said subordinate apparatus is determined based on the priority degree changed in said priority degree changing step; and
in said buffer allocating step, a portion of said buffer area corresponding to the reallocation amount determined in said allocation amount determination step is allocated to each superordinate apparatus.
13. The computer-readable recording medium storing the computer program according to claim 12,
wherein
said buffer allocating step includes:
a re-login requesting step of requesting each superordinate apparatus that has been logged into said subordinate apparatus to re-log into said subordinate apparatus; and
an amount changing step of changing the amount of the portion of said buffer area to be allocated to each superordinate apparatus, when each superordinate apparatus re-logs into said subordinate apparatus in accordance with a request in said re-login requesting step, and
the allocation of a portion of said buffer area corresponding to the reallocation amount to each superordinate apparatus in said buffer allocating step is realized by changing of the amount of the portion of said buffer area to be allocated to each superordinate apparatus in said amount changing step.
US10/861,460 2003-06-06 2004-06-07 Buffer allocation based upon priority Expired - Fee Related US7337285B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2003162789A JP4175185B2 (en) 2003-06-06 2003-06-06 Network information recording device
JP2003-162789 2003-06-06

Publications (2)

Publication Number Publication Date
US20040250026A1 US20040250026A1 (en) 2004-12-09
US7337285B2 true US7337285B2 (en) 2008-02-26

Family

ID=33487554

Family Applications (1)

Application Number Title Priority Date Filing Date
US10/861,460 Expired - Fee Related US7337285B2 (en) 2003-06-06 2004-06-07 Buffer allocation based upon priority

Country Status (2)

Country Link
US (1) US7337285B2 (en)
JP (1) JP4175185B2 (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060265558A1 (en) * 2005-05-17 2006-11-23 Shuji Fujino Information processing method and system
US20080209137A1 (en) * 2007-02-23 2008-08-28 Inventec Corporation Method of specifying access sequence of a storage device
US20090265486A1 (en) * 2008-04-17 2009-10-22 Tim Jenkins System for managing a cost-constrained resource
US20110131328A1 (en) * 2009-11-30 2011-06-02 Neil Horman Network buffer allocations based on consumption patterns
US20120005669A1 (en) * 2010-06-30 2012-01-05 Lsi Corporation Managing protected and unprotected data simultaneously
US20160162425A1 (en) * 2008-09-29 2016-06-09 International Business Machines Corporation Associating process priority with i/o queuing
US11750504B2 (en) 2019-05-23 2023-09-05 Hewlett Packard Enterprise Development Lp Method and system for providing network egress fairness between applications
US11973685B2 (en) 2020-03-23 2024-04-30 Hewlett Packard Enterprise Development Lp Fat tree adaptive routing

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7698424B1 (en) * 2004-09-28 2010-04-13 Emc Corporation Techniques for presenting multiple data storage arrays to iSCSI clients as a single aggregated network array
JP2007233546A (en) * 2006-02-28 2007-09-13 Seiko Epson Corp Multifunctional composite system, composite resource management method and program
JP4901310B2 (en) * 2006-05-31 2012-03-21 株式会社日立製作所 Storage control device and command execution number control method for storage control device
JP5280617B2 (en) * 2006-09-01 2013-09-04 アイシン・エィ・ダブリュ株式会社 Map update system and map update method
JP5034495B2 (en) * 2006-12-27 2012-09-26 日本電気株式会社 Storage system, program and method
JP4654273B2 (en) * 2008-07-14 2011-03-16 富士通株式会社 Storage device and control device
JP5085463B2 (en) * 2008-08-12 2012-11-28 株式会社リコー Information transfer circuit, information processing apparatus, information transfer circuit control method, control program, and recording medium
US9021198B1 (en) * 2011-01-20 2015-04-28 Commvault Systems, Inc. System and method for sharing SAN storage
CN103620563B (en) * 2011-04-26 2015-04-29 Lsi公司 Variable over-provisioning for non-volatile storage
KR101798036B1 (en) 2011-08-09 2017-11-15 엘에스아이 코포레이션 I/o device and computing host interoperation
WO2014068620A1 (en) * 2012-10-31 2014-05-08 Hitachi, Ltd. Storage system and access arbitration method
US9395924B2 (en) 2013-01-22 2016-07-19 Seagate Technology Llc Management of and region selection for writes to non-volatile memory
US9715406B2 (en) * 2013-06-14 2017-07-25 Microsoft Technology Licensing, Llc Assigning and scheduling threads for multiple prioritized queues
JP6149595B2 (en) * 2013-08-13 2017-06-21 富士通株式会社 Cache memory control program, processor incorporating cache memory, and cache memory control method
JP6269045B2 (en) * 2013-12-26 2018-01-31 日本電気株式会社 Information processing apparatus for managing buffer, buffer management method, and program therefor

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5535364A (en) * 1993-04-12 1996-07-09 Hewlett-Packard Company Adaptive method for dynamic allocation of random access memory to procedures having differing priorities based on first and second threshold levels of free RAM
JPH08249142A (en) 1995-03-09 1996-09-27 Ricoh Co Ltd Printer
US6076112A (en) * 1995-07-19 2000-06-13 Fujitsu Network Communications, Inc. Prioritized access to shared buffers
JP2000293386A (en) 1999-04-12 2000-10-20 Hitachi Ltd Memory management system
US6260090B1 (en) * 1999-03-03 2001-07-10 International Business Machines Corporation Circuit arrangement and method incorporating data buffer with priority-based data storage
JP2001337863A (en) 2000-05-24 2001-12-07 Hitachi Ltd Storage controller, storage system, and the method for setting security for storage system
US6601151B1 (en) * 1999-02-08 2003-07-29 Sun Microsystems, Inc. Apparatus and method for handling memory access requests in a data processing system
US20040107322A1 (en) * 2002-11-29 2004-06-03 Daniel Mulligan System and method for dynamically allocating shared memory within a multiple function device
US6889283B2 (en) * 2001-02-23 2005-05-03 Hewlett-Packard Development Company, L.P. Method and system to promote arbitration priority in a buffer queue
US6996820B1 (en) * 1999-04-05 2006-02-07 Cisco Technology, Inc. Efficient multiple priority list memory system
US7035990B1 (en) * 1999-10-27 2006-04-25 Dr. Johannes Heidenhain Gmbh Method for dynamic memory management

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2839530B2 (en) * 1989-02-21 1998-12-16 富士通株式会社 Dynamic change processing method of memory allocation priority
JPH0695936A (en) * 1992-09-16 1994-04-08 Nippon Telegr & Teleph Corp <Ntt> Method for managing buffer
JPH10214247A (en) * 1996-11-28 1998-08-11 Hitachi Ltd External storage device interface
JP3175764B2 (en) * 1998-11-06 2001-06-11 日本電気株式会社 Memory scheduling method and storage medium for storing memory scheduling program
JP3997061B2 (en) * 2001-05-11 2007-10-24 株式会社日立製作所 Storage subsystem and storage subsystem control method

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5535364A (en) * 1993-04-12 1996-07-09 Hewlett-Packard Company Adaptive method for dynamic allocation of random access memory to procedures having differing priorities based on first and second threshold levels of free RAM
JPH08249142A (en) 1995-03-09 1996-09-27 Ricoh Co Ltd Printer
US6076112A (en) * 1995-07-19 2000-06-13 Fujitsu Network Communications, Inc. Prioritized access to shared buffers
US6601151B1 (en) * 1999-02-08 2003-07-29 Sun Microsystems, Inc. Apparatus and method for handling memory access requests in a data processing system
US6260090B1 (en) * 1999-03-03 2001-07-10 International Business Machines Corporation Circuit arrangement and method incorporating data buffer with priority-based data storage
US6996820B1 (en) * 1999-04-05 2006-02-07 Cisco Technology, Inc. Efficient multiple priority list memory system
JP2000293386A (en) 1999-04-12 2000-10-20 Hitachi Ltd Memory management system
US7035990B1 (en) * 1999-10-27 2006-04-25 Dr. Johannes Heidenhain Gmbh Method for dynamic memory management
US6606695B2 (en) 2000-05-24 2003-08-12 Hitachi, Ltd. Method and apparatus for controlling access to storage device
US6968434B2 (en) 2000-05-24 2005-11-22 Hitachi, Ltd. Method and apparatus for controlling access to storage device
JP2001337863A (en) 2000-05-24 2001-12-07 Hitachi Ltd Storage controller, storage system, and the method for setting security for storage system
US7130978B2 (en) 2000-05-24 2006-10-31 Hitachi, Ltd. Method and apparatus for controlling access to storage device
US20060271753A1 (en) 2000-05-24 2006-11-30 Toshimitsu Kamano Method and apparatus for controlling access to storage device
US6889283B2 (en) * 2001-02-23 2005-05-03 Hewlett-Packard Development Company, L.P. Method and system to promote arbitration priority in a buffer queue
US20040107322A1 (en) * 2002-11-29 2004-06-03 Daniel Mulligan System and method for dynamically allocating shared memory within a multiple function device

Cited By (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060265558A1 (en) * 2005-05-17 2006-11-23 Shuji Fujino Information processing method and system
US8307170B2 (en) * 2005-05-17 2012-11-06 Hitachi, Ltd. Information processing method and system
US20080209137A1 (en) * 2007-02-23 2008-08-28 Inventec Corporation Method of specifying access sequence of a storage device
US7818520B2 (en) * 2007-02-23 2010-10-19 Inventec Corporation Method of specifying access sequence of a storage device
US20090265486A1 (en) * 2008-04-17 2009-10-22 Tim Jenkins System for managing a cost-constrained resource
US8799538B2 (en) * 2008-04-17 2014-08-05 2236008 Ontario Inc. System for managing a cost-constrained resource
US20160162425A1 (en) * 2008-09-29 2016-06-09 International Business Machines Corporation Associating process priority with i/o queuing
US9959229B2 (en) * 2008-09-29 2018-05-01 International Business Machines Corporation Associating process priority with I/O queuing
US20110131328A1 (en) * 2009-11-30 2011-06-02 Neil Horman Network buffer allocations based on consumption patterns
US8438284B2 (en) * 2009-11-30 2013-05-07 Red Hat, Inc. Network buffer allocations based on consumption patterns
US20120005669A1 (en) * 2010-06-30 2012-01-05 Lsi Corporation Managing protected and unprotected data simultaneously
US8732701B2 (en) * 2010-06-30 2014-05-20 Lsi Corporation Managing protected and unprotected data simultaneously
US11777843B2 (en) 2019-05-23 2023-10-03 Hewlett Packard Enterprise Development Lp System and method for facilitating data-driven intelligent network
US11863431B2 (en) 2019-05-23 2024-01-02 Hewlett Packard Enterprise Development Lp System and method for facilitating fine-grain flow control in a network interface controller (NIC)
US11757764B2 (en) 2019-05-23 2023-09-12 Hewlett Packard Enterprise Development Lp Optimized adaptive routing to reduce number of hops
US11765074B2 (en) 2019-05-23 2023-09-19 Hewlett Packard Enterprise Development Lp System and method for facilitating hybrid message matching in a network interface controller (NIC)
US11750504B2 (en) 2019-05-23 2023-09-05 Hewlett Packard Enterprise Development Lp Method and system for providing network egress fairness between applications
US11784920B2 (en) 2019-05-23 2023-10-10 Hewlett Packard Enterprise Development Lp Algorithms for use of load information from neighboring nodes in adaptive routing
US11792114B2 (en) 2019-05-23 2023-10-17 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient management of non-idempotent operations in a network interface controller (NIC)
US11799764B2 (en) 2019-05-23 2023-10-24 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient packet injection into an output buffer in a network interface controller (NIC)
US11818037B2 (en) 2019-05-23 2023-11-14 Hewlett Packard Enterprise Development Lp Switch device for facilitating switching in data-driven intelligent network
US11848859B2 (en) 2019-05-23 2023-12-19 Hewlett Packard Enterprise Development Lp System and method for facilitating on-demand paging in a network interface controller (NIC)
US11855881B2 (en) 2019-05-23 2023-12-26 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient packet forwarding using a message state table in a network interface controller (NIC)
US11757763B2 (en) 2019-05-23 2023-09-12 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient host memory access from a network interface controller (NIC)
US11876702B2 (en) 2019-05-23 2024-01-16 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient address translation in a network interface controller (NIC)
US11876701B2 (en) 2019-05-23 2024-01-16 Hewlett Packard Enterprise Development Lp System and method for facilitating operation management in a network interface controller (NIC) for accelerators
US11882025B2 (en) 2019-05-23 2024-01-23 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient message matching in a network interface controller (NIC)
US11902150B2 (en) 2019-05-23 2024-02-13 Hewlett Packard Enterprise Development Lp Systems and methods for adaptive routing in the presence of persistent flows
US11899596B2 (en) 2019-05-23 2024-02-13 Hewlett Packard Enterprise Development Lp System and method for facilitating dynamic command management in a network interface controller (NIC)
US11916782B2 (en) 2019-05-23 2024-02-27 Hewlett Packard Enterprise Development Lp System and method for facilitating global fairness in a network
US11916781B2 (en) 2019-05-23 2024-02-27 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient utilization of an output buffer in a network interface controller (NIC)
US11929919B2 (en) 2019-05-23 2024-03-12 Hewlett Packard Enterprise Development Lp System and method for facilitating self-managing reduction engines
US11962490B2 (en) 2019-05-23 2024-04-16 Hewlett Packard Enterprise Development Lp Systems and methods for per traffic class routing
US11968116B2 (en) 2019-05-23 2024-04-23 Hewlett Packard Enterprise Development Lp Method and system for facilitating lossy dropping and ECN marking
US11973685B2 (en) 2020-03-23 2024-04-30 Hewlett Packard Enterprise Development Lp Fat tree adaptive routing

Also Published As

Publication number Publication date
JP2004362459A (en) 2004-12-24
JP4175185B2 (en) 2008-11-05
US20040250026A1 (en) 2004-12-09

Similar Documents

Publication Publication Date Title
US7337285B2 (en) Buffer allocation based upon priority
US10901636B2 (en) Target optimized auto provisioning of storage in a discoverable storage network
US8402239B2 (en) Volume management for network-type storage devices
US8359444B2 (en) System and method for controlling automated page-based tier management in storage systems
US8694741B2 (en) Storage system and method of executing commands by controller
JP4686606B2 (en) Method, computer program, and system for dynamic distribution of input / output workload among removable media devices attached via multiple host bus adapters
JP4452064B2 (en) Information processing system, information processing apparatus, information processing apparatus control method, and program
US7617349B2 (en) Initiating and using information used for a host, control unit, and logical device connections
US20150242133A1 (en) Storage workload hinting
US20100174879A1 (en) Estimating space in a compressed volume
JP4285058B2 (en) Network management program, management computer and management method
US20110225117A1 (en) Management system and data allocation control method for controlling allocation of data in storage system
KR20120102664A (en) Allocating storage memory based on future use estimates
US20090240911A1 (en) Information processing apparatus and informaiton processing method
US20100235599A1 (en) Access control device, storage system, and access control method
EP3668056B1 (en) Method and device for transmitting data processing request
US8874873B2 (en) Resources allocation in a computer storage system
US7774543B2 (en) Storage system, method for managing the same, and storage controller
US7707199B2 (en) Method and system for integrated management computer setting access rights, calculates requested storage capacity of multiple logical storage apparatus for migration
KR20100008363A (en) Physical network interface selection
CN113900972A (en) Data transmission method, chip and equipment
US20050235005A1 (en) Computer system configuring file system on virtual storage device, virtual storage management apparatus, method and signal-bearing medium thereof
US10387043B2 (en) Writing target file including determination of whether to apply duplication elimination
US7966403B2 (en) Performance profiling for improved data throughput
JPWO2015029188A1 (en) Computer and data reading method

Legal Events

Date Code Title Description
AS Assignment

Owner name: NEC CORPORATION, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TANOUE, KAZUNORI;REEL/FRAME:015440/0628

Effective date: 20040527

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20200226