• DocumentCode
    2214927
  • Title

    Analysis of the 3-Layer Workflow Scheduling Model Based on Improved Dijkstra Algorithm

  • Author

    He Lu ; Chen Wei ; Gao Qiang

  • Author_Institution
    Dept. of Comput. Applic., Univ. of Shanghai for Sci. & Technol., Shanghai, China
  • fYear
    2009
  • fDate
    26-28 Dec. 2009
  • Firstpage
    141
  • Lastpage
    144
  • Abstract
    The 3-layer workflow scheduling model consist of front layer, outside scheduling layer and inside scheduling layer, it can describe the task scheduling more clearly than conventional models. This paper mainly discusses the improved Dijkstra algorithm with multi-precondition, which is the core of this model, converts the classical Dijkstra algorithm into an useful way to calculate the shortest path in weighted directed graph with multi-precondition. The experiment proved out the 3-layer workflow scheduling model based on improved Dijkstra algorithm an efficient model.
  • Keywords
    directed graphs; scheduling; 3-layer workflow scheduling model; classical Dijkstra algorithm; improved Dijkstra algorithm; multiprecondition; shortest path; task scheduling; weighted directed graph; Algorithm design and analysis; Computer applications; Helium; Information analysis; Information science; Optical computing; Petri nets; Processor scheduling; Scheduling algorithm; State feedback;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Science and Engineering (ICISE), 2009 1st International Conference on
  • Conference_Location
    Nanjing
  • Print_ISBN
    978-1-4244-4909-5
  • Type

    conf

  • DOI
    10.1109/ICISE.2009.311
  • Filename
    5454827