Share Email Print

Proceedings Paper

Task allocation model for minimization of completion time in distributed computer systems
Author(s): Jai-Ping Wang; Carl W. Steidley
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A task in a distributed computing system consists of a set of related modules. Each of the modules will execute on one of the processors of the system and communicate with some other modules. In addition, precedence relationships may exist among the modules. Task allocation is an essential activity in distributed-software design. This activity is of importance to all phases of the development of a distributed system. This paper establishes task completion-time models and task allocation models for minimizing task completion time. Current work in this area is either at the experimental level or without the consideration of precedence relationships among modules. The development of mathematical models for the computation of task completion time and task allocation will benefit many real-time computer applications such as radar systems, navigation systems, industrial process control systems, image processing systems, and artificial intelligence oriented systems.

Paper Details

Date Published: 6 August 1993
PDF: 7 pages
Proc. SPIE 2056, Intelligent Robots and Computer Vision XII: Active Vision and 3D Methods, (6 August 1993); doi: 10.1117/12.150221
Show Author Affiliations
Jai-Ping Wang, Southeastern Louisiana Univ. (United States)
Carl W. Steidley, Southeastern Louisiana Univ. (United States)

Published in SPIE Proceedings Vol. 2056:
Intelligent Robots and Computer Vision XII: Active Vision and 3D Methods
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?