scientific article; zbMATH DE number 1003247
From MaRDI portal
Publication:4335207
zbMath0873.68004MaRDI QIDQ4335207
Publication date: 23 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Maximizing the throughput of parallel jobs on hypercubes ⋮ On-line scheduling mesh jobs with dependencies ⋮ Scheduling parallel jobs to minimize the makespan ⋮ Scheduling semi-malleable jobs to minimize mean flow time ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Competitive online scheduling of perfectly malleable jobs with setup times ⋮ On-line scheduling of parallel jobs in a list ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ Online scheduling of moldable parallel tasks ⋮ Scheduling parallel tasks with individual deadlines ⋮ Scheduling space-sharing for internet advertising ⋮ Approximation algorithms for general parallel task scheduling
