Transactional contention management as a Non-clairvoyant scheduling problem (Q848634): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics / 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: Q4875172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293112 / rank
 
Normal rank

Revision as of 12:03, 2 July 2024

scientific article
Language Label Description Also known as
English
Transactional contention management as a Non-clairvoyant scheduling problem
scientific article

    Statements

    Transactional contention management as a Non-clairvoyant scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 March 2010
    0 references
    Scheduling
    0 references
    Transactions
    0 references
    Software transactional memory
    0 references
    Concurrency control
    0 references
    Contention management
    0 references

    Identifiers