scientific article; zbMATH DE number 871911
From MaRDI portal
Publication:4875180
zbMATH Open0845.90069MaRDI QIDQ4875180FDOQ4875180
Authors: Nian Gu, Tim Brecht, Kaicheng Lu, Xiaotie Deng 
Publication date: 15 September 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (28)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- Scheduling in the dark
- Title not available (Why is that?)
- Effective scheduling of local interactive processes and parallel processes in a non-dedicated cluster environment
- Preemptive multiprocessor task scheduling with release times and time windows
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Title not available (Why is that?)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Preemptive multiprocessor scheduling with rejection
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Algorithms – ESA 2005
- Preemptive weighted completion time scheduling of parallel jobs
- Integer preemptive scheduling on parallel machines
- Title not available (Why is that?)
- Fairness in parallel job scheduling
- Multi-core real-time scheduling for generalized parallel task models
- Preemptive scheduling of independent jobs on a hypercube
- Global EDF scheduling for parallel real-time tasks
- Parallel Processing and Applied Mathematics
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875180)
