Auswahl der wissenschaftlichen Literatur zum Thema „Modèle de programmation MapReduce“
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 "Modèle de programmation MapReduce" 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.
Zeitschriftenartikel zum Thema "Modèle de programmation MapReduce"
Lapointe, Jean, Loïc Thérien und Michel Veillette. „Modèle d’élaboration et de validation de matériel didactique en formation professionnelle“. Articles 17, Nr. 1 (16.11.2009): 57–75. http://dx.doi.org/10.7202/900686ar.
Der volle Inhalt der QuelleChateau, Jean-Pierre D. „La programmation déterministe du budget de capital : un modèle financier“. Article 50, Nr. 3 (09.07.2009): 415–49. http://dx.doi.org/10.7202/803057ar.
Der volle Inhalt der QuelleCliche, Lucie, und Marie D. Martel. „Cinq bibliothèques de Montréal dans la société du savoir : une nouvelle génération de tiers lieux“. Du point de vue des bibliothécaires… 60, Nr. 2-3 (09.06.2014): 99–104. http://dx.doi.org/10.7202/1025516ar.
Der volle Inhalt der QuelleDouence, Rémi, und Mario Südholt. „Un modèle et un outil pour la programmation par aspects événementiels“. L'objet 9, Nr. 1-2 (30.06.2003): 105–17. http://dx.doi.org/10.3166/objet.9.1-2.105-117.
Der volle Inhalt der QuelleYanatchkov, Milovann. „Modélisation par le flux“. SHS Web of Conferences 47 (2018): 01006. http://dx.doi.org/10.1051/shsconf/20184701006.
Der volle Inhalt der QuelleParent, E., F. Lebdi und P. Hurand. „Gestion stratégique d'un système de ressources en eau : l'exemple du système NESTE“. Revue des sciences de l'eau 4, Nr. 4 (12.04.2005): 543–68. http://dx.doi.org/10.7202/705115ar.
Der volle Inhalt der QuelleBujold, Stéphane, und Guy Ausloos. „Évaluation du fonctionnement familial : le modèle des fonctions de Guy Ausloos comme données probantes fondées sur la pratique“. Thérapie Familiale Vol. 44, Nr. 3 (13.03.2023): 211–22. http://dx.doi.org/10.3917/tf.233.0211.
Der volle Inhalt der QuelleColas, Maxime, und Michel Deloizy. „Le Model Based Design pour l’apprentissage par conception guidée“. J3eA 22 (2023): 1009. http://dx.doi.org/10.1051/j3ea/20231009.
Der volle Inhalt der QuellePrudhomme, Claire, Ana Roxin, Christophe Cruz und Frank Boochs. „Modélisation sémantique et programmation générative pour une simulation multi-agent dans le contexte de gestion de catastrophe“. Revue Internationale de Géomatique 30, Nr. 1-2 (Januar 2020): 37–65. http://dx.doi.org/10.3166/rig.2020.00102.
Der volle Inhalt der QuelleFabbri, Julie, und Florence Charue-Duboc. „Un modèle d’accompagnement entrepreneurial fondé sur des apprentissages au sein d’un collectif d’entrepreneurs : le cas de La Ruche“. Management international 17, Nr. 3 (27.08.2013): 86–99. http://dx.doi.org/10.7202/1018269ar.
Der volle Inhalt der QuelleDissertationen zum Thema "Modèle de programmation MapReduce"
Rivault, Sébastien. „Parallélisme, équilibrage de charges et extensibilité dans le traitement des mégadonnées sur des systèmes à grande échelle“. Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1019.
Der volle Inhalt der QuelleOver the past two decades, owing to the reduction of storage, exchange and data processing costs, the volume of data generated each year continues to explode. The challenges related to big data processing are often described by the 3Vs : volume, variety and velocity of data creation, analysis, and sharing. To store and analyze these large datasets, it is essential to use clusters of machines and scalable algorithms that are insensitive to load imbalance that may occur among processing nodes. Applications such as collaborative filtering, deduplication and entity resolution are necessary to identify relationships in big datasets relying on a notion of similarity between records. These applications enable finding users with similar tastes, cleaning data and detecting frauds in large datasets. In these cases, similarity join and similarity search operations are often used to retrieve all similar records in one or more datasets using a distance and a user-defined threshold. Although parallel joins have been widely studied and successfully implemented on parallel and distributed architectures, the algorithms are not suitable for similarity join operation, since there is no hashing or sorting techniques, in the literature, that can retrieve all potentially similar record pairs in one step. Many techniques have been introduced in the literature to reduce the search space while ensuring the completeness of the result and avoiding the computation of a Cartesian product and the comparison of all record pairs. However, the scalability of these techniques is limited and does not allow efficient processing of big datasets on large-scale systems. Approximate methods have been proposed to handle similarity join by ignoring a very small part of the result and providing a probabilistic guarantee on the completeness of the results, while reducing the search space. These methods rely on hash functions whose collision probabilities are sensitive to the objects' similarity. We rely on these techniques to propose efficient solutions for similarity join and similarity search processing, based on LSH (Locality Sensitive Hashing), distributed histograms, and randomized communication schemes in order to reduce processing time, communication, and disks I/O costs to only relevant data for various distances and objects. The aim is to propose a generic framework based on the MapReduce programming model that meets the challenges of volume, variety, and velocity of big data analysis.The efficiency and scalability of the proposed solutions were studied using a cost model and confirmed by a series of experiments measuring the result completeness and the reduction of the search space, while guaranteeing efficient similarity join processing regardless the data size and data skew, the distance and the user-defined thresholds
Nemchenko, Sergiy. „Modèle de transactions avancées et modèle à composants“. Valenciennes, 2004. http://ged.univ-valenciennes.fr/nuxeo/site/esupversions/229b5fe0-093f-46d5-bd94-a2e3d64d0cb5.
Der volle Inhalt der QuelleDuring last years we may observe the quick development of distributed applications. This effect is evoked by quick development of hardware and of programming models. As a result, the programmers can create the more complicate software, which uses a lot of computers and servers. At the same time, the requirements to the quality of provided services are increasing too. The non-functional services are created in order to satisfy this requirement. The transactional service allows to create the reliable distributed applications in spite of the possible execution failures. But usually the new applications need the long transactions. However, the existing transactional services don't perform their charges in those conditions. As a result, the applications with a good potential, executed on powerful hardware can be blocked because of inability of transactional service which is intended for the less powerful applications. The advanced transactional models are intended to solve the problem of long transaction use. The analysis of different models shows that the Open Nested Transactions correspond to the needs of component based distributed applications. This transactional model allows to commit the sub-transactions without waiting for the commitment of the top-level transaction. In the same time, this model requires the presence of the compensation mechanism. This mechanism has to manage the compensations, caused by associated transactional manager in order to assure the database consistency in the case of failure. In this work we propose to extend the transactional service used by the component based platforms to the Open Nested Transaction model. We had begun from the proposition of compensation mechanism for the transactions executed by components. Then, we had studied the influences of compensation on the transactions, executed simultaneously or after this compensable transaction. At the end, we had proposed the mechanism allowing the non-conflict cohabitation of the classical and advanced transactions (or, more exectty, of the classical and open nested transactions)
Markhoff, Béatrice. „Contribution à la définition d'un modèle de calcul fonctionnel paralèlle“. Besançon, 1995. http://www.theses.fr/1995BESA2059.
Der volle Inhalt der QuelleBlay-Fornarino, Mireille, und Anne-Marie Pinna. „Un modèle objet logique et relationnel : le langage Othelo“. Nice, 1990. http://www.theses.fr/1990NICE4359.
Der volle Inhalt der QuelleBertrand, Frédéric. „Un modèle de contrôle réactif pour les langages à objets concurrents“. La Rochelle, 1996. http://www.theses.fr/1996LAROS005.
Der volle Inhalt der QuelleNúñez, López Angel Rodrigo. „Un modèle de programmation intégrant classes, évènements et aspects“. Nantes, 2011. http://archive.bu.univ-nantes.fr/pollux/show.action?id=1ba3f61f-5a98-4b3e-8a93-b64ecca1c6ce.
Der volle Inhalt der QuelleObject-Oriented Programming (OOP) has become the de facto programming paradigm. Event-Based Programming (EBP) and Aspect-Oriented Programming (AOP) complement OOP, covering some of its deficiencies when building complex software. Today’s applications combine the three paradigms. However, OOP, EBP and AOP have not yet been properly integrated. Their underlying concepts are in general provided as distinct language constructs, whereas they are not completely orthogonal. This lack of integration and orthogonality complicates the development of software as it reduces its understandability, its composability and increases the required glue code. This thesis proposes an integration of OOP, EBP and AOP leading to a simple and regular programming model. This model integrates the notions of class and aspect, the notions of event and join point, and the notions of piece of advice, method and event handler. It reduces the number of language constructs while keeping expressiveness and offering additional programming options. We have designed and implemented two programming languages based on this model: EJava and ECaesarJ. EJava is an extension of Java implementing the model. We have validated the expressiveness of this language by implementing a well-known graphical editor, JHotDraw, reducing its glue code and improving its design. ECaesarJ is an extension of CaesarJ that combines our model with mixins and language support for state machines. This combination was shown to greatly facilitate the implementation of a smart home application, an industrial-strength case study that aims to coordinate different devices in a house and automatize their behaviors
Núñez, Angel. „Un modèle de programmation intégrant classes, événements et aspects“. Phd thesis, Université de Nantes, 2011. http://tel.archives-ouvertes.fr/tel-00656649.
Der volle Inhalt der QuelleBalmas, Françoise. „Contribution à la conceptualisation de programmes : modèle, implémentation, utilisation et évaluation“. Paris 8, 1995. http://www.theses.fr/1995PA081071.
Der volle Inhalt der QuelleDelignieres-Hannequin, Isabelle. „Proposition d'un modèle d'évaluation parallèle de prolog“. Lille 1, 1991. http://www.theses.fr/1991LIL10060.
Der volle Inhalt der QuelleMeysembourg-Männlein, Marie Laurence. „Modèle et langage à objets pour la programmation d'applications réparties“. Phd thesis, Grenoble INPG, 1989. http://tel.archives-ouvertes.fr/tel-00333509.
Der volle Inhalt der QuelleBücher zum Thema "Modèle de programmation MapReduce"
Mallet, Manon. Guide d'utilisation du logiciel: "modèle multiplicatif". Moncton, N.-B: Ministère des pêches et des océans, 1990.
Den vollen Inhalt der Quelle finden1947-, Gehani Narain, und McGettrick Andrew D. 1944-, Hrsg. Concurrent programming. Wokingham, England: Addison-Wesley, 1988.
Den vollen Inhalt der Quelle findenFreytag, Johann Christoph. Translating relationalqueries into iterative programs. Berlin: Springer-Verlag, 1987.
Den vollen Inhalt der Quelle findenNobert, Yves. La recherche opérationnelle. Montréal: Gaëtan Morin éditeur, 1995.
Den vollen Inhalt der Quelle findenNobert, Yves. La recherche opérationnelle. 3. Aufl. Boucherville, Québec: G. Morin, 2001.
Den vollen Inhalt der Quelle findenPorteneuve, Christophe. Bien de velopper pour le Web 2.0: AJAX, Prototype, Script.aculo.us, XHTML-CSS, JavaScript, DOM. 2. Aufl. Paris: Eyrolles, 2008.
Den vollen Inhalt der Quelle findenDikötter, Marc. Les Accepteurs : Un nouveau modèle de programmation. Presses polytechniques et universitaires romandes, 1993.
Den vollen Inhalt der Quelle findenVries, Steffen van de. Pilotage par ordinateur de modèle réduit ferroviaire avec EDiTs Pro : Electronique et programmation. Publitronic, 2001.
Den vollen Inhalt der Quelle findenMilicev, Dragan. Model-Driven Development with Executable UML. Wiley & Sons, Incorporated, John, 2009.
Den vollen Inhalt der Quelle findenMilicev, Dragan. Model-Driven Development with Executable UML. Wiley & Sons, Incorporated, John, 2009.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Modèle de programmation MapReduce"
GINOSAR, Ran. „Plural, pluricoeur haute performance à faible consommation d’énergie“. In Systèmes multiprocesseurs sur puce 1, 73–91. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9021.ch3.
Der volle Inhalt der QuelleYessad, Amel, Mathieu Muratet und Thibault Carron. „Assister les enseignants du primaire dans l’enseignement de la pensée informatique. Une approche basée sur la scénarisation et vers les teaching analytics“. In Enseigner, apprendre, former à l’informatique à l'école : regards croisés, 211–31. Université Paris Cité, 2024. http://dx.doi.org/10.53480/2024iecare11y.
Der volle Inhalt der Quelle