-
公开(公告)号：CA2874239A1
公开(公告)日：2014-01-03
申请号：CA2874239
申请日：2013-06-14
Applicant: IBM
Inventor： BEEKEN CHRISTOPHER BARRY , AGOMBAR JOHN PAUL , FUENTE CARLOS FRANCISCO
IPC: G06F12/16
Abstract: Various systems, processes, and products may be used to source clean cascaded volumes. In particular implementations, a system, process, and product for source cleaning cascaded volumes may include the ability to store a primary volume and a plurality of cascaded backup volumes. The system, process, and product may also include the ability to determine whether a write to one of the backup volumes is due to a background copy being made of another volume in the cascade and adjust a background copy indicator in a volume map for the backup volume if the write is due to a background copy and to determine whether a write to one of the backup volumes is due to a write to another volume in the cascade and adjust a write copy indicator in a volume map for the backup volume if the write is due to a write to another cascaded volume.
-
公开(公告)号：GB2496840A
公开(公告)日：2013-05-29
申请号：GB201119660
申请日：2011-11-15
Applicant: IBM
Inventor： FUENTE CARLOS FRANCISCO , GUNDA KALYAN CHAKRAVARTHY , MUELLER-FRIEDT WOLFGANG , CURRAN ROBERT
Abstract: A shared storage system 100 is in communication with one or more clusters 120 of host nodes 121-124. Access to the storage system is controlled by: storing cluster membership metadata 141 in a centralized storage 140 independent of the shared storage; updating the cluster membership metadata in response to an inclusion or exclusion request from a node identifying one or more nodes to include or exclude from a cluster; and managing access to storage volumes in the shared storage in response to each update to the cluster membership metadata. The method may also include resolving conflicting requests to update the cluster membership metadata. Responding to an exclusion request may include purging the shared storage of traffic from the excluded node, and/or establishing a fence to deny future access. The storage system does not have to rely on processing and maintaining a cluster membership list per logical unit, reducing system complexity, and provides a tie-breaking function.
-
公开(公告)号：GB2486780A
公开(公告)日：2012-06-27
申请号：GB201121491
申请日：2010-08-26
Applicant: IBM
Inventor： FUENTE CARLOS FRANCISCO , SCALES WILLIAM JAMES , LINDLEY JOHN EARLE
Abstract: An apparatus, method and computer program in a distributed cluster storage network comprises storage control nodes to write data to storage on request from a host;a forwarding layer at a first node to forward data to a second node; a buffer controller at each node to allocate buffers for data to be written; and a communication link between the buffer controller and the forwarding layer at each node to communicate a constrained or unconstrained status indicator of the buffer resource to the forwarding layer. A mode selector selects a constrained mode of operation requiring allocation of buffer resource at the second node and communication of the allocation before the first node can allocate buffers and forward data, or an unconstrained mode of operation granting use of a predetermined resource credit provided by the second to the first node and permitting forwarding of a write request with data.
-
24.发明专利
公开(公告)号：PL376860A1
公开(公告)日：2006-01-09
申请号：PL37686003
申请日：2003-08-14
Applicant: IBM
Inventor： FUENTE CARLOS FRANCISCO , SCALES WILLIAM JAMES
-
公开(公告)号：AU2003278357A1
公开(公告)日：2004-08-23
申请号：AU2003278357
申请日：2003-10-28
Applicant: IBM
Inventor： SCALES WILLIAM JAMES , FUENTE CARLOS FRANCISCO , JONES ROBERT MICHAEL , PASSINGHAM WILLIAM JOHN
Abstract: An apparatus for data transmission over a network includes a buffer and a timer mechanism for timing an optimum interval (less than the round-trip error response delay) for retransmission of data. A first accessor accesses data in the buffer for transmission and starts a first timeout clock. Second or further accessors of the buffer are responsive to a timeout to access the data, start a timeout clock and attempt to transmit the data on a path avoiding path elements used by prior accessors. A counter increments and decrements a count of the references to the buffer by accessors and signals when the count reaches zero. A memory manager returns the buffer to a free buffer pool responsive to the reference counter signaling that the count has reached zero. An analysis mechanism can be used to determine the optimum interval and tune the timer mechanism.
-
Patent Agency Ranking
公开(公告)号：AU2003251059A1
公开(公告)日：2004-06-23
申请号：AU2003251059
申请日：2003-08-13
Applicant: IBM
Inventor： FUENTE CARLOS FRANCISCO , BUTTERWORTH HENRY ESMOND
Abstract: A method, storage system, and machine-readable medium for resynchronizing data stored among a first storage element and a second storage element of a remote copy pair of storage elements is disclosed. According to one embodiment, a method is provided which includes detecting a reestablishment of a remote copy relationship between the first and second storage elements and performing a resynchronization operation in response to this detection. Performing the resynchronization operation comprises transmitting data of a second change record associated with the second storage element to the first storage element, combining the second change record with a first change record associated with the first storage element, identifying a data segment of the second storage element utilizing the combined change record, and overwriting data of the first storage element with data of the identified data segment.
-
公开(公告)号：GB2348303B
公开(公告)日：2003-11-26
申请号：GB9906501
申请日：1999-03-23
Applicant: IBM
Abstract: Described is a method for processing work items in a data processing system. An interrupt is generated in response to receipt of a work item on a queue and the generated interrupt is serviced to schedule a task by placing the task on a task queue for later processing of the queued work item. The interrupt is not enabled at this point and therefore the receipt of further work items will not result in the generation of interrupts. When the scheduled task reaches the head of the queue, the task is executed to process the queued work item (and all other work items that have been added to the queue since the task was scheduled). When all the work items have been processed, a further task is speculatively scheduled for processing of any work items that are subsequently placed on the work item queue. When the speculatively scheduled task reaches the head of the queue, it is executed to process queued work items; if any work items were found, a further task is speculatively scheduled, otherwise the interrupt is enabled.
-
公开(公告)号：GB2348303A
公开(公告)日：2000-09-27
申请号：GB9906501
申请日：1999-03-23
Applicant: IBM
Abstract: A task managing method in which multiple tasks are assigned to a processor with varying frequency and differing processing demands. The method involves adjusting the method of dealing with tasks according to the load requirements placed upon the processor. A polling method is used when there is a high demand or frequent task arrival and an interrupt method is used when there is a low demand or infrequent task arrival. An interrupt 320 is generated in response to receipt of a first task and the task is scheduled on a task queue for later processing. The interrupt is then disabled 330. When the scheduled task 340 reaches the head of the queue, the task is executed 350 along with all other tasks that have been added to the queue since the first task was scheduled 360,370. When all the tasks have been processed, a further task is speculatively scheduled 380 to check for and execute any tasks subsequently placed on the task queue. When this speculatively scheduled task reaches the end of the queue it is executed 390, and if any new tasks are found yet another task is speculatively scheduled 380 to check 400 for and execute 410,420 any tasks subsequently placed on the task queue. If no new tasks are found on the queue the interrupt is re-enabled 310. A particular use of the invention is detailed for a storage controller. The advantage is that switching between interrupt-driven and polling-driven methods in such a manner allows efficient utilisation of processor resources according to the loading that the tasks make on the processor.
-
公开(公告)号：DE112010003794B4
公开(公告)日：2022-01-27
申请号：DE112010003794
申请日：2010-08-25
Applicant: IBM
Inventor： FUENTE CARLOS FRANCISCO , SCALES WILLIAM JAMES , WHYTE BARRY DOUGLAS
IPC: G06F12/08 , G06F3/06 , G06F12/123
Abstract: Verfahren zum Betreiben eines Datenspeicherungssystems, das eine Steuereinheit (10), ein erstes Speichermedium (12) geringer Leistungsfähigkeit und ein zweites Speichermedium (14, 16) höherer Leistungsfähigkeit umfasst, wobei die Steuereinheit (10) mit den Speichermedien verbunden und so eingerichtet ist, dass sie den E/A-Zugriff auf die Speichermedien steuert, und wobei das Verfahren die folgenden Schritte umfasst:o Speichern (S1) eines Abbildes mit einer Mehrzahl von Datenregionen auf dem ersten Speichermedium (12);o Auslösen (S2) einer Kopierfunktion, um eine oder mehrere der Mehrzahl von Datenregionen, die in dem Abbild auf dem ersten Speichermedium (12) gespeichert sind, vom ersten Speichermedium (12) zum zweiten Speichermedium (14, 16) zu kopieren;o als Antwort auf einen E/A-Zugriff auf die eine oder mehrere der Mehrzahl von Datenregionen, die in dem Abbild auf dem ersten Speichermedium (12) gespeichert sind, Leiten (S3) weiterer E/A-Zugriffe auf das Abbild zuerst an das zweite Speichermedium (14, 16) und dann an das erste Speichermedium (12);o Periodisches Umlagern (S4) von Daten vom zweiten Speichermedium (14, 16) zum ersten Speichermedium (12);o Erzeugen (S5) einer neuen leeren Bitmap (18) für eine Mehrzahl von Zeiträumen; und als Reaktion auf einen E/A-Zugriff auf eine Datenregion in dem Abbildo Aktualisieren (S6) der letzten Bitmap (18), um anzuzeigen, dass auf die Daten zugegriffen wurde, und Aktualisieren einer vorhergehenden Bitmap (18), um anzuzeigen, dass nicht auf die Daten zugegriffen wurde.
-
公开(公告)号：GB2486780B
公开(公告)日：2015-06-03
申请号：GB201121491
申请日：2010-08-26
Applicant: IBM
Inventor： FUENTE CARLOS FRANCISCO , SCALES WILLIAM JAMES , LINDLEY JOHN EARLE
IPC: H04L12/861 , G06F3/06 , H04L29/08
Abstract: An apparatus, method and computer program in a distributed cluster storage network comprises storage control nodes to write data to storage on request from a host; a forwarding layer at a first node to forward data to a second node; a buffer controller at each node to allocate buffers for data to be written; and a communication link between the buffer controller and the forwarding layer at each node to communicate a constrained or unconstrained status indicator of the buffer resource to the forwarding layer. A mode selector selects a constrained mode of operation requiring allocation of buffer resource at the second node and communication of the allocation before the first node can allocate buffers and forward data, or an unconstrained mode of operation granting use of a predetermined resource credit provided by the second to the first node and permitting forwarding of a write request with data.
-
-
-
-
-
-
-
-
-
Search Results
47
records
(took 0.019 seconds)
