Accession Number:

ADA257889

Title:

Static Assignment of Complex Stochastic Tasks Using Stochastic Majorization

Descriptive Note:

Contractor rept.

Corporate Author:

INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s):

Report Date:

1992-10-01

Pagination or Media Count:

25.0

Abstract:

We consider the problem of statically assigning many tasks to a smaller system of homogeneous processors, where a tasks structure is modeled as a branching process, and all tasks are assumed to have identical behavior. We show how the theory of majorization can be used to obtain a partial order among possible task assignments. Our results show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, we show how measurements of finishing time, resource utilization, and reliability are all captured by the theory. We also show how the theory may be applied to the problem of partitioning a pool of processors for distribution among parallelizable tasks. mapping majorization parallel processing random tasks.

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE