Gotowa bibliografia na temat „Programmation à base de tâches”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Programmation à base de tâches”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Programmation à base de tâches"
Seassau, M., T. Weiss, R. Carcangiu i F. Duval. "Les mouvements oculomoteurs : un marqueur d’efficacité du méthylphénidate (MPH) dans le TDA/H". European Psychiatry 29, S3 (listopad 2014): 597. http://dx.doi.org/10.1016/j.eurpsy.2014.09.191.
Pełny tekst źródłaBernier, Bernard. "L’automatisation industrielle au Japon et ses conséquences sur le travail et les travailleurs". ANTHROPOLOGY OF WORK Guest editor: Greag Teal / ANTHROPOLOGIE DU TRAVAIL Sous la direction de Greg Teal 15, nr 2 (18.11.2021): 65–84. http://dx.doi.org/10.7202/1083878ar.
Pełny tekst źródłaLussier-Desrochers, Dany, Jeannie Roux i Catherine Sparnaay. "La prise de médicaments de façon autonome pour des personnes présentant une déficience intellectuelle". Revue francophone de la déficience intellectuelle 25 (17.11.2014): 24–36. http://dx.doi.org/10.7202/1027325ar.
Pełny tekst źródłaRuf, Isaline, i Laura Weiss. "Evaluer la résolution de problème de manière certificative : une question complexe". Revue de Mathématiques pour l’école, nr 241 (7.06.2024): 3–14. http://dx.doi.org/10.26034/vd.rm.2024.3970.
Pełny tekst źródłaMpia, Héritier Nsenge. "De la vulnérabilité des informations numériques dans les réseaux informatiques : Cas de l'infiltration à travers le rootkit". Revue Internationale Multidisciplinaire Etincelle 21, nr 1 (10.07.2018): 1–13. http://dx.doi.org/10.61532/rime211111.
Pełny tekst źródłaDumont, Jacques. "Préparation au concours interne de recrutement des professeurs d'EPS — une démarche innovante en Guadeloupe". STAPS 16, nr 37 (1995): 63–71. http://dx.doi.org/10.3406/staps.1995.1025.
Pełny tekst źródłaTigchelaar, Sonia Magdalena. "LA CONCEPTION D'UN MANUEL DE FRANÇAIS LANGUE ÉTRANGÈRE : QUELLE(S) ENTRÉE(S) ?" Non Plus, nr 5 (20.09.2015): 8–19. http://dx.doi.org/10.11606/issn.2316-3976.v3i5p8-19.
Pełny tekst źródłaCouture, Ariane. "Parcours dans la programmation des concerts du Nouvel Ensemble Moderne". Circuit 23, nr 3 (23.01.2014): 63–73. http://dx.doi.org/10.7202/1021519ar.
Pełny tekst źródłaObadia, Lionel. "Programmation, pilotage, politique, prospective… Les contraintes normatives de la « recherche sur projet » en SHS (France-Europe)". Communications 114, nr 1 (5.04.2024): 161–72. http://dx.doi.org/10.3917/commu.114.0161.
Pełny tekst źródłaPoame, Lazare Marcelin. "Les tâches d’une philosophie pratique à l’âge de la technoscience". Philosophiques 25, nr 1 (8.08.2007): 91–109. http://dx.doi.org/10.7202/027474ar.
Pełny tekst źródłaRozprawy doktorskie na temat "Programmation à base de tâches"
Benbernou, Salima. "Outils de base pour une approche de programmation fonctionnelle des tâches opératoires : application aux tâches d'assemblage". Valenciennes, 1991. https://ged.uphf.fr/nuxeo/site/esupversions/27732085-ba53-4b37-94ed-e9e67ed3fb2c.
Pełny tekst źródłaHermenier, Fabien. "Gestion dynamique des tâches dans les grappes : une approche à base de machines virtuelles". Phd thesis, Université de Nantes, 2009. http://tel.archives-ouvertes.fr/tel-00476822.
Pełny tekst źródłaSergent, Marc. "Passage à l'echelle d'un support d'exécution à base de tâches pour l'algèbre linéaire dense". Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0372/document.
Pełny tekst źródłaThe ever-increasing supercomputer architectural complexity emphasizes the need for high-level parallel programming paradigms to design efficient, scalable and portable scientific applications. Among such paradigms, the task-based programming model abstracts away much of the architecture complexity by representing an application as a Directed Acyclic Graph (DAG) of tasks. Among them, the Sequential-Task-Flow (STF) model decouples the task submission step, sequential, from the parallel task execution step. While this model allows for further optimizations on the DAG of tasks at submission time, there is a key concern about the performance hindrance of sequential task submission when scaling. This thesis’ work focuses on studying the scalability of the STF-based StarPU runtime system (developed at Inria Bordeaux in the STORM team) for large scale 3D simulations of the CEA which uses dense linear algebra solvers. To that end, we collaborated with the HiePACS team of Inria Bordeaux on the Chameleon software, which is a collection of linear algebra solvers on top of task-based runtime systems, to produce an efficient and scalable dense linear algebra solver on top of StarPU up to 3,000 cores and 288 GPUs of CEA-DAM’s TERA-100 cluster
Polet, Pierre-Etienne. "Portage des chaînes de traitement sonar sur architecture hétérogène : conception et évaluation d'un environnement de programmation basé sur les tâches moldables". Electronic Thesis or Diss., Lyon, École normale supérieure, 2024. http://www.theses.fr/2024ENSL0004.
Pełny tekst źródłaThe increasing computational demands in SONAR processing chains lead to the choice of heterogeneous architectures based on GPGPU. The complexity of these architectures makes algorithm implementation challenging for individuals who are not specialists in both the application domain and parallel programming. This thesis aims to address this issue by leveraging task-based programming concepts. Static code analysis methods allowed us to group function calls on a GPU to limit certain overheads by increasing task granularity.To extend this approach to enable the utilization of multiple GPUs while controlling memory usage, we explored a moldable task model. This was instantiated into a new OpenMP directive that unifies several older parallelization directives. In this model, moldable tasks or sub-tasks retain the ability to have dependencies. The design of a prototype executive support for managing these moldable tasks focused on load balancing on a heterogeneous architecture and defining an algorithm to detect dependencies between such tasks. Experiments on a SONAR processing beamforming algorithm and the Cholesky factorization algorithm highlighted the method's benefits and some weaknesses in the implementation choices
Vet, Jean-Yves. "Parallélisme de tâches et localité de données dans un contexte multi-modèle de programmation pour supercalculateurs hiérarchiques et hétérogènes". Paris 6, 2013. http://www.theses.fr/2013PA066483.
Pełny tekst źródłaThis thesis makes several distinct contributions which rely on a dedicated task-based programming model. The novelty of this model resides in a dynamic adjustment of the quantity of embedded operations depending on the targeted processing unit. It is particularly well adapted to dynamically balance workloads between heterogeneous processing units. It better harnesses those units by strengthening responsiveness in the presence of execution times fluctuations induced by irregular codes or unpredictable hardware mechanisms. Moreover, the semantics and programming interface of the task-parallel model facilitates the use of automated behaviors such as data coherency of deported memories. It alleviates the burden of developers by taking care of this tedious work and which can be a source of errors. We developed H3LMS an execution platform designed to combine the propositions detailed in the thesis. The platform is integrated to the MPC programming environment in order to enhance cohabitation with other programming models and thus better harness clusters. H3LMS is elaborated to improve task scheduling between homogeneous and heterogeneous processing units by reducing the need to resort to distant accesses in a cluster node. This thesis also focuses on the adaptation of legacy codes which are originally designed to exploit traditional processors and may also consist of hundreds of thousand lines of code. The performance of this solution is evaluated on the Linpack library and on a legacy numerical application from the CEA
Rossignon, Corentin. "Un modèle de programmation à grain fin pour la parallélisation de solveurs linéaires creux". Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0094/document.
Pełny tekst źródłaSolving large sparse linear system is an essential part of numerical simulations. These resolve can takeup to 80% of the total of the simulation time.An efficient parallelization of sparse linear kernels leads to better performances. In distributed memory,parallelization of these kernels is often done by changing the numerical scheme. Contrariwise, in sharedmemory, a more efficient parallelism can be used. It’s necessary to use two levels of parallelism, a first onebetween nodes of a cluster and a second inside a node.When using iterative methods in shared memory, task-based programming enables the possibility tonaturally describe the parallelism by using as granularity one line of the matrix for one task. Unfortunately,this granularity is too fine and doesn’t allow to obtain good performance.In this thesis, we study the granularity problem of the task-based parallelization. We offer to increasegrain size of computational tasks by creating aggregates of tasks which will become tasks themself. Thenew coarser task graph is composed by the set of these aggregates and the new dependencies betweenaggregates. Then a task scheduler schedules this new graph to obtain better performance. We use as examplethe Incomplete LU factorization of a sparse matrix and we show some improvements made by this method.Then, we focus on NUMA architecture computer. When we use a memory bandwidth limited algorithm onthis architecture, it is interesting to reduce NUMA effects. We show how to take into account these effects ina task-based runtime in order to improve performance of a parallel program
Liang, Yan. "Mise en œuvre d'un simulateur en OCCAM pour la conception d'architectures parallèles à base d'une structure multiprocesseur hiérarchique". Compiègne, 1989. http://www.theses.fr/1989COMPD176.
Pełny tekst źródłaThe simulation has become an indispensable phase for conception of parallel processing systems, and enables to avoid construction of expensive prototypes. In this paper, a parallel process-oriented simulator written in OCCAM language has been developed. Our objective is to conceive a simulator adapted to a network of transputers for prototyping parallel processing systems by connecting directly the serial transputer channels. As a simulation example, a parallel processor system (coprocessor) based on hierarchical structure : master-slave has been realized at the processor-memory-switch level. The performance analysis is obtained via two queuing models : the former as independent M/M/1 systems and the latter as a M/M/s system. The experimental performance is measured respectively based on the independent tasks and the sequential tasks. The comparison of analytic and experimental results enables us to constate the advantage and limit of the coprocessor and to encourage us to its implementation
Tahan, Oussama. "Improving execution reliability of parallel applications on multicore architectures : an OpenMP based approach". Compiègne, 2012. http://www.theses.fr/2012COMP2046.
Pełny tekst źródłaToday, computers are implemented more frequently within systems in order to provide products with better functionalities and improved performance. The fast growing appeal on computing based systems forced industry to meet new short time to market and cost related challenges. Besides that, systems providers are facing rapidly growing needs to supply computers with reliability and safety requirements. This is because both applications and processors complexity keeps increasing and die size remains shrinking, thus making computers more vulnerable toward transient faults. For all these reasons, engineers try to find cost-efficient tools and flexible solutions to properly develop these systems. In this PhD thesis, we will study a redundancy based fault tolerance approach using OpenMP taskcentric programming model. In this approach, we enable OpenMP programmers to tag reliable tasks within a program to automatically replicate them and apply a triple modular redundancy. Voting mechanism is used to detect and recover from erroneous results and behavior. This technique allows developers to take advantage of recent and future multi and many-core based systems since the number of available and not fully exploited resources keeps increasing with the growing number of cores. In addition, we will implement within Nanos runtime system a task cancellation approach allowing us to free resources by cancelling erroneous unnecessary subtrees of tasks. It will also allow OpenMP programmers to easily code applications involving task cancellation and speculative execution. Moreover, we will study runtime enhancements to improve execution of OpenMP applications on NUMA based architectures
Boillot, Lionel. "Contributions à la modélisation mathématique et à l'algorithmique parallèle pour l'optimisation d'un propagateur d'ondes élastiques en milieu anisotrope". Thesis, Pau, 2014. http://www.theses.fr/2014PAUU3043/document.
Pełny tekst źródłaThe most common method of Seismic Imaging is the RTM (Reverse Time Migration) which depends on wave propagation simulations in the subsurface. We focused on a 3D elastic wave propagator in anisotropic media, more precisely TTI (Tilted Transverse Isotropic). We directly worked in the Total code DIVA (Depth Imaging Velocity Analysis) which is based on a discretization by the Discontinuous Galerkin method and the Leap-Frog scheme, and developed for intensive parallel computing – HPC (High Performance Computing). We choose to especially target two contributions. Although they required very different skills, they share the same goal: to reduce the computational cost of the simulation. On one hand, classical boundary conditions like PML (Perfectly Matched Layers) are unstable in TTI media. We have proposed a formulation of a stable ABC (Absorbing Boundary Condition) in anisotropic media. The technique is based on slowness curve properties, giving to our approach an original side. On the other hand, the initial parallelism, which is based on a domain decomposition and communications by message passing through the MPI library, leads to load-imbalance and so poor parallel efficiency. We have fixed this issue by replacing the paradigm for parallelism by the use of task-based programming through runtime system. This PhD thesis have been done in the framework of the research action DIP (Depth Imaging Partnership) between the Total oil company and Inria
Oulamara, Ammar. "Flowshops avec détérioration des tâches et groupement des tâches". Université Joseph Fourier (Grenoble), 2001. http://www.theses.fr/2001GRE10074.
Pełny tekst źródłaKsiążki na temat "Programmation à base de tâches"
Beaudouin-Lafon, Michel. Les langages à objets: Principes de base, techniques de programmation. Paris: A. Colin, 1992.
Znajdź pełny tekst źródłaBiggerstaff, Ted J. Outils logiciels pour la programmation système. Paris: Masson, 1989.
Znajdź pełny tekst źródłaMeyer, Bertrand. Reusable software: The Base object-oriented component libraries. [Goleta, Calif: Interactive Software Engineering, Inc., 1995.
Znajdź pełny tekst źródłaMeyer, Bertrand. Reusable software: The Base object-oriented component libraries. Hemel Hempstead: Prentice Hall, 1994.
Znajdź pełny tekst źródłaTanenbaum, Andrew S. Architecture de l'ordinateur: Du circuit logique au logiciel de base. Paris: InterÉditions, 1987.
Znajdź pełny tekst źródłaTanenbaum, Andrew S. Architecture de l'ordinateur: Du circuit logique au logiciel de base. Paris: InterEditions, 1988.
Znajdź pełny tekst źródłaHabert, Antoine. Scripting Windows: Automatiser les tâches d'administration avec VBScript, WSH, WMI, ADSI et les objets COM. Paris: Eyrolles, 2005.
Znajdź pełny tekst źródłaOracle 10g: Entraînez-vous à administrer une base de données. Nantes: Éditions ENI, 2005.
Znajdź pełny tekst źródłaAlberta. Alberta Learning. Direction de l'éducation française. Exemples de tâches d'intégration des technologies de l'information et de la communication aux matières de base de la 10e à la 12e année: Immersion. Edmonton: Alberta Learning, Direction de l'éducation française, 2000.
Znajdź pełny tekst źródłaAlberta. Alberta Learning. Direction de l'éducation française. Exemples de tâches d'intégration des technologies de l'information et de la communication aux matières de base de la 1re à la 6e année: Francophone. Edmonton: Alberta Learning, Direction de l'éducation française, 2000.
Znajdź pełny tekst źródłaCzęści książek na temat "Programmation à base de tâches"
"LES STRUCTURES DE BASE". W Éléments de programmation structurée, 29–56. Presses de l'Université du Québec, 2011. http://dx.doi.org/10.2307/j.ctv18pgz8t.7.
Pełny tekst źródłaGINOSAR, Ran. "Plural, pluricoeur haute performance à faible consommation d’énergie". W Systèmes multiprocesseurs sur puce 1, 73–91. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9021.ch3.
Pełny tekst źródłaParratte, Jean. "Les Techniques de Base en Approche Familiale Systémique: Questionnement Circulaire, Recadrage et Prescription de Tâches". W L’Approche Systémique en Santé Mentale, 113–46. Les Presses de l’Université de Montréal, 2008. http://dx.doi.org/10.1515/9782760627499-007.
Pełny tekst źródłaRaporty organizacyjne na temat "Programmation à base de tâches"
Brinkerhoff, Derick W., Sarah Frazer i Lisa McGregor. S'adapter pour apprendre et apprendre pour s'adapter : conseils pratiques tirés de projets de développement internationaux. RTI Press, styczeń 2018. http://dx.doi.org/10.3768/rtipress.2018.pb.0015.1801.fr.
Pełny tekst źródłaIyer, Ruhil, i Léa Pare Toe. Effet des aléas climatiques sur les pratiques d’hygiène et d’assainissement en milieu rural au Burkina Faso. The Sanitation Learning Hub, Institute of Development Studies, sierpień 2022. http://dx.doi.org/10.19088/slh.2022.017.
Pełny tekst źródła