Dynamic Task Allocation in Asynchronous Shared Memory

DOI10.1137/1.9781611973402.31MaRDI QIDQ5383990zbMATH OpenOpenAlexFDO

Authors Dan Alistarh, James Aspnes, Rati Gelashvili, Michael A. Bender, Seth Gilbert

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.31

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 177544
• Efficient algorithms for dynamic allocation of distributed memory
• Dynamic scheduling in distributed transactional memory
• Cooperative asynchronous update of shared memory
• A Model for Asynchronous Shared Memory Parallel Computation
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• Task allocation in distributed processing systems
• An asynchronous protocol for release consistent distributed shared memory systems

Cited in

(3)

• Performing dynamically injected tasks on processes prone to crashes and restarts
• Cooperative asynchronous update of shared memory
• Doing-it-all with bounded work and communication

This page was built for publication: Dynamic Task Allocation in Asynchronous Shared Memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383990)