FR3111448B1 - Method for scheduling tasks in a processing system, associated scheduling device - Google Patents

Method for scheduling tasks in a processing system, associated scheduling device Download PDF

Info

Publication number
FR3111448B1
FR3111448B1 FR2006509A FR2006509A FR3111448B1 FR 3111448 B1 FR3111448 B1 FR 3111448B1 FR 2006509 A FR2006509 A FR 2006509A FR 2006509 A FR2006509 A FR 2006509A FR 3111448 B1 FR3111448 B1 FR 3111448B1
Authority
FR
France
Prior art keywords
scheduling
processing system
task
tasks
execution
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
FR2006509A
Other languages
French (fr)
Other versions
FR3111448A1 (en
Inventor
Lage Raquel Rugani
Anthony Lambert
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.)
Orange SA
Original Assignee
Orange 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 Orange SA filed Critical Orange SA
Priority to FR2006509A priority Critical patent/FR3111448B1/en
Priority to PCT/FR2021/051120 priority patent/WO2021260312A1/en
Publication of FR3111448A1 publication Critical patent/FR3111448A1/en
Application granted granted Critical
Publication of FR3111448B1 publication Critical patent/FR3111448B1/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/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Stored Programmes (AREA)

Abstract

Procédé d’ordonnancement de tâches dans un système de traitement, dispositif d’ordonnancement associé L’invention concerne un procédé d’ordonnancement d’au moins une tâche dans un système de traitement configuré pour exécuter ladite au moins une tâche. Ledit procédé comporte, pour un premier ensemble de tâches associé audit système, une étape de détermination de valeurs de paramètres d’exécution d’un algorithme métaheuristique configuré pour ordonnancer au moins une tâche associée audit système. Ledit procédé comporte en outre, pour au moins un deuxième ensemble de tâches associé audit système, une étape d’ordonnancement comprenant :- une exécution de l’algorithme métaheuristique paramétré par lesdites valeurs,et, si un critère d’arrêt (CR_STOP) de l’algorithme métaheuristique n’est pas atteint (E20_2),- une mise à jour dudit au moins un deuxième ensemble, par retrait d’au moins une tâche parmi ladite au moins deuxième ensemble,ladite exécution, et ladite mise à jour le cas échéant, étant itérées tant que le critère d’arrêt n’est pas atteint. Figure pour l’abrégé : Fig. 3Method for scheduling tasks in a processing system, associated scheduling device The invention relates to a method for scheduling at least one task in a processing system configured to execute said at least one task. Said method comprises, for a first set of tasks associated with said system, a step of determining execution parameter values of a metaheuristic algorithm configured to schedule at least one task associated with said system. Said method further comprises, for at least a second set of tasks associated with said system, a scheduling step comprising: - an execution of the metaheuristic algorithm parameterized by said values, and, if a stopping criterion (CR_STOP) of the metaheuristic algorithm is not reached (E20_2), - an update of said at least one second set, by removing at least one task from said at least second set, said execution, and said update if necessary appropriate, being iterated as long as the stopping criterion is not reached. Figure for abstract: Fig. 3

FR2006509A 2020-06-22 2020-06-22 Method for scheduling tasks in a processing system, associated scheduling device Active FR3111448B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
FR2006509A FR3111448B1 (en) 2020-06-22 2020-06-22 Method for scheduling tasks in a processing system, associated scheduling device
PCT/FR2021/051120 WO2021260312A1 (en) 2020-06-22 2021-06-21 Method for scheduling tasks in a processing system, associated scheduling device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR2006509 2020-06-22
FR2006509A FR3111448B1 (en) 2020-06-22 2020-06-22 Method for scheduling tasks in a processing system, associated scheduling device

Publications (2)

Publication Number Publication Date
FR3111448A1 FR3111448A1 (en) 2021-12-17
FR3111448B1 true FR3111448B1 (en) 2023-09-08

Family

ID=72801617

Family Applications (1)

Application Number Title Priority Date Filing Date
FR2006509A Active FR3111448B1 (en) 2020-06-22 2020-06-22 Method for scheduling tasks in a processing system, associated scheduling device

Country Status (2)

Country Link
FR (1) FR3111448B1 (en)
WO (1) WO2021260312A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114862065B (en) * 2022-07-05 2022-09-23 杭州数询云知科技有限公司 Social work task planning method and device, electronic equipment and storage medium
CN115689252B (en) * 2022-12-28 2023-06-23 杭州中安电子有限公司 Task allocation method and system based on self-adaptive ant colony algorithm

Also Published As

Publication number Publication date
FR3111448A1 (en) 2021-12-17
WO2021260312A1 (en) 2021-12-30

Similar Documents

Publication Publication Date Title
FR3111448B1 (en) Method for scheduling tasks in a processing system, associated scheduling device
Landau The targets R package: a dynamic Make-like function-oriented pipeline toolkit for reproducibility and high-performance computing
US10606613B2 (en) Integrated mainframe distributed orchestration tool
US9952961B2 (en) Assessing risk of software commits to prioritize verification resources
US10416973B2 (en) Analysis of source code for deployment
US20190164100A1 (en) System and method for a cognitive it change request evaluator
US11163594B2 (en) Rescheduling JIT compilation based on jobs of parallel distributed computing framework
CN101395581A (en) Optimised profile-driven compilation method for conditional code for a processor with predicated execution
CN116226134A (en) Method and device for writing data into file and data writing database
US20240330484A1 (en) Open-source vulnerability detection and impact assessments
US20240169283A1 (en) Claim analysis based on candidate functions
US7065758B2 (en) Optimize code for a family of related functions
FR3130419B1 (en) NFC device detection
FR3139214B1 (en) METHOD OF EXECUTTING A MACHINE CODE BY A COMPUTER
US11580555B2 (en) Systems and methods for rules-based decisioning of events
FR3076921B1 (en) Optimization of the execution time of a computer program by determining the implementation of a function according to a range of input parameters and an exactness
Chmiel et al. tukey_hsd: An accurate implementation of the Tukey honestly significant difference test in Python
FR3121501B1 (en) LIGHT GUIDE ASSEMBLY FOR A MOTOR VEHICLE
FR3122752B1 (en) A computer-implemented method for automatically determining a target architecture.
FR3096482B1 (en) Method for controlling the admission of at least one real-time task to be executed
FR3123454B1 (en) Method for managing a secondary radar operating in mode S to avoid the "BDS swap" problem.
FR3120954B1 (en) Contention mitigation method for an operational application and associated contention mitigation system
CN113610123B (en) Multi-source heterogeneous data fusion method and system based on Internet of things
FR3097343B1 (en) Process for diagnosing an output from a slave computer with the authorization of a master computer
FR3136070B1 (en) Method for spectral positioning of a photonic system

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20211217

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