Skip to main content
SpringerLink
Log in

Processors selection and traffic splitting in a parallel processors system

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

This paper considers a general design problem for a parallel processors system which consists of a set of non-homogeneous potential processors and a set of traffic distributing points. For this problem, two levels of technology choice are made: 1) which candidate processors to establish with capacity option, 2) how to allocate the incoming traffic among established processors generated at each distributing point. The associated model is formulated as a linear fractional integer program whose objective is to minimize the maximum mean queue length on any established processor, while satisfying a side constraint such as budget constraint. Within the framework of branch and bound procedure, fractional subproblems are optimized by solving a sequence of linear programming problems. Computational experience with randomly generated 25 test problems is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bernard, J.C., Ferland, J.A.: Convergence of interval type algorithms for generalized fractional programming. Math. Program.43, 349–363 (1989)

    Google Scholar 

  2. Bland, R.G., Goldfarb, D., Todd, M.J.: The ellipsoid method: A survey. Oper. Res.29, 1039–1091 (1981)

    Google Scholar 

  3. Cantor, D.G., Gerla, M.: Optimal routing in a packet-switched computer network.IEEE Trans. Comput. C23, 1062–1068 (1974)

    Google Scholar 

  4. Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci.13, 492–498 (1967)

    Google Scholar 

  5. Ferland, A., Potvin, J.Y.: Generalized fractional programming: Algorithms and numerical experimentation. Eur. J. Oper. Res.20, 92–101 (1985)

    Google Scholar 

  6. Gerla, M., Kleinrock, L.: On the topological design of distributed computer networks. IEEE Trans. Commun. COM25, 48–60 (1977)

    Google Scholar 

  7. Ibaraki, T.: Parametric approaches to fractional programs. Math. Program.26, 345–362 (1983)

    Google Scholar 

  8. Kumar, A., Bonomi, F.: Adaptive load balancing in a multi-processor system with a central job scheduler. In: Iazeolla, G., Courtois, P.J., Boxma, O.J. (ed). Computer performance and reliability, pp. 173–189. Amsterdam: North-Holland 1988

    Google Scholar 

  9. Shapiro, J.F.: Mathematical programming: Structures and algorithms. New York: Wiley 1979

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Korea Advanced Institute of Science and Technology, Yusong-gu, Taejon, Korea

    Dong-wan Tcha

  2. Cheil Synthetics, Seoul, Korea

    Bum-il Lee

  3. University of Ulsan, Ulsan, Korea

    Young-duck Lee

Authors
  1. Dong-wan Tcha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bum-il Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Young-duck Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tcha, Dw., Lee, Bi. & Lee, Yd. Processors selection and traffic splitting in a parallel processors system. Acta Informatica 29, 415–423 (1992). https://doi.org/10.1007/BF01193575

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01193575

Keywords

Search

Navigation