Buffer memory management method, recording medium, and computer system incorporating same

Claim 2

A buffer memory management method for a buffer memory having a set (14) of buffers (15) for storing respective desired information, the method comprising: referencing said set of buffers and classifying said buffers in a list by order of their least recent utilization (LRU), determining a threshold position (t) in said list of buffers in relation to a current buffer access hit rate and, when a buffer is referenced at a position (p) in said list, said classifying step further comprises classifying said referenced buffer in relation to said position (p) relative said threshold position (t) in said list of buffers.

Claim 3

A method according to claim 1, said step of further classifying comprises, when the desired information is already in said referenced buffer, maintaining said referenced buffer's position when said referenced buffer position precedes said threshold position, and rechaining said referenced buffer in said list of buffers if the contrary holds.

Claim 4

A method according to claim 2, further comprising determining in said list of buffers at least one additional threshold position preceding said threshold position and wherein said referenced buffer receives the desired information and said step of further classifying comprises placing said referenced buffer at that of said at least one additional threshold position nearest said threshold position.

Claim 5

A method according to claim 3, wherein the nearest additional threshold position is determined in relation to said current buffer access hit rate.

Claim 6

A method according to claim 3, wherein said nearest additional threshold position has a predetermined fixed value.

Claim 7

A method according to claim 2, wherein said step of rechaining said referenced buffer advances said referenced buffer to a position preceding the threshold position.

Claim 8

A method according to claim 2, wherein said referenced buffer receives the desired information and said step of further classifying comprises placing said referenced buffer at said threshold position.

Claim 9

A method according to claim 2, wherein said list of buffers has a head buffer and said step of rechaining said referenced buffer advances said referenced buffer to be said head buffer.

Claim 10

A method according to claim 1, wherein said referenced buffer receives the desired information and said step of further classifying comprises placing said referenced buffer at said threshold position.

Claim 11

A method according to claim 1, further comprising determining in said list of buffers at least one additional threshold position preceding said threshold position and wherein said referenced buffer receives the desired information and said step of further classifying comprises placing said referenced buffer at that of said at least one additional threshold position nearest said threshold position.

Claim 12

A method according to claim 10, wherein said nearest additional threshold position is determined in relation to said current buffer access hit rate.

Claim 13

A method according to claim 10, wherein said nearest additional threshold position has a predetermined fixed value.

Claim 14

A method according to claim 1, further comprising determining at least one additional threshold position in relation to said current buffer access hit rate.

Claim 15

A method according to claim 1, further comprising determining at least one additional threshold position having a predetermined fixed value.

Claim 16

A method according to claim 1, wherein said threshold position has a predetermined fixed value corresponding to a predetermined range of values of said current buffer access hit rate.

Claim 17

A computer system (10) comprising a data memory, processor (11) connected to the data memory (12) through a set of buffers (15), means (16) for classifying said buffers in a list according to an LRU algorithm, means (20) for determining a threshold position (t) in said list, means (19) for calculating a current buffer access hit rate, said means (19) for calculating being connected to said determining means (20) in order to determine said threshold position in relation to said current buffer access hit rate, comparison means (21) connected to said determining means and said classifying means for comparing said threshold position with a position (p) of a referenced buffer in said list, and means (16) for further classifying said referenced buffer in said list in relation to said position (p) relative to said threshold position (t).

Claim 18

A computer system (10) comprising a data memory, processor (11) connected to the data memory (12) through a set of buffers (15), means (16) for classifying said buffers in a list according to an LRU algorithm, means (20) for determining a threshold position (t) in said list, means (19) for calculating a current buffer access hit rate, said means (19) for calculating being connected to said determining means (20) in order to determine said threshold position in relation to said current buffer access hit rate, comparison means (21) connected to said determining means and said classifying means for comparing said threshold position with a position (p) of a referenced buffer in said list, and means (16) for further classifying said referenced buffer in said list in relation to said position (p) relative to said threshold position (t).

Claim 19

A system according to claim 16, wherein said threshold position has a predetermined fixed value corresponding to a predetermined range of values of said current buffer access hit rate.

Claim 20

A system according to claim 16, wherein said determining means also determines at least one additional threshold position.

Claim 21

A system according to claim 18, wherein said at least one additional threshold position is also determined in relation to said current buffer access hit rate.

Claim 22

A system according to claim 19, wherein said at least one additional threshold position has a predetermined fixed value corresponding to a respective predetermined range of values of said current buffer access hit rate.

Claim 23

A system according to claim 19, wherein said at least one additional threshold position has a predetermined fixed value.

Claim 24

A buffer memory management method for a buffer memory having a set (14) of buffers (15) for storing respective desired information, the method comprising: referencing said set of buffers and classifying said buffers in a list by order of their least recent utilization (LRU), determining a threshold position (t) in said list of buffers in relation to a current buffer access hit rate and, when a buffer is referenced at a position (p) in said list, said classifying step further comprises classifying said referenced buffer in relation to said position (p) relative to said threshold position (t) in said list of buffers whereby said method is optimized when said set of buffers are operated by simultaneous local and non-local processing.

Claim 25

A buffer memory management method for a buffer memory having a set (14) of buffers (15) for storing respective desired information, the method comprising: referencing said set of buffers and classifying said buffers in a list by order of their least recent utilization (LRU), determining a threshold position (t) in said list of buffers in relation to a current buffer access hit rate and, when a buffer is referenced at a position (p) in said list, said classifying step further comprises classifying said referenced buffer in relation to said position (p) relative to said threshold position (t) in said list of buffers whereby said method is optimized when said set of buffers are operated by simultaneous local and non-local processing.

Claim 26

A method according to claim 22, said step of further classifying comprises, when the desired information is already in said referenced buffer, maintaining said referenced buffer's position when said referenced buffer's position precedes said threshold position, and rechaining said referenced buffer in said list of buffers when the referenced buffer's position does not precede said threshold position.

Claim 27

A method according to claim 23, wherein said step of rechaining said referenced buffer advances said referenced buffer to a position preceding the threshold position.

Claim 28

A method according to claim 22, wherein said referenced buffer receives the desired information and said step of further classifying comprises placing said referenced buffer at said threshold position.

Claim 29

A method according to claim 22, further comprising determining in said list of buffers at least one additional threshold position preceding said threshold position and wherein said referenced buffer receives the desired information and said step of further classifying comprises placing said referenced buffer at that of said at least one additional threshold position nearest said thresholds position.

Claim 30

A method according to claim 22, further comprising determining at least one additional threshold position in relation to said current buffer access hit rate.

Claim 31

A computer system (10) comprising a data memory, a set of buffers and a processor (11) connected to the data memory (12) through the set of buffers (15), said set of buffers (15) being operated by local and non-local processing means (16) for classifying said buffers in a list according to a LRU algorithm, means (20) for determining a threshold position (t) in said list, means (19) for calculating a current buffer access hit rate, said means (19) for calculating being connected to said determining means (20) in order to determine said threshold position in relation to said current buffer access hit rate, comparison means (21) connected to said determining means and said classifying means for comparing said threshold position with a position (p) of a referenced buffer in said list, and means (16) for further classifying said referenced buffer in said list in relation to said position (p) relative to said threshold position (t).

Claim 32

A computer system (10) comprising a data memory, a set of buffers and a processor (11) connected to the data memory (12) through the set of buffers (15), said set of buffers (15) being operated by local and non-local processing means (16) for classifying said buffers in a list according to a LRU algorithm, means (20) for determining a threshold position (t) in said list, means (19) for calculating a current buffer access hit rate, said means (19) for calculating being connected to said determining means (20) in order to determine said threshold position in relation to said current buffer access hit rate, comparison means (21) connected to said determining means and said classifying means for comparing said threshold position with a position (p) of a referenced buffer in said list, and means (16) for further classifying said referenced buffer in said list in relation to said position (p) relative to said threshold position (t).

Claim 33

A system according to claim 28, wherein said threshold position has a predetermined fixed value corresponding to a predetermined range of values of said current buffer access hit rate.

Claim 34

A system according to claim 28, wherein said determining means also determines at least one additional threshold position.

Claim 35

A system according to claim 30, wherein said at least one additional threshold position is also determined in relation to said current buffer access hit rate.

Claim 36

A system according to claim 31, wherein said at least one additional threshold position has a predetermined fixed value corresponding to a respective predetermined rate of values of said current buffer access hit rate.

Claim 37

A system according to claim 31, wherein said at least one additional threshold position has a predetermined fixed value.