Many-to-many matching based task allocation for dispersed computing

DOI10.1007/S00607-023-01160-2MaRDI QIDQ6114597zbMATH OpenOpenAlexFDO

Authors

Publication date 12 July 2023

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-023-01160-2

zbMATH Keywords

dispersed computingmany-to-many matchingnetworked computation pointsprivacy preservationtask allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Optimal distributed task scheduling in volunteer clouds
• Resource allocation in grid computing
• Task assignment in distributed computing systems
• Task allocation model for distributed systems
• scientific article; zbMATH DE number 1880846

Cites work

• College Admissions and the Stability of Marriage
• Deferred acceptance algorithms: history, theory, practice, and open questions
• The blocking lemma and strategy-proofness in many-to-many matchings

This page was built for publication: Many-to-many matching based task allocation for dispersed computing

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