Teses / dissertações sobre o tema "Distributed systemes"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Distributed systemes".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
Benkiran, Mohamed Amine. "Communications dans les systemes distribues". Paris 6, 1988. http://www.theses.fr/1988PA066068.
Texto completo da fonteLONC, BEYAERT BRIGITTE. "Techniques formelles de verification des systemes distribues : application aux protocoles de communication des systemes ouverts". Paris, CNAM, 1987. http://www.theses.fr/1987CNAM0089.
Texto completo da fonteMaviel, Pierre. "Definition de classes d'environnements reseaux pour la simulation d'algorithmes distribues". Paris 6, 1987. http://www.theses.fr/1987PA066519.
Texto completo da fonteHumeau, Jean-Pierre. "Commande de systemes thermiques". Nantes, 1987. http://www.theses.fr/1987NANT2049.
Texto completo da fonteKoscina, Mirko. "Security and optimization of blockchains and associated algorithms". Electronic Thesis or Diss., Université Paris sciences et lettres, 2021. http://www.theses.fr/2021UPSLE063.
Texto completo da fonteThis thesis addresses the security, privacy, and economic barriers to implementing blockchain for user's privacy, data governance, software obfuscation and cryptocurrencies models for circular economies. The first part of this thesis covers the preliminaries about blockchain and modern cryptography. The second part presents three main results concerning privacy-preserving consensus, privacy in electronic voting with permissioned blockchain, and control-flow graph obfuscation for software confidentiality. Finally, the third part includes two results based on applied research work with two prototypes of blockchain systems for data governance and cryptocurrencies. The first part of this thesis describes a brief history of the technology around blockchain and its evolution until arriving at the first blockchain implementation (Bitcoin). Then, the most relevant topics on Modern Cryptography used in this thesis are introduced. The second part begins with a new privacy-preserving consensus algorithm for permissioned blockchain. The main contribution of this work is a general construction of blind signature for transaction unlinkability integrated to a BFT-based consensus for transactions and blocks validation. The second result corresponds to a new electronic voting scheme for permissioned blockchain. This work proposed a new privacy-preserving consensus based on Okamoto-Schnorr blind signature for transaction unlinkability and elliptic curve for vote privacy. Finally, a new control-flow graph obfuscation mechanism for software confidentially (e.i for smart contracts) is presented. The third part presents two blockchain implementations. The first is a novel implementation of the ERC20 token standard and a Marketplace on Hyperledger Fabric for circular economies based on plastic recycling. The second one is a blockchain prototype for data governance in healthcare data exchange according to GDPR automatised using smart contracts
Quichaud, Danièle. "Analyse des reseaux bipolaires pour la coherence et l'evaluation des systemes paralleles". Paris 6, 1988. http://www.theses.fr/1988PA066498.
Texto completo da fonteZenié, Alexandre. "Les reseaux de petri stochastiques colores : application a l'analyse des systemes repartis en temps reel". Paris 6, 1987. http://www.theses.fr/1987PA066672.
Texto completo da fonteOmgba, Louis-Bède. "Contribution a l'interconnexion des systemes ouverts : etablissement de communications dans un reseau local heterogene". Paris 6, 1987. http://www.theses.fr/1987PA066134.
Texto completo da fonteGastin, Paul. "Un modele distribue". Paris 7, 1987. http://www.theses.fr/1987PA077072.
Texto completo da fonteLallier, Martial. "Un environnement d'édition evolué, graphique et syntaxique, pour la conception des systemes repartis". Nancy 1, 1988. http://www.theses.fr/1988NAN10284.
Texto completo da fontePérez, Cortés Elizabeth. "La cohérence sur mesure dans une mémoire virtuelle répartie partagée". Grenoble INPG, 1996. http://www.theses.fr/1996INPG0173.
Texto completo da fonteAl, Badine Samir. "STMM soumission de travaux en mode messagerie /". Grenoble 2 : ANRT, 1988. http://catalogue.bnf.fr/ark:/12148/cb37611499t.
Texto completo da fonteNaimi, Mohamed. "Une structure arborescente pour une classe d'algorithmes distribués d'exclusion mutuelle". Besançon, 1987. http://www.theses.fr/1987BESA2003.
Texto completo da fonteMoise, Izabela. "Des Protocoles d'Accord Efficaces pour des Systèmes Répartis Asynchrones". Phd thesis, Université Rennes 1, 2011. http://tel.archives-ouvertes.fr/tel-00658981.
Texto completo da fonteBruneau-Queyreix, Joachim. "Multi-Criteria Optimization of Content Delivery within the Future Media Internet". Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0745/document.
Texto completo da fonteSingle-source HTTP Adaptive Streaming solutions (HAS) have become the de-facto solutions to deliver video over the Internet mostly due to their capabilities to increase end-user’s Quality of Experience (QoE) as well as their ease of deployment due to the usage of the HTTP protocol. Although HAS solutions can increase QoE by trading off the delivered video quality to minimize the number of video freezing events, they are limited by the bandwidth available on the considered communication channel between the client and the server. This thesis exposes our contributions in building lightweight pragmatic and evolving solutions advocating for the simultaneous usage of multiple sources with heterogeneous capacities so as to achieve high QoE content delivery at low cost. The first contribution of this work presents a streaming solution extending HAS capabilities to a pragmatic multi-server technique: MS-Stream. MS-Stream provides the means to exploit expanded bandwidth and link diversity in distributed heterogeneous network infrastructures. In our second contribution, we propose MATHIAS, a client-side two-phase consumption and adaptation algorithm implemented into MSStream. MATHIAS aims at increasing the end-user’s perceived streaming quality while utilizing the most of the heterogeneous capacities offered at the service and network environments. Finally, we further extend the QoE and scalability capabilities of MS-Stream and MATHIAS by leveraging on clients’ connectivity capacities and we expose our third contribution: a hybrid P2P/Multi-server live-Streaming system (PMS) incorporating distributed quality and scalability adaptation mechanisms
Bahsoun, Jean-Paul. "Expression de la synchronisation dans un module contrôlé par priorité : implantation et méthode de preuve". Toulouse 3, 1988. http://www.theses.fr/1988TOU30126.
Texto completo da fonteHaddad, Serge. "Une categorie reguliere de reseau de petri de haut niveau : definition, proprietes et reductions, application a la validation de systemes distribues". Paris 6, 1987. http://www.theses.fr/1987PA066418.
Texto completo da fonteHan, Jay. "Conception et réalisation d'une mémoire partagée répartie". Phd thesis, Grenoble INPG, 1996. http://www.theses.fr/1996INPG0165.
Texto completo da fonteArias is a distributed shared memory (DSM) system designed as part of project SIRAC, whose purpose is to study a software support for distributed applications. Programming distributed applications is greatly facilitated by a DSM support. The evolution of distributed systems leading to the idea of DSM is outlined. A number of past and current DSM projects are studied and their particular features highlighted. The goals of our own project are then put into perspective, and its spefication defined. From there, the general architecture of Arias is described. We focus our attention on the problems related to the distribution of memory. Specifically, allocating and locating memory in a large-address space DSM presents some major difficulties that impact the application interface and the utilization of the underlying operating system. The close examination of those problems leads to the design of the memory service that is described. The implementation of that service is then fleshed out in its technical details. This implementation has a number of adjustable parameters whose impact on the general behaviour is refined through measurements and simulations. Some potential configurations, each adapted to certain usage patterns, are shown. In conclusion, we revisit lessons learned from this work. From what has been completed, we derive a view of future study topics and general perspectives on DSM
Rahgozar, Maseud. "Controle de concurrence par gestion des evenements". Paris 6, 1987. http://www.theses.fr/1987PA066594.
Texto completo da fonteGavoille, Cyril. "Complexité mémoire du routage dans les réseaux distribués". Lyon, École normale supérieure (sciences), 1996. http://www.theses.fr/1996ENSL0015.
Texto completo da fonteChen, Min. "Excitation optimale d'un systeme parabolique en vue de son identification". Nantes, 1987. http://www.theses.fr/1987NANT2050.
Texto completo da fonteVat, Nicholas. "Geographically distributed requirements elicitation". Thesis, Rhodes University, 2000. http://hdl.handle.net/10962/d1002764.
Texto completo da fonteCostache, Stefania. "Gestion autonome des ressources et des applications dans un nuage informatique selon une approche fondée sur un marché". Phd thesis, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00925352.
Texto completo da fonteMONZIN, JEAN-FRANCOIS. "Programmation en logique et compilation de protocoles : le simulateur veda". Rennes 1, 1988. http://www.theses.fr/1988REN10106.
Texto completo da fontePerez, Hector Benitez. "Smart distributed systems". Thesis, University of Sheffield, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310944.
Texto completo da fonteShanneb, Abdelsalam Carleton University Dissertation Computer Science. "Distributed systems prototyping". Ottawa, 1994.
Encontre o texto completo da fonteEl, Chamie Mahmoud. "Optimisation, contrôle et théorie des jeux dans les protocoles de consensus". Thesis, Nice, 2014. http://www.theses.fr/2014NICE4094/document.
Texto completo da fonteConsensus protocols have gained a lot of interest in the recent years. In this thesis, we study optimization, control, and game theoretical problems arising in consensus protocols. First, we study optimization techniques for weight selection problems to increase the speed of convergence of discrete-time consensus protocols on networks. We propose to select the weights by applying an approximation algorithm: minimizing the Schatten p-norm of the weight matrix. We characterize the approximation error and we show that the proposed algorithm has the advantage that it can be solved in a totally distributed way. Then we propose a game theoretical framework for an adversary that can add noise to the weights used by averaging protocols to drive the system away from consensus. We give the optimal strategies for the game players (the adversary and the network designer) and we show that a saddle-point equilibrium exists in mixed strategies. We also analyze the performance of distributed averaging algorithms where the information exchanged between neighboring agents is subject to deterministic uniform quantization (e.g., when real values sent by nodes to their neighbors are truncated). Consensus algorithms require that nodes exchange messages persistently to reach asymptotically consensus. We propose a distributed algorithm that reduces the communication overhead while still guaranteeing convergence to consensus. Finally, we propose a score metric that evaluates the quality of clusters such that the faster the random walk mixes in the cluster and the slower it escapes, the higher is the score. A local clustering algorithm based on this metric is proposed
Trentesaux, Damien. "Conception d'un système de pilotage distribué, supervisé et multicritère pour les systèmes automatisés de production". Phd thesis, Grenoble INPG, 1996. http://www.theses.fr/1996INPG0030.
Texto completo da fonteA distributed production activity control system has been developed to solve several problems inherent in the inflexibility of classic centralized production activity control systems. The distributed approach implies local decision makings and real time control for task allocations. This forbids correct forecast on critical information such as time cycle for each manufacturing order, meaning a miss of viability for industrial application. The aim of our work is to provide a structure which takes advantage of both extrema and which is able to support just-in-time concepts: the hybrid production activity control structure. The hybrid approach uses the notion of bottleneck and non bottleneck resources and is based on the distributed control structure developed in the laboratory. The bottleneck is the only resource scheduled. It forces the synchronicity of the whole production structure because of its characteristics. This paper evaluates the relative performances of the three control structures (centralized, distributed and hybrid) through theoretical discussions and practical examples from a simplified industrial case study
Bennett, John K. "Distributed Smalltalk : inheritance and reactiveness in distributed systems /". Thesis, Connect to this title online; UW restricted, 1988. http://hdl.handle.net/1773/6923.
Texto completo da fonteRafiliu, Sergiu. "Stability of Adaptive Distributed Real-TimeSystems with Dynamic Resource Management". Doctoral thesis, Linköpings universitet, Programvara och system, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98721.
Texto completo da fonteWerner, Matthias. "Verteilte Mobilität - Eine spannende Herausforderung". Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-78213.
Texto completo da fonteDixon, Eric Richard. "Developing distributed applications with distributed heterogenous databases". Thesis, Virginia Tech, 1993. http://hdl.handle.net/10919/42748.
Texto completo da fonteConroy, Tracy Michael Buxton Winslow Hurlburt. "Secure distributed file systems /". Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA285525.
Texto completo da fonteThesis advisor(s): Roger Stemp, Kishore Sengupta. "September 1994." Bibliography: p. 106-108. Also available online.
Satzger, Benjamin. "Self-healing distributed systems". kostenfrei kostenfrei, 2008. http://d-nb.info/993914381/34.
Texto completo da fonteZhou, Wanlei, e mikewood@deakin edu au. "Building reliable distributed systems". Deakin University. School of Computing and Mathematics, 2001. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20051017.160921.
Texto completo da fonteMansouri-Samani, Masoud. "Monitoring of distributed systems". Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362441.
Texto completo da fonteAlkarouri, Muhammad Abdulmuneim. "Distributed decision support systems". Thesis, University of Sheffield, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555644.
Texto completo da fonteBeacham, Nigel Adrian. "Distributed performance support systems". Thesis, Teesside University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410848.
Texto completo da fonteConroy, Tracy Michael, e Winslow Hurlburt Buxton. "Secure distributed file systems". Thesis, Monterey, California. Naval Postgraduate School, 1994. http://hdl.handle.net/10945/30928.
Texto completo da fonteFadel, Etimad A. "Distributed systems management service". Thesis, De Montfort University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438881.
Texto completo da fonteMd, Mizanur Rahman. "Scanline-based distributed systems". Thesis, London South Bank University, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.570875.
Texto completo da fonteBOLDRIN, FABIO. "Web Distributed Computing Systems". Doctoral thesis, Università degli studi di Ferrara, 2011. http://hdl.handle.net/11392/2388764.
Texto completo da fonteThomas, Alex S. M. Massachusetts Institute of Technology. "An analysis of distributed solar fuel systems". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/76511.
Texto completo da fonteCataloged from PDF version of thesis.
Includes bibliographical references (p. 85-89).
While solar fuel systems offer tremendous potential to address global clean energy needs, most existing analyses have focused on the feasibility of large centralized systems and applications. Not much research exists on the feasibility of distributed solar fuel systems. This thesis is an attempt to understand the larger context of solar fuel systems, to examine the case for going distributed and to critically analyze a distributed solar fuel system available today in the context of a specific application. In doing so, this thesis seeks to a) provide a baseline analysis for the economic feasibility of a distributed solar fuel system based on state-of-the-art technology b) draw some general conclusions about the nature of such systems in order to provide guidance to those engaged in the development of the next generation of solar fuel systems. This study also compares the chosen baseline solar fuel system with a traditional fossil fuel-based alternative and undertakes a cost-to-emissions trade-off analysis. A key finding of this thesis is that for solar fuel systems to be viable, cost and efficiency improvements in individual sub-systems won't be sufficient. Due attention needs to be given to bring down cost of the entire system. Another key finding is that if carbon emissions are considered as a decision-making criterion in addition to cost, even at current cost levels photovoltaic hydrogen systems compare favorably with existing fossil fuel-based alternatives such as diesel generators.
by Alex Thomas.
S.M.in Engineering and Management
Meth, Halli Elaine. "DecaFS: A Modular Distributed File System to Facilitate Distributed Systems Education". DigitalCommons@CalPoly, 2014. https://digitalcommons.calpoly.edu/theses/1206.
Texto completo da fonteStottlemyer, Alan R., e Kevin M. Hassett. "Open Systems Architecture in a COTS environment". International Foundation for Telemetering, 1996. http://hdl.handle.net/10150/608368.
Texto completo da fonteA distributed architecture framework has been developed for NASA at Goddard Space Flight Center (GSFC) as the basis for developing an extended series of space mission support data systems. The architecture is designed to include both mission development and operations. It specifically addresses the problems of standardizing a framework for which commercial off-the-shelf (COTS) applications and infrastructure are expected to provide most of the components of the systems. The resulting distributed architecture is developed based on a combination of a layered architecture, and carefully selected open standards. The layering provides the needed flexibility in mission design to support the wide variability of mission requirements. The standards are selected to address the most important interfaces, while not over constraining the implementation options.
Wong, Wing-ki Vicky. "An immunity-based distributed multiagent control framework". Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37314348.
Texto completo da fonteMENAUD, JEAN-MARC. "Systeme de caches cooperatifs pour les systemes d'informations distribuees a grande echelle". Rennes 1, 2000. http://www.theses.fr/2000REN10005.
Texto completo da fontePadiou, Gérard. "Contribution à l'étude de la notion d'objet réparti dans les langages et systèmes opératoires". Toulouse 3, 1987. http://www.theses.fr/1987TOU30205.
Texto completo da fonteDuboux, Thibault. "Régulation dynamique du partitionnement de données sur machines parallèles à mémoire distribuée". Lyon, École normale supérieure (sciences), 1996. http://www.theses.fr/1996ENSL0009.
Texto completo da fonteLundin, Mats. "Building Distributed Control Systems Using Distributed Active Real-Time Databases". Thesis, University of Skövde, Department of Computer Science, 1998. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-234.
Texto completo da fonteFrom the field of control theory, we can see that varying communication delays in a control system may be hard or even impossible to handle. From this point of view it is preferable to have these delays bounded and as small and as possible in order to adapt the control process to them. On the other hand, in some cases delays are inevitable and must be handled by the control system.
A control system may for different reasons be distributed, e.g., because of a distributed environment or severe environment demands such as heat or dust at some locations. Information in such a system will suffer from delays due to transportation from one place to another. These delays often show up in a random fashion, especially if a general network is used for transportation. Another source of delays is the system environment itself. For predictability reasons a real-time database is preferable if the delays are to be controlled.
A straightforward way of handling delays in a control system is to build the system such that delays are constant, i.e., to build a time invariant system. The time from sensor reading to actuation is made constant either by adding a suitable delay to achieve a total constant delay or by using time-triggered reading and actuation. These are simple ways of controlling the delays, but may be very inefficient because worst-case execution time must always be used. Other ways of handling varying delays are by using more tolerant control algorithms. There are two suitable control models proposed by Nilsson (1998) for this purpose. The tolerant algorithm approach is assumed in this work.
This thesis uses a distributed active real-time database system as a basis for building control systems. One of the main objectives is to determine how active functionality can be used to express the control system, i.e., how rules in the database can be used to express the control algorithm and for handling propagation of information. Another objective is to look at how the choice of consistency level in the database affects the result of the control system, i.e. how different consistency level affects the delays. Of interest is also to characterize what type of applications each level is suited for.