DETERMINING WHETHER A GIVEN DIAGRAM IS A CONCEPTUAL MODEL

• US 20120023499A1
• Filed: 07/26/2010
• Published: 01/26/2012
• Est. Priority Date: 07/26/2010
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Biran, Ofer, Hochberg, Tirtsa, Masin, Michael, Wasserkrug, Segev Eliezer, Rapaport, Gil, Shiloach, Yossi
• Granted Patent: US 8,904,395 B2
• Time in Patent Office: Days
• US Class Current: 718/103
• 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

Systems and methods for scheduling events in a virtualized computing environment are provided. In one embodiment, the method comprises scheduling one or more events in a first event queue implemented in a computing environment, in response to determining that number of events in the first event queue is greater than a first threshold value, wherein the first event queue comprises a first set of events received for purpose of scheduling, wherein said first set of events remain unscheduled; mapping the one or more events in the first event queue to one or more server resources in a virtualized computing environment; receiving a second set of events included in a second event queue, wherein one more events in the second set of event are defined as having a higher priority than one or more events in the first event queue that have or have not yet been scheduled.

Claims

1. A computer implemented method for scheduling events in a virtualized computing environment, the method comprising:

scheduling one or more events in a first event queue implemented in a computing environment, in response to determining that number of events in the first event queue is greater than a first threshold value, wherein the first event queue comprises a first set of events received for purpose of scheduling, wherein said first set of events remain unscheduled;

mapping the one or more events in the first event queue to one or more server resources in a virtualized computing environment;

receiving a second set of events included in a second event queue, wherein one more events in the second set of event are defined as having a higher priority than one or more events in the first event queue that have or have not yet been scheduled; and

scheduling one or more events in the second queue in time slots assigned to one or more events in the first queue.

2. The method of claim 1, wherein the one or more events in the second queue are mapped to one or more server resources in the virtualized computing environment that were assigned to one or more events in the first queue.

3. The method of claim 1, wherein the one or more events in the first queue are rescheduled to different time slots depending on priority attributes associated with the events in the first queue and the second queue.

4. The method of claim 2, wherein the one or more events in the first queue are remapped to different server resources in the virtualized computing environment depending on priority attributes associated with the events in the first queue and the second queue.

5. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s level of importance in comparison with other events.

6. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s level of importance in comparison with other events.

7. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s scheduling priority in comparison with other events.

8. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s scheduling priority in comparison with other events.

9. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s rescheduling penalty.

10. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s rescheduling penalty.

11. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s duration.

12. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s duration.

13. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s scheduled run time intervals.

14. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s scheduled run time intervals.

15. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s length of pendency.

16. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s length of pendency.

17. The method of claim 3, wherein the priority attributes comprise information about an event'"'"'s progression rate in relation to the total length of pendency of the event.

18. The method of claim 4, wherein the priority attributes comprise information about an event'"'"'s progression rate in relation to the total length of pendency of the event.

19. A computing system for scheduling events in a virtualized computing environment, the method comprising:

a scheduler for scheduling one or more events in a first event queue, in response to determining that number of events in the first event queue is greater than a first threshold value, wherein the first event queue comprises a first set of events received for purpose of scheduling, wherein said first set of events remain unscheduled;

a mapper for mapping the one or more events in the first event queue to one or more server resources in a virtualized computing environment;

a logic unit for receiving a second set of events included in a second event queue, wherein one more events in the second set of event are defined as having a higher priority than one or more events in the first event queue that have or have not yet been scheduled; and

wherein the scheduler schedules one or more events in the second queue in time slots assigned to one or more events in the first queue.

20. The computing system of claim 19, wherein the one or more events in the second queue are mapped to one or more server resources in the virtualized computing environment that were assigned to one or more events in the first queue, wherein the one or more events in the first queue are rescheduled to different time slots depending on priority attributes associated with the events in the first queue and the second queue, and wherein the one or more events in the first queue are remapped to different server resources in the virtualized computing environment depending on priority attributes associated with the events in the first queue and the second queue.

23. A computer program product comprising a computer readable storage medium having a computer readable program stored thereon, wherein the computer readable program when executed on a computer causes the computer to:

schedule one or more events in a first event queue implemented in a computing environment, in response to determining that number of events in the first event queue is greater than a first threshold value, wherein the first event queue comprises a first set of events received for purpose of scheduling, wherein said first set of events remain unscheduled;

map the one or more events in the first event queue to one or more server resources in a virtualized computing environment;

receive a second set of events included in a second event queue, wherein one more events in the second set of event are defined as having a higher priority than one or more events in the first event queue that have or have not yet been scheduled; and

schedule one or more events in the second queue in time slots assigned to one or more events in the first queue.

24. The computer program product of claim 23, wherein the one or more events in the second queue are mapped to one or more server resources in the virtualized computing environment that were assigned to one or more events in the first queue.

25. The computer program product of claim 23, wherein the one or more events in the first queue are rescheduled to different time slots depending on priority attributes associated with the events in the first queue and the second queue.