System and method for managing tasks and task workload items between address spaces and logical partitions
A system for scheduling and dispatching workload items between tasks can include an aggregated file structure and a task scheduler. The aggregated file structure comprises at least one logical partition with each partition having a secondary operating system and address spaces and a plurality of tasks executable therein. The task scheduler is executable from the primary operating system and can receive a service request from a task requesting an action from at least one other task and writing the action, a first task identifier, and at least one other task identifier to at least one private memory address associated with the other task or tasks. The service request action can be a start service request, a stop service request, a suspend service request, a resume service request, change the order of execution service request, or a change priority of executing tasks service request.
1. A system for scheduling and dispatching workload items between tasks, the system comprising:
an aggregated file structure comprising of at least one logical partition with each logical partition having an operating system with multiple address spaces and a plurality of tasks executable therein; and
a task scheduler, executable from a primary operating system, for:
receiving a plurality of service requests from two or more tasks of the plurality of tasks, each service request identifying an action;
requesting, for each task, the action from at least one other task; and
writing, for each task, the action, a first task identifier, and at least one other task identifier to at least one private memory address associated with the at least one other task.
2. The system of claim 1 wherein the service request is one of a start service request, a stop service request, a suspend service request, a resume service request, change the order of execution service request, and change priority of executing tasks service request.
3. The system of claim 1 wherein the task scheduler causes the instantiation of the at least one other task in response to the action.
4. The system of claim 1 wherein the address space of the task is the same as the address space of the at least one other task.
5. The system of claim 4 wherein the at least one other task is a sub-task of the task.
6. The system of claim 1 wherein the address space of the task is different from the address space of the at least one other task.
7. The system of claim 6 wherein both address spaces belong to the same logical partition.
8. The system of claim 1 wherein the task scheduler writes input data received from the task to a private address space of the other task.
9. The system of claim 1 wherein each of the other tasks is the same task.
10. A computer aided method for scheduling and dispatching workload items between tasks, the method comprising:
aggregating a file structure and partitioning the aggregated file structure into at least one logical partition, wherein each logical partition includes an operating system executing thereon and address spaces and a plurality of tasks executable therein;
receiving, at a task scheduler executing from a primary operating system, a plurality of service requests from two or more tasks of the plurality of tasks, each service request identifying an action from at least one other task; and
writing, for each task, the action, a first task identifier, and at least one other task identifier to at least one private memory address associated with the at least one other task.
11. The method of claim 10 wherein the service request is one of a start service request, a stop service request, a suspend service request, a resume service request, change the order of execution service request, and change priority of executing tasks service request.
12. The method of claim 10 wherein the task scheduler causes the instantiation of the at least one other task in response to the action.
13. The method of claim 10 wherein the address space of the task is the same as the address space of the at least one other task.
14. The method of claim 13 wherein the at least one other task is a sub-task of the task.
15. The method of claim 10 wherein the address space of the task is different from the address space of the one other task.
16. The method of claim 15 wherein both address spaces belong to the same logical partition.
17. The method of claim 15 wherein both address spaces belong to different logical partitions.
18. A non-transitory computer readable storage medium comprising a set of computer instructions executable by a processor for scheduling and dispatching workload items between tasks, the computer instructions configured to:
execute the plurality of secondary operating systems on an aggregated file structure comprising at least one logical partition with each logical partition having a secondary operating system and address spaces and a plurality of tasks executable therein;
receive, at a task scheduler executing from the primary operating system, a plurality of service requests from two or more tasks of the plurality of tasks, each service request identifying an action from at least one other task; and
write, for each task, the action, a first task identifier, and at least one other task identifier to at least one private memory address associated with the at least one other task.
19. The system of claim 18 wherein the service request is one of a start service request, a stop service request, a suspend service request, a resume service request, change the order of execution service request, and change priority of executing tasks service request.
20. The system of claim 18 wherein the task scheduler causes the instantiation of the at least one other task in response to the action.