GEORDNETE UND SICHERE WARTUNG VON INTERPROZESSBEZIEHUNGEN IN EINEM VERTEILTEN MULTIPROZESSORSYSTEM

SYSTEM FÜR HOCHVERFÜGBARE DATENSPEICHERUNG MIT ALLGEMEIN-ADRESSIERTEM SPEICHER

Providing updated processor polling information

Processor polling information describing operating conditions of an integrated processing system is collected at boot time and provided to an operating system. The operating system is notified of any triggering events that may potentially alter the operating conditions of the integrated processing system. Updated processor polling information is provided to the operating system during runtime to reflect the operating conditions of the integrated processor system after the occurrence of the triggering event. Alternatively, a processor polling information table may be created at boot time and updated during runtime upon receipt of a notification that a triggering event has occurred. Triggering events may include addition, deletion or de-configuration of processing devices in a multi-processor system.

Mixed-media telecommunication call set-up

Storage management in clustered data processing systems

A method, system, and computer program product utilizes cluster-awareness to effectively support a live partition mobility (LPM) event and provide recovery from node failure within a Virtual Input/Output (I/O) Server (VIOS) cluster. An LPM utility creates a monitoring thread on a first VIOS on initiation of a corresponding LPM event. The monitoring thread tracks a status of an LPM and records status information in the mobility table of a database. The LPM utility creates other monitoring threads on other VIOSes running on the (same) source server. If the first VIOS VIOS sustains one of multiple failures, the LPM utility provides notification to other functioning nodes/VIOSes. The LPM utility enables a functioning monitoring thread to update the LPM status. In particular, a last monitoring thread may perform cleanup/update operations within the database based on an indication that there are nodes on the first server that are in failed state.

SYSTEM FOR HIGH-AVAILABLE DATA STORAGE WITH GENERAL-ADDRESSED MEMORY

Mixed-media telecommunication call set-up

Method and apparatus for controlling an extensible computing system

METHOD OF DETERMINING A UNIFORM GLOBAL VIEW OF THE SYSTEM STATUS OF A DISTRIBUTED COMPUTER NETWORK

A method of determining a uniform global view (GS) of the system status of a distributed computer network (VRNW) comprising at least three computers (R1, R2, R3) is provided which is characterized in (a) that the computers exchange messages over communication links (KV12, KV13, KV32) in successive transmission rounds, with each of the computers receiving a message from each of the other computers in each transmission round in the absence of an error, (b) that in each transmission round, each of the computers evaluates messages received from the other computers and, based on the result of the evaluation, assigns one of at least three differently defined computer states to each of he other computers and determines a local view (LS) of the system status therefrom, and (c) that the computers exchange the local views of the system status determined by them, and each of the computers determines a uniform global view (GS) of the system status from the local views exchanged.

MODIFYING MEMBERSHIP OF REPLICATION GROUPS VIA JOURNAL OPERATIONS

DYNAMIC RECONFIGURATION OF A QUORUM GROUP OF PROCESSORS IN A DISTRIBUTED COMPUTING SYSTEM

A DIGITAL IMPLEMENTATION OF MULTI-CHANNEL DEMODULATORS

A method and circuitry for implementing digital multi-channel demodulation circuits. More particularly, embodiments of the present invention provide a digital multi-channel demodulator circuit (250, 650). The demodulator includes a frequency-block down-converter (210, 610) that receives a multi-channel analog RF signal and shifts the multi-channel analog RF signal to a lower frequency band. An ADC (220, 620) receives the multi-channel analog RF signal from the frequency-block down-converter and converts the multi- channel analog RF signal to a multi-channel digital RF signal. A digital channel demultiplexer (230, 630) receives the multi-channel digital RF signal from the ADC and demultiplexes the multi-channel digital RF signal into separate digital RF channels. © KIPO & WIPO 2007 ...

FFT-BASED MULTICHANNEL VIDEO RECEIVER

A multichannel video receiver having an analog-to-digital conveyer, fast-Fourier transform circuit and inverse- Fourier transform circuit. The analog-to-digital converter circuit generates a digitized representation of a frequency band used to convey a plurality of video signals, and the fast-Fourier transform circuit generates a frequency-domain representation of the digitized representation of the frequency band. The inverse-Fourier transform circuit recovers, from the frequency-domain representation, a plurality of digitized time-domain signals that correspond to the plurality of video signals. © KIPO & WIPO 2007 ...

METHODS AND SYSTEMS OF MANAGING A DISTRIBUTED REPLICA BASED STORAGE

A method of managing a distributed storage space. The method comprises mapping a plurality of replica sets to a plurality of storage managing modules installed in a plurality of computing units, each of the plurality of storage managing modules manages access of at least one storage consumer application to replica data of at least one replica of a replica set from the plurality of replica sets, the replica data is stored in at least one drive of a respective the computing unit, allocating at least one time based credit to at least one of each storage managing module and the replica data, iteratively renewing the time based credit as long a failure of at least one of the storage managing module, and the at least one drive and the replica data is not detected plurality of storage managing.

Read descriptors at heterogeneous storage systems

In response to a read request directed to a first data store of a storage group, a state transition indicator is identified, corresponding to a modification that has been applied at the data store before a response to the read is prepared. A read descriptor that includes the state transition indicator and read repeatability verification metadata is prepared. The metadata can be used to check whether the read request is a repeatable read. The read descriptor is transmitted to a client-side component of the storage group.

Method and system for achieving collective consistency in detecting failures in a distributed computing system

A method and apparatus are disclosed for achieving collective consistency in the detection and reporting of failures in a distributed computing system having multiple processors. Each processor is capable of being called by a parallel application for system status. Initially, each processor sends the other processors its view on the status of the processors. It then waits for similar views from other processors except those regarded as failed in its own view. If the received views are identical to the view of the processor, the processor returns its view to the parallel application. In a preferred embodiment, if the views are not identical to its view, the processor sets its view to the union of the received views and its current view. The steps are then repeated. Alternately, the steps are repeated if the processor does not have information that each of the processors not regarded as failed in its view forms an identical union view. In another preferred embodiment, the method is terminated ...

DISASTER RECOVERY FAILBACK

Pursuant to execution of a predetermined failback policy, if a storage device is not preexistent in a source storage system operable in the computing environment, and an owner of the storage device is one of a DR storage system and a storage system having previously withdrawn from a replication grid, and the DR storage system has authorization to transfer ownership of the storage device by a replacement operation, an instance of the storage device is replicated to the source storage system to generate a replicated instance of the storage device on the source storage system, and ownership of the storage device is designated as the source storage system for each of the instance and the replicated instance of the storage device.

Consistent cluster operational data in a server cluster using a quorum of replicas

A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

Emulation of persistent group reservations

Method for emulating persistent group reservations on non persistent group reservation-compliant devices, apparatus to perform the method, and computer-readable storage medium containing instructions to perform the method. The present invention enables the emulation of persistent group reservations on a non persistent group reservation-compliant device, including a shared disk, to enable the disk's implementation of persistent group reservation-reliant algorithms. This in turn enables the implementation of algorithms based on persistent group reservation features substantially without modification of those algorithms. One such algorithm is a quorum algorithm. One example of persistent group reservations is found in the SCSI-3 standard. The present invention accomplishes persistent group reservation emulation, or PGRE, by storing host- and reservation-specific information on a reserved portion of the disk and using this data to emulate the steps of certain persistent group reservation features ...

Transmitter device and relay device for performing data transmission control

A transmitter device (50) which performs window control in transmitting data for transmission through a communications network (20, 40) is caused to identify a mode of window control to be performed based on a communication condition under which the data transmission is performed, so as to transmit the data for transmission by performing the window control in the identified mode.

MEMBER MANAGEMENT METHOD AND DEVICE IN PROCESSOR DOMAIN OF DISTRIBUTED COMPUTER ENVIRONMENT

PROBLEM TO BE SOLVED: To construct a name server node for all nodes by executing a two- stage commitment protocol to make a node serve as a server node to manage the processors included in a domain in response to a fact that the node of the smallest number receives all follow-up messages. SOLUTION: A name server is assigned to the node of the smallest number in a domain. If a node kept in an ascending state 306 receives a PROCLAIM message from the name server node, it broadcasts a ceasing message and is shifted to an insertion holding state 305 via an arrow 309. When the node kept in the state 306 receives the affirmative messages from all other nodes, the node sends the commitment messages to other nodes to show that it serves as a name server at present. Thus, the nodes is shifted to a name server formation state 310. In this instant, a domain is formed. COPYRIGHT: (C)1998,JPO ...

СПОСОБ РАБОТЫ СЕТИ УПРАВЛЕНИЯ И СЕТЬ УПРАВЛЕНИЯ

... 1. Способ работы сети (1) управления с единственным физическим соединением между первым управляющим компьютером (ST1) и вторым резервным управляющим компьютером (ST2) через сеть (2) передачи данных, к которой подключено множество функционально важных технических устройств (А, С, D, F, Н, К, L) обработки данных; и имеется информационно-техническое соединение между управляющими компьютерами (ST1, ST2) и функционально важными устройствами (А, С, D, F, Н, К, L) посредством избыточного и диверсифицированного сообщения подтверждения работоспособности, причем для восприятия работы сети (1) управления проверяется коммуникационное соединение между обоими управляющими компьютерами (ST1, ST2); и- при положительном результате проверки управляющему компьютеру (ST1) назначается функция ведущего, или- при отрицательном результате проверки оба управляющих компьютера (ST1, ST2) присоединяют к себе функционально важные устройства (А, С, D, F, Н, К, L) в установленной последовательности; и- при присоединении ...

Storage management in clustered data processing systems

PROCEDURE AND SYSTEM FOR CONSISTENT GROUP OPERATIONAL DATA IN A SERVER CLUSTER WITH A QUORUM OF REPLICATIONS

ADMINISTRATION OF A GROUPED COMPUTER SYSTEM

PROCEDURE FOR THE DETERMINATION OF A UNIFORM GLOBAL VIEW OF THE SUPERVISOR STATE OF A DISTRIBUTED COMPUTER NETWORK WORK

DYNAMIC DATA FILE DIRECTORY SERVICE

Dynamic directory service

Performing a change of primary node in a distributed system

... (12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT) (19) World Intellectual Property (1) Organization11111111111111111111111I1111111111111i1111liiiii International Bureau (10) International Publication Number (43) International Publication Date W O 2019/072296 A2 18 April 2019 (18.04.2019) W IPO I PCT (51) International Patent Classification: HR, HU, ID, IL, IN, IR, IS, JO, JP, KE, KG, KH, KN, KP, Not classified KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, (21) International Application Number: MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, PCT/CN2018/120873 OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, (22) International Filing Date: TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW. 13 December 2018 (13.12.2018) (84) Designated States (unless otherwise indicated, for every (25) Filing Language: English kind of regional protection available): ARIPO (BW, GH, GM, KE, LR, LS, MW, MZ, NA, RW, ...

OPERATIONS CONTROLLER FOR A FAULT TOLERANT MULTIPLE NODE PROCESSING SYSTEM

An operations controller (12) for a multiple node fault tolerant processing system having a transmitter (30) for transmitting inter-node messages, a plurality of receivers (32a...32n), each receiving inter-node messages from only one of the nodes and a message checker (34) for checking each received message for physical and logical errors. A fault tolerator (36) assembles all of the errors detected and decides which nodes are faulty based on the number and severity of the detected errors. A voter (38) generates a voted value for each value which is received from the other nodes which is stored in a data memory (42) by a task communicator (44). A scheduler (40) selects the tasks to be executed by an applications processor (14) which is passed to the task communicator (44). The task communicator (44) passes the selected task and the data required for the execution of that task to the applications procesor (14) and transmits the data resulting from that task to all of the nodes in the system ...

DIGITAL TELEVISION TRANSMITTER AND RECEIVER FOR TRANSMITTING AND RECEIVING DUAL STREAM USING 4 LEVEL VESTIGIAL SIDE BAND ROBUST DATA

The present invention relates to a Vestigial Side Band (VSB) Digital Television (DTV) in agreement with the DTV standards (A/53) of the Advanced Television System Committee (ATSC), and to a method thereof. More particularly, it provides 4-VSB DTV transceiver that improves reception performance of a receiver by transmitting and receiving dual streams formed of normal data and robust data without increasing average power, regardless of a mixing rate of the normal and robust data. The 4-VSB DTV transceiver of the present research includes an encoding unit for encoding the robust data to be mapped to one of two groups having 4 levels {-5, -3, 1, 7} and {-7, -1, 3, 5}.

FENCING SHARED CLUSTER RESOURCES

An illustrative embodiment of a computer-implemented process for fencing shared cluster resources in event of a possible split-brain, identifies a failing resource of a node within a set of shared resources to form an identified failing resource, fences a subset of the set of shared resources to form a winning subset of shared resources and prevents the identified failing resource from communicating with the winning subset of shared resources using a white list maintained at each database system of the winning subset of shared resources. The computer-implemented process further determines whether the identified failing resource has been cleared to form a cleared failing resource and responsive to a determination that the identified failing resource has been cleared, rejoins the cleared failing resource with the winning subset of the set of shared resources absent a re-boot of the cleared failing resource.

HANDLING BROADCAST AND MULTICAST TRAFFIC AS UNICAST TRAFFIC IN A WIRELESS NETWORK

An access point is to handle received broadcast or multicast traffic as multiple instances of unicast traffic, where each instance is destined for a corresponding wireless client device associated with the access point. A client device may adjust its listen interval parameter according to predefined considerations, for example a charge level of a battery to power the client device and an expected usage model for the device. A client device may initiate a reassociation request to inform the access point of its adjusted listen interval parameter.

METHOD AND APPARATUS FOR SPLIT-BRAIN AVOIDANCE IN A MULTI-PROCESS OR SYSTEM

A split brain avoidance protocol to determine the group of processors (112) that will survive a complete partitioning (disconnection) in the interprocessor communications (114) paths connecting processors (112) in a multiprocessor system (100). Processors (112) embodying the invention detect that the set of processors (112) with which they can communicate has changed. They then choose either to halt or to continue operations, guided by the goal of minimizing the possibility that multiple disconnected groups of processors (112) continue to operate as independent systems, each group having determined (incorrectly) that the processors (112) of the other groups have failed.

Configuration management in distributed data systems

The present invention relates to systems and methods for managing configurations of data nodes in a distributed environment. A configuration manager is implemented as a set of distributed master nodes that may use quorum-based processing to enable reliable identification of master nodes storing current configuration information, even if some of the master nodes fail. If a quorum of master nodes cannot be achieved or some other event occurs that precludes identification of current configuration information, the configuration manager may be rebuilt by analyzing reports from read/write quorums of nodes associated with a configuration, allowing automatic recovery of data partitions.

Global observing method for determining status unification of distributed computer network system

The cluster system and used in the cluster system to provide service in the usability of the method

PROCESS, FITTING, DEVICES FOR the CATCH Of a LINE TELEPHONIQUEPARTAGEE

System and method for ending view change protocol

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain maintained a number (N) of nodes and performed by a first node of the N nodes that is in a view change protocol. The method includes: obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, wherein the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q first messages, ending the view change protocol.

Operations controller for a fault tolerant multiple node processing system

A fault tolerator for an operations controller of a multiple node fault tolerant processing system having a data memory for storing the content of all received error free messages, an error file for storing the content of all received inner node error reports, an error handler for generating a base penalty count for each node based on the content of the errors recorded in the error file and for excluding each node from the operation of the multiple node processing system whose base penalty count exceeds an exclusion threshold. The fault tolerator also includes a synchronizer interface for passing the selected fields of the received messages to a synchronizer, a scheduler interface for passing selected information to a scheduler, and a message interface which stores the error free messages in the data memory and passes the selected fields of the messages to the synchronizer.

SELF HEALING CLUSTER OF A CONTENT MANAGEMENT SYSTEM

Systems and methods herein provide for a clustered content management comprising at least two computing nodes. A first node comprises an instance of the content repository. The first computing node may perform content management operations on its instance of the content repository. Changes to the instance of the content repository of the first computing node are synchronized with the content repository by way of a second computing node. The second computing node is communicatively coupled to the first computing node through a network and is operable to synchronize the change with the content repository. The second computing node also determines that synchronization of the change is blocked due to an error. The second computing node identifies the error, determines that the error is correctable, and corrects the error to synchronize the change with the content repository.

SUPPORTING AUTONOMOUS LIVE PARTITION MOBILITY DURING A CLUSTER SPLIT-BRAINED CONDITION

A method, data processing system, and computer program product autonomously migrate clients serviced by a first VIOS to other VIOSes in the event of a VIOS cluster “split-brain” scenario generating a primary sub-cluster and a secondary sub-cluster, where the first VIOS is in the secondary sub-cluster. The VIOSes in the cluster continually exchange keep-alive information to provide each VIOS with an up-to-date status of other VIOSes within the cluster and to notify the VIOSes when one or more nodes loose connection to or are no longer communicating with other nodes within the cluster, as occurs with a cluster split-brain event/condition. When this event is detected, a first sub-cluster assumes a primary sub-cluster role and one or more clients served by one or more VIOSes within the secondary sub-cluster are autonomously migrated to other VIOSes in the primary sub-cluster, thus minimizing downtime for clients previously served by the unavailable/uncommunicative VIOSes.

Emulation of persistent group reservations

Method for emulating persistent group reservations on non persistent group reservation-compliant devices, apparatus to perform the method, and computer-readable storage medium containing instructions to perform the method. The present invention enables the emulation of persistent group reservations on a non persistent group reservation-compliant device, including a shared disk, to enable the disk's implementation of persistent group reservation-reliant algorithms. This in turn enables the implementation of algorithms based on persistent group reservation features substantially without modification of those algorithms. One such algorithm is a quorum algorithm. One example of persistent group reservations is found in the SCSI-3 standard. The present invention accomplishes persistent group reservation emulation, or PGRE, by storing host- and reservation-specific information on a reserved portion of the disk and using this data to emulate the steps of certain persistent group reservation features ...

FFT-BASED MULTICHANNEL VIDEO RECEIVER

СПОСОБ РАБОТЫ СЕТИ УПРАВЛЕНИЯ И СЕТЬ УПРАВЛЕНИЯ

FIELD: communication. SUBSTANCE: group of inventions relates to operation of a control network. Disclosed is a method of operating a control network with a single connection between first and second control computer backup host computer through network, to which many functionally important technical data processing devices. Information-technical connection between computers and devices is provided by a state request command, wherein for beginning of control network is checked communication connection between both computers. For a positive test result, first computer is assigned a master function, and for a negative test result, both computers are connected to device itself in established order. When connecting a predetermined number of devices to one of two computers, computer takes a leading function, and other computer - backup function when placed below a predetermined number of devices connected to each of two computers, a signal is generated which indicates a fault condition management network. EFFECT: technical result is improved safety and operational reliability of control network. 8 cl, 1 dwg РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (51) МПК G06F 11/20 G06F 15/173 G06F 15/177 H04L 1/22 H04L 12/40 H04L 29/14 (13) 2 589 390 C2 (2006.01) (2006.01) (2006.01) (2006.01) (2006.01) (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ (21)(22) Заявка: ИЗОБРЕТЕНИЯ К ПАТЕНТУ 2014118935/08, 05.10.2012 (24) Дата начала отсчета срока действия патента: 05.10.2012 Приоритет(ы): (30) Конвенционный приоритет: (43) Дата публикации заявки: 27.11.2015 Бюл. № 33 (73) Патентообладатель(и): СИМЕНС АКЦИЕНГЕЗЕЛЛЬШАФТ (DE) R U 13.10.2011 US 13/272,260 (72) Автор(ы): КИРШ Андреас (DE), ЛУДВИГ Хартмут (US), ПОРШ Роланд (DE), ШВАРЦ Тино (DE), ЦИГЛЕР Андреас (DE) (45) Опубликовано: 10.07.2016 Бюл. № 19 (85) Дата начала рассмотрения заявки PCT на национальной фазе: 13.05.2014 (86) Заявка PCT: 2 5 8 9 3 9 0 (56) Список документов, цитированных в отчете о поиске: US 2011/ ...

Verteiltes System mit Quorumredundanz und Verfahren dafür

DIGITAL IMPLEMENTATION OF MULTI-CHANNEL DEMODULATORS

Method of solving a split-brain condition

Method for operating a control network, and control network

The invention relates to a method for operating a control network. It should be possible to perform the method reliably with relatively little complexity. According to the invention, a method for operating a control network (1) is suitable for this purpose, said control network having a single physical connection between a first control computer (ST1) and a second redundant control computer (ST2) by means of a data line network (2), to which several functionally important data processing devices (A, C, D, F, H, K, L) are connected. The data connection between the control computers (ST1, ST2) and the functionally important devices (A, C, D, F, H, K, L) is achieved by means of a redundant and diverse heartbeat, wherein the communication connection between the two control computers (ST1, ST2) is checked in order to start the operation of the control network (1). If the result of the check is positive, a master function is assigned to a control computer (ST1), or if the result of the check ...

SHARED MEMORY COMPUTER NETWORKS

Distributed shared memory systems and processes that can connect into each node of a computer network to encapsulate the memory management operations of the connected nodes and to provide thereby an abstraction of a shared virtual memory that can span across each node of the network and that optionally spans across each memory device connected to the computer network. Accordingly, each node on the network having the distributed shared memory system of the invention can access the shared memory.

CONGESTION CONTROL METHOD FOR THE REVERSE INTERFACE BETWEEN THE BTS AND THE BSC, THE DEVICE AND THE TRANSCEIVER BASE STATION THEREOF

A congestion control method for the reverse interface between the base transceiver stations BTS and the base station controller BSC, and the device, the BTS thereof are disclosed. It could make the BTS perform the congestion control processing for the reverse interface between the BTS and the BSC when the reverse interface between the BTS and the BSC does not reach the congestion while is about to reach the congestion by setting the pre-congestion control threshold and detecting the congestion degree of the reverse interface between the BTS and the BSC. With the invention, it could effectively avoid the data packet losing, thus avoid the effect on the data transmission capacity of the interface between the BSC and the BTS caused by the packet losing, and the wasting of the air interface resource caused by the data retransmission, the increasing of the congestion of the interface between the BSC and the BTS caused by the data retransmission, and reducing of the users’ satisfaction caused ...

CONFIGURATION MANAGEMENT IN DISTRIBUTED DATA SYSTEMS

Systems and methods for managing configurations of data nodes in a distributed environment. A configuration manager is implemented as a set of distributed master nodes that may use quorum-based processing to enable reliable identification of master nodes storing current configuration information, even if some of the master nodes fail. If a quorum of master nodes cannot be achieved or some other event occurs that precludes identification of current configuration information, the configuration manager may be rebuilt by analyzing reports from read/write quorums of nodes associated with a configuration, allowing automatic recovery of data partitions.

NONSTOP SERVICE SYSTEM USING VOTING AND, INFORMATION UPDATING AND PROVIDING METHOD IN THE SAME

A nonstop service system using voting and a method for updating and providing information in the nonstop service system. The nonstop service system includes a plurality of groups of nodes for storing and managing information on the basis of identifiers for distinguishing clients, each group including a plurality of nodes each of which is capable of storing and managing information independently. The nonstop service system further includes a control dispatcher server, which is located between the group of nodes and the clients and manages state information and connection information of the nodes belonging to the plurality of groups of nodes. The control dispatcher server selects a group of nodes corresponding to a client according to an information update and provision request from the client, transmits the information update and provision request to the nodes belonging to the selected group of nodes, and, when information is provided from the nodes, provides information which is selected ...

Nonstop service system using voting, and information updating and providing method in the same

A nonstop service system using voting and a method for updating and providing information in the nonstop service system. The nonstop service system includes a plurality of groups of nodes for storing and managing information on the basis of identifiers for distinguishing clients, each group including a plurality of nodes each of which is capable of storing and managing information independently. The nonstop service system further includes a control dispatcher server, which is located between the group of nodes and the clients and manages state information and connection information of the nodes belonging to the plurality of groups of nodes. The control dispatcher server selects a group of nodes corresponding to a client according to an information update and provision request from the client, transmits the information update and provision request to the nodes belonging to the selected group of nodes, and, when information is provided from the nodes, provides information which is selected ...

Method for providing digital cinema content based upon audience metrics

A method for displaying a motion picture received as a digital data stream and having selectable scene content, by obtaining audience metrics, such as demographic data, and, based on these metrics, selecting replaceable image elements (202) from alternate frame (200) content or from selectable scenes (174a1, 174a2) to be inserted into the image display data stream (180), as purchased by an advertiser (260).

Remote access and geographically distributed computers in a globally addressable storage environment

A computer system employs a globally addressable storage environment that allows a plurality of networked computers to access data by addressing even when the data is stored on a persistent storage device such as a computer hard disk and other traditionally non-addressable data storage devices. The computers can be located on a single computer network or on a plurality of interconnected computer networks such as two local area networks (LANs) coupled by a wide area network (WAN). The globally addressable storage environment allows data to be accessed and shared by and among the various computers on the plurality of networks.

Group proxy and method for grouping services in a distributed computing application

A distributed computing system with an improved architecture and methodology which is capable of handling a wide range of dynamic groups of services where the makeup of the groups can be determined and changed while the application is running. This is mainly accomplished through a group proxy, which is generated at run time, and which handles interactions with groups of services on behalf of one or more clients. The group proxy consists of a group logic shell which contains all the group-aware logic, and a service proxy for each service in the group which contains the necessary logic to interact with the particular service. A grouping agent is also described which provides the group-aware logic for each service that participates in a group, as well as a group service which generates and updates the group proxy. The group service dynamically creates the group proxies for each group by adding the appropriate service proxies to a group logic shell and then registers the group proxies with ...

INTRA-CLUSTER NODE TROUBLESHOOTING METHOD AND DEVICE

Embodiments of this application relate to an intra-cluster node troubleshooting method and device. The method includes: obtaining fault detection topology information of a cluster, where the fault detection topology information includes a fault detection relationship between all nodes in the cluster; obtaining a fault indication message, where the fault indication message is used to indicate unreachability from a detection node to a detected node; determining a sub-cluster of the cluster based on the fault detection topology information and the fault indication message, where nodes that belong to different sub-clusters are unreachable to each other; and determining a working cluster based on the sub-cluster of the cluster. According to the embodiments of this application, available nodes in the cluster can be retained to a maximum extent at relatively low costs. In this way, a quantity of available nodes in the cluster is increased, high availability is ensured.

Load balancing and fault tolerant service in a distributed data system

Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition.

ERROR MANAGEMENT ACROSS HARDWARE AND SOFTWARE LAYERS

Generally, this disclosure provides error management across hardware and software layers to enable hardware and software to deliver reliable operation in the face of errors and hardware variation due to aging, manufacturing tolerances, etc. In one embodiment, an error management module is provided that gathers information from the hardware and software layers, and detects and diagnoses errors. A hardware or software recovery technique may be selected to provide efficient operation, and, in some embodiments, the hardware device may be reconfigured to prevent future errors and to permit the hardware device to operate despite a permanent error.

System and method for data replication using a single master failover protocol

A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master.

System and Method for Recovering from a Configuration Error

A system and method for recovering from a configuration error are disclosed. A Basic Input Output System (BIOS) configures a memory associated with a node of an information handling system and enables a progress monitoring process during configuration of the memory. The memory is disabled if the BIOS determines that a configuration error occurred and a memory reference code associated with the memory is modified in order to prevent a reset of the information handling system.

Policy-based cluster quorum determination

A system, method and computer program product for use in a server cluster having plural server nodes implementing a server tier in a client-server computing architecture in order to determine which of two or more partitioned server subgroups has a quorum. A determination is made of relative priorities of the subgroups and a quorum is awarded to the subgroup having a highest relative priority. The relative priorities are determined by policy rules that evaluate comparative server node application state information. The server node application state information may include one or more of client connectivity, application priority, resource connectivity, processing capability, memory availability, and input/output resource availability, etc. The policy rules evaluate the application state information for each subgroup and can assign different weights to different types of application state information. An interface may be provided for receiving policy rules specified by a cluster application ...

CONNECTIVITY-AWARE WITNESS FOR ACTIVE-ACTIVE STORAGE

Architectures and techniques are described that can enhance the functionality of a witness for an active-active storage array. In the event of a dual storage area network (SAN) failure, or another suitable event, host-array connectivity can take precedence for the witness in determining a winner or loser. Techniques are presented to identify connectivity issues and to utilize connectivity data in connection with determining a winner or a loser.

FASTENER CARTRIDGES INCLUDING EXTENSIONS HAVING DIFFERENT CONFIGURATIONS

A fastener cartridge can include, one, a cartridge body comprising a deck and a plurality of fastener cavities and, two, a plurality of fasteners positioned in the fastener cavities. The cartridge body can further comprise extensions extending from the deck having different sizes and/or configurations. The extensions can control the flow of tissue relative to the deck and/or support the fasteners as they are ejected from the fastener cavities.

FASTENER CARTRIDGES INCLUDING EXTENSIONS HAVING DIFFERENT CONFIGURATIONS

A fastener cartridge can include, one, a cartridge body comprising a deck and a plurality of fastener cavities and, two, a plurality of fasteners positioned in the fastener cavities. The cartridge body can further comprise extensions extending from the deck having different sizes and/or configurations. The extensions can control the flow of tissue relative to the deck and/or support the fasteners as they are ejected from the fastener cavities.

Mixed-media telecommunication call set-up

A method for setting up a mixed media call between mobile stations capable of video telephony, comprising connecting a mixed media call between first and second mobile stations capable of video telephony; receiving data indicative of user selection of a type of video image to be displayed on the second mobile station, wherein the data is received during at least a portion of the connected call and via a user interface of the first mobile station, the user selection being one of a live video to be captured by a camera of the first mobile station and transmitted to the second mobile station, or prestored video; and conducting the mixed media call, in response to the received data and based on part on the user selection, such that the selected type of video image is displayed on the second mobile station during at least a portion of the call.

METHOD AND APPARATUS FOR RELIABLE DISK FENCING IN A MULTICOMPUTER SYSTEM

An apparatus for fast/reliable fencing of resources such as share disks (50) on a networked system (10). For each new configuration of nodes/resources, a membership program module generates a list and based upon that, a new epoch number uniquely identifying the membership correlated with the time that it exists. A control key based upon the epoch number is generated and stored at each resource controller and node (20, 30, 40). If a node is identified as failed, it is removed from the membership list and a new epoch number/control key are generated. When a node sends an access request to a resource (50), the controller compares its locally stored key with the key stored at the node. The access request is executed only if the keys match. The membership list is revisited based upon a node's determination of the failure of a resource and is carried out independently of the failed resource.

ПРОГРАММНЫЙ ИНТЕРФЕЙС ПРИЛОЖЕНИЙ ДЛЯ АДМИНИСТРИРОВАНИЯ РАСПРЕДЕЛЕНИЕМ ОБНОВЛЕНИЙ ПРОГРАММНОГО ОБЕСПЕЧЕНИЯ В СИСТЕМЕ РАСПРЕДЕЛЕНИЯ ОБНОВЛЕНИЯ

... 1. Узел по обслуживанию обновлений, имеющий программный интерфейс приложений для администрирования распределением обновлений программного обеспечения на узле по обслуживанию обновлений, причем программный интерфейс приложений содержит хранилище обновлений для хранения обновлений программного обеспечения; Web-службу обновлений, посредством которой узел по обслуживанию обновлений получает обновления программного обеспечения от родительского узла по обслуживанию обновлений по сети связи, и посредством которой узел по обслуживанию обновлений распределяет обновления программного обеспечения дочерним узлам по обслуживанию обновлений по сети связи; и административный программный интерфейс приложений (API), посредством которого администратор устанавливает средства управления распределением обновлений программного обеспечения для дочерних узлов по обслуживанию обновлений и клиентских компьютеров, при этом административный API является объектом, обеспечивающим множество интерфейсных вызовов, посредством ...

Neu konfigurierbare Wiederherstellungsmodi in Hochverfügbarkeitsprozessoren

Ein Computerprogrammprodukt zur Durchführung der Fehlerbehebung ist so konfiguriert, dass es ein Verfahren durchführt, welches das Erzeugen eines Wiederherstellungsprüfpunkts durch einen Prozessor beinhaltet. Auf der Grundlage des Erzeugens des Software-Wiederherstellungsprüfpunkts wird der Prozessor dynamisch in einen nicht wiederherstellbaren Verarbeitungs-Betriebsmodus überführt. Der nicht wiederherstellbare Verarbeitungs-Betriebsmodus ist ein Modus, in dem eine Teilgruppe von Hardware-Fehlerbehebungsressourcen ausgeschaltet oder für den neuen Zweck der Instruktionsverarbeitung verwendet wird. Während des nicht wiederherstellbaren Verarbeitungs-Betriebsmodus wird festgestellt, dass ein neuer Software-Wiederherstellungsprüfpunkt erforderlich ist. Auf der Grundlage des Feststellens, dass ein neuer Software-Wiederherstellungsprüfpunkt erforderlich ist, wird der Prozessor dynamisch in einen wiederherstellbaren Verarbeitungs-Betriebsmodus überführt. Der wiederherstellbare Verarbeitungs-Betriebsmodus ...

STRUKTURIERTES DATENSPEICHERSYSTEM MIT GLOBAL ADRESSIERBAREM SPEICHER

Quorummechanismus in einem verteilten Zweiknotenrechnersystem

Method system and program products for serialising replicated transactions of a distributed computing environment

Mixed-media telecommunication call set-up

A method of transferring between communication channels of differing bandwidth, the method including the steps of:
```establishing data communications on a first channel, the first channel having a first bandwidth;
```in response to a trigger indicating changes in the data to be communicated, establishing data communications on a second channel, the second channel having bandwidth which provides different use of resources;
```once data communications have been set up on the second channel, releasing the first channel. The method allows switching to a channel capable of transmitting audio and video images over a GSM link from a normal voice channel, (or vice-versa).

Serialising replicated transactions of a distributed computing environment

Replicated Transactions in a distributed computing environment may request a modification operation on a resource. If a conflict for the resource is detected, the conflict is resolved by serialising the replicated transactions without requiring explicit locking of the resource. The management and use of replicated distributed transactions is facilitated. A distributed synchronous transaction system protocol is provided to manage the replication of distributed transactions for client application instances. The distributed synchronous transaction system allows transactions to be replicated without having the client application instances be aware of other instances to receive the transaction. Further, if a failure occurs during processing of a distributed replicated transaction, the distributed synchronous transaction system manages the recovery of the failure.

High-availability architecture for cloud-based concurrent-access collaboration platform

sTRUCTUREDdATA MEMORY SYSTEM MIT gLOBALaDDRESSABLE ONE MEMORY

MOUNTING A FILE SYSTEM IN A GECLUSTERTEN FILE SYSTEM

CLUSTERING INFRASTRUCTURE SYSTEM AND METHOD

CLUSTER DATABASE WITH REMOTE DATA MIRRORING

A method and apparatus for mirroring data between a plurality of sites is provided. A replication relationship is established between the plurality of sites that include a first site and a second site. A first database server at the first site receives an indication that a write operation could not be successfully mirrored at the second site. In response to the indication, the first database server initiates a membership voting operation by communicating with a quorum device to determine whether the first database server or a second database server associated with the second site should be removed from the replication membership. If it is determined that the second database server associated with the second site should be removed from the replication membership, then the first database server sends a message to indicate that write operations are no longer to be replicated at the second site.

METHOD AND SYSTEM FOR TRANSFERRING IP PACKETS BY AGGREGATING MULTIPLE WIRELESS COMMUNICATION CHANNELS FOR HIGH DATA RATE TRANSFERS

A mobile wireless terminal (MWT) (206) receives IP packets (404) destined for a ground network (234) in a predetermined sequence order. The MWT (206) fragments each of the IP packets into many smaller packet fragments (406), appends identifying information to each of the packet fragments (408), and transmits the packet fragments in parallel with one another (416) over concurrently operating satellite channels (240a-240n). A receiving station (180) receives the packet fragments (904) transmitted by the MWT (206). The receiving station (180) forwards the received packet fragments to a ground controller (232) over a network connection, based on the identifying information appended to the packet fragments. The ground controller (232) combines the packet fragments (908) into reconstructed IP packets based on the identifying information appended to the fragments. The ground controller (232) also sequences the reconstructed IP packets (1006) in the predetermined sequence order based on the identifying ...

MULTIPROCESSOR CLUSTER MEMBERSHIP MANAGER FRAMEWORK

A shared-disk cluster system includes a cluster membership manager framework which coordinates the joining or leaving among all nodes in a cluster including taking the multiple layers of involved subsystems through transitions. Subsystems are notified of transitions in particular order depending upon the transition, and all nodes' subsystems receiving a notification must process that notification prior to another layer of subsystems being notified. One of the subsystems registered for notification is an event manager in user space. The event manager carries out transfers of client services, including user applications, resulting from nodes joining and leaving the cluster. This includes a registration and launch service which registers a node, or multiple nodes, in a cluster which claims, or is assigned, responsibility for the service and provides an optional launching function which initiates the client service upon successful registration.

SHARED MEMORY COMPUTER NETWORKS

Distributed shared memory systems and processes that can connect into each node of a computer network to encapsulate the memory management operations of the connected nodes and to provide thereby an abstraction of a shared virtual memory that can span across each node of the network and that optionally spans across each memory device connected to the computer network . Accordingly, each node on the network having the distributed shared memo ry system of the invention can access the shared memory.

METHOD AND APPARATUS FOR NODE PRUNING A MULTI-PROCESSOR SYSTEM FOR MAXIMAL, FULL CONNECTION DURING RECOVERY

A method and apparatus for achieving maximal, full connection in a multiprocessor system having a plurality of processors. Each of the multiple processors has a respective memory. The invention includes communicatively connecting the processors. Following a disruption (805) in the communicative connection, the invention collects connectivity information of one of the processors (830) and selects certain of the processors to cease operations, based on the connectivity information collected. The invention further communicates the selection to each of the processors (850) communicatively coupled to the one processor.

DETERMINING CLUSTER MEMBERSHIP IN A DISTRIBUTED COMPUTER SYSTEM

Cluster membership in a distributed computer system is determined by determining with which other nodes each node is in communication and distributing that connectivity information through the nodes of the system. Accordingly, each node can determine an optimized new cluster based upon the connectivity information. Specifically, each node has information regarding with which nodes the node is in communication and similar information for each other node of the system. Therefore, each node has complete information regarding interconnectivity of all nodes which are directly or indirectly connected. Each node applies optimization criteria to such connectivity information to determine an optimal new cluster. Data represent the optimal new cluster is broadcast by each node. In addition, the optimal new cluster determined by the various nodes are collected by each node. Thus, each node has data representing the proposed new cluster which is perceived by each respective node to be optimal. Each ...

DATA INTEGRITY AND AVAILABILITY IN A DISTRIBUTED COMPUTER SYSTEM

Data integrity and availability is assured by preventing a node of a distributed, clustered system from accessing shared data in the case of a failure of the node or communication links with the node. The node is prevented from accessing the shared data in the presence of such a failure by ensuring that such a failure is detected in less time than a secondary node would allow user I/O activities to commence after reconfiguration. The prompt detection of failure is assured by periodically determining which configuration of the current cluster each node believes itself to be a member of. Each node maintains a sequence number which identifies the current configuration of the cluster. Periodically, each node exchanges its sequence number with all other nodes of the cluster. If a particular node detects that it believes itself to be a member of a preceding configuration to that to which another node belongs, the node determines that the cluster has been reconfigured since the node last performed ...

Controlling application access from various appliances e.g. telephone sets, computer modems, etc. to telephone line by issuing off-hook signals indicating appliance priority level

L'invention concerne le contrôle de l'accès de différents appareils (4A à 4G) d'une installation (1) connectés à une ligne téléphonique (2). Les appareils disposent de niveau de priorité. Il est prévu l'émission, à la demande d'un appareil effectuant une opération de prise de la ligne et à destination des autres appareils, d'un signal de décroché représentatif du niveau de priorité de l'appareil, lorsque ce niveau est supérieur à celui d'au moins un autre appareil de l'installation. Le signal est émis à l'occasion de l'opération de prise de ligne et pour la durée de la connexion de l'appareil à la ligne, si aucun signal de décroché d'un niveau de priorité supérieur n'est émis. Il est aussi prévu une déconnexion de la ligne pour tout appareil recevant un signal de décroché émis pour un appareil ayant un niveau de priorité supérieur.

DISTRIBUTED COMPUTING SYSTEM

Disclosed is a distributed computing system that enables autonomous leader selection without relying on a particular server. The distributed computing system (S) is provided with: a leader candidate selection device (63) that, when communication is established with a majority of the initial total number of information processing devices, selects the aforementioned information processing device with the oldest accession time as a leader candidate information processing device, and transmits identification information thereof; and a leader recognition device (64) that investigates identification information of the aforementioned leader candidate information processing device and the transmitted identification information of the aforementioned leader candidate information processing device of the leader recognition device itself, and that, in the case that the information processing device that is the same as that recognized as the leader candidate information processing device is present ...

AGGREGATING MULTIPLE WIRELESS COMMUNICATION CHANNELS FOR HIGH DATA RATE TRANSFERS

A mobile wireless terminal (MWT) (206) receives IP packets (404) destined for a ground network (234) in a predetermined sequence order. The MWT (206) fragments each of the IP packets into many smaller packet fragments (406), appends identifying information to each of the packet fragments (408), and transmits the packet fragments in parallel with one another (416) over concurrently operating satellite channels (240a-240n). A receiving station (180) receives the packet fragments (904) transmitted by the MWT (206). The receiving station (180) forwards the received packet fragments to a ground controller (232) over a network connection, based on the identifying information appended to the packet fragments. The ground controller (232) combines the packet fragments (908) into reconstructed IP packets based on the identifying information appended to the fragments. The ground controller (232) also sequences the reconstructed IP packets (1006) in the predetermined sequence order based on the identifying ...

DETERMINING CLUSTER MEMBERSHIP IN A DISTRIBUTED COMPUTER SYSTEM

Cluster membership in a distributed computer system is determined by determining with which other nodes each node is in communication and distributing that connectivity information through the nodes of the system. Accordingly, each node can determine an optimized new cluster based upon the connectivity information. Specifically, each node has information regarding with which nodes the node is in communication and similar information for each other node of the system. Therefore, each node has complete information regarding interconnectivity of all nodes which are directly or indirectly connected. Each node applies optimization criteria to such connectivity information to determine an optimal new cluster. Data represent the optimal new cluster is broadcast by each node. In addition, the optimal new cluster determined by the various nodes are collected by each node. Thus, each node has data representing the proposed new cluster which is perceived by each respective node to be optimal. Each ...

Task scheduler for a fault tolerant multiple node processing system

A task scheduler for a fault tolerant multiple node processing system having a task activity list storing a set of application tasks, a priority scan list storing a selected portion of the set of application tasks, a completion status list also storing the same selected portion of the set of application tasks. A wake-up sequencer transfers the application tasks from the task activity list to the priority scan list, and a priority scanner transfers the application tasks ready for execution from the priority scan list to a selection queue. A next task selector selects the next application task that its node will execute, and a task started register stores the identity of the application tasks completed by the other nodes. A task interactive consistency (TIC) handler updates the status of the application tasks stored in the task activity list, the priority scan list, and the completion status list in response to messages received from the other nodes identifying which nodes completed tasks ...

Method and system for strong-leader election in a distributed computer system

Embodiments of the present invention provide methods and systems for strong-leader election in a distributed computer system. In certain embodiments of the present invention, nodes employ a distributed consensus service, such as Paxos, to seek election of leader at or near the expiration of each of a set of successive lease periods. A current leader seeks re-election prior to expiration of the current lease, thus favoring continued re-election of the current leader until and unless the current leader fails or surrenders the leadership role.

FASTENER CARTRIDGE COMPRISING NON-UNIFORM FASTENERS

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle. 1. A staple cartridge for use with a surgical instrument , wherein said staple cartridge comprises: a proximal end;', 'a distal end;', 'a first longitudinal row of staple cavities; and', 'a second longitudinal row of staple cavities;, 'a cartridge body, comprising a base;', 'a first proximal leg extending from said base at a first proximal angle; and', 'a first distal leg extending from said base at a first distal angle, wherein said first proximal angle is different than said first distal angle; and, 'a plurality of first staples, wherein each said first staple is positioned in said first longitudinal row of staple cavities, and wherein each said first staple comprisesa plurality of second staples, wherein each said second staple is positioned in said second longitudinal row of staple cavities.2. The staple cartridge of claim 1 , wherein each said second staple is positioned in said second longitudinal row of staple cavities claim 1 , and wherein each said second staple comprises:a second base;a second proximal leg extending from said second base at a second proximal angle; anda ...

CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS

A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

Selections of managing nodes in clusters of nodes

Example implementations relate to clusters of nodes. In an example, a method includes computing a score for a first node in a distributed storage system comprising a plurality of nodes. The score is a function of at least one of: a location of the first node, a health status of the first node, and a resource utilization of the first node. A rank of the first node among the plurality of nodes is then determined based on the score and on a plurality of scores associated with the plurality of nodes. An instruction is sent to the first node to instantiate a manager process for managing the distributed storage system on the first node when the rank of the first node is at least equal to a predefined rank.

Automated node restart in clustered computer system

An apparatus, program product and method initiate a restart of a node in a clustered computer system using a member of a clustering group that resides on a different node from that to be restarted. Typically, a restart operation is initiated by the member in response to a membership change message sent by another group member that is resident on the node to be restarted, with an indicator associated with the membership change message that indicates that a restart should be initiated. Typically, the restart is implemented in much the same manner as a start operation that is performed when a node is initially added to a cluster, with additional functionality utilized to preclude repeated restart attempts upon a failure of a prior restart operation.

Method and Apparatus for Power-Efficient High-Capacity Scalable Storage System

Systems and methods for providing scalable, reliable, power-efficient, high-capacity data storage, wherein large numbers of closely packed data drives having corresponding metadata and parity volumes are individually powered on and off, depending upon their respective usage. In one embodiment, the invention is implemented in a RAID-type data storage system which employs a large number of hard disk drives that are individually controlled, so that only the disk drives that are in use are powered on. The reduced power consumption allows the disk drives to be contained in a smaller enclosure than would conventionally be possible. In a preferred embodiment, the data protection scheme is designed to utilize large, contiguous blocks of space on the data disk drives, and to use the space on one data disk drive at a time, so that the data disk drives which are not in use can be powered down.

Write requests in a distributed storage system

Example data storage systems and methods are described. In one implementation, a method identifies data to be written to a shared storage system that includes multiple storage nodes. The method communicates a write operation vote request to each of the multiple storage nodes. The write operation vote request is associated with a data write operation to write the identified data to the shared storage system. A positive response is received from at least a portion of the multiple storage nodes. The data write operation is initiated in response to receiving positive responses from a quorum of the storage nodes.

Using distributed queues in an overlay network

The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and/or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.

Validation of access to a shared data record subject to read and write access by multiple requesters

According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt.

Reconfigurable recovery modes in high availability processors

A method for performing error recovery that includes creating, by a processor, a recovery checkpoint. The processor is dynamically switched into a non-recoverable processing mode of operation based on creating the software recovery checkpoint. The non-recoverable processing mode of operation is a mode in which a subset of hardware error recovery resources are powered-down or re-purposed for instruction processing. It is determined, during the non-recoverable processing mode of operation, that a new software recovery checkpoint is required. Based on the determining that a new software recovery checkpoint is required, the processor is dynamically switched into a recoverable processing mode of operation. The recoverable processing mode of operation is a mode in which hardware error recovery resources, including at least one of the hardware error recovery resources in the subset, are purposed for hardware error recovery operations.

Mobile hadoop clusters

Techniques for mobile clusters for collecting telemetry data and processing analytic tasks, are disclosed herein. The mobile cluster includes a processor, a plurality of data nodes and an analysis module. The data nodes receive and store a snapshot of at least a portion of data stored in a main Hadoop storage cluster and real-time acquired data received from a data capturing device. The analysis module is operatively coupled to the processor to process analytic tasks based on the snapshot and the real-time acquired data when the storage cluster is not connected to the main storage cluster.

TWO NODE CLUSTERS RECOVERY ON A FAILURE

Systems and methods for high availability computing systems. Systems and methods include disaster recovery of two-node computing clusters. A method embodiment commences upon identifying a computing cluster having two nodes, the two nodes corresponding to a first node and a second node that each send and receive heartbeat indications periodically while performing storage I/O operations. One or both of the two nodes detect a heartbeat failure between the two nodes, and in response to detecting the heartbeat failure, one or both of the nodes temporarily cease storage I/O operations. A witness node is accessed in an on-demand basis as a result of detecting the heartbeat failure. The witness performs a leadership election operation to provide a leadership lock to only one requestor. The leader then resumes storage I/O operations and performs one or more disaster remediation operations. After remediation, the computing cluster is restored to a configuration having two nodes. 1. A method comprising:detecting a failure condition between a first node and a second node in a computing cluster that comprises a storage pool that is accessed by the first and second nodes;in response to detecting the failure condition, stopping execution of an I/O operation to the storage pool by the first and second nodes;accessing a witness node in an on-demand basis, wherein an atomic leadership election operation is initiated to form a quorum that includes the witness node, the atomic leadership election operation providing a leadership lock to only a single requestor, the single requestor corresponding to only one of the first or second nodes; andinitiating, by the single requestor having the leadership lock, a disaster recovery operation for the computing cluster.2. The method of claim 1 , further comprising:receiving a leadership request at an arbiter, the leadership request being received from at least one of, the first node or the second node, and performing, in response to receiving the ...

Efficient, time-based leader node election in a distributed computing system

A same voting time, a same vote counting time, and a same leader node tenure is configured by a host for all nodes. Time configuration information including the same configured voting time, the same vote counting time, and the same leader node tenure, is sent to all the nodes. The nodes are operable to vote during the same voting time, count the number of votes during the same vote counting time, and elect a leader node according to a vote counting result. The nodes are enabled to perform periodic node election according to the same leader node tenure.

High availability scheduler for scheduling map-reduce searches

A high availability scheduler of tasks in a cluster of server devices is provided. A server device of the cluster of server devices enters a leader state based upon the results of a consensus election process in which the server device participates with others of the cluster of server devices. Upon entering the leader state, the server device schedules one or more tasks by assigning each of the one or more tasks to a device, wherein the one or more tasks involve initiating a late-binding schema.

LOAD BALANCING AND FAULT TOLERANT SERVICE IN A DISTRIBUTED DATA SYSTEM

Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition. 1. A method , comprising:creating relationships between a quorum of nodes in a cluster;adding a new node to the quorum of nodes;adding a new user space process to the new node; andreassigning a relationship handled by the new user space process based upon the user space process failing.2. The method of claim 1 , comprising:assigning each user space process of each node within the quorum of nodes to handle a virtual server disaster recovery relationship of the cluster.3. The method of claim 1 , wherein no more than one user space process is assigned to each node.4. The method of claim 1 , wherein the new user space process comprises a virtual server disaster recovery process.5. The method of claim 1 , wherein the reassigning comprises:accessing a library of a replicated database (RDB) service to evaluate a set of classes indicative of nodes in the cluster that have not failed.6. The method of claim 5 , comprising:utilizing an RDB ring of a user space process to detect that a current node has failed.7. The method of claim 5 , comprising:utilizing the RDB ring of the user space process to detect that the current node has been activated.8. The method of claim 5 , comprising: ...

DATA WRITING AND READING AND APPARATUS AND CLOUD STORAGE SYSTEM

A data writing and reading method and apparatus, and a cloud storage system. The data writing method includes an access node receiving a data write request, identifying domain identification information contained in the data write request when failing to obtain an available management node, and querying a pre-saved index according to the domain identification information, wherein the index includes a correspondence between a resource pool and domain identification information, identifying a target resource pool that matches the domain identification information, each resource pool including at least one storage server, determining, from at least one storage server included in the target resource pool, one of the storage servers as a target storage server, and writing data to be written into the target storage server, to ensure that the cloud storage system operates normally without additional cost when all management nodes are at fault or the management node cluster network is abnormal. 1. A data writing method based on a cloud storage system comprising at least: an access node , at least one management node , and at least one storage server , wherein the method comprises:the access node receiving a data write request;identifying domain identification information contained in the data write request when failing to obtain an available management node, and querying a pre-saved index according to the domain identification information, wherein the index comprises a correspondence between a resource pool and domain identification information;identifying a target resource pool that matches the domain identification information, wherein each resource pool comprises at least one storage server;determining, from the at least one storage server contained in the target resource pool, one of the storage servers as a target storage server, and writing data to be written into the target storage server.2. The method of claim 1 , wherein determining one of the storage servers as a ...

ROLE DESIGNATION IN A HIGH AVAILABILITY NODE

A high-availability network device cluster role synchronization technique for devices configured with multiple network controllers is disclosed. An HA node may contain information regarding a role within a cluster for that HA node. This information should property be maintained or erased based on a type of failover for an HA device. For example, if there is a loss of the active controller that causes only a controller failover, changes to the role of the HA node may not be necessary. Thus, an election process within a cluster may be avoided. However, if a failover of an entire HA node occurs (or restart of an HA node), role information prior to the restart may not be applicable and an election process may need to be initiated such that the cluster may continue to function. Different types of roles may exist for nodes within a cluster. 1. A computer-implemented method of maintaining a role designation for a high availability (HA) node having a first and second controller , the method comprising:receiving an indication of a cluster role designation for the HA node at the first controller of the HA node when the first controller is active, the first controller to act as a backup for the second controller when the second controller is active, and the second controller to act as a backup for the first controller when the first controller is active;providing information regarding the cluster role designation from the first controller to the second controller, acting as a backup for the first controller, via a mechanism used for exchanging HA state information independent of a clustering protocol, the HA state information including an indication of which of the first controller and the second controller is active;responsive to receiving the cluster role designation at the second controller, storing information in non-persistent memory of the HA node accessible to the second controller, the information sufficient for the second controller to become active using the cluster ...

FAULT REPAIR METHOD FOR DATABASE SYSTEM, DATABASE SYSTEM, AND COMPUTING DEVICE

The present disclosure relates to fault repair methods for a database system. In one example method, when working normally, a master node backs up, to a global buffer pool (GBP) node by using a data transmission protocol with a low latency and a high throughput (for example, a remote direct memory access (RDMA) protocol), a modified page generated because of transaction modification. When the master node is faulty, a standby node does not need to replay all remaining replay logs that are not replayed, but only needs to replay redo logs corresponding to a page that does not exist on the GBP node and pages that are not sequentially arranged and obtain the pages.

Fastener cartridge comprising non-uniform fasteners

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle.

Method and Apparatus for Redundancy in Active-Active Cluster System

A method is applied to a system including a host cluster and at least one pair of storage arrays. The host cluster includes a quorum host, which includes a quorum unit. The quorum host is an application host having a quorum function. A pair of storage arrays includes a first storage array and a second storage array. The quorum host receives a quorum request, temporarily stops delivering a service to the first storage array and the second storage array, determines, from the first storage array and the second storage array, which is a quorum winning storage array and which is a quorum losing storage array according to logic judgment, stops the service with the quorum losing storage array, sends quorum winning information to the quorum winning storage array, and resumes the delivered service between the host cluster and the quorum winning storage array. 1. An active-active (AA) storage system , comprising:a first host configured to run a first quorum host having first quorum instances;a first storage array coupled to the first host; anda second storage array coupled to the first host and the first storage array,wherein a first volume in the first storage array and a second volume in the second storage array form an AA pair,wherein the first storage array is configured to send a first quorum request for the AA pair to a quorum instance in the first quorum instances when the first storage array fails to contact the second storage array,wherein the second storage array is configured to send a second quorum request to the quorum instance at a later time than the first storage array sends the first quorum request, andwherein the quorum instance is configured to grant the first storage array to be a winner based on the first quorum request and the second quorum request.2. The AA storage system of claim 1 , wherein the AA storage system does not comprise a physical quorum server to implement the first quorum request or the second quorum request.3. The AA storage system of ...

FASTENER CARTRIDGES INCLUDING EXTENSIONS HAVING DIFFERENT CONFIGURATIONS

A fastener cartridge can include, one, a cartridge body comprising a deck and a plurality of fastener cavities and, two, a plurality of fasteners positioned in the fastener cavities. The cartridge body can further comprise extensions extending from the deck having different sizes and/or configurations. The extensions can control the flow of tissue relative to the deck and/or support the fasteners as they are ejected from the fastener cavities. 118-. (canceled)19. A surgical stapling instrument , comprising:a housing;an elongate shaft extending from said housing, wherein said elongate shaft defines a longitudinal axis and is rotatable about said longitudinal axis;an articulation joint;{'claim-text': ['an elongate channel comprising a bottom, wherein said bottom includes a proximal end and a distal end;', 'a replaceable staple cartridge seatable in said elongate channel; and', 'an anvil;'], '#text': 'an end effector rotatably coupled to said elongate shaft about said articulation joint, wherein said end effector comprises:'}{'claim-text': ['a vertical portion;', 'a first cam configured to engage said anvil during said firing motion;', 'a second cam; and', 'a lateral shoulder extending laterally from said vertical portion;'], '#text': 'a motor-driven firing element translatable distally from a proximal position adjacent said proximal end to a fired position during a firing motion, wherein said motor-driven firing element comprises:'}an internal passage extending within said elongate channel, wherein said internal passage is configured to receive said second cam during said firing motion;a proximal channel opening through said proximal end of said bottom of said elongate channel, wherein said proximal channel opening facilitates viewing of said motor-driven firing element therethrough when said motor-driven firing element is in said proximal position, and wherein said proximal channel opening is sized to receive said second cam therein; anda sloped surface configured to ...

FASTENER CARTRIDGE ASSEMBLIES AND STAPLE RETAINER COVER ARRANGEMENTS

A cover member for a surgical staple cartridge. The cover member is configured to retain a wedge sled within the staple cartridge in a starting position when the cover member is attached to the body of the staple cartridge. The cover member includes a top portion that covers all of the fastener openings in the deck of the staple cartridge when the cover is attached to the cartridge. 120-. (canceled)21. A surgical end effector , comprising:an elongate channel including a bottom including a proximal end and a distal end, the elongate channel being configured to operably support a staple cartridge therein;a firing element configured to translate between a first position adjacent the proximal end of the bottom of the elongate channel and an ending position adjacent the distal end of the bottom of the elongate channel, the firing element including a vertical portion and at least one laterally extending lower foot;an internal passage extending within the elongate channel and configured to receive the at least one laterally extending lower foot when the firing element moves between the first position and ending position;a proximal channel opening through the proximal end of the bottom of the elongate channel to facilitate viewing of the firing element therethrough when the firing element is in the first position, the proximal channel opening sized to receive therein the at least one laterally extending lower foot on the firing element; anda lead surface that guides the at least one laterally extending lower foot into the internal passage.22. A surgical end effector , comprising:an elongate channel including a bottom including a proximal end and a distal end, the elongate channel being configured to operably support a staple cartridge therein;a firing element configured to translate between a first position adjacent the proximal end of the bottom of the elongate channel and an ending position adjacent the distal end of the bottom of the elongate channel, the firing element ...

Network Distributed File System

A storage pool component is operable on a computing device including a storage medium having an otherwise free storage capacity for forming a portion of a storage capacity of a storage pool and being operably connected across a network to at least one other such component. The component comprises configuration data identifying at least one other computing device to which the computing device may connect across the network; and a directory for identifying file information for files of the storage pool stored on the storage medium, the file information being stored with a degree of redundancy across the computing devices of the storage pool. On instantiation, the component for communicates with at least one other component operating on one of the other computing devices to verify the contents of the directory. The component reconciles file information stored on the storage medium with file information from the remainder of the storage pool. The component then acts as a driver, responsive to an access request for a file stored in the storage pool received across the network from another component of the storage pool, for determining a location of the file on the storage medium from the directory and for accessing the file accordingly.

Massively Scalable, Low Latency, High Concurrency and High Throughput Decentralized Consensus Algorithm

A distributed/decentralized consensus algorithm that is auto-adaptive, massively scalable with low latency, high concurrency and high throughput, achieved via parallel processing and location-aware formation of topology and O(n) messages on consensus agreement. 1. A massively scalable , low latency , high concurrency and high throughput decentralized consensus algorithm divides the consensus participating entities into many much smaller consensus domains based on pre-configured or auto-learned and auto-adjusted location proximity and subject to a configurable optimal upper bound in membership size , wherein auto-elected auto-adjusted representative nodes from each consensus domain forms the command domain , and as the bridge between the command domain and its home consensus domain. Command nodes in the command domain elects and auto-adjust its master;wherein master election can be location-biased so that it has the lowest overall low latency to other command nodes;wherein the consensus topology is formed by the potentially multi-tier command domains and all potentially multi-tier consensus domains, besides the described one-command domain-and-multiple-flat-consensus-domain paradigm for brevity;wherein the command domain is responsible to accept consensus requests from logically external clients, coordinates with all consensus domains to achieve consensus and return the result to the calling client;wherein all command nodes can accept client requests simultaneously for high throughput and high concurrency, when they are doing it they are called accepting node. A master node is itself a command node and hence can be accepting node, besides issuing a signed sequence number to a request received by an accepting node.2. A massively scalable claim 1 , low latency claim 1 , high concurrency and high throughput decentralized consensus algorithm according to claim 1 , wherein on receiving a REQUEST message from a client claim 1 , an accepting node contacts the master node to ...

High availability architecture for a cloud-based concurrent-access collaboration platform

Embodiments in the present disclosure include systems and methods related to a high-availability architecture for a cloud-based concurrent-access collaboration platform. The disclosed technology relates to an active data center which includes multiple document server instances that handle user requests for concurrently accessing documents. Multiple document server instances are implemented on a single physical server. This architecture uses an instance assignment manager to assign documents to the document server instances, a primary repository to store backup snapshots of the documents, and a datastore to store all changes made to the documents. The disclosed technology also involves a backup data center that can be swapped with the active data center automatically.

COMPUTER CLUSTER USING EXPIRING RECOVERY RULES

The fail-over computer cluster enables multiple computing devices to operate using adaptive quorum rules to dictate which nodes are in the fail-over cluster at any given time. The adaptive quorum rules provide requirements for communications between nodes and connections with voting file systems. The adaptive quorum rules include particular recovery rules for unplanned changes in node configuration, such as due to a disruptive event. Such recovery quorum rules enable the fail-over cluster to continuing to operate with various changed configurations of its node members as a result of the disruptive event. In the changed configuration, access to voting file systems may not be required for a majority-group subset of nodes. If no majority-group subset remains, nodes may need direct or indirect access to voting file systems. 1. A computer-implemented method to operate a computer cluster having a plurality of nodes according to quorum rules , the method comprising:prior to a disruptive event, the computer cluster operates according to formation quorum rules in which each initial node that operates in the computer cluster is in communication with at least a majority of one or more voting file systems;determining a failure status of at least one of the plurality of nodes of the computer cluster in response to a disruptive event; andmaintaining the computer cluster according to at least one recovery quorum rule for an expiration time, under which a subset of remaining nodes operates, after which the formation quorum rules or revised quorum rules apply instead of the recovery quorum rules,wherein the at least one recovery quorum rule is different from the formation quorum rules and the revised quorum rules.2. The computer-implemented method of claim 1 , wherein the expiration time is extendable based claim 1 , at least in part claim 1 , on an additional time to address a result of the disruptive event.3. The computer-implemented method of claim 1 , wherein the at least one ...

COMMISSIONING AND DECOMMISSIONING METADATA NODES IN A RUNNING DISTRIBUTED DATA STORAGE SYSTEM

In a running distributed data storage system that actively processes I/Os, metadata nodes are commissioned and decommissioned without taking down the storage system and without introducing interruptions to metadata or payload data I/O. The inflow of reads and writes continues without interruption even while new metadata nodes are in the process of being added and/or removed and the strong consistency of the system is guaranteed. Commissioning and decommissioning nodes within the running system enables streamlined replacement of permanently failed nodes and advantageously enables the system to adapt elastically to workload changes. An illustrative distributed barrier logic (the “view change barrier”) controls a multi-state process that controls a coordinated step-wise progression of the metadata nodes from an old view to a new normal. Rules for I/O handling govern each state until the state machine loop has been traversed and the system reaches its new normal. 1. A method for commissioning new metadata nodes into a working distributed data storage system that comprises a plurality of storage service nodes , the method comprising: wherein the first metadata node comprises a first storage service node that executes a metadata subsystem of the distributed data storage system,', 'wherein the set of keys are unique identifiers that ensure strong consistency within the distributed data storage system,', 'wherein each key of the set is owned by exactly one metadata node in the distributed data storage system,', 'wherein the first metadata node: owns the first range of keys, and stores and maintains first metadata files at the first storage service node, and', 'wherein each first metadata file is associated with the first range of keys;, 'by a first metadata node, receiving read requests and write commands for metadata that is associated with a first range of keys within a set of keys,'}activating a second metadata node at a second storage service node that is distinct from ...

LOAD BALANCING AND FAULT TOLERANT SERVICE IN A DISTRIBUTED DATA SYSTEM

Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition. 1. A method , comprising:distributing a snapshot task to a first node of a cluster;detecting a failure condition for the first node; andreassigning the snapshot task from the first node to a second node to perform the snapshot task based upon detecting the failure condition.2. The method of claim 1 , comprising:restarting a failed user space process as a restarted user space process executing at the second node based upon detecting the failure condition.3. The method of claim 2 , comprising:recreating a state transition table for the restarted user space process based upon information within a routing table.4. The method of claim 1 , comprising:identifying a list of healthy nodes within the cluster.5. The method of claim 4 , comprising:identifying a list of unhealthy nodes within the cluster.6. The method of claim 5 , comprising:redistributing relationships between nodes of the cluster based upon the list of healthy nodes and the list of unhealthy nodes.7. The method of claim 6 , comprising:determining if a new node of a quorum of nodes within the cluster is a most recent node responsible for a relationship.8. The method of claim 1 , comprising:utilizing a last owning node list ...

METHOD AND SYSTEM FOR DATA PLACEMENT IN A LINKED NODE SYSTEM

In general, embodiments of the invention relate to storing data and managing the stored data in linked nodes. More specifically, embodiments of the invention relate to nodes linked together in a daisy chain configuration such as, but not limited to, a single-chain configuration and a dual-chain configuration, which use data protection domain (DPD) information to determine where and/or how to store the data. 1. A method for storing data , comprising:identifying, by a data processor and using aggregated data protection domain (DPD) information for a plurality of node, a first node and a second node; andissuing, by the data processor, a first request to store data to a first node and a second request to store the data to a second node.2. The method of claim 1 , further comprising:receiving, by the data processor, node-specific DPD information from the first node,generating the aggregated DPD information using the node-specific DPD information.3. The method of claim 2 , wherein the node-specific DPD information comprises immediate neighbor information of at least one immediate neighbor.4. The method of claim 3 ,wherein the at least one immediate neighbor is a third node,wherein the immediate neighbor information specifies a communication interface on the node that is directly connected to the third node.5. The method of claim 4 , wherein the immediate neighbor information further specifies a name of the third node and a communication address of the third node.6. The method of claim 1 , further comprising: receiving, by the data processor, a failure notification from the first node,', 'identifying, in response to the failure notification and using the aggregated DPD information, a third node;', 'issuing a third request to store the data to the third node., 'in response the first request7. The method of claim 6 ,wherein the first node is a member of a first data protection group (DPG);wherein the third node is a member of a second DPG;wherein the first DPG and the second ...

METHOD AND SYSTEM FOR EFFICIENT UPDATING OF DATA IN A LINKED NODE SYSTEM

In general, embodiments of the invention relate to storing data and managing the stored data in linked nodes. Managing the data in the linked nodes includes updating erasure coded data in a manner that reduces the transmission of data chunks and parity chunks between the linked nodes. 1. A method for managing data , comprising:receiving, by a node, an updated data chunk, wherein the node comprising a data chunk, wherein the data chunk is a prior version of the updated data chunk;identifying a second node comprising a parity chunk associated with the data chunk;transmitting, by the node, the data chunk and the updated data chunk to the second node;generating, the second node, an updated parity chunk using the data chunk and the updated data chunk; andstoring the updated parity chunk on the second node.2. The method of claim 1 , further comprising:deleting the data chunk on the node.3. The method of claim 1 , further comprising:deleting the data chunk, the updated data chunk, and the parity chunk from the second node after the updated parity chunk is generated on the second node.4. The method of claim 1 , wherein the second node is identified by the node.5. The method of claim 1 , wherein the node and the second node are connected in a single-chain configuration.6. The method of claim 1 , wherein the node and the second node are connected in a dual-chain configuration.7. The method of claim 1 ,wherein the node and the second node are members of a cluster; andwherein the data chunk and the parity chunk are stored in the cluster using, at least in part, data protection domain (DPD) information.8. The method of claim 7 ,wherein the DPD information specifies immediate neighbor nodes of the node; andwherein the second node is not an immediate neighbor node of the node.9. A non-transitory computer readable medium comprising computer readable program code claim 7 , which when executed by a computer processor enables the computer processor to perform a method for storing data ...

Smart selection of a storage module to be excluded

Provided are a computer program product, computer system, and method for smart selection of a storage module to be excluded when a connection between two storage modules is broken. An indication is received from a first storage module that a connection between the first storage module and a second storage module is broken. In response to determining that the second storage module is accessible, values of exclusion criteria for the first storage module are determined and summed to identify a first exclusion total. Then, values of exclusion criteria for the second storage module are determined and summed to identify a second exclusion total. In response to determining that the first exclusion total exceeds the second exclusion total, the second storage node is excluded from the cluster. In response to determining that the second exclusion total exceeds the first exclusion total, the first storage node is excluded from the cluster.

Information processing apparatus and information processing method

An information processing apparatus includes a memory and a processor coupled to the memory. The processor is configured to determine, when a simultaneous distribution is made to a plurality of destinations, whether a first communication situation in the information processing apparatus is worse than a predetermined reference. The processor is configured to select a request destination from among the plurality of destinations upon determining that the first communication situation is worse than the predetermined reference. The processor is configured to request the request destination to perform the simultaneous distribution to part of the plurality of destinations except for the request destination.

NODE DIAGNOSIS APPARATUS AND SYSTEM

Embodiments of this disclosure provide a node diagnosis apparatus and system. The node diagnosis apparatus includes: a first receiving unit configured to receive notifications related to busyness/idleness of channels reported by other nodes; a first transmitting unit configured to, when the first receiving unit receives a first notification related to busyness/idleness of channels reported by a first node and a second notification related to busyness/idleness of channels reported by a second node and the first node and the second node are in different basic service sets, transmit a control signal to the first node and the second node; a second receiving unit configured to receive one or more first parameters reported by the first node and one or more second parameters reported by the second node; and a first determining unit configured to determine that the first node and the second node are exposed nodes when the one or more first parameters and the one or more second parameters satisfy a predetermined condition. With the embodiments of this disclosure, whether a node is an exposed node may be well identified, with complexity of identification being low, and signaling being simple. 1. A node diagnosis apparatus , configured in a control node , characterized in that the node diagnosis apparatus includes:a first receiving unit configured to receive notifications related to busyness/idleness of channels reported by other nodes;a first transmitting unit configured to, when the first receiving unit receives a first notification related to busyness/idleness of channels reported by a first node and a second notification related to busyness/idleness of channels reported by a second node and the first node and the second node are in different basic service sets, transmit a control signal to the first node and the second node, so that the first node and the second node simultaneously transmit test packets respectively within a first time according to the control signal;a ...

SYSTEM AND METHOD FOR SUPPORTING PERSISTENT STORE VERSIONING AND INTEGRITY IN A DISTRIBUTED DATA GRID

A system and method can support recovery of persisted data from persistent storage of a distributed data grid, and provide persistent store versioning and integrity. A coordinator in the distributed data grid can receive a plurality of identifiers from one or more members of the distributed data grid, wherein each said identifier is associated with a persisted partition in a persistent storage for the distributed data grid. Then, the coordinator can select an identifier for each partition, wherein each selected identifier is associated with a most recent valid version of a partition. Furthermore, the coordinator can determine an active member in the distributed data grid that is responsible for recovering said partition from a persisted partition associated with the selected identifier. 1. A method for recovering of persisted data from persistent storage in a distributed data grid comprising a plurality of members , wherein each of the plurality of members manages partitioned cache content held in the random access memory of a computer on which each member of the plurality of members respectively executes , the method comprising:accessing the persisted data by each active member of the plurality of members wherein the persisted data comprises a plurality of persisted partitions persisted by each member of the plurality of members, the plurality of persisted partitions each identified by a globally unique identifier (GUID) for each member's respective persisted partition, wherein each GUID for each respective persisted partition includes a partition number of the respective persisted partition, a version number of the respective persisted partition, and a member identifier that is an indication of which member generated the GUID of the respective persisted partition;reporting, to a coordinating member by each active member of the plurality of members, the GUID of each persisted partition of the plurality of persisted partitions that each active member, respectively, ...

FLEXIBLE BYZANTINE FAULT TOLERANCE

A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view. 1. A method for performing a flexible byzantine fault tolerant (BFT) protocol for a consensus , the method comprising:sending, from a client device, a proposed value to a plurality of replica devices;receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value, wherein the at least one of the plurality of replica devices determines to send the safe vote based on a first quorum being reached and the safe vote is sent to the client device and each of the other replica devices of the plurality of replica devices;determining that a number of received safe votes, received from the at least one of the replica devices, for the proposed value meets or exceeds a second quorum threshold;selecting the proposed value based on the determination;setting a period of time within which to receive additional votes from at least one of the plurality of replica devices, wherein the period of time is a network delay bound for a single view of the BFT protocol; andbased on the period of time elapsing without receiving the additional votes, committing the selected value ...

Dynamically Erectable Computer System

A fault-tolerant computer system architecture includes two types of operating domains: a conventional first domain (DID) that processes data and instructions, and a novel second domain which includes mentor processors for mentoring the DID according to “meta information” which includes but is not limited to data, algorithms and protective rule sets. The term “mentoring” (as defined herein below) refers to, among other things, applying and using meta information to enforce rule sets and/or dynamically erecting abstractions and virtualizations by which resources in the DID are shuffled around for, inter alia, efficiency and fault correction. Meta Mentor processors create systems and sub-systems by means of fault tolerant mentor switches that route signals to and from hardware and software entities. The systems and sub-systems created are distinct sub-architectures and unique configurations that may be operated as separately or concurrently as defined by the executing processes.

METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA PROCESSING

Embodiments of the present disclosure provide a method, a device and a computer program product for data processing. The method comprises determining, at a first node of a plurality of nodes of a metadata management system, a set of nodes from the plurality of nodes that store access information associated with a shard of metadata; determining, from the set of nodes, the number of available nodes capable of providing the shard; and adjusting the number of available nodes based on a threshold number. In this way, a distributed management of the shard of metadata in each node could be achieved without using the management node in a conventional way. 1. A method of data storage , comprising:determining, at a first node of a plurality of nodes of a metadata management system, a set of nodes from the plurality of nodes that store access information associated with a shard of metadata;determining, from the set of nodes, the number of available nodes capable of providing the shard; andadjusting the number of available nodes based on a threshold number.2. The method of claim 1 , wherein determining the set of nodes comprises:in response to receiving an access request for the shard, determining a set of nodes storing the access information associated with the shard.3. The method of claim 1 , wherein determining the set of nodes comprises:obtaining data to be queried periodically as the shard; anddetermining a set of nodes storing the access information associated with the shard.4. The method of claim 1 , wherein determining the set of nodes comprises:transmitting, to other nodes of the plurality of nodes than the first node, a first query request for the access information;determining, based on a response to the first query request received from the other nodes, a node from the other nodes that comprises the access information; anddetermining the set of nodes based on the determined node and the first node.5. The method of claim 4 , wherein the first query request comprises ...

Access point controller failover system

An access point IHS group controller failover system includes a first access point IHS group controller that controls a first access point IHS group that includes plurality of access point IHSs. Following a failure of the first access point IHS group controller, the first access point IHS broadcasts a first access point IHS identifier to a first subset of the plurality of access point IHSs. The first access point IHS then registers the first subset of the plurality of access point IHSs as members of a second access point IHS group, and controls at least some functions of the second access point IHS group. When the first access point IHS detects activity from the first access point IHS group controller, it instructs the first subset of the plurality of access point IHSs in the second access point IHS group to reconnect to the first access point IHS group controller.

RETAINING COMMITTED TRANSACTIONS DURING DATABASE CLUSTER REPLICATION

In an approach to improve asynchronous replication in database clusters embodiments retain committed transactions during database cluster replication. Embodiments build and run asynchronous replication logic using database nodes running as one or more standalone nodes, wherein the asynchronous replication logic is responsible for data replication from a primary database node to one or more secondary database nodes. Embodiments register a replication reader to a sender node to replicate journal logs and replay the journal logs on the one or more secondary database nodes. Further, embodiments monitor replication lag metrics from the sender node and notify a replication source and a replication target of a generated replication plan, wherein the cluster controller instructs the replication source and the replication target to be ready to initiate the replication plan. Additionally, embodiments adjust a replication plan to allow the asynchronous replication logic to catch up and complete uncommitted transactions. 1. A computer-implemented method for retaining committed transactions during database cluster replication , the computer-implemented method comprising:building and running asynchronous replication logic using database nodes running as one or more standalone nodes, wherein the asynchronous replication logic is responsible for data replication from a primary database node to one or more secondary database nodes;registering a replication reader to a sender node to replicate journal logs and replay the journal logs on the one or more secondary database nodes;monitoring, by a cluster controller, replication lag metrics from the sender node;notifying, by the cluster controller, a replication source and a replication target of a generated replication plan, wherein the cluster controller instructs the replication source and the replication target to be ready to initiate the replication plan; andadjusting, by the cluster controller, a replication plan to allow the ...

EFFICIENT, TIME-BASED LEADER NODE ELECTION IN A DISTRIBUTED COMPUTING SYSTEM

A same voting time, a same vote counting time, and a same leader node tenure is configured by a host for all nodes. Time configuration information including the same configured voting time, the same vote counting time, and the same leader node tenure, is sent to all the nodes. The nodes are operable to vote during the same voting time, count the number of votes during the same vote counting time, and elect a leader node according to a vote counting result. The nodes are enabled to perform periodic node election according to the same leader node tenure. 1. A computer-implemented method , comprising:sending, by a host, time configuration information that includes a same voting time, a same vote counting time, and a same leader node tenure to all nodes, the nodes operable to vote during the same voting time, count a number of votes during the same vote counting time, and elect a leader node according to a vote counting result, wherein the nodes are enabled to perform periodic node election according to the same leader node tenure.2. The computer-implemented method of claim 1 , further comprising:when there is no leader node among all nodes, sending, by at least one node, a voting request to all the nodes during a voting time that is included in time configuration information;receiving, by each node, vote information that is generated by other nodes according to the voting request;counting, by each node in a vote counting time that is included in the time configuration information, the number of votes included in the vote information; anddetermining, by the nodes, a leader node according to the respective number of votes included in the vote information, to process a specified service.3. The computer-implemented method of claim 2 , further comprising terminating the receiving of the vote information before starting the counting.4. The computer-implemented method of claim 2 , wherein determining claim 2 , by the nodes claim 2 , a leader node according to the respective ...

System and method for ending view change protocol

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain maintained by a number (N) of nodes and performed by a first node of the N nodes that is in a view change protocol. The method includes: obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising ( 1 ) a consistent current view known to the second node indicating a primary node designated among the N nodes and ( 2 ) a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, wherein the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q first messages, ending the view change protocol.

Techniques to manage non-disruptive san availability in a partitioned cluster

Techniques to managing non-disruptive SAN availability in a partitioned cluster comprising one or more components configured to determine whether to separate a cluster into two or more partitions, notify one or more responsive cluster nodes to separate the cluster into a first partition and a second partition, update one or more access states, notify the host that access states of one or more network paths has been updated, and provide the one or more access states. Other embodiments are described and claimed.

System and method for supporting persistent store versioning and integrity in a distributed data grid

A system and method can support persistence in a distributed data grid, such as persistent store versioning and integrity. A resolver in the distributed data grid can receive a plurality of identifiers from one or more members of the distributed data grid, wherein each said identifier is associated with a persisted partition in a persistent storage for the distributed data grid. Then, the resolver can select an identifier for each partition, wherein each selected identifier is associated with a most recent valid version of a partition. Furthermore, the resolver can determine a member in the distributed data grid that is responsible for recovering said partition from a persisted partition associated with the selected identifier.

Environmental Aware Witness for Active-Active Storage Cluster Nodes

The system, devices, and methods disclosed herein relate to a dynamic, robust method for choosing a “winner” in an active-active data storage network. In the systems and methods disclosed herein, two or more intelligent nodes within an active-active data storage network periodically exchange operational parameters in an ongoing negotiation regarding who should be the winner in the event of a communication failure within the network. The winner is chosen dynamically based on the operational parameters. A witness is kept apprised of the winner. In the event of a communication failure between the two nodes, the winner is chosen by the witness based on the most recently negotiated lock file reported by one or both of the nodes. 1. A method for dynamically assigning a winning node in an active-active data storage network comprising the steps of:sending a first operational parameter from a first node to a second node;sending a second operational parameter from the second node to the first node, the first and second nodes being part of an active-active data storage network;negotiating between the first and second nodes which would be the winner in the event a quality measurement of a communication link between the first and second nodes falls below a threshold value, wherein the negotiation includes evaluating the first and second operational parameters;choosing a winner based on at least the first and second operational parameters;recording a winner in a lock file; andtransmitting the lock file to a witness.2. The method of claim 1 , wherein the first operational parameter and the second operation parameter correspond to an equivalent parameter as between the first node and the second node.3. The method of claim 1 , wherein the first operational parameter or the second operational parameter is a measure of a cache availability.4. The method of claim 1 , wherein the first operational parameter is a health measurement for the first node.5. The method of claim 1 , wherein ...

RLC Reconfiguration During Cell Reselection

It is provided a method, including detecting whether or not a terminal has completed a reconfiguration of a radio bearer based on a first reconfiguration message, wherein the first reconfiguration message provides a first configuration of a first radio bearer in a first cell; detecting whether or not a cell update message is received from the terminal, wherein the cell update message indicates that the terminal has performed a cell update from the first cell to a second cell different from the first cell; triggering, if the terminal has not completed the reconfiguration and the cell update message is received, providing a second reconfiguration message to the terminal, wherein the second reconfiguration message provides a second configuration of a second radio bearer in the second cell. 1. Apparatus , comprisingreconfiguration detecting means adapted to detect whether or not a terminal has completed a reconfiguration of a radio bearer based on a first reconfiguration message, wherein the first reconfiguration message provides a first configuration of a first radio bearer in a first cell;cell update detecting means adapted to detect whether or not a cell update message is received from the terminal, wherein the cell update message indicates that the terminal has performed a cell update from the first cell to a second cell different from the first cell;triggering means adapted to trigger, if the terminal has not completed the reconfiguration and the cell update message is received, providing a second reconfiguration message to the terminal, wherein the second reconfiguration message provides a second configuration of a second radio bearer in the second cell.2. The apparatus according to claim 1 , whereinthe reconfiguration detecting means is adapted to detect that the terminal has not completed the reconfiguration if it detects a set reconfiguration status indicator in the cell update message.3. The apparatus according to claim 1 , whereinthe reconfiguration detecting ...

System and method for adjusting membership of a data replication group

A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. A master replica for a replica group may increment a membership version indicator for the group, and may propagate metadata (including the membership version indicator) indicating a membership change for the group to other members of the group. Propagating the metadata may include sending a log record containing the metadata to the other replicas to be appended to their respective logs. Once the membership change becomes durable, it may be committed. A replica attempting to become the master of a replica group may determine that another replica in the group has observed a more recent membership version, in which case logs may be synchronized or snipped, or the attempt may be abandoned.

SET BUFFER STATE INSTRUCTION

Input/output (I/O) operation requests from pageable storage mode guests are interpreted without host intervention. In a pageable mode virtual environment, requests issued by pageable storage mode guests are processed by one or more processors of the environment absent intervention from one or more hosts of the environment. Processing of the requests includes manipulating, by at least one processor on behalf of the guests, buffer state information stored in host storage. The manipulating is performed via instructions initiated by the guests and processed by one or more of the processors. 1. A computer program product for executing an instruction in a computing environment , said computer program product comprising: obtaining, based on executing the instruction, an indication of one or more buffers for which state is to be set; and', 'setting the state of the one or more buffers based on state specified by an operand associated with the instruction., 'executing an instruction, the instruction having an operation code, the operation code specifying a set buffer state operation, the executing comprising, 'a computer readable storage medium readable by a processing circuit and storing instructions for performing a method comprising2. The computer program product of claim 1 , wherein the one or more buffers are queued direct input/output buffers.3. The computer program product of claim 1 , wherein the state of the one or more buffers is changed between program owned and adapter owned.4. The computer program product of claim 1 , wherein the instruction further comprises a first register field to be used in obtaining the indication of the one or more buffers for which state is to be set.5. The computer program product of claim 4 , wherein the first register field includes a specification of a queue and a buffer of the queue for which state is to be set claim 4 , the buffer of the queue being one of the one or more buffers for which state is to be set.6. The computer program ...

Fault-tolerant data processing computer system and method for implementing a distributed two-tier state machine

A fault-tolerant data processing computer system and method for implementing a distributed two-tier state machine aimed for distributed (replicated) data stores, in which consistency is maintained despite the failure of any number of replicas and communication paths. In the distributed two-tier state machine, one process (device) in a network of processes (devices) is chosen as the leader, and that leader is responsible for executing functions that return state machine commands, and for broadcasting the commands to the other processes. The processes execute the commands in the logical precedence order that corresponds to the order of function executions that return these commands. The system and method ensures that each of the processes issues exactly the same sequence of commands for execution, such that each command in the sequence, except the first one, has a precedent command on which the command logically depends.

System and method for recovering from a configuration error

A system and method for recovering from a configuration error are disclosed. A Basic Input Output System (BIOS) configures a memory associated with a node of an information handling system and enables a progress monitoring process during configuration of the memory. The memory is disabled if the BIOS determines that a configuration error occurred and a memory reference code associated with the memory is modified in order to prevent a reset of the information handling system.

SYSTEM AND METHOD FOR DATA REPLICATION USING A SINGLE MASTER FAILOVER PROTOCOL

A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master. 135.-. (canceled)36. A system , comprising: include, in a failover quorum, ones of the plurality of replicas other than the candidate replica identified to support the attempt of the candidate replica to assume the first role; and', 'assume the first role, based on a determination that a number of replicas included in the failover quorum meets or exceeds a pre-determined number of replicas., 'acquire a lock from an external lock manager, and responsive to acquisition of the lock, 'a plurality of replicas that collectively form a replica group, wherein the plurality of replicas store data on respective computing nodes of a plurality of computing nodes that collectively implement a data store, wherein at most one of the plurality of replicas can perform a first role for the replica group, and wherein, to attempt to assume the first role for the replica group, a candidate replica of the plurality of replicas is configured to37. The system of claim 36 , wherein:the replica group maintains an indicator of membership version, and 'determine that the replica has not ...

Proactive Node Preference Changing in a Storage Controller

Disclosed is a computer-implemented method in a storage controller of changing a preferred node from a first node to a second node, comprising: receiving a notification of a request to remove the first node; reporting ports on the first node as non-preferred instead of reporting them as preferred; reporting ports on the second node as preferred instead of reporting them as non-preferred; compiling a target port groups report for each of the first node and the second node; and raising an asymmetric access state changed unit attention notification. 1. A computer-implemented method , in a storage controller , of changing a preferred node from a first node to a second node , the computer-implemented method comprising:receiving a notification of a request to remove the first node;reporting ports on the first node as non-preferred instead of reporting them as preferred;reporting ports on the second node as preferred instead of reporting them as non-preferred;compiling a target port groups report for each of the first node and the second node; andraising an “Asymmetric Access State Changed” unit attention notification.2. The computer-implemented method of claim 1 , wherein access to logical units (LUNs) presented by the storage controller supports Asymmetric Logical Unit Access and wherein each target port group corresponding to ports on the first node and the second node have different asymmetric access states.3. The computer-implemented method of claim 1 , wherein non-preferred ports correspond to ports in a port group with an “Active/Non-Optimized” asymmetric access state and preferred ports correspond to ports in a port group with an “Active/Optimized” asymmetric access state.4. The computer-implemented method of claim 1 , wherein a host has access to the storage controller and in response to a unit attention condition being established:the host issues a “Report Target Port Group” command;the host waits for the “Asymmetric Access State Changed” unit attention ...

Method and Apparatus for Redundancy in Active-Active Cluster System

A method is applied to a system including a host cluster and at least one pair of storage arrays. The host cluster includes a quorum host, which includes a quorum unit. The quorum host is an application host having a quorum function. A pair of storage arrays includes a first storage array and a second storage array. The quorum host receives a quorum request, temporarily stops delivering a service to the first storage array and the second storage array, determines, from the first storage array and the second storage array, which is a quorum winning storage array and which is a quorum losing storage array according to logic judgment, stops the service with the quorum losing storage array, sends quorum winning information to the quorum winning storage array, and resumes the delivered service between the host cluster and the quorum winning storage array. 1. An active-active (AA) storage system , comprising:a host cluster comprising a first quorum host having a quorum function; anda pair of storage arrays coupled to the host cluster, wherein the pair of storage arrays comprises a first storage array and a second storage array, send a first quorum request to the first quorum host when the first storage array fails to contact the second storage array; and', 'keep the first storage array accessible to the host cluster,, 'wherein the first storage array is configured towherein the second storage array is configured to send a second quorum request to the first quorum host after the first storage array sends the first quorum request, 'grant the first storage array to be a winner based on the first quorum request and the second quorum request, and deny accessibility of the second storage array to the host cluster based on granting the first storage array to be the winner.', 'wherein the first quorum host is configured to2. The AA storage system of claim 1 , wherein the AA storage system does not deploy a quorum server to implement the first quorum request or the second quorum ...

FAULT TOLERANT DISTRIBUTED TASKS USING DISTRIBUTED FILE SYSTEMS

Data files in a distributed system sometimes becomes unavailable. A method for fault tolerance without data loss in a distributed file system includes allocating data nodes of the distributed file system among a plurality of compute groups, replicating a data file among a subset of the plurality of the compute groups such that the data file is located in at least two compute zones, wherein the first compute zone is isolated from the second compute zone, monitoring the accessibility of the data files, and causing a distributed task requiring data in the data file to be executed by a compute instance in the subset of the plurality of the compute groups. Upon detecting a failure in the accessibility of a data node with the data file, the task management node may redistribute the distributed task among other compute instances with access to any replica of the data file. 1. A computer-implemented method , comprising:receiving a first request to store data;determining, based at least in part on the first request, a plurality of zones associated with a distributed file system, each zone of the plurality being isolated from a remainder of the plurality such that the data remains available for retrieval if only one zone of the plurality of zones is available;storing the data in the distributed file system using each zone of the plurality of zones;receiving a second request to process the data;determining, based at least in part on the second request and the plurality of zones, a set of groups of resources capable of processing the second request, a first group of the set of groups being associated with a first zone of the plurality of zones, and a different second group of the set of groups being associated with a different second zone of the plurality of zones;determining that the first group is unavailable as a result of the first zone being unavailable; andprocessing the second request using the second group.2. The computer-implemented method of claim 1 , further ...

Systems and Methods for Data Synchronization and Failover Management

A Data Synchronization and Failover Management (DSFM) system monitors simultaneous execution of non-identical instances of a software application and may label as a particular result of the software application the earliest output corresponding to that result produced by one of the instances. The DSFM may label one of the instances as a primary instance and the other instances as secondary instances and, if the primary instance fails, may re-label one of the secondary instances that computed all of the operations associated with the last result produced prior to the failure of the primary instance, as a new primary instance. 1. A method for executing an application expeditiously on at least one computer processor , the method comprising:simultaneously executing a plurality of instances of the application on the at least one computer processor, each instance being compiled according to a respective compiler option that is different from respective compiler options used to compile all other instances from the plurality of instances; and monitoring, corresponding to the result, a respective output generated by each instance; and', 'labelling from the monitored outputs the output occurring earliest as output of the application corresponding to the result, and labelling all other outputs as duplicates, thereby speeding up a computing performance of the at least one computer processor., 'for each one of a first plurality of results to be produced by the application2. The method of claim 1 , wherein:the plurality of instances comprises a first instance and a second instance;the compiler option for the first instance comprises ahead-of-time (AIT) compilation; andthe compiler option for the second instance comprises just-in-time (JIT) compilation, wherein JIT compilation is based on, at least in part, runtime information obtained from at least one prior execution of the second instance.3. The method of claim 1 , wherein:the plurality of instances comprises a first instance; ...

METHODS AND SYSTEMS OF MANAGING CONSISTENCY AND AVAILABILITY TRADEOFFS IN A REAL-TIME OPERATIONAL DBMS

in one aspect, a computerized method for managing consistency and availability tradeoffs in a real-time operational database management system (DBMS) includes the step of implementing consistency in an AP mode of the real-time operational DBMS by implementing the following steps. The method adds a set of schemes that enable a real-time operational DBMS to linearize read/write operations in all situations except a first specified situation and a second specified situation. The real-time operational DBMS is in AP mode, at least one master node for every data item is available in the database cluster of the real-time operational DBMS at all times. The method implements a CP mode of operation. 1. A computerized method for managing consistency and availability tradeoffs in a real-time operational database management system (DBMS) comprising: 'adding a set of schemes that enable a real-time operational DBMS to linearize read/write operations in all situations except a first specified situation and a second specified situation, wherein when the real-time operational DBMS is in AP mode, at least one master node for every data item is available in the database cluster of the real-time operational DBMS at all times; and', 'implementing consistency in an AP mode of the real-time operational DBMS by;'}implementing a CP mode of operation.2. The computerized method of claim 1 , wherein the first specified comprises detecting that a split-brain partition occurs in a database cluster of the real-time operational DBMS.3. The computerized method of claim 2 , wherein the second specified situation comprises detecting that a number of nodes are simultaneously lost due to failures.3. The computerized method of claim 2 , wherein the number of nodes that are simultaneously lost due to failures is determined greater than the replication count.4. The computerized method of claim 3 , wherein the at least one master node for every data item is available in the database cluster of the the real ...

HARMONIZATION OF FAILURE DOMAINS IN A DISTRIBUTED SYSTEM

Harmonization of failure domains in a distributed system is provided herein. A data storage system as described herein can include a memory that stores computer executable components and a processor that executes computer executable components stored in the memory. The computer executable components can include a node assignment component that assigns computing nodes in the data storage system to respective failure domains of a set of data failure domains, a hashing component that generates hashing information associated with respective computing nodes of the computing nodes assigned to a selected failure domain of the set of failure domains, and a group update component that designates at least one computing node of the computing nodes in the selected data failure domain to perform an operation associated with the hashing information. 1. A data storage system , comprising:a memory that stores computer executable components; and a node assignment component that assigns computing nodes in the data storage system to respective failure domains of a set of failure domains;', 'a hashing component that generates hashing information associated with respective computing nodes of the computing nodes assigned to a selected failure domain of the set of failure domains; and', 'a group update component that designates at least one computing node of the computing nodes in the selected failure domain to perform an operation associated with the hashing information., 'a processor that executes computer executable components stored in the memory, wherein the computer executable components comprise2. The data storage system of claim 1 , wherein the computer executable components further comprise:a lock data management component that assigns client lock data for a client associated with the data storage system to a first computing node of the computing nodes in the selected failure domain in response to the first computing node being designated by the group update component.3. The data ...

System and Method for Storage System Node Fencing

A method, computer program product, and computing system for receiving, at a first baseboard management controller (BMC) of a first node, a fence request from a central processing unit (CPU) of the first node. The first BMC of the first node may communicate with a second BMC of a second node, wherein the first node and the second node are communicatively coupled to a plurality of storage drives. The first BMC and the second BMC may determine which node of the first node and the second node to fence from the plurality of storage drives. One of the first node and the second node may be fenced, via one of the first BMC and the second BMC, from the plurality of storage drives, thus defining a fenced node.

System and method for data replication using a single master failover protocol

A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master.

MAINTAINING COMPONENTS OF NETWORKED NODES WITH DISTRIBUTED DATA DEPENDENCIES

Methods, systems and computer program products for maintaining components of networked nodes with distributed data dependencies are described. For example, in accordance with one or more embodiments, a method can comprise identifying, by a device comprising a processor, in a group of dependent nodes of a cluster of nodes, a first portion of the dependent nodes for which an update is implicated. The method can further comprise selecting, by the device, from the first portion, a second portion of the dependent nodes that are predicted to be able to be updated with the update without affecting access to data of the group of dependent nodes. Further, the method can comprise communicating, by the device, the update to the second portion of the dependent nodes. 1. A method , comprising:identifying, by a device comprising a processor, in a group of dependent nodes of a cluster of nodes, a first portion of the dependent nodes for which an update is implicated;selecting, by the device, from the first portion, a second portion of the dependent nodes that are predicted to be able to be updated with the update without affecting access to data of the group of dependent nodes; andcommunicating, by the device, the update to the second portion of the dependent nodes.2. The method of claim 1 , wherein the group of dependent nodes comprises a redundant array of an independent disks system.3. The method of claim 2 , wherein the data of the group of dependent nodes is first data claim 2 , and wherein the redundant array of the independent disks system comprises second data corresponding to a parity protected stripe of data that spans the redundant array of the independent disks system.4. The method of claim 1 , wherein the selecting the second portion of the dependent nodes comprises selecting the second portion of the dependent nodes based on a journal shared between nodes of the second portion of the dependent nodes.5. The method of claim 1 , wherein the data of the group of ...

Fastener cartridge comprising non-uniform fasteners

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle.

ARBITRATION PROCESSING METHOD AFTER CLUSTER BRAIN SPLIT, QUORUM STORAGE APPARATUS, AND SYSTEM

The present disclosure discloses an arbitration processing solution when brain split occurs in cluster. The solution includes: receiving, by a quorum storage apparatus within a first refresh packet detection period, first master quorum node preemption requests sent by at least two quorum nodes in the cluster; sending, by the quorum storage apparatus, a first master quorum node preemption success response message to the initial master quorum node indicating that the initial master quorum node succeeds in master quorum node preemption when the first master quorum node preemption requests received within the first refresh packet detection period comprise the master quorum node preemption request sent by the initial master quorum node. 1. A method performed by a quorum storage apparatus for arbitration processing , in a system comprising a cluster and the quorum storage apparatus , wherein the cluster comprises at least two quorum nodes and one of the at least two quorum nodes in the cluster is pre-recorded as an initial master quorum node , the method comprising:receiving, by the quorum storage apparatus within a first refresh packet detection period, first master quorum node preemption requests sent by the at least two quorum nodes in the cluster when a brain split occurs in the cluster;determining, by the quorum storage apparatus, whether the first master quorum node preemption requests sent by the at least two quorum nodes in the cluster comprise a master quorum node preemption request sent by the initial master quorum node; andsending, by the quorum storage apparatus, a first master quorum node preemption success response message to the initial master quorum node indicating that the initial master quorum node succeeds in master quorum node preemption when the first master quorum node preemption requests received within the first refresh packet detection period comprise the master quorum node preemption request sent by the initial master quorum node.2. The method ...

Core repair with failure analysis and recovery probe

An apparatus for core repair includes a failure analysis and recovery (“FAR”) probe that accesses a core of a processor and units of the core over a low-level communication bus while the core is operational after a failure notification. The FAR probe compares operational data of the core versus vital product data (“VPD”) while the core is running tests and a thermal, power, functional (“TPF”) workload to determine if the core is in a degraded state and runs tests to identify a failure after determining that the core is in a degraded state. The FAR probe adjusts parameters of the core in response to identifying a failure of the core and re-evaluates the core to determine if the core is functional. The FAR probe returns the core to service after determining that the core is functional. The FAR probe operates independent of other processor cores while the cores are operational.

HIGH AVAILABILITY SCHEDULER FOR SCHEDULING MAP-REDUCE SEARCHES

A high availability scheduler of tasks in a cluster of server devices is provided. A server device of the cluster of server devices enters a leader state based upon the results of an election process in which the server device participates with others of the cluster of server devices. Upon entering the leader state, the server device schedules one or more tasks by assigning each of the one or more tasks to a device, wherein the one or more tasks involve initiating a search of time stamped events. 1. A method comprising:entering, by a server device of a plurality of server devices, a leader state based upon a result of an election process in which the server device participates with the plurality of server devices;based on being in the leader state, scheduling, by a processing device of the server device, one or more tasks by assigning each of the one or more tasks to one or more of the plurality of server devices, wherein the one or more tasks involve initiating a map-reduce search of a plurality of events, wherein an event of the plurality of events comprises raw data associated with a time stamp;receiving a confirmation that the one or more tasks have been performed; anddetermining, based on the confirmation, a location in storage of results of the one or more tasks.2. The method of claim 1 , wherein the time stamp is based on when the event is recorded claim 1 , and wherein the time stamp is extracted from the raw data of the event.3. The method of claim 1 , wherein the location is comprised in the confirmation.4. The method of claim 1 , wherein the election process comprises a Raft consensus election process.5. The method of claim 1 , further comprising continuing participation in the election process after entering the leader state to enable another server device in the plurality of server devices to assume scheduling responsibilities in case of computer or network breakdown affecting the server device.6. The method of claim 4 , further comprising continuing ...

Resource Processing Method and Device for Multi-controller System

A resource processing method and device for a multi-controller system are provided. The method includes that: when a controller in the multi-controller system may not sense existence of a peer controller, the controller judges whether the peer controller loads a first resource pool according to a first use tag stored in the first resource pool previously loaded by the peer controller. 1. A resource processing method for a multi-controller system , comprising:a controller in the multi-controller system cannot sense existence of a peer controller in the multi-controller system; andjudging, by the controller, whether the peer controller loads a first resource pool according to a first use tag stored in the first resource pool previously loaded by the peer controller, wherein the first use tag identifying whether the peer controller loads the first resource pool or not.2. The method as claimed in claim 1 , wherein claim 1 , before judging claim 1 , by the controller claim 1 , whether the peer controller loads the first resource pool according to the first use tag claim 1 , the method further comprises:writing, by each controller in the multi-controller system, the first use tag into a respectively loaded resource pool at regular intervals, wherein the first use tag identifying whether the controller loads the resource pool of the controller or not.3. The method as claimed in claim 1 , wherein claim 1 , under the condition that the controller judges that the peer controller does not load the first resource pool according to the first use tag claim 1 , the method further comprises:writing, by the controller, a second use tag indicating the controller to load the first resource pool into the first resource pool, and loading the first resource pool.4. The method as claimed in claim 3 , wherein claim 3 , after writing claim 3 , by the controller claim 3 , the second use tag indicating the controller to load the first resource pool into the first resource pool claim 3 , the ...

FASTENER CARTRIDGE COMPRISING NON-UNIFORM FASTENERS

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle. 1. A staple cartridge for use with a surgical instrument , wherein said staple cartridge comprises: a proximal end;', 'a distal end;', 'a first longitudinal row of staple cavities; and', 'a second longitudinal row of staple cavities;, 'a cartridge body, comprising a base;', 'a first proximal leg extending from said base at a first proximal angle; and', 'a first distal leg extending from said base at a first distal angle, wherein said first proximal angle is different than said first distal angle; and, 'a plurality of first staples, wherein each said first staple is positioned in said first longitudinal row of staple cavities, and wherein each said first staple comprisesa plurality of second staples, wherein each said second staple is positioned in said second longitudinal row of staple cavities.2. The staple cartridge of claim 1 , wherein each said second staple is positioned in said second longitudinal row of staple cavities claim 1 , and wherein each said second staple comprises:a second base;a second proximal leg extending from said second base at a second proximal angle; anda ...

FASTENER CARTRIDGE COMPRISING NON-UNIFORM FASTENERS

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle. 1. A staple cartridge for use with a surgical instrument , wherein said staple cartridge comprises: a proximal end;', 'a distal end;', 'a first longitudinal row of staple cavities; and', 'a second longitudinal row of staple cavities;, 'a cartridge body, comprising a base;', 'a first proximal leg extending from said base at a first proximal angle; and', 'a first distal leg extending from said base at a first distal angle, wherein said first proximal angle is different than said first distal angle; and, 'a plurality of first staples, wherein each said first staple is positioned in said first longitudinal row of staple cavities, and wherein each said first staple comprisesa plurality of second staples, wherein each said second staple is positioned in said second longitudinal row of staple cavities.2. The staple cartridge of claim 1 , wherein each said second staple is positioned in said second longitudinal row of staple cavities claim 1 , and wherein each said second staple comprises:a second base;a second proximal leg extending from said second base at a second proximal angle; anda ...

SYSTEM AND METHOD FOR DATA REPLICATION USING A SINGLE MASTER FAILOVER PROTOCOL

A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master. 1. A system , comprising:a plurality of computing nodes, each comprising at least one processor and memory, wherein the plurality of computing nodes is configured to implement a data storage service;wherein the data storage service maintains data on behalf of one or more storage service clients, wherein maintaining the data comprises storing two or more replicas of the data on respective computing nodes in the system, wherein the two or more replicas make up a replica group, wherein the replica group maintains an indicator of its membership version, wherein the membership version is updated each time the membership of the replica group changes, wherein at most one of the replicas in the replica group can act as a master replica for the replica group at a time, and wherein replicas in the replica group that are not acting as the master replica act as slave replicas in the replica group; acquiring a lock associated with the replica group, wherein only one of the two or more replicas can hold the lock at a time;', 'gathering state information from at least some of ...

SYSTEM AND METHOD FOR DATA RETENTION IN A DECENTRALIZED SYSTEM

A node for use in a data management system includes a persistent storage and a data protection agent. The persistent storage stores data. The data protection agent makes an identification of a data protection strategy change event for the data; in response to the identification: makes a determination that the data protection strategy change event is a scale down event; in response to the determination: identifies a number of replicas of the data in other nodes that are in a predetermined state; makes a second determination that the number of the replicas of the data in the other nodes that are in the predetermined state exceeds a threshold specified by a data protection policy associated with the data protection strategy change event; and reduces the number of replicas that exceed the threshold to be less than the threshold in response to the second determination. 1. A node for use in a data management system , comprising:a persistent storage that stores data; and make an identification of a data protection strategy change event for the data;', make a determination that the data protection strategy change event is a scale down event;', identify a number of replicas of the data in other nodes that are in a predetermined state;', 'make a second determination that the number of the replicas of the data in the other nodes that are in the predetermined state exceeds a threshold specified by a data protection policy associated with the data protection strategy change event; and', 'reduce the number of replicas that exceed the threshold to be less than the threshold in response to the second determination., 'in response to the determination], 'in response to the identification], 'a data protection agent programmed to2. The node of claim 1 , wherein reducing the number of replicas that exceed the threshold to be less than the threshold comprises:sending a scale down command to at least one of the number of the replicas that exceeds the threshold,wherein the scale down ...

Fault Rectification Method, Device, and System

A distributed cluster system includes at least a first node, a second node, and a third node, where the first node and the second node have a latest log before a fault occurs, but the third node does not have the latest log before the fault occurs. A fault rectification method includes: setting, by the first node after the first node restarts due to the fault, a voting status of the first node to Voting Not Allowed, where the voting status is used to indicate whether the first node can vote in a process in which the distributed cluster system elects a leader; receiving a replicated-log-entry message from the second node; and setting the voting status of the first node to Voting Allowed, where the second node is a leader. 1. A fault rectification method applied to a distributed cluster system , wherein the distributed cluster system comprises at least a first node , a second node , and a third node , wherein the first node and the second node have a latest log before a fault occurs , wherein the third node does not have the latest log before the fault occurs , and wherein the method comprises:setting a voting status of the first node to a Voting Not Allowed state after the first node restarts due to the fault, wherein the voting status indicates whether the first node is able to vote in a process in which the distributed cluster system performs a leader election; andreceiving, by the first node, a replicated-log-entry message from the second node; andsetting the voting status of the first node to a Voting Allowed state,wherein the second node is a leader of the distributed cluster system.2. The method according to claim 1 , wherein the second node is a new leader elected by the distributed cluster system after the first node restarts due to the fault claim 1 , and wherein setting the voting status of the first node to the Voting Not Allowed state after the first node restarts due to the fault ensures that the third node cannot be elected as leader in the leader ...

Fastener cartridge comprising deployable tissue engaging members

A fastener cartridge can comprise a cartridge body including a plurality of cavities arranged in longitudinal rows. Some of the cavities can have fasteners removably stored therein. Other cavities can have deployable tissue engaging members stored therein which are movable from an undeployed position to a deployed position to engage tissue. In some instances, the fastener cartridge can include at least one longitudinal row of cavities which each include a deployable tissue engaging member. Such rows of cavities can comprise the outer-most rows of cavities in the fastener cartridge.

Fastener cartridge comprising a sled including longitudinally-staggered ramps

A fastener cartridge comprising a cartridge body comprising a tissue-supporting deck, a longitudinal slot, cavities, and ridges protruding from the tissue-supporting deck is disclosed. The fastener cartridge further comprises fasteners positioned in the cavities, drivers supporting the fasteners, and a sled configured to engage the drivers to fire the fasteners from the cavities during a firing stroke. The sled comprises a central portion and ramps. The ramps comprise a first ramp on a first side of the central portion, a second ramp on the first side of the central portion, a third ramp on a second side of the central portion, and a fourth ramp on the second side of the central portion. The first ramp, the second ramp, and the third ramp are longitudinally-staggered. The central portion comprises a hump intermediate the first ramp and the third ramp, and a stabilizer extending from the hump distally beyond the ramps.

Surgical stapling assembly comprising a firing member including a lateral extension

A surgical stapling assembly comprising an anvil, a cartridge channel, a staple cartridge configured to be operably positioned in the channel, a firing member, and a ramp is disclosed. The channel comprises a base, an elongate internal slot, and a proximal channel opening defined in the base. The elongate internal slot comprises an encased internal passageway. The proximal channel opening is separate from the elongate internal slot. The firing member is movable from a first position to a second position distal to the first position. The firing member comprises a lateral extension configured to be received in the encased internal passageway as the firing member travels through the elongate internal slot during a firing motion. The proximal channel opening is configured to indicate when the firing member is in the first position. The ramp is for guiding the lateral extension into the encased internal passageway during the firing motion.

Fastener cartridge comprising non-uniform fasteners

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle.

Fastener cartridge comprising non-uniform fasteners

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle.

Method and system for consistent cluster operational data in a server cluster using a quorum of replicas

A method and system for increasing the availability of a server cluster (60sub1-60sub5) while reducing its cost by requiring at a minimum only one node and a quorum replica set (57A) of storage devices (replica members) (58sub-1-58sub2) to form and continue operating as a cluster. A plurality of replica members maintain the cluster operational data and are independent from any given node. A cluster may be formed and continue to operate as long as one server node possesses a quorum (majority) of the replica members. This ensures that a new or surviving cluster has a least one replica member that belonged to the immediately prior cluster and is thus correct with respect to the cluster operational data. Update sequence numbers and/or timestamps are used to determine the most updated replica member from among those in the quorum for reconciling the other replica members.

STAPLE CARTRIDGE FOR USE WITH A SURGICAL STAPLER AND STAPLE CARTRIDGE FOR USE WITH A SURGICAL INSTRUMENT

CARTUCHO DE PRENDEDORES COMPREENDENDO PRENDEDORES NÃO UNIFORMES A presente invenção se refere a um cartucho de prendedores (2000) que pode compreender cavidades de prende dor (2050) dispostas em fileiras longitudinais. Um primeiro prendedor (2130) tendo uma primeira configuração e um segundo prendedor (2130) tendo uma segunda configuração podem ser armazenados em uma fileira longitudinal. Os primeiros prendedores que têm uma primeira configuração podem ser armazenados em uma primeira fileira longitudinal e os segundos prendedores que têm uma segunda configuração podem ser armazenados em uma segunda fileira longitudinal. Cada primeiro prendedor pode ter uma perna proximal (2132a), ou porção de perna, que se estende em um primeiro ângulo proximal (F) e uma perna distal (2132b), ou porção de perna, que se estende um em primeiro ângulo distal (G), e cada segundo prendedor pode ter uma perna proximal, ou porção de perna, que se estende em um segundo ângulo proximal e uma perna distal, ou porção de perna, que se estende em um segundo ângulo distal. O primeiro ângulo proximal pode ser diferente do segundo ângulo proximal e/ou o primeiro ângulo distal pode ser diferente do segundo ângulo distal. FASTENER CARTRIDGE COMPRISING NON-UNIFORM FASTENERS The present invention relates to a fastener cartridge (2000) which may comprise fastener cavities (2050) arranged in longitudinal rows. A first fastener (2130) having a first configuration and a second fastener (2130) having a second configuration may be stored in a longitudinal row. First fasteners having a first configuration may be stored in a first longitudinal row and second fasteners having a second configuration may be stored in a second longitudinal row. Each first fastener may have a proximal leg (2132a) or leg portion extending at a first proximal angle (F) and a distal leg (2132b) or leg portion extending at a first distal angle (F). G), and each second fastener may have a proximal leg, or leg portion, extending at a ...

Cartucho de prendedores para uso com um instrumento cirúrgico

CARTUCHO DE PRENDEDORES INCLUINDO EXTENSÕES QUE TÊM CONFIGURAÇÕES DIFERENTES. A presente invenção refere-se a um cartucho de prendedores que pode incluir: 1) um corpo de cartucho que compreende uma plataforma e uma pluralidade de cavidades para prendedores e 2) uma pluralidade de prendedores posicionada nas cavidades para prendedores. O corpo de cartucho pode compreender adicionalmente extensões que se estendem a partir da plataforma tendo tamanhos e/ou configurações diferentes. As extensões podem controlar o fluxo de tecido em relação à plataforma e/ou sustentar os prendedores à medida que eles são ejetados das cavidades para prendedores.

包括具有不同构型的延伸部的紧固件仓

本发明公开了一种紧固件仓，所述紧固件仓可包括(一)包括平台和多个紧固件腔的仓体和(二)定位在所述紧固件腔中的多个紧固件。所述仓体还可包括从所述平台延伸的具有不同尺寸和/或构型的延伸部。所述延伸部可控制组织相对于所述平台的流动和/或当所述紧固件从所述紧固件腔射出时支撑所述紧固件。

Fastener cartridge including non-uniform fastener

本发明公开了一种紧固件仓(2000)，所述紧固件仓可包括被布置成纵向排的紧固件腔(2050)。具有第一构型的第一紧固件(2130)和具有第二构型的第二紧固件(2130)可存储在纵向排中。具有第一构型的第一紧固件可存储在第一纵向排中，并且具有第二构型的第二紧固件可存储在第二纵向排中。每个第一紧固件可具有以第一近侧角度(F)延伸的近侧腿部(2132a)或腿部部分和以第一远侧角度(G)延伸的远侧腿部(2132b)或腿部部分，并且每个第二紧固件可具有以第二近侧角度延伸的近侧腿部或腿部部分和以第二远侧角度延伸的远侧腿部或腿部部分。所述第一近侧角度可不同于所述第二近侧角度和/或所述第一远侧角度可不同于所述第二远侧角度。

Surgical fastener cartridges with driver stabilizing arrangements

A fastener cartridge for use with a surgical instrument. The cartridge may include a cartridge body that has a series of staple pockets therein. A driver is movably supported in each staple pocket and is configured to operably support at least one surgical staple thereon. In one arrangement, at least some of the drivers may be formed with one or more laterally extending features that are configured to be received in correspondingly-shaped grooves in the cartridge body to provide lateral support to the driver as it is operably moved within the staple pocket. In other arrangements, at least one inwardly-extending features is formed in the inner wall surface of the pocket and is configured to be movably supported within correspondingly-shaped groove in the driver.

Fastener cartridge comprising tissue control features

A fastener cartridge can include, one, a cartridge body comprising a deck and a plurality of fastener cavities and, two, a plurality of fasteners positioned in the fastener cavities. The deck can comprise features for controlling the flow of tissue relative thereto. In some instances, the features can support the fasteners as they are ejected from the fastener cavities.

Fastener cartridge assemblies and staple retainer cover arrangements

A cover member for a surgical staple cartridge. The cover member is configured to retain a wedge sled within the staple cartridge in a starting position when the cover member is attached to the body of the staple cartridge. The cover member includes a top portion that covers all of the fastener openings in the deck of the staple cartridge when the cover is attached to the cartridge.

End effector comprising an anvil including projections extending therefrom

An end effector can comprise, one, a fastener cartridge including a plurality of fasteners stored therein and, two, an anvil configured to deform the fasteners. The anvil can further comprise extensions extending therefrom which can control the flow of tissue relative to the fastener cartridge and/or support the fasteners as they are ejected from the fastener cartridge. The extensions can having different sizes and/or configurations.

Fastener cartridge compromising fastener cavities including fastener control features

An end effector can comprise, one, a fastener cartridge including a plurality of fasteners stored therein and, two, an anvil configured to deform the fasteners. The anvil can further comprise extensions extending therefrom which can control the flow of tissue relative to the fastener cartridge and/or support the fasteners as they are ejected from the fastener cartridge. The extensions can having different sizes and/or configurations.

Fastener cartridge including a layer attached thereto

A fastener cartridge including a cartridge body and a layer mounted to said cartridge body is disclosed. The cartridge body can include projections extending therefrom and the layer can include apertures which correspond to the projections. The projections and the apertures can form a releasable interference fit therebetween to secure the layer to the cartridge body.

Fastener cartridge comprising non-uniform fasteners

A fastener cartridge can comprise fastener cavities arranged in longitudinal rows. A first fastener having a first configuration and a second fastener having a second configuration can be stored within a longitudinal row. First fasteners having a first configuration can be stored within a first longitudinal row and second fasteners having a second configuration can be stored within a second longitudinal row. Each first fastener can have a proximal leg, or leg portion, extending at a first proximal angle and a distal leg, or leg portion, extending at a first distal angle and each second fastener can have a proximal leg, or leg portion, extending at a second proximal angle and a distal leg, or leg portion, extending at a second distal angle. The first proximal angle can be different than the second proximal angle and/or the first distal angle can be different than the second distal angle.

Surgical end effectors with firing element monitoring arrangements

A surgical end effector including an elongate channel configured to operably support a staple cartridge therein and a firing element configured to move within the elongate channel between a starting and an ending position. Various arrangements include openings through the bottom of the elongate channel to permit viewing of the firing element as it moves between the starting and ending positions. An anvil may be supported for movable travel relative to the elongate channel and include a plurality of openings therethrough to permit viewing of the cutting element as it moves between the starting and ending positions. Various arrangements include a firing bar attached to the firing element that serves to move the firing element between the starting and ending position. The firing bar may be movably supported with a hollow shaft that has a plurality of openings therethrough for monitoring the position of the firing bar.

Task scheduler for a fault tolerant multiple node processing system

A task scheduler for a fault tolerant multiple node processing system having a task activity list storing a set of application tasks, a priority scan list storing a selected portion of the set of application tasks, a completion status list also storing the same selected portion of the set of application tasks. A wake-up sequencer transfers the application tasks from the task activity list to the priority scan list, and a priority scanner transfers the application tasks ready for execution from the priority scan list to a selection queue. A next task selector selects the next application task that its node will execute, and a task started register stores the identity of the application tasks completed by the other nodes. A task interactive consistency (TIC) handler updates the status of the application tasks stored in the task activity list, the priority scan list, and the completion status list in response to messages received from the other nodes identifying which nodes completed tasks. The task interactive consistency handler checks the scheduling process of each node by comparing the application tasks it reported to have started with the highest priority application task scheduled for that node in its selection queue.

Remote access and geographically distributed computers in a globally addressable storage environment

A computer system employs a globally addressable storage environment that allows a plurality of networked computers to access data by addressing even when the data is stored on a persistent storage device such as a computer hard disk and other traditionally non-addressable data storage devices. The computers can be located on a single computer network or on a plurality of interconnected computer networks such as two local area networks (LANs) coupled by a wide area network (WAN). The globally addressable storage environment allows data to be accessed and shared by and among the various computers on the plurality of networks.

Nonstop service system using voting and, information updating and providing method in the same

본 발명은 투표를 활용한 무정지 서비스 시스템 및 그 시스템에서의 정보 갱신 및 제공 방법에 관한 것이다. 이 무정지 서비스 시스템은 클라이언트를 구별하는 구별자를 기준으로 정보를 저장하고 관리하는 복수 개의 노드 그룹을 포함하며, 이 노드 그룹은 독립적으로 정보 저장 및 관리가 가능한 복수 개의 노드를 포함한다. 제어 배분 서버는 노드 그룹과 클라이언트 사이에 위치하며, 복수 개의 노드 그룹에 속한 각 노드의 상태 정보와 연결 정보를 관리한다. 제어 배분 서버는 클라이언트로부터의 정보 갱신 및 정보 제공 요청에 따라, 클라이언트에 해당하는 노드 그룹을 선택하여 정보 갱신 및 정보 제공 요청을 선택된 노드 그룹에 포함된 각 노드에게 전달하고, 각 노드로부터 정보 제공이 있는 경우에는 제공된 정보 중에서 최신성과 같은 특정 기준에 따라 투표로 선택된 정보를 클라이언트에게 제공한다. 본 발명에 따르면, 초기 서비스 시스템 구축에 있어서 서비스 이용량에 따른 투자가 가능하며 저 비용으로 고효율의 시스템 구축이 가능하다. 또한, 무정지 시스템 구축을 별다른 장비 추가 없이 효율적으로 할 수 있다.

Quorum architecture based on scalable software

Mixed-media telecommunication call set-up

一种在不同带宽的通信信道之间转换的方法，该方法包括步骤：在第一信道上建立数据通信，所述第一信道具有第一带宽；响应一个指示将要通信的数据中的变化的触发信号，在第二信道上建立数据通信，第二信道具有提供不同资源使用的带宽；一旦在第二信道上建立了数据通信，就释放第一信道。

Method and system for consistent cluster operational data in a server cluster using a quorum of replicas

A method and system for increasing the availability of a server cluster while reducing its cost by requiring at a minimum only one node and a quorum replica set of storage devices (replica members) to form and continue operating as a cluster. A plurality of replica members maintain the cluster operational data and are independent from any given node. A cluster may be formed and continue to operate as long as one server node possesses a quorum (majority) of the replica members. This ensures that a new or surviving cluster has a least one replica member that belonged to the immediately prior cluster and is thus correct with respect to the cluster operational data. Update sequence numbers and/or timestamps are used to determine the most updated replica member from among those in the quorum for reconciling the other replica members.

Fastener cartridge including the extension with various configuration

本发明公开了一种紧固件仓，所述紧固件仓可包括(一)包括平台和多个紧固件腔的仓体和(二)定位在所述紧固件腔中的多个紧固件。所述仓体还可包括从所述平台延伸的具有不同尺寸和/或构型的延伸部。所述延伸部可控制组织相对于所述平台的流动和/或当所述紧固件从所述紧固件腔射出时支撑所述紧固件。

Method and apparatus for managing clustered computer system

클러스터형 컴퓨터 시스템은 속도와 신뢰성에 대한 장점 모두를 제공한다. 그러나 클러스터 컴퓨터들 간의 통신이 절충되면(compromised) 상기 컴퓨터들은 혼돈되고 데이터베이스 파일은 손상(corrupt)될 수 있다. 본 발명의 방법 및 장치는 클러스터형 컴퓨터 시스템의 관리를 개선시키도록 사용된다. 특히, 시스템은 페일 오버(failover) 조건용으로 사용 가능한 노드의 개수를 확장한다. Clustered computer systems offer both speed and reliability advantages. However, if communication between clustered computers is compromised, the computers may be confused and database files may be corrupted. The method and apparatus of the present invention are used to improve management of clustered computer systems. In particular, the system expands the number of nodes available for failover conditions.

Method for transmitting data frame of mobile communication terminal in wireless lan

본 발명은 무선 랜에서 이동 통신 단말기의 데이터 프레임을 전송하는 방법에 관한 것으로서, AP (Access Point; AP)로부터 전송 채널(Transmission Channel)의 사용 권한을 부여 받을 때 미리 결정된 개수의 데이터 프레임들을 연속적으로 전송함으로써, 이동 통신 단말기의 송신 전력을 절감 시킬 수 있다. 이를 위한 본 발명은 전송하려는 데이터 프레임을 버퍼에 저장하고 상기 저장된 데이터 프레임의 전송을 결정하는 단계와, 상기 저장된 데이터 프레임의 전송이 결정될 때, 상기 저장된 데이터 프레임을 AP에 전송하는 단계를 포함하여 구성한다. The present invention relates to a method for transmitting a data frame of a mobile communication terminal in a wireless LAN, wherein a predetermined number of data frames are consecutively received when an access point (AP) is granted from a AP. By transmitting, the transmission power of the mobile communication terminal can be reduced. To this end, the present invention comprises the steps of storing the data frame to be transmitted in a buffer and determining the transmission of the stored data frame, and when the transmission of the stored data frame is determined, transmitting the stored data frame to the AP do.

Encrypted/scrambled information remote management control access having broadcasting centre transmitting control message security processor and exchange action instructions/replies subjected local security protocol inhibiting local viewing.

The remote management protocol has a broadcasting centre having access control to scrambled data through a descrambling terminal and an access control card or module with a security processor. The broadcasting centre transmits (A) to a receiver set or security processor a control message including input template fields, control applications data and a digital signal. The exchange of action instructions and replies between the terminal and the security processor are subjected (B) to a local security protocol inhibiting any local viewing in the security process and terminal.

High availability architecture for a cloud-based concurrent-access collaboration platform

Embodiments in the present disclosure include systems and methods related to a high-availability architecture for a cloud-based concurrent-access collaboration platform. The disclosed technology relates to an active data center which includes multiple document server instances that handle user requests for concurrently accessing documents. Multiple document server instances are implemented on a single physical server. This architecture uses an instance assignment manager to assign documents to the document server instances, a primary repository to store backup snapshots of the documents, and a datastore to store all changes made to the documents. The disclosed technology also involves a backup data center that can be swapped with the active data center automatically.

Transaction processing method, apparatus, and electronic device for blockchain

Fault processing method and device for nodes in cluster

本申请实施例涉及一种集群中节点的故障处理方法及设备。该方法包括获取集群的故障检测拓扑信息，该故障检测拓扑信息包含所述集群中所有节点之间的故障检测关系；获取故障指示消息，该故障指示消息用于指示检测节点到被检测节点不可达；根据故障检测拓扑信息，以及故障指示消息，确定集群中的子集群，其中，属于不同子集群中的节点互不可达；根据集群的子集群，确定工作集群。通过本申请实施例可以实现以较小的代价，最大程度的保留集群中的可用节点，提高了集群中可用节点的数量，确保了高可用性，降低了集群重启，业务不可用的概率，降低了故障恢复、业务迁移的开销。

Interpreting I/O operation requests from pageable guests without host intervention

Input/output (I/O) operation requests from pageable storage mode guests are interpreted without host intervention. In a pageable mode virtual environment, requests issued by pageable storage mode guests are processed by one or more processors of the environment absent intervention from one or more hosts of the environment. Processing of the requests includes manipulating, by at least one processor on behalf of the guests, buffer state information stored in host storage. The manipulating is performed via instructions initiated by the guests and processed by one or more of the processors.

Lock acquisition among nodes of divided cluster

The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.