Дисертації з теми "Calcul dans la mémoire"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Calcul dans la mémoire".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ezzadeen, Mona. "Conception d'un circuit dédié au calcul dans la mémoire à base de technologie 3D innovante." Electronic Thesis or Diss., Aix-Marseille, 2022. http://theses.univ-amu.fr.lama.univ-amu.fr/221212_EZZADEEN_955e754k888gvxorp699jljcho_TH.pdf.
Повний текст джерелаWith the advent of edge devices and artificial intelligence, the data deluge is a reality, making energy-efficient computing systems a must-have. Unfortunately, classical von Neumann architectures suffer from the high cost of data transfers between memories and processing units. At the same time, CMOS scaling seems more and more challenging and costly to afford, limiting the chips' performance due to power consumption issues.In this context, bringing the computation directly inside or near memories (I/NMC) seems an appealing solution. However, data-centric applications require an important amount of non-volatile storage, and modern Flash memories suffer from scaling issues and are not very suited for I/NMC. On the other hand, emerging memory technologies such as ReRAM present very appealing memory performances, good scalability, and interesting I/NMC features. However, they suffer from variability issues and from a degraded density integration if an access transistor per bitcell (1T1R) is used to limit the sneak-path currents. This thesis work aims to overcome these two challenges. First, the variability impact on read and I/NMC operations is assessed and new robust and low-overhead ReRAM-based boolean operations are proposed. In the context of neural networks, new ReRAM-based neuromorphic accelerators are developed and characterized, with an emphasis on good robustness against variability, good parallelism, and high energy efficiency. Second, to resolve the density integration issues, an ultra-dense 3D 1T1R ReRAM-based Cube and its architecture are proposed, which can be used as a 3D NOR memory as well as a low overhead and energy-efficient I/NMC accelerator
Valat, Sébastien. "Contribution à l'amélioration des méthodes d'optimisation de la gestion de la mémoire dans le cadre du calcul haute performance." Versailles-St Quentin en Yvelines, 2014. http://www.theses.fr/2014VERS0014.
Повний текст джерелаCurrent supercomputer architectures are subject to memory related issues. For instance we can observe slowdowns induced by memory management mechanisms and their implementation. In this context, we focus on the management of large memory segments for multi-core and NUMA supercomputers similar to Tera 100 and Curie. We discuss our work in three parts. We first study several paging policies (page coloring, huge pages. . . ) from multiple operating systems. We demonstrate an interference between those policies and layout decisions taken by userspace allocators. Such interactions can significantly reduce cache efficiency depending on the application, particularly on multi-core architectures. This study extends existing works by studying interactions between the operating system, the allocator and caches. Then, we discuss performance issues when large memory segments are allocated. We consider the interaction between the OS and userspace allocators. We show that we can significantly improve some application performances (up to 50%) by controlling the memory exchange rate with the OS and by taking care of memory topologies. We finally study page fault extensibility in current Linux kernel implementation. We observe a large impact due to page zeroing which is a security requirement. We propose an improvement on memory allocation semantic aimed at avoiding page zeroing. It shows a new interest for huge pages to improve paging scalability without changing too much kernel algorithms
Slavova, Tzvetomila. "Résolution triangulaire de systèmes linéaires creux de grande taille dans un contexte parallèle multifrontal et hors-mémoire." Thesis, Toulouse, INPT, 2009. http://www.theses.fr/2009INPT016H/document.
Повний текст джерелаWe consider the solution of very large systems of linear equations with direct multifrontal methods. In this context the size of the factors is an important limitation for the use of sparse direct solvers. We will thus assume that the factors have been written on the local disks of our target multiprocessor machine during parallel factorization. Our main focus is the study and the design of efficient approaches for the forward and backward substitution phases after a sparse multifrontal factorization. These phases involve sparse triangular solution and have often been neglected in previous works on sparse direct factorization. In many applications, however, the time for the solution can be the main bottleneck for the performance. This thesis consists of two parts. The focus of the first part is on optimizing the out-of-core performance of the solution phase. The focus of the second part is to further improve the performance by exploiting the sparsity of the right-hand side vectors. In the first part, we describe and compare two approaches to access data from the hard disk. We then show that in a parallel environment the task scheduling can strongly influence the performance. We prove that a constraint ordering of the tasks is possible; it does not introduce any deadlock and it improves the performance. Experiments on large real test problems (more than 8 million unknowns) using an out-of-core version of a sparse multifrontal code called MUMPS (MUltifrontal Massively Parallel Solver) are used to analyse the behaviour of our algorithms. In the second part, we are interested in applications with sparse multiple right-hand sides, particularly those with single nonzero entries. The motivating applications arise in electromagnetism and data assimilation. In such applications, we need either to compute the null space of a highly rank deficient matrix or to compute entries in the inverse of a matrix associated with the normal equations of linear least-squares problems. We cast both of these problems as linear systems with multiple right-hand side vectors, each containing a single nonzero entry. We describe, implement and comment on efficient algorithms to reduce the input-output cost during an outof- core execution. We show how the sparsity of the right-hand side can be exploited to limit both the number of operations and the amount of data accessed. The work presented in this thesis has been partially supported by SOLSTICE ANR project (ANR-06-CIS6-010)
Juganaru, Mihaela. "Equilibrage et régulation de charge dans les machines parallèles à mémoire distribuée." Phd thesis, Ecole Nationale Supérieure des Mines de Saint-Etienne, 1999. http://tel.archives-ouvertes.fr/tel-00822691.
Повний текст джерелаLemer, Cathy. "Représentations langagières des nombres dans la résolution de calculs mentaux complexes: une approche par la mémoire à court-terme verbale." Doctoral thesis, Universite Libre de Bruxelles, 2000. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211747.
Повний текст джерелаFournier, Catherine (1970. "Role des canaux potassium dépendant du calcium sensibles à l'apamine dans les processus mnésiques." Aix-Marseille 1, 1999. http://www.theses.fr/1999AIX11051.
Повний текст джерелаReganaz, Lucas. "Etude des fluctuations de résistance dans les ReRAM : origine physique, dépendance temporelle et impact sur la fiabilité de la mémoire." Electronic Thesis or Diss., Université Grenoble Alpes, 2024. http://www.theses.fr/2024GRALT012.
Повний текст джерелаThis thesis investigates the pivotal role of emerging non-volatile memory (NVM) technologies, with a primary focus on Resistive Random-Access Memory (ReRAM), in addressing the challenges of memory latency associated with the shrinking of logic components. The exploration begins by elucidating the fundamental physics of ReRAM and its potential applications in in-memory and neuromorphic computing.The second chapter delves into material engineering strategies to optimize ReRAM performance, covering aspects such as top electrode materials, doping effects, and the benefits of a bi-layer resistive switching (RS) oxide stack. These insights provide a foundation for subsequent investigations into device reliability.A Kinetic Monte Carlo (KMC) simulation framework is introduced in the third chapter, offering a powerful tool for probing the microscopic dynamic behavior of ReRAM. This framework becomes instrumental in the fourth chapter, where the physics of ReRAM reliability, specifically resistance fluctuations, is explored in depth. The analysis reveals intricate mechanisms governing fluctuations and their impact on metrics like the standard Failing Bit Count (FBC).In the final chapter, the application of ReRAM devices as synapses in artificial neural networks (ANNs) is revisited. Programming techniques and strategies to mitigate the impact of fluctuations, particularly in multi-level cell (MLC) ReRAM, are discussed. The thesis concludes by emphasizing the crucial role of ReRAM material stack engineering in designing reliable synapses for future computing paradigms.This comprehensive exploration contributes to advancing our understanding of ReRAM's potential, offering insights into device optimization, reliability, and its application in neuromorphic computing. Looking forward, the research underscores the significance of continued innovation in ReRAM material engineering to unlock its full capabilities and facilitate its integration into the evolving landscape of computing technologies
Vaumourin, Gregory. "Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0173/document.
Повний текст джерелаThe energy consumption of the memory system in modern architectures is a major issue for embedded system limited by their battery or supercalculators limited by their Thermal Design Power. Using a classification information in the memory system allows a heterogeneous management of data, more specific to each kind of data. During this thesis, we focused on the specific management of read-only data into the memory system through a compilation/architecture codesign. It allows to explore new potentials in terms of data locality, scalability of the system or cache designs. Evaluated by simulation with multi-core architecture, the proposed solution others significant energy consumption reduction while keeping the performance stable
Monnet, Sébastien. "Gestion des données dans les grilles de calcul : support pour la tolérance aux fautes et la cohérence des données." Phd thesis, Université Rennes 1, 2006. http://tel.archives-ouvertes.fr/tel-00411447.
Повний текст джерелаGoglin, Brice. "Réseaux rapides et stockage distribué dans les grappes de calculateurs : propositions pour une interaction efficace." Lyon, École normale supérieure (sciences), 2005. http://www.theses.fr/2005ENSL0328.
Повний текст джерелаThis work aims at studying the exploitation of high-speed networks of clusters for distributed storage. Parallel applications running on clusters require both high-performance communications between nodes and efficient access to the storage system. Many studies on network technologies led to the design of dedicated architectures for clusters with very fast communications between computing nodes. Efficient distributed storage in clusters have been essentially developed by adding parallelization mechanisms so that the server(s) may sustain an increased workload. In this work, we propose to improve the performance of distributed storage systems in clusters by efficiently using the underlying high-performance network to access distant storage systems. The main question we are addressing is: do high-speed networks of clusters fit the requirements of a transparent, efficient and high-performance access to remote storage? We show that storage requirements are very different from those of parallel computation. High-speed networks of clusters were designed to optimize communications between different nodes of a parallel application. We study their utilization in a very different context, storage in clusters, where client-server models are generally used to access remote storage (for instance NFS, PVFS or Lustre). Our experimental study based on the usage of the GM programming interface of Myrinet high-speed networks for distributed storage did raised several interesting problems. Firstly, the specific memory utilization in the storage access system layers does not easily fit the traditional memory model of high-speed networks. Secondly, client-server models that are used for distributed storage have specific requirements on message control and event processing, which are not handled by existing interfaces. We propose different solutions to solve communication control problems at the file-system level. We show that a modification of the network programming interface is required. Data transfer issues need an adaptation of the operating system. We detail several propositions for network programming interfaces which make their utilization easier in the context of distributed storage. The integration of a flexible processing of data transfer in the new programming interface Myrinet/MX is finally presented. Performance evaluations show that its usage in the context of both storage and other types of applications is easy and efficient
Bigot, Julien. "Du support générique d'opérateurs de composition dans les modèles de composants logiciels : Application au calcul à haute performance." Phd thesis, INSA de Rennes, 2010. http://tel.archives-ouvertes.fr/tel-00626698.
Повний текст джерелаBonnet, Djohan. "Synaptic uncertainty for in-memory computing." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPAST037.
Повний текст джерелаThe high demand for Artificial Neural Networks, combined with their high energy cost due to the memory bottleneck of von-Neumann architectures, has intensified efforts to overcome hardware constraints. This thesis explores the interdisciplinary field of neuromorphic computing, focusing on experimental studies, algorithms, and integrated circuit design. The experimental part investigates the electrical characteristics of resistive random access memories based on metal-oxide transition (OxRAMs) and phase change memories (PCMs) to understand their different variabilities. Additionally, a Bayesian neural network is implemented across 75 electronic chips. Moving to algorithms, the research involves both experimental and theoretical analyses of a novel learning method named MESU, which stands for metaplasticity from synaptic uncertainty. This method exploits synaptic uncertainty in Bayesian neural networks for continual learning. Lastly, for the circuit design part, a full custom in-memory computing demonstrator is developed, leveraging OxRAM technology, covering aspects from transistor sizing to layout realization
Zhang, Bo. "Self-optimization of infrastructure and platform resources in cloud computing." Thesis, Lille 1, 2016. http://www.theses.fr/2016LIL10207/document.
Повний текст джерелаElasticity is considered as an important solution to handle the performance issues in scalable distributed system. However, most of the researches of elasticity only concern the provisioning and de-provisioning resources in automatic ways, but always ignore the resource utilization of provisioned resources. This might lead to resource leaks while provisioning redundant resources, thereby causing unnecessary expenditure. To avoid the resource leaks and redundant resources, my research therefore focus on how to maximize resource utilization by self resource management. In this thesis, relevant to diverse problems of resource usage and allocation in different layers, I propose two resource management approaches corresponding to infrastructure and platform, respectively. To overcome infrastructure limitation, I propose CloudGC as middleware service which aims to free occupied resources by recycling idle VMs. In platform-layer, a self-balancing approach is introduced to adjust Hadoop configuration at runtime, thereby avoiding memory loss and dynamically optimizing Hadoop performance. Finally, this thesis concerns rapid deployment of service which is also an issue of elasticity. A new tool, named "hadoop-benchmark", applies docker to accelerate the installation of Hadoop cluster and to provide a set of docker images which contain several well-known Hadoop benchmarks.The assessments show that these approaches and tool can well achieve resource management and self-optimization in various layers, and then facilitate the elasticity of infrastructure and platform in scalable platform, such as Cloud computing
Brice, Goglin. "Réseaux rapides et stockage distribué dans les grappes de calculateurs : propositions pour une interaction efficace." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2005. http://tel.archives-ouvertes.fr/tel-00408722.
Повний текст джерела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.
Повний текст джерелаThis 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
Perisse, Emmmanuel. "Le calcium, un déclencheur moléculaire de la formation de la mémoire olfactive à long terme chez l'abeille : approches comportementale et transcriptomique." Toulouse 3, 2009. http://thesesups.ups-tlse.fr/678/.
Повний текст джерелаLong-term memory formation is a neural process requiring synaptic modifications, gene transcription and de novo protein synthesis enabling long-term information storage. Among the different molecular actors involved in memory formation, calcium appears to play a central role. Indeed, its spatial and temporal regulation could allow calcium to play a crucial role in numerous nervous functions. Using behavioral, pharmacological and molecular approaches, this work focuses on the role of calcium and the expression of calcium-dependent genes involved in the formation of an olfactory long-term memory in the honeybee Apis mellifera. Our results revealed that 1) pharmacological buffering of intracellular calcium concentration ([Ca2+]i) during an associative conditioning in multiple trials induces a specific drop of memory performance at long-term; 2) conversely, during a one trial conditioning, a pharmacologically-induced [Ca2+]i increase triggers a specific enhancement of long-term memory, which is dependent on de novo protein synthesis; 3) the analysis of the transcriptomic results (microarray and quantitative RT-PCR) suggest that calcium regulates gene expression required for long-term memory formation. This work establishes the necessary and sufficient role of calcium in the establishment of long-term memory. The [Ca2+]i level during training would be a critical key triggering various molecular pathways leading to the regulation of target genes expression and de novo protein synthesis required for the long-term storage of information
Chabane, Hinde. "Contribution à la validation expérimentale de l'approche Monte-Carlo de l'interaction neutron-silicium utilisée dans des codes de physique nucléaire dédiées au calcul de SER des mémoires SRAM." Montpellier 2, 2006. http://www.theses.fr/2006MON20164.
Повний текст джерелаWrobel, Frédéric. "Elaboration d'une base de données des particules responsables des dysfonctionnements dans les composants électroniques exposés à des flux de protons ou de neutrons. Application au calcul des taux d'erreurs dans les mémoires sram en environnement radiatif naturel." Montpellier 2, 2002. http://www.theses.fr/2002MON20064.
Повний текст джерелаGiacinti, Anaïs. "Implication fonctionnelle des vaisseaux sanguins cérébraux dans le processus de consolidation mnésique." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0271/document.
Повний текст джерелаWhile there is consensus that cerebral blood flow is distributed according to themetabolic demand of neurons, the contribution of vascular networks to memoryconsolidation, the process by which memories acquire stability over time, remainsunknown. This process requires a transitory hippocampal-cortical interaction allowingthe progressive remodeling of cortical neuronal networks supporting the remotememory trace.By using a behavioral task requiring an associative olfactory memory coupled to cellularimaging techniques, we first reveal, in adult healthy rats, a functional dissociationbetween the reactivity and the architecture of cerebral vascular networks. We identifycalcium signaling changes that occur in specific cerebral arteries, pointing to theirability to adapt their dynamics upon retrieval to enable the successful expression ofeither recent or remote memories. Moreover, we show that vascular networks undergo atime-dependent densification via an angiogenesis mechanism as early as one day afterlearning, including in cortical regions which will only support memory storage andretrieval weeks later. By specifically stimulating this early cortical angiogenesis, we wereable to improve the performance of rats tested for remote memory.Taken together, our results highlight the importance of vascular plasticity inmodulating neuronal plasticity and cognitive functions. They also suggest that the earlystructural changes within vascular networks could constitute a permissive mechanismwhich regulates the development of cortical dendritic spines thought to support theprogressive formation and storage of enduring memories
Peultier, Bertrand. "Alliages à Mémoire de Forme: Modélisation et Calcul de Structures." Phd thesis, Paris, ENSAM, 2005. http://pastel.archives-ouvertes.fr/pastel-00001444.
Повний текст джерелаEtcheverry, Arnaud. "Simulation de la dynamique des dislocations à très grande échelle." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0263/document.
Повний текст джерелаThis research work focuses on bringing performances in 3D dislocation dynamics simulation, to run efficiently on modern computers. First of all, we introduce some algorithmic technics, to reduce the complexity in order to target large scale simulations. Second of all, we focus on data structure to take into account both memory hierachie and algorithmic data access. On one side we build this adaptive data structure to handle dynamism of data and on the other side we use an Octree to combine hierachie decompostion and data locality in order to face intensive arithmetics with force field computation and collision detection. Finnaly, we introduce some parallel aspects of our simulation. We propose a classical hybrid parallelism, with task based openMP threads and domain decomposition technics for MPI
Desprez, Frédéric. "Procédures de base pour le calcul scientifique sur machines parallèles à mémoire distribuée." Phd thesis, Grenoble INPG, 1994. http://tel.archives-ouvertes.fr/tel-00344993.
Повний текст джерелаDandouna, Makarem. "Librairies numériques réutilisables pour le calcul distribué à grande échelle." Versailles-St Quentin en Yvelines, 2012. http://www.theses.fr/2012VERS0063.
Повний текст джерелаWe propose, in this thesis, a design model for numerical libraries based on a component oriented approach and a strict separation between data management, computation operations and communication control of an application. This model allows the sequential/parallel reusability as well as the expression of the multi-levels parallelism. The abstraction of the three principals aspects of a parallel library suggested by our design model allows the independence of this one from the communication mecanisms. One of the consequences of this independence is the possibility to make more scalable the existing parallel libraries and those built according to this model. To validate the proposed approach, we realize our design model basing on some existing numerical libraries designed differently used jointly with a scientifc workfow environment called YML. Experiments performed on the supercomputer HopperII from the National Energy Research Scientifc Computing Center (NERSC) and on the national French Grid'5000 platform show the effciency and the scalability of our approach
Morin, Catherine. "L'oubli en mémoire." Master's thesis, Université Laval, 2016. http://hdl.handle.net/20.500.11794/26870.
Повний текст джерелаGras-Vincendon, Agnès. "Fonctionnement de la mémoire dans l'autisme : Etude de la mémoire temporelle et des états subjectifs de conscience en mémoire épisodique dans l'autisme." Université Louis Pasteur (Strasbourg) (1971-2008), 2005. http://www.theses.fr/2005STR14789.
Повний текст джерелаMaillard, Nicolas. "Calcul Haute-Performance et Mécanique Quantique : analyse des ordonnancements en temps et en mémoire." Phd thesis, Université Joseph Fourier (Grenoble), 2001. http://tel.archives-ouvertes.fr/tel-00004684.
Повний текст джерелаDusser, Julien. "Blocs nuls dans la hiérarchie mémoire." Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00557080.
Повний текст джерелаGadafi, Aeiman. "Gestion mémoire dans une infrastructure répartie." Phd thesis, Toulouse, INPT, 2013. http://oatao.univ-toulouse.fr/11004/1/gadafi.pdf.
Повний текст джерелаMakunga, Lendo. "Mémoire et oubli dans l'Ancien Testament." Université Marc Bloch (Strasbourg) (1971-2008), 2006. http://www.theses.fr/2006STR20029.
Повний текст джерелаThis thesis tries to analyse all the Old Testament texts which base the Historical Memory of the Biblical Israel. The purpose of this study is to show how the Biblical Israel keeps this memory alive. This thesis is divided into three chapters of unequal length. The first chapter develops the memory places. The second chapter studies the memory content. The third chapter compares the Biblical Israel Culture with the Yombe Culture of Democratic Republic of Congo related with the memory. It results from this research that the Biblical Israel insistence on the memory and texts production which aim of keeping this memory alive is best explained by the destruction of Jerusalem and its political and cultual institutions collapse in 586 B. C. Therefore, from the theological point of view, the memory is seen as a relatively recent thought in the Old Testament
Ancrenat, Anne-Marie. "De mémoire de femmes, la mémoire archaïque dans l'oeuvre romanesque d'Anne Hébert." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq25373.pdf.
Повний текст джерелаKaci, Ania. "Conception d'une architecture extensible pour le calcul massivement parallèle." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1044.
Повний текст джерелаIn response to the growing demand for performance by a wide variety of applications (eg, financial modeling, sub-atomic simulation, bioinformatics, etc.), computer systems become more complex and increase in size (number of computing components, memory and storage capacity). The increased complexity of these systems results in a change in their architecture towards a heterogeneous computing technologies and programming models. The harmonious management of this heterogeneity, resource optimization and minimization of consumption are major technical challenges in the design of future computer systems.This thesis addresses a field of this complexity by focusing on shared memory subsystems where all processors share a common address space. Work will focus on the implementation of a cache coherence and memory consistency on an extensible architecture and methodology for validation of this implementation.In our approach, we selected processors 64-bit ARM and generic co-processor (GPU, DSP, etc.) as components of computing, shared memory protocols AMBA / ACE and AMBA / ACE-Lite and associated architecture "CoreLink CCN" as a starting solution. Generalization and parameterization of this architecture and its validation in the simulation environment GEM5 are the backbone of this thesis.The results at the end of the thesis, tend to demonstrate the achievement of objectives
ABDICHE, MINA. "Pi-calcul et sous-typage : inference de types et codages du lambda-calcul dans le pi-calcul." Paris 11, 2000. http://www.theses.fr/2000PA112214.
Повний текст джерелаAhmad, Mumtaz. "Stratégies d'optimisation de la mémoire pour le calcul d'applications linéaires et l'indexation de document partagés." Phd thesis, Université Henri Poincaré - Nancy I, 2011. http://tel.archives-ouvertes.fr/tel-00641866.
Повний текст джерелаDauvois, Nathalie. "Mémoire et poésie dans l'oeuvre de Ronsard." Paris 10, 1986. http://www.theses.fr/1986PA100097.
Повний текст джерелаThis survey aims to wonder about the status of memory within the Ronsard’s masterwork. In this notion are defined the stakes of a writing. The link established in the Ronsard’s work between the treasure of invention of the poem and its future memory situates it into the tradition of epidictical rhetoric. Memory is the source of a topic which is inkeeping with the system of virtues. The poet dedicates an immortal Mnemeion to the celebrated hero sighting him out as an exemplarity of virtue, searching into his memory the material and the means of this illustration. From this model are studied the modifications operated by the text, is drawn an evolution: this one of a poetry where is enhanced the rhetoric function, the persuasive and didactic will, where teaching value and memorable value are mingled, and a poetry where is enhanced the poetic value, the aim of the work towards itself, and which obliges the reader to take part to the constitution of a contextual memory. This contextual memory is elaborated within the network of an intertextual memory: the author conceives progressively his work renewing his own way of imitation and particularly writing out the same myths. The game of variation and auto citation establishes a dialogue in the reader's memory and within the same language between antic works and Ronsardian work and, defining the singularity of a poetic voice, defines it as memorable as Homeric or Virgilian voices. The invention of a poetic of memory is therefore linked to the birth of a memory of libraries, place of return to the source of poetic voices, place of a renewed dialogue between works, authors and readers of past, present and future
Syska, Michel. "Communication dans les architectures à mémoire distribuée." Nice, 1992. http://www.theses.fr/1992NICE4562.
Повний текст джерелаLacore-Martin, Emmanuelle. "Temps, mémoire, histoire dans l'oeuvre de Rabelais." Paris 3, 2003. http://www.theses.fr/2003PA030057.
Повний текст джерелаRabelais' works stand at a crossroads in literary history, partaking in the sweeping renewal movement in every domain of knowledge, which characterizes the beginning of the sixteenth century, while still bearing the legacy of the finishing medieval times. This particular situation appears to deeply motivate and influence a reflection on the notion of time in the text, within a meaningful network linking it with the associated themes of history and memory. Rabelais' playful approach of time in the narrative reveals a questioning of the nature of narrated time itself, which leads to a reflection on the specificity of the historical text as opposed to fiction - at a time when boundaries between the two are still blurred. This critical comment on historiography is rooted in an opposition between memory and history, written history and the living memory of the people, which is ultimately linked with the question of the nature and structure of time and the intersection between human and cosmic time
Morasse, Karine. "La mémoire épisodique dans le développement normal et dans l'autisme." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ65322.pdf.
Повний текст джерелаBlanc, Tomasz. "Propriétés de sécurité dans le lambda-calcul." Phd thesis, Ecole Polytechnique X, 2006. http://pastel.archives-ouvertes.fr/pastel-00002090.
Повний текст джерелаPomeransky, Andrei. "Intrication et Imperfections dans le Calcul Quantique." Phd thesis, Université Paul Sabatier - Toulouse III, 2004. http://tel.archives-ouvertes.fr/tel-00007256.
Повний текст джерелаMezzina, Claudio antares. "Réversibilité dans le pi calcul d'ordre supérieur." Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00683964.
Повний текст джерелаMezzina, Claudio Antares. "Réversibilité dans le pi calcul d'ordre supérieur." Thesis, Grenoble, 2012. http://www.theses.fr/2012GRENM006/document.
Повний текст джерелаReversible computing has a long history. Nowadays, reversible computing is attracting increasing interest because of its potential applications in diverse fields, including hardware design, biological modelling, program debugging and testing and quantum computing. Of particular interest is the application of reversible computation notions to the study of programming abstractions for dependable systems, because several techniques used to build dependable systems rely on some forms of undo or rollback. We continue, in this thesis, the study undertaken on reversible CCS by Vincent Danos and Jean Krivine, by defining a reversible higher-order pi-calculus (rhopi). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully rhopi into a variant of HOpi. Moreover we design a fine-grained rollback primitive able to control the rollback of a concurrent execution. We give a formal specification of this primitive and show that it enjoys good properties, even in presence of concurrent conflicting rollbacks. We then devise a concurrent algorithm implementing such primitive and show that the algorithm respects the defined semantics
Dowek, Gilles. "Demonstration automatique dans le calcul des constructions." Paris 7, 1991. http://www.theses.fr/1991PA077227.
Повний текст джерелаRouyer, Joseph. "Développements d'algorithmes dans le calcul des constructions." Vandoeuvre-les-Nancy, INPL, 1994. http://www.theses.fr/1994INPL042N.
Повний текст джерелаPomeransky, Andrei A. "Intrication et imperfections dans le calcul quantique." Toulouse 3, 2004. http://www.theses.fr/2004TOU30132.
Повний текст джерелаQuantum information is a new domain of physics, which studies the applications of quantum systems to the computation and to the information transmission. The quantum computers use the lows of quantum mechanics to perform the calculations much more efficiently than all currently existing computers can. The quantum computers will be influenced by all kinds of perturbations. We study, in the case of two very different quantum computations, the efficiency of the quantum computers in the presence of the static imperfections. One of the fundamental reasons of the extraordinary efficiency of the quantum computers is the effect of quantum entanglement. In the present thesis we study certain important properties of a widely used quantitative measure of entanglement. We consider also the average informational entropy of quantum states, find an explicit expression for this quantity and study some its most important properties
Herrmann, Samuel. "Calcul asymptotique lié à l'étude de certains processus stochastiques." Habilitation à diriger des recherches, Université Henri Poincaré - Nancy I, 2009. http://tel.archives-ouvertes.fr/tel-00591974.
Повний текст джерелаGuise, Élaine de. "Le rôle du corps calleux dans la mémoire procédurale et la mémoire de travail." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0021/NQ43708.pdf.
Повний текст джерелаMadet, Antoine. "Complexité implicite dans des Lambda -calculs concurrents." Paris 7, 2012. http://www.theses.fr/2012PA077222.
Повний текст джерелаControlling the resource consumption of programs is crucial: besides performance reasons, it has many applications in the field of computer security where e. G. Mobile or embedded Systems dispose of limited amounts of resources. In this thesis, we develop static criteria to control the resource consumption of higher-order concurrent programs. Our starting point is the framework of Light Logics which has been extensively studied to control the complexity of higher-order functional programs through the proofs-as-programs correspondent. The contribution of this thesis is to extend this framework to higher-order concurrent programs. More generally, this thesis fits in the research field of Implicit Computational Complexity which aims at characterizing complexity classes by logical principles or language restrictions. The criteria that we propose are purely syntactic and are developed gradually to control the computational time of programs in a finer and finer way: first, we show how to guarantee the termination of programs (finite time); then, we show how to guarantee the termination of programs in elementary time and last, we show how to guarantee the termination of programs in polynomial time. We also introduce type Systems so that well-typed programs are guaranteed to terminate in bounded time and to return values. Finally, we show that the type Systems capture some interesting concurrent programs that iterate functions producing side effects over inductive data structures. In the last part, we study an alternative semantic method to control the resource consumption of higher-order imperative programs. The method is based on Dal Lago and Hofmann's quantitative realizability framework and allows to obtain various complexity bounds in a uniform way. This last par is joint work with Aloïs Brunel
Möller, Nathalie. "Adaptation de codes industriels de simulation en Calcul Haute Performance aux architectures modernes de supercalculateurs." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLV088.
Повний текст джерелаFor many years, the stability of the architecture paradigm has facilitated the performance portability of large HPC codes from one generation of supercomputers to another.The announced breakdown of the Moore's Law, which rules the progress of microprocessor engraving, ends this model and requires new efforts on the software's side.Code modernization, based on an algorithmic which is well adapted to the future systems, is mandatory.This modernization is based on well-known principles as the computation concurrency, or degree of parallelism, and the data locality.However, the implementation of these principles in large industrial applications, which often are the result of years of development efforts, turns out to be way more difficult than expected.This thesis contributions are twofold :On the one hand, we explore a methodology of software modernization based on the concept of proto-applications and compare it with the direct approach, while optimizing two simulation codes developed in a similar context.On the other hand, we focus on the identification of the main challenges for the architecture, the programming models and the applications.The two chosen application fields are the Computational Fluid Dynamics and Computational Electro Magnetics
Aoyagi, Risa. "Péripéties proustiennes dans A la recherche du temps perdu : entre mémoire volontaire et mémoire involontaire." Paris 3, 2004. http://www.theses.fr/2004PA030012.
Повний текст джерелаLying in the body itself of the intrigue of Remembrance of things past of Marcel Proust, in the genesis of the work or in the subtext, the peripetia which is already stressed in involuntary memory plays a crucial role in voluntary memory. Introduced into the universes of artists which nourish the work (Baudelaire, Botticelli, Vermeer, Manet), the peripetia is the instrument for their recreation, as the passer-by of Baudelaire shows it. Receiving realistic daily details (the impossible date of Easter, the overloaded line of one twenty-two train), the peripetia renders the transposition of the real to serve to reveal the aesthetics of the writer. Common to the two types of memory, the peripetia represents their close kinship and constitutes the keystone of the Prousian maieutics
Llorca, Iris. "Mémoire vécue, mémoire du texte : les correspondances intertextuelles dans les Chants Orphiques de Dino Campana." Paris 3, 2007. http://www.theses.fr/2007PA030158.
Повний текст джерелаThe intertextualities shows in Dino Campana (1885-1932) the perpetual exchanges with the French poets of the second half of the 19th century: Mallarmé, Rimbaud, Nerval, Verlaine et Baudelaire ; and their Italian tradition embodied by Dante. In the unique collection of Dino Campana, Canti Orfici (1914), the study of the intertextualities and their use requires reflexion on their degree of imprinting in the intertextual correspondences written by Campana. The memory analysis linked to it contains at least two axis of research: the literal souvenir – literature from memory- is linked directly to the intertextual studies: quotations, references, similarities, imitations, correspondences with the same themes ; the personal or lived experiences, transformed in text (in prose and in verse), is found in the verses of the poet, in the colour of a painter’s work of art. Besides, the souvenir of the first manuscript lost by Campana (Il più lungo giorno –1913-) that he decided to rewrite, according to the legend, « by heart », allows to clarify how the poet reconstructed his poetry in relation, not only in this note books which he kept, but also in the literary and artistic novelties arisen between the loss of the manuscript and its rewriting