Controlling the data space of tree structured computations

DOI10.1016/S0890-5401(03)00132-9MaRDI QIDQ1877554zbMATH OpenWikidataFDO

Authors B. Obrenić, Israel Gottlieb

Publication date 19 August 2004

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0890-5401(03)00132-9

zbMATH Keywords

DataflowMultiprocessor scheduling algorithmPrecedence graphPrecedence treeToken space

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• An efficient decision procedure for imperative tree data structures
• scientific article; zbMATH DE number 3876615
• scientific article; zbMATH DE number 4174333
• scientific article; zbMATH DE number 4062615
• Rough Sets and Current Trends in Computing
• A new approach to operating with undirected trees

Cites work

• An Efficient Algorithm for Exploiting Multiple Arithmetic Units
• NP-complete scheduling problems
• Optimal scheduling for two-processor systems

Cited in

(3)

• Dual-issue scheduling for binary trees with spills and pipelined loads
• scientific article; zbMATH DE number 1696521 (Why is no real title available?)
• scientific article; zbMATH DE number 1305461 (Why is no real title available?)

This page was built for publication: Controlling the data space of tree structured computations

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