Two-way dominant sequence clustering for processor scheduling

DOI10.1016/0020-0190(94)90012-4MaRDI QIDQ1318742zbMATH OpenOpenAlexFDO

Authors Dongseung Kim, Joonyoung Park

Publication date 5 April 1994

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

Full work available at URL https://doi.org/10.1016/0020-0190(94)90012-4

zbMATH Keywords

parallel processingcompilerstask schedulingoperating systemsprocessor schedulingdominant sequence clustering

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20) Theory of operating systems (68N25)

Recommendations

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Scheduling independent 2-processor tasks to minimize schedule length
• A two-pass scheduling algorithm for parallel programs
• scientific article; zbMATH DE number 2086781
• ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems

Cites work

• scientific article; zbMATH DE number 42110 (Why is no real title available?)
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• A two-pass scheduling algorithm for parallel programs
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Towards an Architecture-Independent Analysis of Parallel Algorithms

Cited in

(1)

• Clustering and scheduling method based on task duplication

This page was built for publication: Two-way dominant sequence clustering for processor scheduling

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