Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2009.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037854601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Certified Write-All Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing memory robustly in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Processor Failures and Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust randomized algorithm to perform independent tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-optimal message-efficient work performance in the presence of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic load balancing with group communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performing Work Efficiently in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient gossip and robust distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative computing with fragmentable and mergeable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performing work with asynchronous processors: Message-delay-sensitive bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Writing-all deterministically and optimally using a nontrivial number of asynchronous processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed scheduling for disconnected cooperation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emulating shared-memory do-all algorithms in asynchronous message-passing systems / rank
 
Normal rank

Latest revision as of 23:02, 4 July 2024

scientific article
Language Label Description Also known as
English
Emulating shared-memory do-all algorithms in asynchronous message-passing systems
scientific article

    Statements

    Emulating shared-memory do-all algorithms in asynchronous message-passing systems (English)
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    distributed algorithm
    0 references
    fault-tolerance
    0 references
    work
    0 references
    communication
    0 references
    quorums
    0 references

    Identifiers