Scheduling Multiprocessor Tasks to Minimize Schedule Length
From MaRDI portal
Publication:3741047
DOI10.1109/TC.1986.1676781zbMath0604.68040MaRDI QIDQ3741047
Jan Weglarz, Jacek Błażewicz, M. Drabowski
Publication date: 1986
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
algorithms; linear programming; deterministic scheduling; complex analysis; microprocessor system; non- preemptive scheduling
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Scheduling DAGs with random parallel tasks on binarily partitionable systems, The complexity of path coloring and call scheduling, On-line scheduling of parallel jobs with runtime restrictions, Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness, Scheduling independent two processor tasks on a uniform duo-processor system, List scheduling of parallel tasks, Models and complexity of multibin packing problems, A simple linear time approximation algorithm for multi-processor job scheduling on four processors, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, On the complexity of adjacent resource scheduling, Scheduling parallel jobs to minimize the makespan, Minimizing mean flow time with parallel processors and resource constraints, New trends in machine scheduling, The complexity of scheduling independent two-processor tasks on dedicated processors, Production scheduling problems in a textile industry, Scheduling multiprocessor tasks on three dedicated processors, Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness, Scheduling multiprocessor tasks -- An overview, Scheduling multiprocessor tasks with chain constraints, Minimizing the schedule length for a parallel 3D-grid precedence graph, Complexity of scheduling multiprocessor tasks with prespecified processors allocations, Real-time scheduling of linear speedup parallel tasks, Efficiency and effectiveness of normal schedules on three dedicated processors, Distributed processing of divisible jobs with communication startup costs, Scheduling multiprocessor tasks on parallel processors with limited availability., Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., Hybrid flow-shop scheduling problems with multiprocessor task systems., Linear and quadratic algorithms for scheduling chains and opposite chains, An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems, An efficient load distribution strategy for a distributed linear network of processors with communication delays, Scheduling of resource tasks, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Deadline scheduling of multiprocessor tasks, Scheduling multiprocessor tasks on two parallel processors
