Auswahl der wissenschaftlichen Literatur zum Thema „Calcul distribué à accès multiple“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Calcul distribué à accès multiple" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Dissertationen zum Thema "Calcul distribué à accès multiple"
Brunero, Federico. „Unearthing the Impact of Structure in Data and in Topology for Caching and Computing Networks“. Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS368.pdf.
Der volle Inhalt der QuelleCaching has shown to be an excellent expedient for the purposes of reducing the traffic load in data networks. An information-theoretic study of caching, known as coded caching, represented a key breakthrough in understanding how memory can be effectively transformed into data rates. Coded caching also revealed the deep connection between caching and computing networks, which similarly show the same need for novel algorithmic solutions to reduce the traffic load. Despite the vast literature, there remain some fundamental limitations, whose resolution is critical. For instance, it is well-known that the coding gain ensured by coded caching not only is merely linear in the overall caching resources, but also turns out to be the Achilles heel of the technique in most practical settings. This thesis aims at improving and deepening the understanding of the key role that structure plays either in data or in topology for caching and computing networks. First, we explore the fundamental limits of caching under some information-theoretic models that impose structure in data, where by this we mean that we assume to know in advance what data are of interest to whom. Secondly, we investigate the impressive ramifications of having structure in network topology. Throughout the manuscript, we also show how the results in caching can be employed in the context of distributed computing
Alleon, Guillaume. „Résolution de grands problèmes d'électromagnétisme sur calculateurs parallèles“. Paris 6, 2000. http://www.theses.fr/2000PA066572.
Der volle Inhalt der QuelleHatefi, Atoosa. „Codage distribué pour les réseaux coopératifs sans fil“. Phd thesis, Supélec, 2012. http://tel.archives-ouvertes.fr/tel-00829100.
Der volle Inhalt der QuelleBrice, 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.
Der volle Inhalt der QuelleSow, Garmy. „Méthodes d'Accès Multiple à Répartition Spatiale pour Communications par Satellite“. Phd thesis, Télécom ParisTech, 2006. http://pastel.archives-ouvertes.fr/pastel-00001876.
Der volle Inhalt der QuelleBen, Chikha Haithem. „Etude et Amélioration de Turbo-Codage Distribué pour les Réseaux Coopératifs“. Thesis, Valenciennes, 2012. http://www.theses.fr/2012VALE0011/document.
Der volle Inhalt der QuelleDiversity provides an efficient method for combating multipath fading in mobile radio systems. One of the most common forms of spatial diversity is multiple-input multipleoutput (MIMO), where full diversity is obtained. However, embedding multiple antennas at the transmitter or the receiver can sometimes be expensive. As an alternative to collocated antennas, cooperative diversity in wireless multi-hop networks confirms their ability to achieve spatial diversity gains by exploiting the spatial diversity of the traditional MIMO techniques, without each node necessarily having multiple antennas. In addition, cooperative diversity has been shown to provide the network with importantthroughput, reduced energy requirements and improved access coverage.In light of this, the objective of this thesis is to devise coding schemes suitable for relay channels that aim at showing the best compromise between performance of diversity and coding gains. Firstly, we investigate a distributed turbo coding scheme dedicated to L-relay channels operating in the soft-decode-and-forward mode. Then, we present a proposed distributed turbo coded cooperative (DTCC) scheme, called parallel concatenated convolutional-based distributed coded cooperation. Finally, we investigate antenna/soft-relaying selection for DTCC networks in order to improve their end-to-end performance. Assuming BPSK transmission for fully interleaved channels with ideal channel state information, we define the explicit upper bounds for error probability inRayleigh fading channels with independent fading. Both theoretical limits and simulation results are presented to demonstrate the performances
Bouilloc, Thomas. „Applications de décompositions tensorielles à l'identification de modèles de Volterra et aux systèmes de communication MIMO-CDMA“. Nice, 2011. http://www.theses.fr/2011NICE4048.
Der volle Inhalt der QuelleThis thesis concerns both the theoretical and constructive resolution of inverse problems for isotropic diffusion equation in planar domains, simply and doubly connected. From partial Cauchy boundary data (potential, flux), we look for those quantities on the remaining part of the boundary, where no information is available, as well as inside the domain. The proposed approach proceed by considering solutions to the diffusion equation as real parts of complex valued solutions to some conjugated Beltrami equation. These particular generalized analytic functions allow to introduce Hardy classes, where the inverse problems is stated as a best constrained approximation issue (bounded extremal problem), and thereby is regularized. Hence, existence and smoothness properties, together with density results of traces on the boundary, ensure well-posedness. An application is studied, to a free boundary problem for magnetically confined plasma in the tokamak Tore Supra (CEA-IRFM Caldarache). The resolution of the approximation problem on a suitable basis of functions (toroidal harmonics) lead to a qualification criterion for the estimated plasma boundary. A descent algorithm makes it decrease, and refines the estimations. The methods do not require any integration of the solution in the overall domain. It furnishes very accurate numerical results, and could be extended to other devices, like JET ou ITER
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.
Der volle Inhalt der QuelleWe 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)
March, Katia. „Etude à l'échelle atomique de l'ordre local et de la structure électronique aux interfaces d'une jonction tunnel magnétique métal / oxyde : du dispositif fonctionnel à un système modèle“. Paris 11, 2008. http://www.theses.fr/2008PA112368.
Der volle Inhalt der QuelleThe work detailed in this thesis represents an experimental contribution to the development of a new magnetic random access memory (MRAM) in which the main element is a magnetic tunnel junction (MTJ). Interfaces play a crucial role in determining the transport properties and magnetic coupling in these systems, which consist of layers having thicknesses on the order of nanometers. As such, investigation at the nanometer or even atomic scale is rnandatory. This is achieved here using spatially resolved electron energy loss spectroscopy (BELS), the dominant technique in this study. The purpose of the investigation on ALTIS Semiconductor functional industrial systems is to evaluate their stability over time as well as during the steps involved in their production. This work highlights effects restricting their industrial production and suggests solutions to counteract them. In parallel, in order to better understand the importance of the MTJ interfaces themselves, a monocrystalline Co₀,₆Fe₀,₄ / MgO / Co₀,₆Fe₀,₄ (001) system, deposited using molecular beam epitaxy, was also investigated. The Co₀,₆Fe₀,₄ alloy exhibits a half-metallic character with regards to the symmetries of the Bloch states which lead to strong spin polarization. The very high quality of the crystalline structure at the interfaces offers the possibility to consider the sample as an ideal system, allowing a detailed analysis of the fine structure of the transition metal L-edges and the oxygen K-edge. These experimental spectra can thus be simulated using multiple scattering calculations in order to test the influence of the local environment and to characterize the p-d hybridization effects at the interfaces
Medernach, Emmanuel. „Allocation de ressources et ordonnancement multi-utilisateurs : une approche basée sur l'équité“. Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2011. http://tel.archives-ouvertes.fr/tel-00686891.
Der volle Inhalt der Quelle