Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14432
For citation please use:
Main Title: Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Author(s): Günther, Elisabeth
König, Felix G.
Megow, Nicole
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15659
http://dx.doi.org/10.14279/depositonce-14432
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We study two related problems in non-preemptive scheduling and packing of malleable tasks with precedence constraints to minimize the makespan. We distinguish the scheduling variant, in which we allow the free choice of processors, and the packing variant, in which a task must be assigned to a contiguous subset of processors.
Subject(s): scheduling
packing
malleable
precedence constraints
bounded width
Issue Date: 2009
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2009, 20
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-020-2009.pdf
Format: Adobe PDF | Size: 161.54 kB
DownloadShow Preview
Thumbnail
Report-020-2009.ps
Format: Postscript | Size: 235.68 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.