Treegion scheduling for highly parallel processors

DOI10.1007/BFB0002855MaRDI QIDQ4537094zbMATH OpenFDO

Authors Sanjeev Banerjia, William A. Havaki, Thomas M. Conte

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Tree traversal scheduling: A global instruction scheduling technique for VLIW/EPIC processors
• Profile-assisted instruction scheduling
• Scalable and structured scheduling
• Learning heuristics for basic block instruction scheduling
• Scheduling tree dags on parallel architectures

Cited in

(5)

• Learning heuristics for basic block instruction scheduling
• Scheduling tree dags on parallel architectures
• Efficient Resource Constrained Scheduling Using Parallel Structure-Aware Pruning Techniques
• Tree traversal scheduling: A global instruction scheduling technique for VLIW/EPIC processors
• Scheduling task-tree with additive scales on parallel/distributed machines

This page was built for publication: Treegion scheduling for highly parallel processors

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