Littérature scientifique sur le sujet « Verrous distribués »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Verrous distribués ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Verrous distribués"
Manini, Claudia, et José I. López. « Unusual Faces of Bladder Cancer ». Cancers 12, no 12 (10 décembre 2020) : 3706. http://dx.doi.org/10.3390/cancers12123706.
Texte intégralKorziti, Samya, Abderrahim Dahbi, Ahmed Chetou, Mohamed Aggour, Farida Bentayeb, Youssef Bouzekraoui et Youssef Elmerabet. « Attitudes de prise en charge de la myopie chez les enfants dans la pratique clinique au Maroc ». SHS Web of Conferences 175 (2023) : 01031. http://dx.doi.org/10.1051/shsconf/202317501031.
Texte intégralThèses sur le sujet "Verrous distribués"
Nair, Sreeja Sasidhara. « Designing safe and highly available distributed applications ». Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS272.
Texte intégralDesigning distributed applications involves a fundamental trade-off between safety and performance as described by CAP theorem. We focus on the cases where safety is the top requirement.For the subclass of state-based distributed systems, we propose a proof methodology for establishing that a given application maintains a given invariant. Our approach allows reasoning about individual operations separately. We demonstrate that our rules are sound, and with a mechanized proof engine, we illustrate their use with some representative examples. For conflicting operations, the developer can choose between conflict resolution or coordination. We present a novel replicated tree data structure that supports coordination-free concurrent atomic moves, and arguably maintains the tree invariant. Our analysis identifies cases where concurrent moves are inherently safe. For the remaining cases we devise a conflict resolution algorithm. The trade-off is that in some cases a move operation "loses". Given the coordination required by some application for safety, it can be implemented in many different ways. Even restricting to locks, they can use various configurations, differing by lock granularity, type, and placement. The performance of each configuration depends on workload. We study the "coordination lattice", i.e., design space of lock configurations, and define a set of metrics to systematically navigate them
Huang, Feng. « Contribution à l'évaluation et à la configuration optimale des systèmes à énergie distribuée basés sur la récupération de rejets de chaleur industrielle ». Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30297/document.
Texte intégralNowadays, industry accounts for about one third of energy consumption and CO2 emissions. Substantial opportunities exist to address environmental and economic challenges, including energy efficiency in general and the use of energy, especially in industrial parks. Distributed Energy Systems (DES) correspond in this sense to a common and promising solution. We have therefore undertaken a global site approach, including the aggregation of all influential energy, economic, environmental and managerial variables in an installation of this type. Implementation on a pilot plant and its validation have made it possible to identify the scientific and technical locks and to measure the relevance and efficiency of the elements and stationary operating modes of the systems. This study offers a method of cooperative use of the indicators of impacted domains and also opens perspectives on developments in dynamic mode for the purposes of optimum driving assistance
Saied, Mariem. « Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures ». Thesis, Strasbourg, 2018. http://www.theses.fr/2018STRAD036/document.
Texte intégralIn this work, we present Dido, an implicitly parallel domain-specific language (DSL) that captures high-level stencil abstractions and automatically generates high-performance parallel stencil code for distributed-memory architectures. The generated code uses ORWL as a communication and synchronization backend. We show that Dido achieves a huge progress in terms of programmer productivity without sacrificing the performance. Dido supports a wide range of stencil computations and real-world stencil-based applications. We show that the well-structured code generated by Dido lends itself to different possible optimizations and study the performance of two of them. We also combine Dido's code generation technique with the polyhedral loop optimizer Pluto to increase data locality and improve intra-node data reuse. We present experiments that prove the efficiency and scalability of the generated code that outperforms both ORWL and MPI hand-crafted implementations