We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
LI Liang, YANG Guowei. An Assignment Method for IPUs in Distributed Systems[J]. Journal of Computer Science and Technology, 1999, 14(3): 259-266.
Citation: LI Liang, YANG Guowei. An Assignment Method for IPUs in Distributed Systems[J]. Journal of Computer Science and Technology, 1999, 14(3): 259-266.

An Assignment Method for IPUs in Distributed Systems

More Information
  • Published Date: May 09, 1999
  • In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a dis tributed 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 pro portions, they have to adjust their undertaking tasks only by self-learning. In this paper, the performance of this syste…
  • [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. In IEEE 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. ……….
  • Related Articles

    [1]Ji-Gang Wu, Thambipillai Srikanthan, Guang-Wei Zou. New Model and Algorithm for Hardware/Software Partitioning[J]. Journal of Computer Science and Technology, 2008, 23(4): 644-651.
    [2]XIA YinShui, WU XunWei, A. E. A. Almaini. Power Minimization of FPRM Functions Based on Polarity Conversion[J]. Journal of Computer Science and Technology, 2003, 18(3).
    [3]GU Naijie. Efficient Indirect All-to-All Personalized Communication on Rings and 2-D Tori[J]. Journal of Computer Science and Technology, 2001, 16(5).
    [4]ZHU Daming, LUAN Junfeng, MA Shaohan. Hardness and Methods to Solve CLIQUE[J]. Journal of Computer Science and Technology, 2001, 16(4).
    [5]JIANG Tao, LI Ming, Paul M.B. Average-Case Analysis of Algorithms Using Kolmogorov Complexity[J]. Journal of Computer Science and Technology, 2000, 15(5): 402-408.
    [6]JIANG Tao, LI Ming, Paul M.B.Vitanyi. Average-Case Analysis of Algorithms Using Kolmogorov Complexity[J]. Journal of Computer Science and Technology, 2000, 15(5).
    [7]GUO Qingping, Yakup Paker, ZHANG Shesheng, Dennis Parkinson, WEI Jianing. Optimum Tactics of Parallel Multi-Grid Algorithm with Virtual Boundary Forecast Method Running on a Local Network with the PVM Platform[J]. Journal of Computer Science and Technology, 2000, 15(4): 355-359.
    [8]GUO Qingping, Yakup Paker, ZHANG Shesheng, Dennis Parkinson, WEI Jianing. Optimum Tactics of Parallel Multi-Grid Algorithm with Virtual Boundary Forecast Method Running on a Local Network with the PVM Platform[J]. Journal of Computer Science and Technology, 2000, 15(4).
    [9]Ding Wei, Gong Jian, Yu Xiao. A Traffic Partition Algorithm for Switched LANs and Its Performance Analysis[J]. Journal of Computer Science and Technology, 1998, 13(3): 261-267.
    [10]Wang Jianchao, Wei Daozheng. An Effective Test Generation Algorithm for Combinational Circuits[J]. Journal of Computer Science and Technology, 1986, 1(4): 1-16.

Catalog

    Article views (21) PDF downloads (1249) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return