Bounds for LPT Schedules on Uniform Processors

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1977 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 6, pages 155-166 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Teofilo F. Gonzalez; Oscar H. Ibarra; Sartaj Sahni;

doi: 10.1137/0206013

Bounds for LPT Schedules on Uniform Processors

- Summary
- Subjects
- Metrics

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.

Keywords

Formal languages and automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	130
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%