A Generalized Uniform Processor System

Hiroaki Ishii, Charles Martel, Teruo Masuda and Toshio Nishida
Additional contact information
Hiroaki Ishii: Osaka University, Osaka, Japan
Charles Martel: University of California, Davis, California
Teruo Masuda: Osaka University, Osaka, Japan
Toshio Nishida: Osaka University, Osaka, Japan

Operations Research, 1985, vol. 33, issue 2, 346-362

Abstract: This paper considers a scheduling problem whose objective is to determine both the optimal speeds of processors and an optimal schedule in a preemptive multiprocessor environment. The jobs are independent and each processor can be assigned any speed; however, the cost associated with each processor is a function of the processor's speed. Polynomial algorithms are presented to find optimal speed assignments for a variety of cost functions.

Keywords: 584 optimal speeds of uniform processors; 657 quadratic speed costs of uniform processors (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.2.346 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:2:p:346-362

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().