Allocation of jobs to unequally-capable processors : a planning approach
Bookreader Item Preview
Share or Embed This Item
texts
Allocation of jobs to unequally-capable processors : a planning approach
- Publication date
- 1996-09
- Topics
- JOBS., QUEUEING THEORY.
- Publisher
- Monterey, California : Naval Postgraduate School
- Collection
- navalpostgraduateschoollibrary; fedlink; americana
- Contributor
- Naval Postgraduate School, Dudley Knox Library
- Language
- en_US
Cover title
"NPS-OR-96-010."
"September 1996."
AD A316 928
Includes bibliographical references (p. 21)
This paper addresses the problem in which jobs of different types arrive at a system that consists of a collection of individual and somewhat diverse processors. The processors differ in that each may spedalize in one job type, but may also do others. Job types that are totally incompatible with a processor have an infinite service on that processor, but degrees of incompatibility may exist, and are modeled here. Using static queuing models, several practical performance measures may be evaluated, and optimal allocation of jobs to processors are obtained by solving linear and nonlinear programming problems. To illustrate, several numerical examples are provided. It is shown that jobs are not always most advantageously assigned to their most expert servers
aq/aq cc:9116 02/26/97
"NPS-OR-96-010."
"September 1996."
AD A316 928
Includes bibliographical references (p. 21)
This paper addresses the problem in which jobs of different types arrive at a system that consists of a collection of individual and somewhat diverse processors. The processors differ in that each may spedalize in one job type, but may also do others. Job types that are totally incompatible with a processor have an infinite service on that processor, but degrees of incompatibility may exist, and are modeled here. Using static queuing models, several practical performance measures may be evaluated, and optimal allocation of jobs to processors are obtained by solving linear and nonlinear programming problems. To illustrate, several numerical examples are provided. It is shown that jobs are not always most advantageously assigned to their most expert servers
aq/aq cc:9116 02/26/97
- Addeddate
- 2013-01-16 18:38:27
- Associated-names
- Jacobs, Patricia A; Becker, Kevin J; Lawphongpanich, Siriphong, 1956-; Naval Postgraduate School (U.S.). Dept. of Operations Research
- Call number
- ocn640466208
- Camera
- Canon EOS 5D Mark II
- Contributor_corporate
- Naval Postgraduate School (U.S.). Dept. of Operations Research.
- External-identifier
-
urn:handle:10945/29696
urn:oclc:record:1039519116
- Foldoutcount
- 0
- Format_extent
- 29 p. : ill. ; 28 cm.
- Identifier
- allocationofjobs00gave
- Identifier-ark
- ark:/13960/t7pp0dt7x
- Identifier_npsreport
- NPS-OR-96-010
- Identifier_oclc
- ocn640466208
- Ocr_converted
- abbyy-to-hocr 1.1.37
- Ocr_module_version
- 0.0.21
- Openlibrary_edition
- OL25499607M
- Openlibrary_work
- OL16877189W
- Page-progression
- lr
- Page_number_confidence
- 75
- Page_number_module_version
- 1.0.3
- Pages
- 40
- Ppi
- 350
- Republisher_date
- 20130117160517
- Republisher_operator
- associate-karina-martinez@archive.org
- Scandate
- 20130116184906
- Scanner
- scribe14.sanfrancisco.archive.org
- Scanningcenter
- sanfrancisco
- Type
- Technical Report
- Full catalog record
- MARCXML
comment
Reviews
There are no reviews yet. Be the first one to
write a review.
555 Views
DOWNLOAD OPTIONS
For users with print-disabilities
IN COLLECTIONS
Naval Postgraduate School FEDLINK - United States Federal Collection American LibrariesUploaded by Jacob-QA on