Two-way dominant sequence clustering for processor scheduling

DOI10.1016/0020-0190(94)90012-4zbMath0795.68043OpenAlexW1964628706MaRDI QIDQ1318742

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 processingtask schedulingcompilersoperating systemsprocessor schedulingdominant sequence clustering

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• A two-pass scheduling algorithm for parallel programs
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times

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