FR3091770B1 - Method of deploying a task in a supercomputer, method of implementing a task in a supercomputer, corresponding computer program and supercomputer - Google Patents

Method of deploying a task in a supercomputer, method of implementing a task in a supercomputer, corresponding computer program and supercomputer Download PDF

Info

Publication number
FR3091770B1
FR3091770B1 FR1904679A FR1904679A FR3091770B1 FR 3091770 B1 FR3091770 B1 FR 3091770B1 FR 1904679 A FR1904679 A FR 1904679A FR 1904679 A FR1904679 A FR 1904679A FR 3091770 B1 FR3091770 B1 FR 3091770B1
Authority
FR
France
Prior art keywords
task
supercomputer
deploying
network
allocated
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
FR1904679A
Other languages
French (fr)
Other versions
FR3091770A1 (en
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
Commissariat a lEnergie Atomique et aux Energies Alternatives CEA
Original Assignee
Bull SAS
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 SAS filed Critical Bull SAS
Priority to EP19219177.3A priority Critical patent/EP3671456A1/en
Priority to US16/722,912 priority patent/US11334392B2/en
Publication of FR3091770A1 publication Critical patent/FR3091770A1/en
Application granted granted Critical
Publication of FR3091770B1 publication Critical patent/FR3091770B1/en
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/5072—Grid computing
    • 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
    • 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
    • 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
    • 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
    • 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
    • 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]
    • 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
    • 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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • 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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
    • 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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5022—Mechanisms to release resources
    • 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
    • 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/5044—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 hardware capabilities
    • 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
    • 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
    • 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)
  • Mathematical Physics (AREA)
  • Computer Hardware Design (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Exchanges In Wide-Area Networks (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 déterminé est celui, parmi au moins deux sous-réseaux satisfaisant le ou les critères autres que le premier critère, utilisant le plus de commutateurs déjà alloués chacun à au moins une tâche déjà déployée ; 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. 1This method of deploying a task involves: allocating nodes (1 ... 16) to the task; the determination, in the network (110), of a sub-network, of interconnection of the allocated nodes, satisfying one or more predefined determination criteria comprising a first criterion according to which the determined sub-network is that, among at least two subnetworks satisfying the criteria other than the first criterion, using the most switches already allocated each to at least one task already deployed; the allocation of the subnetwork, and in particular of the links belonging to this subnetwork, to the task; and the implementation of inter-node communication routes in the allocated subnet Figure for the abstract: Fig. 1

FR1904679A 2018-12-21 2019-05-03 Method of deploying a task in a supercomputer, method of implementing a task in a supercomputer, corresponding computer program and supercomputer Expired - Fee Related FR3091770B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19219177.3A EP3671456A1 (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
US16/722,912 US11334392B2 (en) 2018-12-21 2019-12-20 Method for deployment of a task in a supercomputer, method for implementing a task in a supercomputer, corresponding computer program and supercomputer

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1873820 2018-12-21
FR1873820A FR3091775A1 (en) 2018-12-21 2018-12-21 Execution / Application isolation by allocation of network resources through the routing mechanism

Publications (2)

Publication Number Publication Date
FR3091770A1 FR3091770A1 (en) 2020-07-17
FR3091770B1 true FR3091770B1 (en) 2021-09-24

Family

ID=67384128

Family Applications (2)

Application Number Title Priority Date Filing Date
FR1873820A Pending FR3091775A1 (en) 2018-12-21 2018-12-21 Execution / Application isolation by allocation of network resources through the routing mechanism
FR1904679A Expired - Fee Related FR3091770B1 (en) 2018-12-21 2019-05-03 Method of deploying a task in a supercomputer, method of implementing a task in a supercomputer, corresponding computer program and supercomputer

Family Applications Before (1)

Application Number Title Priority Date Filing Date
FR1873820A Pending FR3091775A1 (en) 2018-12-21 2018-12-21 Execution / Application isolation by allocation of network resources through the routing mechanism

Country Status (1)

Country Link
FR (2) FR3091775A1 (en)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104156267B (en) * 2013-05-14 2017-10-10 华为技术有限公司 Method for allocating tasks, task allocation apparatus and network-on-chip
WO2017056238A1 (en) * 2015-09-30 2017-04-06 株式会社日立製作所 Vm assignment management system and vm assignment management method

Also Published As

Publication number Publication date
FR3091770A1 (en) 2020-07-17
FR3091775A1 (en) 2020-07-17

Similar Documents

Publication Publication Date Title
JP4899643B2 (en) Network component
DE60128155D1 (en) METHOD AND ARRANGEMENTS FOR OBTAINING A DYNAMIC OPERATING DISTRIBUTION DIRECTIVE IN PACKET BASED COMMUNICATION NETWORKS
DE60139016D1 (en) PROCESS AND TOP-CONSIDERED MANAGER IN AN IP REMOTE SYSTEM
CN112311592B (en) SRv6SID self-adaptive networking method and device
JP4917742B2 (en) System and method for network tuning with multiprotocol label switching
Chen et al. On efficient protection design for dynamic multipath provisioning in elastic optical networks
CN112422427B (en) Traffic engineering implementation method, device and controller based on segmented routing
FR3091774B1 (en) Method of deploying a task in a supercomputer, method of implementing a task in a supercomputer, corresponding computer program and supercomputer
FR3091770B1 (en) Method of deploying a task in a supercomputer, method of implementing a task in a supercomputer, corresponding computer program and supercomputer
Chen et al. Optimizing FIPP-${p} $-Cycle Protection Design to Realize Availability-Aware Elastic Optical Networks
US10778562B2 (en) Path computation in a multi-tenant network
JP6439424B2 (en) Transmission path design apparatus and transmission path design method
Skoog et al. Analysis and implementation of a 3-way handshake signaling protocol for highly dynamic transport networks
Assis et al. Approaches to maximize the open capacity of elastic optical networks
de Queiroz et al. A heuristic approach for border node selection and traffic routing in multi-domain optical networks
Comellas et al. Impact of traffic delay tolerance on elastic optical networks performance
JP6579102B2 (en) Optical network management apparatus and optical network management method
Chang et al. A simple network-engineering approach for improving connection availability in WDM networks
Piruthiviraj et al. Wavelength Selectivity Using Adaptive Shortest Path Algorithm for Optical Network.
Wang et al. Efficient distributed solution for MPLS Fast Reroute
Patil et al. Routing and re-routing scheme for cost effective mechanism in WDM Network
Drummond et al. On-line dynamic traffic grooming algorithms for WDM mesh networks
Develder et al. Dimensioning backbone networks for multi-site data centers: exploiting anycast routing for resilience
Ravhuanzwo et al. SDN-enabled dynamic WDM networks to address routing information inaccuracy
Singal et al. Performance evaluation of algorithms for wavelength assignment in optical ring network

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

PLFP Fee payment

Year of fee payment: 6