Publication | Closed Access
Bounds for LPT Schedules on Uniform Processors
286
Citations
8
References
1977
Year
Mathematical ProgrammingEngineeringNonpreemptive Multiprocessor EnvironmentLargest Processing TimeComputer ArchitectureComputational ComplexityOperations ResearchSystems EngineeringDiscrete MathematicsParallel ComputingCombinatorial OptimizationLpt SchedulesLower BoundComputer EngineeringScheduling (Computing)Computer ScienceScheduling AnalysisDifferent SpeedsScheduling ProblemReal-time Multiprocessor SystemScheduling (Production Processes)Parallel Programming
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1