An efficient job scheduling algorithm in partitionable mesh connected systems

DOI10.1142/S0129054101000850MaRDI QIDQ5249289zbMATHFDO

Authors Keqin Li

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmprobabilistic analysisjob schedulingaverage-case performance ratiopartitionable mesh connected system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems
• scientific article; zbMATH DE number 1375583
• Randomized On-line Scheduling of Parallel Jobs
• scientific article; zbMATH DE number 2247728
• Scheduling independent jobs on partitionable hypercubes

Cites work

• Algorithms for Scheduling Independent Tasks
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Heuristic algorithms for on-line packing in three dimensions
• On Packing Two-Dimensional Bins
• On Three-Dimensional Packing
• Scheduling subject to resource constraints: Classification and complexity
• Shelf Algorithms for Two-Dimensional Packing Problems
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(2)

• Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems
• Scheduling independent jobs for torus connected networks with/without link contention.

This page was built for publication: An efficient job scheduling algorithm in partitionable mesh connected systems

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