FR3091774B1 - Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur - Google Patents

Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur Download PDF

Info

Publication number
FR3091774B1
FR3091774B1 FR1904674A FR1904674A FR3091774B1 FR 3091774 B1 FR3091774 B1 FR 3091774B1 FR 1904674 A FR1904674 A FR 1904674A FR 1904674 A FR1904674 A FR 1904674A FR 3091774 B1 FR3091774 B1 FR 3091774B1
Authority
FR
France
Prior art keywords
task
supercomputer
subnetwork
allocated
deploying
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.)
Expired - Fee Related
Application number
FR1904674A
Other languages
English (en)
Other versions
FR3091774A1 (fr
Inventor
Jean-Noël Quintin
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 Sas Fr
Commissariat a lEnergie Atomique et aux Energies Alternatives CEA
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 US16/722,684 priority Critical patent/US11157326B2/en
Priority to EP19219176.5A priority patent/EP3671455A1/fr
Publication of FR3091774A1 publication Critical patent/FR3091774A1/fr
Application granted granted Critical
Publication of FR3091774B1 publication Critical patent/FR3091774B1/fr
Expired - Fee Related 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/5061—Partitioning or combining of resources
    • G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • 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/5061—Partitioning or combining of resources
    • G06F9/5077—Logical partitioning of resources; Management or configuration of virtualized resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17306—Intercommunication techniques
    • G06F15/17312—Routing techniques specific to parallel machines, e.g. wormhole, store and forward, shortest path problem congestion
    • 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/485—Task life-cycle, e.g. stopping, restarting, resuming execution
    • 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
    • G06F9/4893—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues taking into account power or heat criteria
    • 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/505—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 load
    • 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/5094—Allocation of resources, e.g. of the central processing unit [CPU] where the allocation takes into account power or heat criteria
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mathematical Physics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

Ce procédé de déploiement d’une tâche comporte : l’allocation de nœuds (1…16) à la tâche ; la détermination, dans le réseau (110), d’un sous-réseau, d’interconnexion des nœuds alloués, satisfaisant un ou plusieurs critères de détermination prédéfinis comportant un premier critère selon lequel le sous-réseau utilise uniquement des liens qui ne sont alloués à aucune autre tâche déjà déployée ou bien qui sont alloués à moins de N autres tâches déjà déployées, N étant un nombre prédéfini valant un ou plus ; l’allocation du sous-réseau, et en particulier des liens appartenant à ce sous-réseau, à la tâche ; et l’implémentation de routes de communication inter-nœuds dans le sous-réseau alloué Figure pour l’abrégé : Fig. 1
FR1904674A 2018-12-21 2019-05-03 Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur Expired - Fee Related FR3091774B1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US16/722,684 US11157326B2 (en) 2018-12-21 2019-12-20 Method for deploying a task in a supercomputer, method for implementing a task in a supercomputer, corresponding computer program and supercomputer
EP19219176.5A EP3671455A1 (fr) 2018-12-21 2019-12-20 Procédé de déploiement d'une tâche dans un supercalculateur, procédé de mise en oeuvre d'une tâche dans un supercalculateur, programme d'ordinateur correspondant et supercalculateur

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1873798 2018-12-21
FR1873798A FR3091773A1 (fr) 2018-12-21 2018-12-21 Execution/Isolation d’application par allocation de ressources réseau au travers du mécanisme de routage

Publications (2)

Publication Number Publication Date
FR3091774A1 FR3091774A1 (fr) 2020-07-17
FR3091774B1 true FR3091774B1 (fr) 2021-10-22

Family

ID=67742740

Family Applications (2)

Application Number Title Priority Date Filing Date
FR1873798A Pending FR3091773A1 (fr) 2018-12-21 2018-12-21 Execution/Isolation d’application par allocation de ressources réseau au travers du mécanisme de routage
FR1904674A Expired - Fee Related FR3091774B1 (fr) 2018-12-21 2019-05-03 Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur

Family Applications Before (1)

Application Number Title Priority Date Filing Date
FR1873798A Pending FR3091773A1 (fr) 2018-12-21 2018-12-21 Execution/Isolation d’application par allocation de ressources réseau au travers du mécanisme de routage

Country Status (2)

Country Link
US (1) US11157326B2 (fr)
FR (2) FR3091773A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112445595B (zh) * 2020-11-26 2022-10-25 深圳晶泰科技有限公司 基于slurm计算平台的多任务提交系统
CN114020443B (zh) * 2022-01-05 2022-03-18 国家超级计算天津中心 超级计算机资源调度方法、电子设备和介质

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104156267B (zh) * 2013-05-14 2017-10-10 华为技术有限公司 任务分配方法、任务分配装置及片上网络
US10241838B2 (en) * 2013-12-09 2019-03-26 International Business Machines Corporation Domain based resource isolation in multi-core systems
US10536391B1 (en) * 2016-07-07 2020-01-14 Binaris Inc Systems and methods for intelligently directing a service request to a preferred place of execution

Also Published As

Publication number Publication date
US11157326B2 (en) 2021-10-26
FR3091774A1 (fr) 2020-07-17
FR3091773A1 (fr) 2020-07-17
US20200348982A1 (en) 2020-11-05

Similar Documents

Publication Publication Date Title
FR3091774B1 (fr) Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur
MX2019012502A (es) Arquitectura de red superpuesta predictiva.
TW200735580A (en) Multiple node applications cooperatively managing a plurality of packet switched network pathways
RU2016132883A (ru) Система и способ зонирования в программно определяемых сетях
Eramo et al. Server resource dimensioning and routing of service function chain in NFV network architectures
EP1786151A3 (fr) Accès au réseau fédérateur Internet par sélection d'un ou plusieurs voies à travers des commutateurs de périphérie différents
TW200718089A (en) Autonomic sensor network ecosystem
Bhamare et al. Multi-cloud distribution of virtual functions and dynamic service deployment: Open ADN perspective
US20070248007A1 (en) Broadband access network capacity management
ATE505007T1 (de) Zuteilung von netzwerkressourcen
BR112012033068A2 (pt) gerenciamento de qualidade de serviço à base de nó
Chen et al. Static routing and spectrum assignment for deadline-driven bulk-data transfer in elastic optical networks
CN112422427B (zh) 基于分段路由的流量工程实现方法、装置及控制器
Shirazipourazad et al. Analysis of on-line routing and spectrum allocation in spectrum-sliced optical networks
JP2016082519A5 (fr)
Chen et al. On efficient protection design for dynamic multipath provisioning in elastic optical networks
Hai et al. On the routing and spectrum assignment with multiple objectives
Islam et al. Optimal execution of virtualized network functions for applications in cyber-physical-social-systems
JP6439424B2 (ja) 伝送経路設計装置および伝送経路設計方法
Lu et al. On vNF-SC deployment and task scheduling for bulk-data transfers in inter-DC EONs
CN102783100A (zh) 一种带宽资源的分配方法及装置
FR3091770B1 (fr) Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur
TW200735582A (en) Network nodes cooperatively routing traffic flow amongst wired and wireless networks
FR3076025B1 (fr) Reseau informatique d'infrastructures de ressources de calcul et procede d'affectation de ces ressources a des applications client
Shakya et al. Minimize sub-carrier reallocation in elastic optical path networks using traffic prediction

Legal Events

Date Code Title Description
PLSC Publication of the preliminary search report

Effective date: 20200717

PLFP Fee payment

Year of fee payment: 2

ST Notification of lapse

Effective date: 20210105

RN Application for restoration

Effective date: 20210322

FC Decision of inpi director general to approve request for restoration

Effective date: 20210407

PLFP Fee payment

Year of fee payment: 3

PLFP Fee payment

Year of fee payment: 4

PLFP Fee payment

Year of fee payment: 5

TQ Partial transmission of property

Owner name: LE COMMISSARIAT A L'ENERGIE ATOMIQUE ET AUX EN, FR

Effective date: 20231218

Owner name: BULL SAS, FR

Effective date: 20231218