Methods and apparatus for scheduling parallel processors

• US 6,434,590 B1
• Filed: 04/01/1998
• Issued: 08/13/2002
• Est. Priority Date: 07/14/1995
• Status: Expired due to Term

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Avaya Technology Corporation Miami Lakes FLA US
• Inventors: Narlikar, Girija J., Blelloch, Guy E., Matias, Yossi, Gibbons, Phillip B.
• Primary Examiner(s): Coleman, Eric
• Application Number:
  US09/053,873
• Time in Patent Office: 1,595 Days
• Field of Search: 712/1, 709/106, 709/102, 709/1
• US Class Current: 718/102
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451

Abstract

A parallel processing method involves the steps of determining a sequential ordering of tasks for processing, assigning priorities to available tasks on the basis of the earliest and then later in the sequential ordering, selecting a number of tasks greater than a total number of available parallel processing elements from all available tasks having the highest priorities, partitioning the selected tasks into a number of groups equal to the available number of parallel processing elements, and executing the tasks in the groups in the parallel processing elements. The determining step establishes an ordering with a specific predetermined sequential schedule that is independent of the parallel execution, and the assigning step assigns priorities for parallel execution on the basis of the sequential schedule that is independent of the parallel execution.

Claims

1. A method of parallel processing, comprising:

selecting, in an assignment manager, a sequential schedule to determine priorities for processing;

assigning, in the assignment manager, live tasks available for scheduling according to priorities on the basis of the sequential schedule;

making, in the assignment manager, the highest priority live tasks that are available for scheduling available for processing by parallel processing elements;

extracting, by said processing elements, available tasks for processing into each of said processing elements; and

executing tasks from the extracted tasks in each of the processing elements;

said sequential schedule and determining of priorities being independent of the execution of the extracted tasks in the processing elements;

choosing, in the assignment manager, an operating criterion for execution of the extracted tasks in the processing elements; and

said executing of tasks in each of said processing elements including executing extracted tasks until the criterion is reached and then feeding information concerning the execution to the assignment manager.

2. A method as in claim 1, wherein tasks are spawned during executing of tasks and the tasks are given priorities on the basis of the sequential scheduling.

3. A method as in claim 1, wherein said sequential ordering is a Depth-first (DF) schedule.

4. A method as in claim 1, further comprising placing information on completed tasks in the assignment manager and new live tasks generated by execution into a task in queue.

5. A method as in claim 4, further comprising fetching information on completed tasks and new live tasks from the task in queue and updating to remove records of completed tasks and include records of new live tasks.

6. A method as in claim 4, further comprising placing in the task queue notification that the parallel program has completed.

7. A method as in claim 1, wherein the assignment manager selects a depth first order as the sequential schedule used to determine priorities.

8. A method as in claim 1, wherein the assignment manager places the live tasks in a depth first order, and places records that mark these tasks as unblocked.

9. A method as in claim 1, wherein the assignment manager determines which tasks are available for scheduling and not blocked.

10. A method as in claim 1, wherein the assignment manager removes records of completed tasks and includes records of new live tasks, marks said tasks awaiting a flag as blocked awaiting a flag and otherwise marks said tasks as unblocked, and marks as unblocked any tasks awaiting any of the new flags.

11. A method as in claim 1, wherein the criterion is time elapsed.

12. A method as in claim 1, wherein the criterion is used memory.

13. A method as in claim 1, wherein the criterion is the number of operations completed.

14. A method as in claim 1, wherein the criterion is the number of tasks completed.

15. A method as in claim 1, wherein the processing elements feed information concerning the execution to the assignment manager no later than when the criterion is reached.

16. A method as in claim 1, wherein the processing elements feeding information concerning the execution to the assignment manager then extract available tasks for processing.

18. A method as in claim 1, wherein said selecting and assigning and making by the assignment manager overlap said extracting and executing by the processing elements, and neither the assignment manager nor the processing elements need wait for the other to become idle before the selecting and assigning and making by the assignment manager and said extracting and executing by the processing elements.

17. An apparatus for parallel processing, comprising:

an assignment manager having coded therein a sequential schedule to determine priorities for processing;

the assignment manager being responsive to live tasks available for scheduling according to priorities on the basis of the sequential schedule;

the assignment manager being responsive to the highest priority live tasks that are available for scheduling available for processing;

a plurality of task-extracting and task-executing processing elements respectively responsive to available tasks so that said processing elements execute tasks from the tasks extracted into each of the processing elements;

said sequential schedule for determining of priorities in said assignment manager being independent of the execution of the executed tasks in the processing elements;

said assignment manager having an operating criterion for governing execution of the extracted tasks in the processing elements; and

said task-extracting and task-executing processing elements being responsive to said criterion and including a status feedback arrangement to said assignment manager in response to said criterion.

19. An apparatus as in claim 17, wherein in said processing elements spawn tasks during executing of extracted tasks and the tasks are given priorities in said assignment manager on the basis of the sequential scheduling.

20. An apparatus as in claim 17, wherein said assignment manager includes the sequential ordering in a depth-first (DF) schedule.

21. An apparatus as in claim 17, wherein said feedback arrangement places information on completed tasks in the assignment manager and on new live tasks generated by execution into a task in queue.

22. An apparatus as in claim 19, wherein said assignment manager responds to information on completed tasks and new live tasks in a task in queue and updates to remove records of completed tasks and include records of new live tasks.

23. An apparatus as in claim 19, wherein said feedback arrangement places in the task queue notification that the parallel program has completed.

24. An apparatus as in claim 17, wherein the assignment manager selects a depth first order as the sequential schedule used to determine priorities.

25. An apparatus as in claim 17, wherein the assignment manager places the live tasks a depth first order, and places records that mark these tasks as unblocked.

26. An apparatus as in claim 17, wherein the assignment manager determines which tasks are available for scheduling and not blocked.

27. An apparatus as in claim 17, wherein the assignment manager removes records of completed tasks and Includes records of new live tasks, marks said tasks awaiting a flag as blocked awaiting a flag and otherwise marks said tasks as unblocked, and marks as unblocked any tasks awaiting any of the new flags.

28. An apparatus as in claim 17, wherein thus criterion is time elapsed.

29. An apparatus as in claim 17, wherein the criterion is used memory.

30. An apparatus as in claim 17, wherein the criterion is the number of operations completed.

31. An apparatus as in claim 17, wherein the criterion is the number of tasks completed.

32. An apparatus as in claim 17, wherein the processing elements feed information concerning the execution to the assignment manager no later than when the criterion is reached.

33. An apparatus as in claim 17, wherein the processing elements feeding information concerning the execution to the assignment manager then extract available tasks for processing.

34. An apparatus as in claim 17, wherein the assignment manager responses overlap said processing elements responses, and neither the assignment manager nor the processing elements wait for the other to become idle before executing the tasks.