AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS

DOI10.1142/S0129054101000850zbMath1319.68040MaRDI QIDQ5249289

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)

Cites Work

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