An efficient job scheduling algorithm in partitionable mesh connected systems

DOI10.1142/S0129054101000850zbMATH Open1319.68040MaRDI QIDQ5249289FDOQ5249289

Authors: Keqin Li 

Publication date: 30 April 2015

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

Recommendations

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

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)

Cites Work

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

Cited In (2)

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

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)