Contents
Academic literature on the topic 'Ordinateurs – Mémoires – Informatique'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Ordinateurs – Mémoires – Informatique.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Dissertations / Theses on the topic "Ordinateurs – Mémoires – Informatique"
Lalam, Mustapha. "Mémoire multiport série pour processeurs vectoriels." Toulouse 3, 1990. http://www.theses.fr/1990TOU30165.
Full textThiria, Sylvie. "L'Apprentissage supervisé dans les modèles connexionnistes." Paris 5, 1989. http://www.theses.fr/1989PA05S004.
Full textTourancheau, Bernard. "Algorithmique parallèle pour les machines à mémoire distribuée : application aux algorithmes matriciels." Grenoble INPG, 1989. http://tel.archives-ouvertes.fr/tel-00332663/.
Full textLefebvre, Vincent. "Restructuration automatique des variables d'un programme en vue de sa parallélisation." Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0008.
Full textAcquaviva, Jean-Thomas. "Architecture DSM et calcul scientifique : étude de la prédiction de la cohérence de données." Versailles-St Quentin en Yvelines, 2000. http://www.theses.fr/2000VERS0017.
Full textBernardi, Fabrice. "Conception de bibliothèques hiérarchisées de modèles réutilisables selon une approche orientée objet." Corte, 2002. http://www.theses.fr/2002CORT3068.
Full textLacroix, Patrice. "RTL-Check : a practical static analysis framework to verify memory safety and more." Thesis, Université Laval, 2006. http://www.theses.ulaval.ca/2006/23909/23909.pdf.
Full textSince computers are ubiquitous in our society and we depend more and more on programs to accomplish our everyday activities, bugs can sometimes have serious consequences. A large proportion of existing programs are written in C or C++ and the main source of errors with these programming languages is the absence of memory safety. Our long term goal is to be able to verify if a C or C++ program accesses memory correctly in spite of the deficiencies of these languages. To that end, we have created a static analysis framework which we present in this thesis. It allows building analyses from small reusable components that are automatically bound together by metaprogramming. It also incorporates the visitor design pattern and algorithms that are useful for the development of static analyses. Moreover, it provides an object model for RTL, the low-level intermediate representation for all languages supported by GCC. This implies that it is possible to design analyses that are independent of programming languages. We also describe the modules that comprise the static analysis we have developed using our framework and which aims to verify if a program is memory-safe. This analysis is not yet complete, but it is designed to be easily improved. Both our framework and our memory access analysis modules are distributed in RTL-Check, an open-source project.
Petri, Gustavo. "Operational semantics of relaxed memory models." Nice, 2010. http://www.theses.fr/2010NICE4087.
Full textMost current multiprocessor architectures and shared memory parallel programming languages are not sequentially consistent for parallel programs. Their possible behaviors are characterized by weak or relaxed memory models. A memory model describes the way in which parallel programs can interact by reading and writing the shared memory. Thus, a relaxed memory model exhibits more behaviors than sequential consistency (a “strong” memory model). The fact that most architectures have relaxed memory models has been known for decades, and yet few programmers understand which are the exact behaviors a parallel program can have in such architectures. We argue in this thesis that the problem stems from the difficulty in understanding the specification of these relaxed memory models. Firstly because few architectures or programming languages provide a formal definition of their memory model. And secondly because the majority of the existing formal definitions are axiomatic, which hinders their understandability and makes them unsuitable for language-based techniques such as static analysis or model checking. We propose an alternative characterization of relaxed memory models. Our characterization is operational, which we believe makes it simpler to understand for the programmer, and better suited to standard language-based techniques. Our first contribution in this thesis is the operational formalization of writebuffering architectures. Write-buffering is pervasive across multi-core architectures, and thus its understanding is fundamental for parallel programming in such architectures. By means of standard programming languages concepts, we prove that the standard DRF guarantee is satisfied by our formalization. Hence, reasoning about sequentially consistent computations is sound for programs free of simultaneous accesses on a single memory location. Our second contribution is a framework for the operational characterization of speculative computation techniques. This framework allows us to formally define the intuitive notion of valid speculation. For this framework two languages are considered; a high-level programming language that supports locks; and a low-level programming language, closer to the Instruction Set Architecture (ISA) of a machine, that only supports barriers and a simple compare-and-swap instruction. We identify properties for programs of both of these languages that are sufficient to guarantee that only sequentially consistent behaviors can be observed when the programs are executed speculatively. The final contribution is the instantiation of the write-buffering and speculative frameworks to formalize the TSO, PSO and RMO memory models of the Sparc architecture. In particular, we observe that the framework of write buffers is not well suited to formalize liberal relaxations as allowed by RMO. We prove a correspondence result between the formalizations of PSO and TSO I ii in both frameworks. The fact that RMO cannot be instantiated by means of write-buffers is a good indication that the speculative framework is more general than the one of write buffers
Barral, Pierre. "Un modèle neuro-mimétique de mémoire associative." Limoges, 1997. http://www.theses.fr/1997LIMO0029.
Full textHammami, Omar. "Anticipation et gestion mémoire." Toulouse 3, 1992. http://www.theses.fr/1992TOU30159.
Full textBooks on the topic "Ordinateurs – Mémoires – Informatique"
Kamp, Yves. Réseaux de neurones récursifs pour mémoires associatives. Lausanne: Presses polytechniques et universitaires romandes, 1990.
Find full textGoupille, P. A. Technologie des ordinateurs et des réseaux: Cours et exercices corrigés. 8th ed. Paris: Dunod, 2008.
Find full textFreihof, Michael. Configuration optimale autoexec.bat, config.sys. Paris: Micro Application, 1995.
Find full textHennessy, John L. Computer architecture: A quantitative approach. 4th ed. Amsterdam: Morgan Kaufmann, 2007.
Find full textHennessy, John L. Computer architecture: A quantitative approach. 3rd ed. San Francisco, CA: Morgan Kaufmann Publishers, 2003.
Find full textHennessy, John L. Computer architecture: A quantitative approach. 3rd ed. San Francisco, CA: Morgan Kaufmann Publishers, 2003.
Find full textSelf-organization and associative memory. 3rd ed. Berlin: Springer-Verlag, 1989.
Find full textKohonen, Teuvo. Self-organization and associative memory. 2nd ed. Berlin: Springer-Verlag, 1988.
Find full textCésari, Bernard. Thèses, mémoires et publications au micro-ordinateur. Paris: Expansion scientifique française, 1989.
Find full textE, Hinton Geoffrey, and Anderson James A, eds. Parallel models of associative memory. Hillsdale, N.J: L. Erlbaum, 1989.
Find full textBook chapters on the topic "Ordinateurs – Mémoires – Informatique"
BERTUCCI, Marie-Madeleine, and Mounia ILLOURMANNE. "Transcrire un corpus audio dans la perspective de la préservation du patrimoine culturel immatériel." In Corpus audiovisuels, 115–24. Editions des archives contemporaines, 2022. http://dx.doi.org/10.17184/eac.5704.
Full text