1 / 33

A Scheduling Service Oriented Approach for Workflow Scheduling

A Scheduling Service Oriented Approach for Workflow Scheduling. by Conan Fan Li. Supervisor: Dr . Wendy MacCaull Committee member: Dr. Man Lin Committee member: Dr. Iker Gondra. A SSO approach for workflow scheduling. Initiatives

olivia-owen
Download Presentation

A Scheduling Service Oriented Approach for Workflow Scheduling

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. A Scheduling Service Oriented Approach for Workflow Scheduling by Conan Fan Li Supervisor: Dr. Wendy MacCaull Committee member: Dr. Man Lin Committee member: Dr. IkerGondra

  2. A SSO approach for workflow scheduling • Initiatives • AIF project: building decision-support through dynamic workflow systems. • Workflow engines are not naturally built for scheduling problems

  3. What is a workflow? • A workflow or a workflow model is a depiction of a business process composed of a sequence of operations (tasks). • Tasks are connected in the form of a directed graph to provide an abstraction of the real work for further assessment.

  4. What is a workflow?

  5. What is a workflow?

  6. Why workflow? • Abstraction & visualization • Clarity & consistency • Automation

  7. What is scheduling? • The process of making decisions about the allocation of resources for a number of tasks to achieve one or more objectives? • Two main applications

  8. Application of scheduling Manufacturing (e.g., a car factory)

  9. Application of scheduling Service industry (e.g., Gate Assignments at an Airport)

  10. Basics of Scheduling • A scheduling problem can be described by a triplet α | β | γ. • α describes the machine environment • β describes the processing characteristics and constraints • γ describes the objective • The triplet Jm | prec | Cmax describes a job shop scheduling problem with precedence constraints and an objective to minimize the makespan

  11. A Job Shop Example -job, processing time, machine, precedence, requirement, schedule, makespan (0,7) (1,9) (2,21) (3,5) (4,15) (5,30) M0 M1

  12. Workflow Scheduling • Petri net based scheduling job machine precedence constraint

  13. Workflow Scheduling Petri net based scheduling (0,7) (1,9) (2,21) (3,5) (4,15) (5,30) job 1 job 3 job 5 M1 M0 M0 M1 job 0 job 2 job 4

  14. The SSO approach • An approach that maps a scheduling problem onto a workflow model that consists of tasks that provide services for scheduling. • Proposed scheduling services include: • selection • allocation • push • pop • process

  15. Selection M0 (0,7) (4,15) (0,7) (1,9) (2,21) (3,5) (4,15) (5,30) (1,9) M1 0 15 20 25 5 10 M0 M1

  16. Selection • S'=select(S,c) returns a subset of S. Fore each element e in S', c(e) must be True. • Eg. if we define • c1(j)= isNotScheduled(j) && isIndependent(j) • then select(J,c1) returns {J0, J2, J4} (0,7) (1,9) (2,21) (3,5) (4,15) (5,30) M0 M1

  17. Allocation • Given a partial schedule and a number of jobs ready to be scheduled, the allocation service produces the set of successors • For example, let sch0 be the initial schedule where no job is scheduled. allocate(sch0,{J0,J2,J4}) will generate the following three schedules.

  18. Allocation • allocate(sch0,{J0,J2,J4}) M0 M0 M0 (4,15) (2,21) (0,7) M1 M1 M1 0 0 0 15 15 15 20 20 20 25 25 25 5 5 5 10 10 10

  19. Push & Pop M0 M0 M0 (4,15) (2,21) (0,7) Push M1 M1 M1 0 0 0 15 15 15 20 20 20 25 25 25 Pop 5 5 5 10 10 10

  20. Process (0,7) (1,9) (2,21) (3,5) (4,15) (5,30) M0 (0,7) (4,15) (1,9) M1 0 15 20 25 30 5 10 M0 M1 past now future clock=7 slot=16

  21. Process (0,7) (1,9) (2,21) (3,5) (4,15) (5,30) M0 (0,7) (4,15) (1,9) M1 0 15 20 25 30 5 10 M0 M1 past now future clock=16 slot=22

  22. Schedule-flow pop queue is not empty allocate something is selected start push select end nothing is selected process

  23. Schedule-flow in YAWL

  24. PYSF

  25. PYSF

  26. SSO vs. Classic

  27. SSO vs. Classic • Size

  28. SSO vs. Classic • Size pop queue is not empty allocate something is selected start push select end nothing is selected process

  29. SSO vs. Classic 1:0

  30. SSO vs. Classic • Performance

  31. SSO vs. Classic

  32. SSO vs. Classic 2:0

More Related