Competitive implementation of parallel programs

DOI10.1007/PL00009248MaRDI QIDQ1277321zbMATH OpenFDO

Authors K. Appert

Publication date 2 February 1999

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00009248

zbMATH Keywords

competitive analysis of algorithms

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 437571
• Scheduling tree dags on parallel architectures
• Dynamic scheduling of parallel computations

Cited in

(7)

• A robust compile time method for scheduling task parallelism on distributed memory machines
• scientific article; zbMATH DE number 1696537 (Why is no real title available?)
• scientific article; zbMATH DE number 437571 (Why is no real title available?)
• scientific article; zbMATH DE number 3909716 (Why is no real title available?)
• A competitive algorithm for managing sharing in the distributed execution of functional programs
• Compositional competitiveness for distributed algorithms
• scientific article; zbMATH DE number 2090647 (Why is no real title available?)

This page was built for publication: Competitive implementation of parallel programs

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