Allocation of Jobs to Unequally-Capable Processors: A Planning Approach
Gaver, Donald Paul
Jacobs, Patricia A.
Becker, Kevin J.
MetadataShow full item record
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
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
NPS Report NumberNPS-OR-96-010
Showing items related by title, author, creator and subject.
A periodic scheduling heuristic for mapping iterative task graphs onto distributed memory multiprocessors Kasinger, Charles D. (Monterey, California. Naval Postgraduate School, 1994-09);This thesis investigates the problem of statically assigning the tasks of applications represented by repetitive task graphs (such as sonar or radar signal processing) to the processors of a distributed memory multiprocessor ...
Usefulness of compile-time restructuring of large grain data flow programs in throughput-critical applications Cross, David M. (Monterey, California. Naval Postgraduate School, 1993-09);In this thesis, Large Grain Data Flow (LGDF) representation of parallelism is applied to throughout-critical applications that process periodically arriving data. The applications are represented by directed acyclic graphs ...
Benage, William Fred, Jr. (Monterey, California. Naval Postgraduate School, 1989-06);This thesis presents a software algorithm that resends work packages to processors when one or more of the worker processors fails or when the link with one or more processors fails. There are two resend criteria used in ...