[go: up one dir, main page]

Bracha et al., 1990 - Google Patents

Approximated counters and randomized consensus

Bracha et al., 1990

View PDF
Document ID
9256922951473169329
Author
Bracha G
Rachman O
Publication year

External Links

Snippet

This paper introduces a new shared data-type, approximated counter. This data-type offers a tradeoff between time and accuracy in operations on shared counters in distributed shared- memory wait-free environments. We use approximated counter to improve existing solutions …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • 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
    • G06F9/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7219—Countermeasures against side channel or fault attacks
    • 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
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/86—Event-based monitoring
    • 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/10—Complex mathematical operations

Similar Documents

Publication Publication Date Title
Anderson et al. Shared-memory mutual exclusion: major research trends since 1986
Millen Finite-state noiseless covert channels
Bonnet et al. Anonymous asynchronous systems: the case of failure detectors
Attiya et al. An adaptive collect algorithm with applications
CN111694839B (en) Time sequence index construction method and device based on big data and computer equipment
Delporte-Gallet et al. Shared memory vs message passing
Aguilera et al. Abortable and query-abortable objects and their efficient implementation
Liu et al. Top-$ k $ Queries for Categorized RFID Systems
Itai et al. Symmetry breaking in distributed networks
Bracha et al. Approximated counters and randomized consensus
Guerraoui et al. What can be implemented anonymously?
CN112927075A (en) Processing method and device for cross-chain transaction, electronic equipment and readable storage medium
Huang A distributed deadlock detection algorithm for CSP-like communication
Helmi et al. The space complexity of long-lived and one-shot timestamp implementations
CN104572414A (en) Method and system for detecting CPU (Central Processing Unit) occupancy rate of vxWorks
CN114238500A (en) Storage method, device, electronic device and readable storage medium for blockchain transaction
Alsmeyer On the Harris recurrence of iterated random Lipschitz functions and related convergence rate results
Aspnes et al. Relationships between broadcast and shared memory in reliable anonymous distributed systems
Bui et al. Snap-stabilizing PIF algorithm in tree networks without sense of direction
Danek et al. Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
Herlihy et al. Self stabilizing distributed queuing
CN116755073B (en) Method for resolving distance ambiguity by using lookup table and application
Cai et al. Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
Attiya et al. Time and space lower bounds for implementations using k-CAS
Ding et al. Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph