Chang et al., 2001 - Google Patents
A generalized grid quorum strategy for k-mutual exclusion in distributed systemsChang et al., 2001
View PDF- Document ID
- 4494981431889345566
- Author
- Chang Y
- Chen B
- Publication year
- Publication venue
- Information Processing Letters
External Links
Snippet
In the problem of k-mutual exclusion, concurrent access to shared resource or the critical section (CS) must be synchronized such that at any time at most k processes can access the CS. In this paper, we propose a generalized grid quorum strategy for k-mutual exclusion …
- 238000000034 method 0 abstract description 5
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/202—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where processing functionality is redundant
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17356—Indirect interconnection networks
- G06F15/17368—Indirect interconnection networks non hierarchical topologies
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30575—Replication, distribution or synchronisation of data between databases or within a distributed database; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0721—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment within a central processing unit [CPU]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/70—Fault tolerant, i.e. transient fault suppression
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Saxena et al. | A survey of permission-based distributed mutual exclusion algorithms | |
Lang et al. | A torus quorum protocol for distributed mutual exclusion | |
Chiang et al. | On the arrangement graph | |
Liu et al. | A novel links fault tolerant analysis: g-good r-component edge-connectivity of interconnection networks with applications to hypercubes | |
Chang et al. | A generalized grid quorum strategy for k-mutual exclusion in distributed systems | |
Chang et al. | Fault-tolerant bipancyclicity of faulty hypercubes under the generalized conditional-fault model | |
Neamatollahi et al. | Info-based approach in distributed mutual exclusion algorithms | |
Lang et al. | A comparison of two torus-based k-coteries | |
Agrawal et al. | Analysis of quorum-based protocols for distributed (k+ 1)-exclusion | |
Kanrar et al. | A new voting-based mutual exclusion algorithm for distributed systems | |
Shen | An optimal O (NlgN) algorithm for permutation admissibility to extra-stage cube-type networks | |
Merritt et al. | Resilient consensus for infinitely many processes | |
Ajima | High-dimensional interconnect technology for the K computer and the supercomputer fugaku | |
Agrawal et al. | Efficient techniques for replicated data management | |
Wu et al. | A new quorum-based replica control protocol | |
Mabni et al. | A high availability cluster-based replica control protocol in data grid | |
Chang et al. | A fault-tolerant triangular mesh protocol for distributed mutual exclusion | |
Farahabady et al. | Characterization of spatial fault patterns in interconnection networks | |
Wang et al. | A probabilistic approach to fault-tolerant routing algorithm on mesh networks | |
Ueda et al. | On the availability of replicated data managed by hierarchical voting | |
Pandey et al. | Exploiting logical structures to reduce quorum sizes of replicated databases | |
Chang et al. | A BINARY FOREST QUORUM STRATEGY FOR K-MUTUAL EXCLUSION IN DISTRIBUTED SYSTEMS | |
Chang et al. | An extended degree-k-tree quorum strategy for k-mutual exclusion in distributed systems | |
Wang et al. | A new fault-tolerant broadcast routing algorithm on mesh networks | |
Gupta et al. | A lower bound on embedding tree machines with balanced processor utilization |