Contention-sensitive data structures and algorithms (Q526873): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2597711081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timeliness-based wait-freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrency of operations on B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of transactional contention managers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detectors to boost obstruction-freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent manipulation of binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient locking for concurrent operations on B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-free algorithms for fast, long-lived renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Programming: Algorithms, Principles, and Foundations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software transactional memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention-Sensitive Data Structures and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waiting in concurrent algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibility and impossibility results in a shared memory environment / rank
 
Normal rank

Latest revision as of 20:14, 13 July 2024

scientific article
Language Label Description Also known as
English
Contention-sensitive data structures and algorithms
scientific article

    Statements

    Contention-sensitive data structures and algorithms (English)
    0 references
    0 references
    15 May 2017
    0 references
    contention-sensitive
    0 references
    interference
    0 references
    synchronization
    0 references
    locks
    0 references
    shortcut code
    0 references
    disable-free
    0 references
    prevention-free
    0 references
    livelock
    0 references
    starvation
    0 references
    \(k\)-obstruction-free
    0 references
    wait-free
    0 references

    Identifiers