Skip to main content
Springer Nature Link
Log in

An assignment method for IPUs in distributed systems

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a distributed system does not have a central administrator, all independent processing units in this system want to cooperate for the best results, but they cannot know the conditions of one another. So in order to undertake the tasks in admirable proportions, they have to adjust their undertaking tasks only by self-learning. In this paper, the performance of this system is analyzed by Markov chains, and a robust method of self-learning for independent processing units in this kind of systems is presented. This method can lead the tasks of the system to be distributed very well among all the independent processing units, and can also be used to solve the general assignment problem.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. He C W. Automata Theory and Application. Science Press, 1990.

  2. Lazar A A, Orda A, Pendarakis D E. Virtual path bandwidth allocation in multi-user networks. InIEEE INFOCOM’95.

  3. Shenker S J. Making greed work in networks: a game-theoretic analysis of switch service disciplines.IEEE/ACM Trans. Networking, Dec. 1995, 3.

  4. Korilis Y A, Lazar A A, Orda A. Achieving network optima using stackelberg routing strategies.IEEE/ACM Trans. Networking, Feb. 1997, Vol.5.

  5. Tsetlin M L. Finite automata and modeling the simplest forms of actions. Ph.D. thesis, U.A.Steklov Math. Inst., 1964.

  6. Tung B, Kleinrock L. Using finite state automata to produce self-optimization and self-control.IEEE Trans. Parallel and Distributed System. Apr. 1996, Vol.7.

  7. Qian S H. Operational Research. TsingHua University Press, 1990.

  8. Rabin M O. Probabilistic automata.Inf & Control, 1968, (12).

  9. Tanenbaum A S. Distributed Operating Systems. Prentice-Hall, Inc., 1995.

  10. Zhang Z Z, Douligeris C. Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications.IEEE Trans. Communications, Aug. 1992, 40(8).

Download references

Author information

Authors and Affiliations

  1. Computing Center, Chengdu University of Electronic Science and Technology, 610054, Chengdu, P.R. China

    Li Liang & Yang Guowei

Authors
  1. Li Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Guowei
    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

Li, L., Yang, G. An assignment method for IPUs in distributed systems. J. of Comput. Sci. & Technol. 14, 259–266 (1999). https://doi.org/10.1007/BF02948514

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords