Littérature scientifique sur le sujet « MAPREDUCE FRAMEWORKS »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
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 « MAPREDUCE FRAMEWORKS ».
À 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 "MAPREDUCE FRAMEWORKS"
Ajibade Lukuman Saheed, Abu Bakar Kamalrulnizam, Ahmed Aliyu et Tasneem Darwish. « Latency-aware Straggler Mitigation Strategy in Hadoop MapReduce Framework : A Review ». Systematic Literature Review and Meta-Analysis Journal 2, no 2 (19 octobre 2021) : 53–60. http://dx.doi.org/10.54480/slrm.v2i2.19.
Texte intégralDarapaneni, Chandra Sekhar, Bobba Basaveswara Rao, Boggavarapu Bhanu Venkata Satya Vara Prasad et Suneetha Bulla. « An Analytical Performance Evaluation of MapReduce Model Using Transient Queuing Model ». Advances in Modelling and Analysis B 64, no 1-4 (31 décembre 2021) : 46–53. http://dx.doi.org/10.18280/ama_b.641-407.
Texte intégralKang, Sol Ji, Sang Yeon Lee et Keon Myung Lee. « Performance Comparison of OpenMP, MPI, and MapReduce in Practical Problems ». Advances in Multimedia 2015 (2015) : 1–9. http://dx.doi.org/10.1155/2015/575687.
Texte intégralSrirama, Satish Narayana, Oleg Batrashev, Pelle Jakovits et Eero Vainikko. « Scalability of Parallel Scientific Applications on the Cloud ». Scientific Programming 19, no 2-3 (2011) : 91–105. http://dx.doi.org/10.1155/2011/361854.
Texte intégralSenthilkumar, M., et P. Ilango. « A Survey on Job Scheduling in Big Data ». Cybernetics and Information Technologies 16, no 3 (1 septembre 2016) : 35–51. http://dx.doi.org/10.1515/cait-2016-0033.
Texte intégralAdornes, Daniel, Dalvan Griebler, Cleverson Ledur et Luiz Gustavo Fernandes. « Coding Productivity in MapReduce Applications for Distributed and Shared Memory Architectures ». International Journal of Software Engineering and Knowledge Engineering 25, no 09n10 (novembre 2015) : 1739–41. http://dx.doi.org/10.1142/s0218194015710096.
Texte intégralSong, Minjae, Hyunsuk Oh, Seungmin Seo et Kyong-Ho Lee. « Map-Side Join Processing of SPARQL Queries Based on Abstract RDF Data Filtering ». Journal of Database Management 30, no 1 (janvier 2019) : 22–40. http://dx.doi.org/10.4018/jdm.2019010102.
Texte intégralThabtah, Fadi, Suhel Hammoud et Hussein Abdel-Jaber. « Parallel Associative Classification Data Mining Frameworks Based MapReduce ». Parallel Processing Letters 25, no 02 (juin 2015) : 1550002. http://dx.doi.org/10.1142/s0129626415500024.
Texte intégralGoncalves, Carlos, Luis Assuncao et Jose C. Cunha. « Flexible MapReduce Workflows for Cloud Data Analytics ». International Journal of Grid and High Performance Computing 5, no 4 (octobre 2013) : 48–64. http://dx.doi.org/10.4018/ijghpc.2013100104.
Texte intégralEsposito, Christian, et Massimo Ficco. « Recent Developments on Security and Reliability in Large-Scale Data Processing with MapReduce ». International Journal of Data Warehousing and Mining 12, no 1 (janvier 2016) : 49–68. http://dx.doi.org/10.4018/ijdwm.2016010104.
Texte intégralThèses sur le sujet "MAPREDUCE FRAMEWORKS"
de, Souza Ferreira Tharso. « Improving Memory Hierarchy Performance on MapReduce Frameworks for Multi-Core Architectures ». Doctoral thesis, Universitat Autònoma de Barcelona, 2013. http://hdl.handle.net/10803/129468.
Texte intégralThe need of analyzing large data sets from many different application fields has fostered the use of simplified programming models like MapReduce. Its current popularity is justified by being a useful abstraction to express data parallel processing and also by effectively hiding synchronization, fault tolerance and load balancing management details from the application developer. MapReduce frameworks have also been ported to multi-core and shared memory computer systems. These frameworks propose to dedicate a different computing CPU core for each map or reduce task to execute them concurrently. Also, Map and Reduce phases share a common data structure where main computations are applied. In this work we describe some limitations of current multi-core MapReduce frameworks. First, we describe the relevance of the data structure used to keep all input and intermediate data in memory. Current multi-core MapReduce frameworks are designed to keep all intermediate data in memory. When executing applications with large data input, the available memory becomes too small to store all framework intermediate data and there is a severe performance loss. We propose a memory management subsystem to allow intermediate data structures the processing of an unlimited amount of data by the use of a disk spilling mechanism. Also, we have implemented a way to manage concurrent access to disk of all threads participating in the computation. Finally, we have studied the effective use of the memory hierarchy by the data structures of the MapReduce frameworks and proposed a new implementation of partial MapReduce tasks to the input data set. The objective is to make a better use of the cache and to eliminate references to data blocks that are no longer in use. Our proposal was able to significantly reduce the main memory usage and improves the overall performance with the increasing of cache memory usage.
Kumaraswamy, Ravindranathan Krishnaraj. « Exploiting Heterogeneity in Distributed Software Frameworks ». Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/64423.
Texte intégralPh. D.
Venumuddala, Ramu Reddy. « Distributed Frameworks Towards Building an Open Data Architecture ». Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc801911/.
Texte intégralPeddi, Sri Vijay Bharat. « Cloud Computing Frameworks for Food Recognition from Images ». Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32450.
Texte intégralElteir, Marwa Khamis. « A MapReduce Framework for Heterogeneous Computing Architectures ». Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/28786.
Texte intégralPh. D.
Alkan, Sertan. « A Distributed Graph Mining Framework Based On Mapreduce ». Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12611588/index.pdf.
Texte intégralWang, Yongzhi. « Constructing Secure MapReduce Framework in Cloud-based Environment ». FIU Digital Commons, 2015. http://digitalcommons.fiu.edu/etd/2238.
Texte intégralZhang, Yue. « A Workload Balanced MapReduce Framework on GPU Platforms ». Wright State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=wright1450180042.
Texte intégralRaja, Anitha. « A Coordination Framework for Deploying Hadoop MapReduce Jobs on Hadoop Cluster ». Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196951.
Texte intégralApache Hadoop är ett öppen källkods system som levererar pålitlig, skalbar och distribuerad användning. Hadoop tjänster hjälper med distribuerad data förvaring, bearbetning, åtkomst och trygghet. MapReduce är en viktig del av Hadoop system och är designad att bearbeta stora data mängder och även distribuerad i flera leder. MapReduce är använt extensivt inom bearbetning av strukturerad och ostrukturerad data i olika branscher bl. a e-handel, webbsökning, sociala medier och även vetenskapliga beräkningar. Förståelse av MapReduces arbetsbelastningar är viktiga att få förbättrad konfigurationer och resultat. Men, arbetsbelastningar av MapReduce inom massproduktions miljö var inte djup-forskat hittills. I detta examensarbete, är en hel del fokus satt på ”Hadoop cluster” (som en utförande miljö i data bearbetning) att analysera två typer av Hadoop MapReduce (MR) arbeten genom ett tilltänkt system. Detta system är refererad som arbetsbelastnings översättare. Resultaten från denna arbete innehåller: (1) en parametrisk arbetsbelastningsmodell till inriktad MR arbeten, (2) en specifikation att utveckla förbättrad kluster strategier med båda modellen och koordinations system, och (3) förbättrad planering och arbetsprestationer, d.v.s kortare tid att utföra arbetet. Vi har realiserat en prototyp med Apache Tomcat på (OpenStack) Ubuntu Trusty Tahr som använder RESTful API (1) att skapa ”Hadoop cluster” version 2.7.2 och (2) att båda skala upp och ner antal medarbetare i kluster. Forskningens resultat har visat att med vältrimmad parametrar, kan MR arbete nå förbättringar dvs. sparad tid vid slutfört arbete och förbättrad användning av hårdvara resurser. Målgruppen för denna avhandling är utvecklare. I framtiden, föreslår vi tilläggning av olika parametrar att utveckla en allmän modell för MR och liknande arbeten.
Lakkimsetti, Praveen Kumar. « A framework for automatic optimization of MapReduce programs based on job parameter configurations ». Kansas State University, 2011. http://hdl.handle.net/2097/12011.
Texte intégralDepartment of Computing and Information Sciences
Mitchell L. Neilsen
Recently, cost-effective and timely processing of large datasets has been playing an important role in the success of many enterprises and the scientific computing community. Two promising trends ensure that applications will be able to deal with ever increasing data volumes: first, the emergence of cloud computing, which provides transparent access to a large number of processing, storage and networking resources; and second, the development of the MapReduce programming model, which provides a high-level abstraction for data-intensive computing. MapReduce has been widely used for large-scale data analysis in the Cloud [5]. The system is well recognized for its elastic scalability and fine-grained fault tolerance. However, even to run a single program in a MapReduce framework, a number of tuning parameters have to be set by users or system administrators to increase the efficiency of the program. Users often run into performance problems because they are unaware of how to set these parameters, or because they don't even know that these parameters exist. With MapReduce being a relatively new technology, it is not easy to find qualified administrators [4]. The major objective of this project is to provide a framework that optimizes MapReduce programs that run on large datasets. This is done by executing the MapReduce program on a part of the dataset using stored parameter combinations and setting the program with the most efficient combination and this modified program can be executed over the different datasets. We know that many MapReduce programs are used over and over again in applications like daily weather analysis, log analysis, daily report generation etc. So, once the parameter combination is set, it can be used on a number of data sets efficiently. This feature can go a long way towards improving the productivity of users who lack the skills to optimize programs themselves due to lack of familiarity with MapReduce or with the data being processed.
Chapitres de livres sur le sujet "MAPREDUCE FRAMEWORKS"
Singh, Jaspreet, S. N. Panda et Rajesh Kaushal. « Performance Evaluation of Big Data Frameworks : MapReduce and Spark ». Dans Advances in Intelligent Systems and Computing, 1611–19. Singapore : Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-5903-2_167.
Texte intégralDhanani, Jenish, Rupa Mehta, Dipti Rana et Bharat Tidke. « Back-Propagated Neural Network on MapReduce Frameworks : A Survey ». Dans Smart Innovations in Communication and Computational Sciences, 381–91. Singapore : Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2414-7_35.
Texte intégralNoh, Hyunho, et Jun-Ki Min. « An Efficient Data Access Method Exploiting Quadtrees on MapReduce Frameworks ». Dans Database Systems for Advanced Applications, 86–100. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40270-8_8.
Texte intégralSalto, Carolina, Gabriela Minetti, Enrique Alba et Gabriel Luque. « Developing Genetic Algorithms Using Different MapReduce Frameworks : MPI vs. Hadoop ». Dans Advances in Artificial Intelligence, 262–72. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00374-6_25.
Texte intégralXu, Huanle, Ronghai Yang, Zhibo Yang et Wing Cheong Lau. « Solving Large Graph Problems in MapReduce-Like Frameworks via Optimized Parameter Configuration ». Dans Algorithms and Architectures for Parallel Processing, 525–39. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27122-4_36.
Texte intégralReinders, James, Ben Ashbaugh, James Brodman, Michael Kinsner, John Pennycook et Xinmin Tian. « Common Parallel Patterns ». Dans Data Parallel C++, 323–52. Berkeley, CA : Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5574-2_14.
Texte intégralJeyaraj, Rathinaraja, Ganeshkumar Pugalendhi et Anand Paul. « Hadoop Framework ». Dans Big Data with Hadoop MapReduce, 47–111. Includes bibliographical references and index. : Apple Academic Press, 2020. http://dx.doi.org/10.1201/9780429321733-2.
Texte intégralSuryawanshi, Sahiba, et Praveen Kaushik. « Efficient MapReduce Framework Using Summation ». Dans Data, Engineering and Applications, 3–11. Singapore : Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6351-1_1.
Texte intégralCho, Kyung Soo, Ji Yeon Lim, Jae Yeol Yoon, Young Hee Kim, Seung Kwan Kim et Ung Mo Kim. « Opinion Mining in MapReduce Framework ». Dans Communications in Computer and Information Science, 50–55. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22365-5_7.
Texte intégralLiu, Xiufeng, Christian Thomsen et Torben Bach Pedersen. « The ETLMR MapReduce-Based ETL Framework ». Dans Lecture Notes in Computer Science, 586–88. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22351-8_48.
Texte intégralActes de conférences sur le sujet "MAPREDUCE FRAMEWORKS"
Lee, Haejoon, Minseo Kang, Sun-Bum Youn, Jae-Gil Lee et YongChul Kwon. « An Experimental Comparison of Iterative MapReduce Frameworks ». Dans CIKM'16 : ACM Conference on Information and Knowledge Management. New York, NY, USA : ACM, 2016. http://dx.doi.org/10.1145/2983323.2983647.
Texte intégralWang, Haoyu, Haiying Shen, Charles Reiss, Arnim Jain et Yunqiao Zhang. « Improved Intermediate Data Management for MapReduce Frameworks ». Dans 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2020. http://dx.doi.org/10.1109/ipdps47924.2020.00062.
Texte intégralHsaini, Sara, Salma Azzouzi et My El Hassan Charaf. « A Secure Testing Based Approach for Mapreduce Frameworks ». Dans 2018 International Conference on Electronics, Control, Optimization and Computer Science (ICECOCS). IEEE, 2018. http://dx.doi.org/10.1109/icecocs.2018.8610596.
Texte intégralJakovits, Pelle, et Satish Narayana Srirama. « Evaluating MapReduce frameworks for iterative Scientific Computing applications ». Dans 2014 International Conference on High Performance Computing & Simulation (HPCS). IEEE, 2014. http://dx.doi.org/10.1109/hpcsim.2014.6903690.
Texte intégralHaque, Ahsanul, et Latifur Khan. « MapReduce Based Frameworks for Classifying Evolving Data Stream ». Dans 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW). IEEE, 2013. http://dx.doi.org/10.1109/icdmw.2013.145.
Texte intégralAhmad, Maaz Bin Safeer, et Alvin Cheung. « Automatically Leveraging MapReduce Frameworks for Data-Intensive Applications ». Dans SIGMOD/PODS '18 : International Conference on Management of Data. New York, NY, USA : ACM, 2018. http://dx.doi.org/10.1145/3183713.3196891.
Texte intégralTrong-Tuan Vu et Fabrice Huet. « A Lightweight Continuous Jobs Mechanism for MapReduce Frameworks ». Dans 2013 13th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid). IEEE, 2013. http://dx.doi.org/10.1109/ccgrid.2013.36.
Texte intégralGhit, Bogdan, et Dick Epema. « Tyrex : Size-Based Resource Allocation in MapReduce Frameworks ». Dans 2016 16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid). IEEE, 2016. http://dx.doi.org/10.1109/ccgrid.2016.82.
Texte intégralRivas-Gomez, Sergio, Stefano Markidis, Erwin Laure, Keeran Brabazon, Oliver Perks et Sai Narasimhamurthy. « Decoupled Strategy for Imbalanced Workloads in MapReduce Frameworks ». Dans 2018 IEEE 20th International Conference on High Performance Computing and Communications ; IEEE 16th International Conference on Smart City ; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS). IEEE, 2018. http://dx.doi.org/10.1109/hpcc/smartcity/dss.2018.00153.
Texte intégralGuo, Jia, et Gagan Agrawal. « Achieving Performance and Programmability for MapReduce(-Like) Frameworks ». Dans 2018 IEEE 25th International Conference on High Performance Computing (HiPC). IEEE, 2018. http://dx.doi.org/10.1109/hipc.2018.00043.
Texte intégral