FR3091376B1 - Process for optimizing a scheduling plan and the sizing of an IT infrastructure - Google Patents

Process for optimizing a scheduling plan and the sizing of an IT infrastructure Download PDF

Info

Publication number
FR3091376B1
FR3091376B1 FR1874426A FR1874426A FR3091376B1 FR 3091376 B1 FR3091376 B1 FR 3091376B1 FR 1874426 A FR1874426 A FR 1874426A FR 1874426 A FR1874426 A FR 1874426A FR 3091376 B1 FR3091376 B1 FR 3091376B1
Authority
FR
France
Prior art keywords
infrastructure
execution
optimizing
sizing
plan
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
FR1874426A
Other languages
French (fr)
Other versions
FR3091376A1 (en
Inventor
Bruno Demeilliez
Wajih Chaabane
Damien Aiello
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bull SA
Original Assignee
Bull SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bull SA filed Critical Bull SA
Priority to FR1874426A priority Critical patent/FR3091376B1/en
Priority to EP19203879.2A priority patent/EP3640800A1/en
Publication of FR3091376A1 publication Critical patent/FR3091376A1/en
Application granted granted Critical
Publication of FR3091376B1 publication Critical patent/FR3091376B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration

Abstract

L’invention porte sur un procédé d’optimisation d’un plan d’ordonnancement et du dimensionnement d’une infrastructure informatique pour l’exécution d’une pluralité de traitements par lots, ladite infrastructure informatique présentant des valeurs de quantités de ressources initiales permettant l’exécution de la pluralité de traitements par lots, ledit procédé comportant une étape de détermination (300) de durées d’exécution rallongées de la pluralité de traitements par lots, une étape de génération (400) d’au moins un plan de dimensionnement optimisé, ladite étape de génération comportant la sélection (430), parmi les valeurs de quantité de ressources disponibles, de valeurs de quantité de ressources attribuées à l’au moins un plan de dimensionnement optimisé ; et une étape de calcul (500), d'un plan d’ordonnancement respectant des règles d'exécution mémorisées. L’invention porte également sur un dispositif (1) d’optimisation d’un plan d’ordonnancement et du dimensionnement d’une infrastructure informatique (2) pour l’exécution d’une pluralité de traitements par lots. Figure à publier avec l’abrégé : FIGURE 1The invention relates to a method for optimizing a scheduling plan and the sizing of an IT infrastructure for the execution of a plurality of batch processes, said IT infrastructure having values of quantities of initial resources allowing execution of the plurality of batch processes, said method comprising a step of determining (300) extended execution times of the plurality of batch processes, a step of generating (400) at least one dimensioning plan optimized, said generating step comprising selecting (430), from among the available resource quantity values, resource quantity values allocated to the at least one optimized sizing plan; and a calculation step (500) of a scheduling plan respecting the stored execution rules. The invention also relates to a device (1) for optimizing a scheduling plan and the dimensioning of an IT infrastructure (2) for the execution of a plurality of batch processes. Figure to be published with the abstract: FIGURE 1

FR1874426A 2018-10-17 2018-12-31 Process for optimizing a scheduling plan and the sizing of an IT infrastructure Active FR3091376B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
FR1874426A FR3091376B1 (en) 2018-12-31 2018-12-31 Process for optimizing a scheduling plan and the sizing of an IT infrastructure
EP19203879.2A EP3640800A1 (en) 2018-10-17 2019-10-17 Method for improving the efficiency of use of the resources of an infrastructure designed to execute a scheduling plan

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
FR1874426A FR3091376B1 (en) 2018-12-31 2018-12-31 Process for optimizing a scheduling plan and the sizing of an IT infrastructure

Publications (2)

Publication Number Publication Date
FR3091376A1 FR3091376A1 (en) 2020-07-03
FR3091376B1 true FR3091376B1 (en) 2020-12-11

Family

ID=66867348

Family Applications (1)

Application Number Title Priority Date Filing Date
FR1874426A Active FR3091376B1 (en) 2018-10-17 2018-12-31 Process for optimizing a scheduling plan and the sizing of an IT infrastructure

Country Status (1)

Country Link
FR (1) FR3091376B1 (en)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012125144A1 (en) * 2011-03-11 2012-09-20 Joyent, Inc. Systems and methods for sizing resources in a cloud-based environment
FR3023940B1 (en) 2014-07-17 2017-12-29 Bull Sas METHOD FOR PRODUCING CONTROLLED INTERFERENCE OF AN AUTOMATED PROCESSING DEVICE DURING A TEST SCENARIO OF AN APPLICATION
FR3038405B1 (en) 2015-07-02 2019-04-12 Bull Sas LOT PROCESSING ORDERING MECHANISM
FR3061784B1 (en) * 2017-01-12 2021-11-26 Bull Sas PROCESS FOR EVALUATING THE PERFORMANCE OF AN APPLICATION CHAIN WITHIN AN IT INFRASTRUCTURE

Also Published As

Publication number Publication date
FR3091376A1 (en) 2020-07-03

Similar Documents

Publication Publication Date Title
Mak et al. The mini-BESTest can predict parkinsonian recurrent fallers: a 6-month prospective study.
SG11201808548XA (en) Task-resource scheduling method and device
US20180143858A1 (en) Method & system for meeting multiple slas with partial qos control
Bortoluzzi et al. Validity of the Italian algorithm for the attribution of neuropsychiatric events in systemic lupus erythematosus: a retrospective multicentre international diagnostic cohort study
Jung et al. Project categorization, prioritization, and execution based on Six Sigma concept: a case study of operational improvement project
CN107193652A (en) The flexible resource dispatching method and system of flow data processing system in container cloud environment
Radhika et al. A review on prediction based autoscaling techniques for heterogeneous applications in cloud environment
KR101852610B1 (en) Method for using resources using ai learning based realtime analyzing system and managemnet server using the same
FR3091376B1 (en) Process for optimizing a scheduling plan and the sizing of an IT infrastructure
KR20220128353A (en) Generating protein sequences using machine learning techniques based on template protein sequences
US11776005B2 (en) System, method, and computer program product for generating a synthetic control group
Rolland 'Desperately'seeking research on agile requirements in the context of large-scale agile projects
JP2016516235A5 (en)
Trzyna et al. Throughput time characteristics of rush orders and their impact on standard orders
Figueiredo et al. The effect of longer development times on product pipeline management performance
FR3087282B1 (en) PROCESS FOR OPTIMIZING THE MINIMUM SIZING OF AN INFRASTRUCTURE INTENDED TO EXECUTE A SCHEDULE PLAN
KR20160076896A (en) Method and apparatus for selecting a preemption technique
FR3076025B1 (en) COMPUTER NETWORK OF COMPUTING RESOURCE INFRASTRUCTURES AND METHOD FOR ASSIGNING SUCH RESOURCES TO CUSTOMER APPLICATIONS
Sajdak The concept of an agile enterprise research model
FR3076935B1 (en) METHODS OF LEARNING PARAMETERS OF A CONVOLVED NEURON NETWORK AND OF CLASSIFYING AN INPUT DATA
JP6996271B2 (en) Information processing equipment, information processing methods, and information processing programs
FR3084508B1 (en) METHOD FOR PREDICTING A BIOLOGICAL ASSESSMENT
FR3066289B1 (en) PROCESS, IMPLEMENTATION BY COMPUTER, OF SEARCHING FOR ASSOCIATION RULES IN A DATABASE
Wangikar et al. Faster payments to farmers: analysis of the direct payments process of EU’s agricultural guarantee fund
FR3076370B1 (en) METHOD AND SYSTEM FOR THE OPTIMIZATION OF THE SCHEDULING OF BATCH TREATMENTS

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20200703

PLFP Fee payment

Year of fee payment: 3

PLFP Fee payment

Year of fee payment: 4

PLFP Fee payment

Year of fee payment: 5

PLFP Fee payment

Year of fee payment: 6