公开(公告)号：GB2512086A

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

申请号：GB201305062

申请日：2013-03-20

Applicant: IBM

Inventor： LEVELL JONATHAN ,  SCHOFIELD ANDREW JOHN ,  EDWARDS IAN CHARLES ,  LOBBAN TREVOR

IPC: G06F9/54 ,  G06F9/52

Abstract: A method and system for transactional capable queuing is provided. The method comprises a queue of ordered messages (200). A get cursor operation (211) points to a starting place in the queue for retrieving a message. A first lock (220) is provided for putting operations to the queue to ensure only one application (223) can put to the queue at a time. A second lock (230) is provided to ensure only one getting application (233) can get from the queue at any one time. Putting and getting operations are synchronized to check and update the get cursor. No first or second locks are provided is there is only a single put or get application. The get cursor may be unwound if a put application commits a message earlier than the starting position of the get cursor. The get cursor may comprise one or two memory words used by an atomic instruction for synchronizing. Synchronizing may include Double Width Compare and Swap (DWCAS) or a Compare and Swap (CAS) operations.

公开(公告)号：GB2295255A

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

申请号：GB9422856

申请日：1994-11-12

Applicant: IBM

Inventor： ADAMS PAUL STUART ,  SINGLETON VINCENT JOSEPH ,  GLADWYN BENEDICT DANIEL ,  EDWARDS IAN CHARLES

IPC: H03M7/46 ,  H04N7/26 ,  H04N7/30 ,  H04N7/36 ,  H03M7/48 ,  H04N1/41 ,  H04N5/917 ,  H04N11/04

Abstract: Data representing differences of successive video frames (for example), Figs. 2, 3, is compressed by putting the positions and lengths of runs of zeros of at least a predetermined length into a data structure 70, Fig. 4, removing these runs from the original data, and providing the result 71, Fig. 4, together with the data structure 70, as the compressed data. The removed runs are put back in decompression.