A new approach to decentralized control of job scheduling

  • Guoqing Zhang
  • Yueming Hu
  • Zhiliang Xie
System Software Aspects (Session 2.1)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 237)


This paper proposes a new approach to improve the existing techniques and algorithms for decentralized control of a multiprocessor system. Each processor in the model proposed can either be a controller or a controllee and resides in one of the following statuses: User, System, Blocked and Idle, similar to a process in an operating system. Job scheduling strategies are based on the concept of confliction vectors stored in a shared memory. Conventional task scheduling strategies such as that with MINIMAX criterion can still be employed to achieve both interprocessor communication minimization and processor load balancing. The new approach combines the idea concerning distributed processing and pipelining. It has extensibility and strong fault-tolerant capacity, and shows to be of practical use.


Shared Memory Time Slice Schedule Strategy Schedule Method Multiprocessor System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H.S. Stone and S.H. Bokhari, "Control of Distributed Processes," Computer, vol.11, pp.97–106, July 1978.Google Scholar
  2. [2]
    T.C.K.Chow and J.A.Abraham. "Load Balancing in Distributed Systems," IEEE Trans. Software Eng,vol. SE-8, July 1982.Google Scholar
  3. [3]
    W.W. Chu, L.J. Holloway, M.T. Lan and K. Efe, "Task Allocation in Distributed Data Processing," Computer, vol.13, pp.57–69, Nov. 1980.Google Scholar
  4. [4]
    P.P. Ma, E.Y.S. Lee and M. Tsuchiya. "A Task Allocation Model for Distributed computing systems," IEEE Trans. Computer, vol C-31, pp.41–47, Jan. 1982.Google Scholar
  5. [5]
    Y.C.Chow and W.Kohler, "Models for Dynamic Load Balancing in a Heterogeneous Multiple processor system," IEEE Trans. Computer. vol. C-28, May 1979.Google Scholar
  6. [6]
    L. Kleinrock and A. Nilsson. "On Optimal Scheduling Algorithms for time-shared systems," J.ACM, vol.28, No.3, pp.477–486, July 1981.Google Scholar
  7. [7]
    K. Efe. "Heuristic Models of Task Assignment Scheduling in Distributed Systems," Computer, vol.15, pp.50–56, June 1982.Google Scholar
  8. [8]
    O.I. El-Dossouki and W. Huen, "Distributed Enumeration on Beteen Computers," IEEE Trans. Computer, vol. C-29, pp.818–825, Sept. 1980.Google Scholar
  9. [9]
    P.Kogge, "The Architecture of Pipelined Computers," 1981.Google Scholar
  10. [10]
    K.Hwang and F.A.Briggs, "Computer Architecture and Parallel Processing," McGraw-Hill Inc., 1984.Google Scholar
  11. [11]
    C.C.Shen and W.H. Tsai, "A Graph Matching Approach to Optimal Tast Assignment in Distributed Computing Systems Using a Minimax Criterion," IEEE Trans. Computer, vol.C-34, No.3, March 1985.Google Scholar
  12. [12]
    M.J. Gonzalez, "Deterministic Processor Scheduling," Computing Surveys, vol.9, No.3, pp.173–204, Sept. 1977.Google Scholar
  13. [13]
    A.M.Van Tilborg and L.D.Wittie, "Wave Scheduling — Decentralized Scheduling of Task Forces in Multicomputers," IEEE Trans. Computer, vol.C-33, No.9, Sept. 1984.Google Scholar
  14. [14]
    R.G.Smith, "The Contract Net Protocol: High-level communication and Control in a Distributed Problem Solver," IEEE Trans. Computer, vol. C-29, No.12, December 1980.Google Scholar
  15. [15]
    E.G.Coffman, JR. et al, "Computer and Job-shop Scheduling Theory", 1976, John Wiley & sons. inc.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Guoqing Zhang
    • 1
  • Yueming Hu
    • 1
  • Zhiliang Xie
    • 1
  1. 1.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghaiPeople's Republic of China

Personalised recommendations