Bounds for LPT Schedules on Uniform Processors
SIAM Journal on Computing1977Vol. 6(1), pp. 155–166
Citations Over TimeTop 1% of 1977 papers
Abstract
We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.
Related Papers
- → Task Assignment on Uniform Heterogeneous Multiprocessors(2006)35 cited
- → An effective parallelization of execution of multijoins in multiprocessor systems(2002)1 cited
- → ON MODELING PARTITIONED MULTIPROCESSOR SYSTEMS(1994)10 cited
- → Minimum distance: a method for partitioning recurrences for multiprocessors(1989)6 cited
- → Parallelization Methods for Edge Extraction Applied to Chip Multiprocessor Clusters(2012)