A two-tier framework for transmission-cost minimization of high-performance communication applications

Chia Cheng Hu, Chin-Feng Lai, Yueh-Min Huang, Han Chieh Chao

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In two-tier high-performance networks (HPNs), some facilities are constructed to form a powerful supercomputing environment, and to alleviate server load. Then, the applications are provided by them in co-operated, parallel and distributed manners. A proper way to select facilities is crucial to the performance of two-tier HPNs The problem of selecting facilities can be regarded as a kind of the facility location problem, which is to determine an optimal subset of facilities that will be open to serve users. The traditional facility location problem aims to minimize the incurred costs between the users/servers and their assigned facilities. In two-tier HPNs, the incurred costs can be regarded as the transmission costs, e.g. transmission latency, bandwidth overhead. We observe that most of the packets are transmitted among the facilities for application servicing and framework maintaining. In this paper, we address the problem of selecting facilities in two-tier HPNs by minimizing the transmission costs from servers to users by passing through the selected facilities. Our problem is different from the traditional facility location problem, which only considers the transmission costs between the users/servers and their assigned facilities. In our problem, the transmission costs between the selected facilities are further considered. The problem is formulated as a 0/1 integer non-linear programming (0/1 INLP) and 0/1 integer linear programming (0/1 ILP). Further, a simple heuristic algorithm is proposed for obtaining a feasible solution when the network sizes increase, since solving INLPs and ILPs for large-scale problems takes long time.

Original languageEnglish
Pages (from-to)381-393
Number of pages13
JournalConcurrency Computation Practice and Experience
Volume24
Issue number4
DOIs
Publication statusPublished - 2012 Mar 25

Fingerprint

Cost Minimization
High Performance
Communication
Costs
Facility Location Problem
Network performance
Server
Servers
Framework
Nonlinear Integer Programming
Integer Linear Programming
Large-scale Problems
Inductive logic programming (ILP)
Heuristic algorithm
Latency
Nonlinear programming
Heuristic algorithms
Bandwidth
Linear programming
Minimise

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Cite this

@article{28c38b4f9c9a42f8a5ce99b849163b10,
title = "A two-tier framework for transmission-cost minimization of high-performance communication applications",
abstract = "In two-tier high-performance networks (HPNs), some facilities are constructed to form a powerful supercomputing environment, and to alleviate server load. Then, the applications are provided by them in co-operated, parallel and distributed manners. A proper way to select facilities is crucial to the performance of two-tier HPNs The problem of selecting facilities can be regarded as a kind of the facility location problem, which is to determine an optimal subset of facilities that will be open to serve users. The traditional facility location problem aims to minimize the incurred costs between the users/servers and their assigned facilities. In two-tier HPNs, the incurred costs can be regarded as the transmission costs, e.g. transmission latency, bandwidth overhead. We observe that most of the packets are transmitted among the facilities for application servicing and framework maintaining. In this paper, we address the problem of selecting facilities in two-tier HPNs by minimizing the transmission costs from servers to users by passing through the selected facilities. Our problem is different from the traditional facility location problem, which only considers the transmission costs between the users/servers and their assigned facilities. In our problem, the transmission costs between the selected facilities are further considered. The problem is formulated as a 0/1 integer non-linear programming (0/1 INLP) and 0/1 integer linear programming (0/1 ILP). Further, a simple heuristic algorithm is proposed for obtaining a feasible solution when the network sizes increase, since solving INLPs and ILPs for large-scale problems takes long time.",
author = "Hu, {Chia Cheng} and Chin-Feng Lai and Yueh-Min Huang and Chao, {Han Chieh}",
year = "2012",
month = "3",
day = "25",
doi = "10.1002/cpe.1610",
language = "English",
volume = "24",
pages = "381--393",
journal = "Concurrency Computation Practice and Experience",
issn = "1532-0626",
publisher = "John Wiley and Sons Ltd",
number = "4",

}

A two-tier framework for transmission-cost minimization of high-performance communication applications. / Hu, Chia Cheng; Lai, Chin-Feng; Huang, Yueh-Min; Chao, Han Chieh.

In: Concurrency Computation Practice and Experience, Vol. 24, No. 4, 25.03.2012, p. 381-393.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A two-tier framework for transmission-cost minimization of high-performance communication applications

AU - Hu, Chia Cheng

AU - Lai, Chin-Feng

AU - Huang, Yueh-Min

AU - Chao, Han Chieh

PY - 2012/3/25

Y1 - 2012/3/25

N2 - In two-tier high-performance networks (HPNs), some facilities are constructed to form a powerful supercomputing environment, and to alleviate server load. Then, the applications are provided by them in co-operated, parallel and distributed manners. A proper way to select facilities is crucial to the performance of two-tier HPNs The problem of selecting facilities can be regarded as a kind of the facility location problem, which is to determine an optimal subset of facilities that will be open to serve users. The traditional facility location problem aims to minimize the incurred costs between the users/servers and their assigned facilities. In two-tier HPNs, the incurred costs can be regarded as the transmission costs, e.g. transmission latency, bandwidth overhead. We observe that most of the packets are transmitted among the facilities for application servicing and framework maintaining. In this paper, we address the problem of selecting facilities in two-tier HPNs by minimizing the transmission costs from servers to users by passing through the selected facilities. Our problem is different from the traditional facility location problem, which only considers the transmission costs between the users/servers and their assigned facilities. In our problem, the transmission costs between the selected facilities are further considered. The problem is formulated as a 0/1 integer non-linear programming (0/1 INLP) and 0/1 integer linear programming (0/1 ILP). Further, a simple heuristic algorithm is proposed for obtaining a feasible solution when the network sizes increase, since solving INLPs and ILPs for large-scale problems takes long time.

AB - In two-tier high-performance networks (HPNs), some facilities are constructed to form a powerful supercomputing environment, and to alleviate server load. Then, the applications are provided by them in co-operated, parallel and distributed manners. A proper way to select facilities is crucial to the performance of two-tier HPNs The problem of selecting facilities can be regarded as a kind of the facility location problem, which is to determine an optimal subset of facilities that will be open to serve users. The traditional facility location problem aims to minimize the incurred costs between the users/servers and their assigned facilities. In two-tier HPNs, the incurred costs can be regarded as the transmission costs, e.g. transmission latency, bandwidth overhead. We observe that most of the packets are transmitted among the facilities for application servicing and framework maintaining. In this paper, we address the problem of selecting facilities in two-tier HPNs by minimizing the transmission costs from servers to users by passing through the selected facilities. Our problem is different from the traditional facility location problem, which only considers the transmission costs between the users/servers and their assigned facilities. In our problem, the transmission costs between the selected facilities are further considered. The problem is formulated as a 0/1 integer non-linear programming (0/1 INLP) and 0/1 integer linear programming (0/1 ILP). Further, a simple heuristic algorithm is proposed for obtaining a feasible solution when the network sizes increase, since solving INLPs and ILPs for large-scale problems takes long time.

UR - http://www.scopus.com/inward/record.url?scp=84863134376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863134376&partnerID=8YFLogxK

U2 - 10.1002/cpe.1610

DO - 10.1002/cpe.1610

M3 - Article

VL - 24

SP - 381

EP - 393

JO - Concurrency Computation Practice and Experience

JF - Concurrency Computation Practice and Experience

SN - 1532-0626

IS - 4

ER -