-
公开(公告)号：AT518308T
公开(公告)日：2011-08-15
申请号：AT03702716
申请日：2003-01-30
Applicant: IBM
Inventor： COCKBURN GORDON , HAWES ADRIAN JOHN
Abstract: A method ( 300 ) and arrangement for LZ1 compression of a data string where multiple input symbols are compared in parallel with the history buffer by: holding in an input buffer ( 140 ) a first sequence of bytes of the data string; holding in a history buffer ( 110, 120 ) a second sequence of bytes of the data string; comparing ( 170 ), in matrix comparison means coupled to the input buffer and the history buffer and having a plurality of rows and columns of comparison units ( 200 ), bytes held in the input buffer with bytes held in the history buffer, bytes of the history buffer being coupled to diagonally displaced comparison units in the matrix comparison means; detecting ( 150 ) in each of the rows the column in which a largest number of consecutive byte matches has occurred at the comparison unit in that row and preceding comparison units in the same column; and encoding ( 160 ) as a token a sequence of matched bytes detected in the step of detecting ( 150 ).
-
公开(公告)号：GB2519157A
公开(公告)日：2015-04-15
申请号：GB201318114
申请日：2013-10-14
Applicant: IBM
Abstract: A data storage system and method for replicating data, eg. for the purposes of disaster recovery. A plurality of nodes (220) organised in groups (210), with one of the nodes acting as a coordinator node (220'), are configured to receive write requests from an external server (100) and to apply these write requests to a storage resource (230). The independent write requests are identified by a batch sequence number. Each node stores the write request in non-volatile memory with the coordinator node monitoring which batches are secured in their entirety in non-volatile memory. The coordinator node authorises all other nodes to sequentially replicate the write requests in their non-volatile memory to the storage resource for all writes up to the highest batch sequence number for which all writes have been secured in non-volatile memory. This allows for pipelining of batch replication as well as recovery from error situations without losing data consistency.
-
公开(公告)号：GB2508922A
公开(公告)日：2014-06-18
申请号：GB201222706
申请日：2012-12-17
Applicant: IBM
Inventor： BITTLES WILLIAM , COCKBURN GORDON , MCCARTHY TIMOTHY FINBAR , WHITE STEVEN , PARKES JON
IPC: H04Q1/14
Abstract: Controlling modification of storage area network (SAN) fabric cabling by physical locks, using control signals, generated in dependence on the processing of cable modification requests, which are adapted to control a physical lock associated with the SAN component so as to permit or prevent modification of SAN fabric cabling.
-
Patent Agency Ranking
公开(公告)号：CA2485566A1
公开(公告)日：2003-11-20
申请号：CA2485566
申请日：2003-01-30
Applicant: IBM
Inventor： HAWES ADRIAN JOHN , COCKBURN GORDON
Abstract: A method (300) and arrangement for LZ1 compression of a data string where multiple imput symbols are compared in parallel with the history buffer by: holding in an input buffer (140) a first sequence of bytes of the data strin g; holding in a history buffer (110, 120) a second sequence of bytes of the dat a string; comparing (170), in matrix comparison means coupled to the input buffer and the history buffer and having a plurality of rows and columns of comparison units (200), bytes held in the input buffer with bytes held in th e history buffer, bytes of the history buffer being coupled to diagonally displaced comparison units in the matrix comparison means; detecting (150) i n each of the rows the column in which a largest number of consecutive byte matches has occurred at the comparison unit in that row and preceding comparison units in the same column; and encoding (160) as a token a sequenc e of matched bytes detected in the step of detecting (150).
-
公开(公告)号：CA2485566C
公开(公告)日：2008-05-13
申请号：CA2485566
申请日：2003-01-30
Applicant: IBM
Inventor： HAWES ADRIAN JOHN , COCKBURN GORDON
Abstract: A method (300) and arrangement for LZ1 compression of a data string where multiple imput symbols are compared in parallel with the history buffer by: holding in an input buffer (140) a first sequence of bytes of the data strin g; holding in a history buffer (110, 120) a second sequence of bytes of the dat a string; comparing (170), in matrix comparison means coupled to the input buffer and the history buffer and having a plurality of rows and columns of comparison units (200), bytes held in the input buffer with bytes held in th e history buffer, bytes of the history buffer being coupled to diagonally displaced comparison units in the matrix comparison means; detecting (150) i n each of the rows the column in which a largest number of consecutive byte matches has occurred at the comparison unit in that row and preceding comparison units in the same column; and encoding (160) as a token a sequenc e of matched bytes detected in the step of detecting (150).
-
公开(公告)号：PL371971A1
公开(公告)日：2005-07-11
申请号：PL37197103
申请日：2003-01-30
Applicant: IBM
Inventor： COCKBURN GORDON , HAWES ADRIAN JOHN
Abstract: A method ( 300 ) and arrangement for LZ1 compression of a data string where multiple input symbols are compared in parallel with the history buffer by: holding in an input buffer ( 140 ) a first sequence of bytes of the data string; holding in a history buffer ( 110, 120 ) a second sequence of bytes of the data string; comparing ( 170 ), in matrix comparison means coupled to the input buffer and the history buffer and having a plurality of rows and columns of comparison units ( 200 ), bytes held in the input buffer with bytes held in the history buffer, bytes of the history buffer being coupled to diagonally displaced comparison units in the matrix comparison means; detecting ( 150 ) in each of the rows the column in which a largest number of consecutive byte matches has occurred at the comparison unit in that row and preceding comparison units in the same column; and encoding ( 160 ) as a token a sequence of matched bytes detected in the step of detecting ( 150 ).
-
公开(公告)号：AU2003215713A1
公开(公告)日：2003-11-11
申请号：AU2003215713
申请日：2003-01-30
Applicant: IBM
Inventor： COCKBURN GORDON , HAWES ADRIAN JOHN
IPC: H03M7/30
Abstract: An apparatus for performing data compression is disclosed. A circuit ( 640 ) within a comparison unit ( 400 ) of a comparison matrix ( 170 ) performs LZ1 compression of a data string by comparing bytes held in an input buffer ( 140 ) with bytes held in a history buffer ( 110, 120 ). A group of logic gate stages ( 720, 730, 740, 750 ) is connected in series with each other. Each of the logic gate stages produces a carry value that is passed to one of the output of the comparison unit and another logic gate stages. The product of the number stages in the logic gate stages and the number logic gates in each of the logic gate stages is less than the number of logic gates required for an equivalent circuit having a single logic circuit stage.
-
公开(公告)号：AU2003205839A1
公开(公告)日：2003-11-11
申请号：AU2003205839
申请日：2003-01-30
Applicant: IBM
Inventor： COCKBURN GORDON , HAWES ADRIAN JOHN
Abstract: A method ( 300 ) and arrangement for LZ1 compression of a data string where multiple input symbols are compared in parallel with the history buffer by: holding in an input buffer ( 140 ) a first sequence of bytes of the data string; holding in a history buffer ( 110, 120 ) a second sequence of bytes of the data string; comparing ( 170 ), in matrix comparison means coupled to the input buffer and the history buffer and having a plurality of rows and columns of comparison units ( 200 ), bytes held in the input buffer with bytes held in the history buffer, bytes of the history buffer being coupled to diagonally displaced comparison units in the matrix comparison means; detecting ( 150 ) in each of the rows the column in which a largest number of consecutive byte matches has occurred at the comparison unit in that row and preceding comparison units in the same column; and encoding ( 160 ) as a token a sequence of matched bytes detected in the step of detecting ( 150 ).
-
-
-
-
-
-
-
Search Results
8
records
(took 0.019 seconds)
