An optimal component distribution algorithm based on MINLP

Authors:
Kebo Wang;Zhiying Wang;Yan Jia;Weihong Han
Affiliations:
National University of Defense Technology, China;National University of Defense Technology, China;National University of Defense Technology, China;National University of Defense Technology, China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 4
Cited 0

Graph cutting algorithms for distributed applications partitioning

ACM SIGMETRICS Performance Evaluation Review
The Method of Layers

IEEE Transactions on Software Engineering
Software Architectural Specification for Optimal Object Distribution

SCCC '98 Proceedings of the XVIII International Conference of the Chilean Computer Science Society
Optimized Allocation of Distributed Applications Across Local Area Networks

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

While deploying distributed components, a key decision to be made is the location of each component in the target distributed environment. Unappropriate distribution may lead to bad performance. Existing distribution algorithms use criterion such as minimal communication bandwidth or response time to optimize object distribution. But for distributed applications processing massive parallel requests, which require both low response time and high throughput. In such situation single-criterion algorithms may output distribution with a very low throughput sometimes. We propose an algorithm called OCDA based MINLP(Mixed Integer Non-Linear Programming), which meets the requirement that with a restricted average response time, maximize throughput capacities of applications. Finally we discuss the advantages and limitations of OCDA.