Method of Centralized Planning of Tasks to be Executed by Computers Satisfying Certain Qualitative Criteria Within a Distributed Set of Computers

• US 20160004562A1
• Filed: 02/25/2014
• Published: 01/07/2016
• Est. Priority Date: 02/27/2013
• Status: Abandoned Application

• Current Assignee: Jade-I
• Original Assignee: Jade-I
• Inventors: Vieille, Laurent, Levy, David
• Application Number:
  US14/770,462
• Publication Number:
  US 20160004562A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 3/04842 Selection of displayed objects or displayed text elements G06F3/0482 takes precedence
• CPC Class Codes: G06F 3/0486 Drag-and-drop
• CPC Class Codes: G06F 9/4806 Task transfer initiation or dispatching
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests

Abstract

A method of disseminating a planning of tasks in a network of distributed computers. The network includes a planning server, the programming on the planning server, of a planning of tasks for at least one class of distributed computers; and, independently the defining of ranges of transfer to the distributed computers of information allocated to each distributed computer, the transfer range being defined as a function of the constraints of the network; the splitting of the planned tasks into scheduling information, for each distributed computer and for a period of time dependent on the transfer ranges defined, the scheduling information being generated as a function of the class or classes to which the computer belongs; the transfer to the distributed computers of the scheduling information while complying with the transfer ranges defined.

Claims

1-11. -11. (canceled)

12. A method of disseminating task planning within a network of distributed computers, the distributed computers being qualified by at least one predetermined criterion allowing to define classes of distributed computers, the network further including a planning server, comprising:

the programming, on the planning server, of a task planning for at least one class of distributed computers; and

, independently,

the definition of ranges of transfer towards the distributed computers of information attributed to each distributed computer, the transfer ranges being defined according to the network constraints;

the distribution of the planned tasks into scheduling information, for each distributed computer and for a period of time dependent on the defined transfer ranges, the scheduling information being generated according to the class or classes to which the computer belongs;

the transfer towards the distributed computers of the scheduling information by respecting the defined transfer ranges.

13. The method according to claim 12, wherein a default class is further defined on the planning server and the scheduling information for this default class is transferred to any computer added to the set of distributed computers outside the transfer ranges.

14. The method according to claim 12, wherein at least one intermediate computer controls a cluster of distributed computers and is the recipient of the scheduling information for the computers of the cluster which it controls.

15. The method according to claim 12, wherein the size of the scheduling information is optimized by using a semantic representation of the latter.

16. The method according to claim 12, wherein at least one network constraint comprises a discontinuous availability towards at least part of the distributed computers.

17. The method according to claim 16, wherein the transfer ranges are of type available or of the type which can be activated, and a modification of the planning is further authorized if a transfer range which can be activated allows transferring the scheduling information resulting from the modification.

18. A computer program product including program code instructions saved on a support readable by a computer, for implementing the steps of a method according to claim 12.

19. A method according to claim 12, wherein the programming step is carried out by means of a human-machine interface system comprising a screen and an information typing device for managing task planning in a network of distributed computers, the distributed computers being qualified by at least one predetermined criteria allowing to define classes of distributed computers, the system further comprising:

means for displaying on the screen of a typical planning period; and

means for displaying on the screen a calendar period to be panned;

the typing device being suitable for programming, deleting or replacing a task by dragging and dropping a representation of the task towards the typical period;

then for generating a validation allowing to transfer the planning thus defined over a typical period towards a calendar period.

20. A method according to claim 19, wherein the typing device is further suitable for adding, deleting or replacing a task by the day or according to a time slot.

21. A method according to claim 19, wherein the typing device is suitable for allowing a modification over a calendar period.

22. A method according to claim 19, further comprising means for displaying at least one class of distributed computers and that the typing means are suitable for associating a planning to the class.