Scheduling Multi-task Agents

  • Rong Xie
  • Daniela Rus
  • Cliff Stein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2240)


We present a centralized and a distributed algorithm for scheduling multi-task agents in a distributed system with the objective of minimizing the overall application completion time. Each agent consists of multiple tasks that can be executed on multiple machines which correspond to resources. The machine speeds and link transfer rates are heterogeneous. Our centralized algorithm has an upper bound on the overall completion time and is used as a module in the distributed algorithm. Extensive simulations show promising results of the algorithms, especially for scheduling communication-intensive multi-task agents.


Schedule Algorithm Mobile Agent Task Graph Average Speedup Schedule Length 
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. El-Rewini and T.G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, 9:138–153, 1990.CrossRefGoogle Scholar
  2. 2.
    C. Hanen and A. Munier. An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. 1995.Google Scholar
  3. 3.
    M. Iverson and F. Ozguner. Parallelizing existing applications in a distributed heterogeneous environments. In Proc. of HCW, pages 93–100, 1995.Google Scholar
  4. 4.
    J.J. Hwang and Y.C. Chow. Scheduling precedence graphs in system with interprocessor communication times. SIAM Journal on Computing, 18(2):244–257, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Y. Kwok and I. Ahmad. Benchmarking the task graph scheduling algorithms. In Proceedigns of the first merged international parallel processing symposium and symposium on parallel and distributed processing, pages 531–537, 1998.Google Scholar
  6. 6.
    R.H. Mohring, M.W. Schaffter, and A.S. Schulz. Scheduling jobs with communication delays: using infeasible solutions for approximation. In Algorithms-ESA’96, pages 76–90, Barcelona, Spain, 1996.Google Scholar
  7. 7.
    A. Munier. Approximation algorithms for scheduling trees with general communication delays. Parallel Computing, 25(1):41–48, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322–328, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    R. Gray, G. Cybenko, D. Kotz, R. Peterson, and D. Rus. D’Agents: Applications and Performance of a Mobile-Agent System.submitted to Software Practice and Experience,2000.Google Scholar
  10. 10.
    G.C. Sih and E.A. Lee. A compile-time scheduling heuristic for interconnectionconstrained heterogeneous processor architectures. IEEE Trans. Parallel and Distributed Sys., 4:175–186, 1993.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Rong Xie
    • 1
  • Daniela Rus
    • 1
  • Cliff Stein
    • 2
  1. 1.Department of Computer ScienceDartmouth CollegeDarthmouth
  2. 2.Department of IEORColumbia UniversityColumbia

Personalised recommendations