scientific article; zbMATH DE number 2042272

zbMATH Open1036.68009MaRDI QIDQ4450046FDOQ4450046

Authors: Janez Brest, Viljem Žumer 

Publication date: 15 February 2004

Title of this publication is not available (Why is that?)

Recommendations

• A comparison of the static task graph scheduling algorithms
• scientific article; zbMATH DE number 1512197
• A heuristic for scheduling task graphs with communication delays onto multiprocessors
• Task matching and scheduling for smart homogeneous multiprocessor systems
• Scheduling independent multiprocessor tasks

zbMATH Keywords

static scheduling algorithm

Mathematics Subject Classification ID

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

Cited In (21)

• Benchmarking and comparison of the task graph scheduling algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
• List Scheduling in Order of α-Points on a Single Machine
• Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems
• A list-scheduling heuristic for the short-term planning of assessment centers
• A clustering algorithm for multiprocessor environments using dynamic priority of modules
• A comparison of the static task graph scheduling algorithms
• Analysis of the list scheduling algorithm for precedence constrained parallel tasks
• On task scheduling accuracy: Evaluation methodology and results
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Title not available (Why is that?)
• Computational Science – ICCS 2005
• A global-optimized scheduling algorithm based on a combination of sub-graphs
• Title not available (Why is that?)
• Task matching and scheduling for smart homogeneous multiprocessor systems
• A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
• A machine assignment mechanism for compile-time list-scheduling heuristics
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Title not available (Why is that?)

This page was built for publication:

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