Grid scheduling by on-line rectangle packing

DOI10.1002/NET.20021MaRDI QIDQ3156825zbMATH OpenOpenAlexFDO

Authors Massimiliano Caramia, Stefano Giordani, Antonio Iovanella

Publication date 12 January 2005

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20021

zbMATH Keywords

grid schedulingon-line algorithmsRectangle packing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Jobs on Grid Processors
• Scheduling jobs on grid processors
• scientific article; zbMATH DE number 1966227
• scientific article; zbMATH DE number 5763750
• Resource allocation in grid computing

Cites work

• Approximation schemes for covering and packing problems in image processing and VLSI
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Job scheduling strategies for parallel processing. 7th international workshop, JSSPP 2001, Cambridge, MA, USA, June 16, 2001. Revised papers
• Online algorithms. The state of the art

Cited in

(6)

• Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods
• Efficient grid scheduling through the incremental schedule-based approach
• Study of a process of task accumulation and distribution in a GRID-system
• On-line algorithms for packing rectangles into several strips
• Scheduling Jobs on Grid Processors
• On the effectiveness of the harmonic shelf algorithm for on-line strip packing

This page was built for publication: Grid scheduling by on-line rectangle packing

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