Robust resource allocations in parallel computing systems: model and heuristics
Date
2005
Authors
Shestak, Vladimir, author
Maciejewski, Anthony A., author
Siegel, Howard Jay, author
Ali, Shoukat, author
IEEE Computer Society, publisher
Journal Title
Journal ISSN
Volume Title
Abstract
This is an overview of the material to be discussed in the invited keynote presentation by H. J. Siegel; it summarizes our research in [2, 16, and 17]. The resources in parallel computer systems (including heterogeneous clusters) should be allocated to the computational applications in a way that maximizes some system performance measure. However, allocation decisions and associated performance prediction are often based on estimated values of application and system parameters. The actual values of these parameters may differ from the estimates; for example, the estimates may represent only average values, the models used to generate the estimates may have limited accuracy, and there may be changes in the environment. Thus, an important research problem is the development of resource management strategies that can guarantee a particular system performance given such uncertainties. To address this problem, we have designed a model for deriving the degree of robustness of a resource allocation--the maximum amount of collective uncertainty in system parameters within which a user specified level of system performance (QoS) can be guaranteed. The model will be presented and we will demonstrate its ability to select the most robust resource allocation from among those that otherwise perform similarly (based on the primary performance criterion). The model's use in allocation heuristics also will be demonstrated. This model is applicable to different types of computing and communication environments, including parallel, distributed, cluster, grid, Internet, embedded, and wireless.