Minimizing the stretch when scheduling flows of divisible requests
type: Item
instance of: scholarly article
title: Minimizing the stretch when scheduling flows of divisible requests
zbMATH Open document ID: 1168.90455
author: Arnaud Legrand
author: Alan Su
author: Frédéric Vivien
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
full work available at URL: OnlineDivisible.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5599868
zbMATH Keywords: bioinformatics
zbMATH Keywords: heterogeneous computing
zbMATH Keywords: scheduling
zbMATH Keywords: divisible load
zbMATH Keywords: linear programming
zbMATH Keywords: stretch
describes a project that uses: mpiBLAST
MaRDI profile type: Publication
OpenAlex ID: W2101083305
cites work: Q3885495
cites work: The complexity of mean flow time scheduling problems with release times
cites work: Q4250192
cites work: Q4829012
cites work: Approximation algorithms for average stretch scheduling
cites work: Q3361866
cites work: Q4131656
cites work: Parallelization of local BLAST service on workstation clusters
cites work: Approximation schemes for preemptive weighted flow time
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Approximation algorithms for combinatorial problems
cites work: Q3217922
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Q4124328
cites work: Online Scheduling to Minimize Average Stretch
cites work: Structure preserving reductions among convex optimization problems
cites work: The power of \(\alpha\)-points in preemptive single machine scheduling.
cites work: Complexity of preemptive minsum scheduling on unrelated parallel machines
cites work: Q4228498
DOI: 10.1007/S10951-008-0078-4
description: scientific article; zbMATH DE number 5599868