Implementing (nondeterministic) parallel assignments

DOI10.1016/0020-0190(96)00053-1MaRDI QIDQ1352008zbMATH OpenOpenAlexFDO

Authors Piercarlo Grandi

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00053-1

zbMATH Keywords

OptimizationCompilersMultiple assignmentParallel assignmentNondeterministic

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4058853
• Massively parallel augmenting path algorithms for the assignment problem
• A parallel shortest augmenting path algorithm for the assignment problem
• scientific article; zbMATH DE number 1751911
• Publication:4735042

Cites work

• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• Parallel assignment revisited
• The Schorr-Waite graph marking algorithm

Cited in

(3)

• scientific article; zbMATH DE number 5198953 (Why is no real title available?)
• Reasoning about data-parallel array assignment
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

This page was built for publication: Implementing (nondeterministic) parallel assignments

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