An algorithm for maximum desequencing of repetition-free loops

DOI10.1007/BF01068331zbMATH Open0554.68012OpenAlexW2042529155MaRDI QIDQ3217586FDOQ3217586

Authors:

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

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

Recommendations

• Publication:4735042
• scientific article; zbMATH DE number 3845030
• Distribution of operations and data arrays over processors
• scientific article; zbMATH DE number 618313
• Scheduling Sequential Loops on Parallel Processors

zbMATH Keywords

assignment operatorsequential and parallel execution of operators

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• The parallel execution of DO loops

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: An algorithm for maximum desequencing of repetition-free loops

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