Processing

Please wait...

Settings

Settings

Goto Application

1. WO2014170036 - METHOD AND APPARATUS FOR EXPLOITING DATA LOCALITY IN DYNAMIC TASK SCHEDULING

Publication Number WO/2014/170036
Publication Date 23.10.2014
International Application No. PCT/EP2014/051193
International Filing Date 22.01.2014
IPC
G06F 9/45 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
44Arrangements for executing specific programs
45Compilation or interpretation of high level programme languages
G06F 12/08 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
12Accessing, addressing or allocating within memory systems or architectures
02Addressing or allocation; Relocation
08in hierarchically structured memory systems, e.g. virtual memory systems
G06F 9/48 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
48Program initiating; Program switching, e.g. by interrupt
G06F 9/50 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
50Allocation of resources, e.g. of the central processing unit
CPC
G06F 8/41
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
G06F 8/423
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
42Syntactic analysis
423Preprocessors
G06F 8/43
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
43Checking; Contextual analysis
G06F 8/4441
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
44Encoding
443Optimisation
4441Reducing the execution time required by the program code
G06F 8/445
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
44Encoding
445Exploiting fine grain parallelism, i.e. parallelism at instruction level
G06F 8/451
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
45Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions
451Code distribution
Applicants
  • SIEMENS AKTIENGESELLSCHAFT [DE]/[DE]
Inventors
  • MATTHEIS, Sebastian
  • SCHÜLE, Tobias
Priority Data
13/865,85618.04.2013US
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) METHOD AND APPARATUS FOR EXPLOITING DATA LOCALITY IN DYNAMIC TASK SCHEDULING
(FR) PROCÉDÉ ET APPAREIL POUR EXPLOITER LA LOCALITÉ DES DONNÉES EN ORDONNANCEMENT DYNAMIQUE DES TÂCHES
Abstract
(EN)
A method for scheduling tasks to processor cores of a parallel computing system comprising the steps of processing a source code which comprises at least one parallel lambda function having a function body called by a task and having a capture list specifying the data structures accessed in the function body of said parallel lambda function and used to derive data location information; executing the task calling said function body on the processor core which is associated to a memory unit of the parallel computing system where the data of the data structures specified by said capture list is stored, wherein the memory unit is selected or localized on the basis of the derived data location information.
(FR)
L'invention porte sur un procédé d'ordonnancement de tâches sur des cœurs de processeur d'un système de calcul parallèle, comprenant les étapes consistant à traiter un code source qui comprend au moins une fonction lambda parallèle ayant un corps de fonction appelé par une tâche et ayant une liste de capture spécifiant les structures de données faisant l'objet d'un accès dans le corps de fonction de ladite fonction lambda parallèle et utilisées pour obtenir des informations de localisation de données; à exécuter la tâche appelant ledit corps de fonction sur le cœur de processeur qui est associé à une unité de mémoire du système de calcul parallèle dans laquelle sont stockées les données des structures de données spécifiées par ladite liste de capture, l'unité de mémoire étant sélectionnée ou localisée sur la base des informations de localisation de données obtenues.
Also published as
Latest bibliographic data on file with the International Bureau