scientific article; zbMATH DE number 2086778

MaRDI QIDQ4737346zbMATH OpenFDO

Authors Krzysztof Giaro, Marek Kubale, Michal Malafiejski, K. Piwakowski

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2328/23280087.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Scheduling multiprocessor tasks on three dedicated processors
• scientific article; zbMATH DE number 1264424
• Minimizing mean flow time with parallel processors and resource constraints
• Scheduling multiprocessor tasks for mean flow time criterion

Cited in

(1)

• Min Sum Edge Coloring in Multigraphs Via Configuration LP

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 Q4737346)