Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 64 for “"Map/Reduce"”.
-
DFA Minimization Algorithms in Map-Reduce
Map-Reduce has been a highly popular parallel-distributed programming model. In this thesis, we study the problem of minimizing Deterministic Finite State Automata (DFA). We focus our attention on two well-known (serial) algorithms, namely the algorithms of Moore (1956) and of Hopcroft (1971). The …
-
Finite Automata Algorithms in Map-Reduce
… a large deterministic finite automaton (DFA) in map-reduce are studied. We have derived a lower bound on replication rate for computing NFA intersections and provided three concrete algorithms for the problem. Our investigation of the replication rate for each of all three algorithms shows where …
-
Data Analysis With Map Reduce Programming Paradigm
… for the relational algebra followed by a Map Reduce implementation of the same operators. We then implement a database schema in Hive for the Google 1T 5-gram data set. The thesis will further look into the query processing with Hive and Pig in the Hadoop setting. More specially, we report …
-
Using Map-reduce to scale an empirical database
… s times its size. UpSizeR is implemented using Map-Reduce which guarantees it could efficiently handle large datasets . In order to reduce I/O operations, we optimize our UpSizeR implementation to make it more efficient. We run queries on both the synthetic and the original datasets and compare …
-
Improving the Efficiency of Map-Reduce Task Engine
Map-Reduce is a popular distributed programming framework for parallelizing computation on huge datasets over a large number of compute nodes. This year completes a decade since it was invented by Google in 2004. Hadoop, a popular open source implementation of Map-Reduce was introduced by Yahoo in …
-
DEVELOPMENT OF MAP/REDUCE BASED MICROARRAY ANALYSIS TOOLS
… and summarization algorithms using the Map/Reduce framework. The Map/Reduce framework, first introduced by Google in 2004, offers a promising paradigm to develop scalable parallel applications for large-scale data. Evaluation of our new implementation on large microarray data of rice and …
-
A Map Reduce Approach of K-Means++ Algorithm with Initial Equidistant Centers
… parallel k-means++ clustering algorithm based on MapReduce, which is simple like traditional K-means, yet more powerful because the initial centroid selection process is not random. It follows a formula to plot initial centroids at equal distance and then iterates repeatedly like k-means to …
-
Finding Top-k Dominance on Incomplete Big Data Using Map-Reduce Framework
… the application of TKD query possible is the Bitmap Index Guided (BIG) algorithm. This algorithm strongly improves the performance for incomplete data, but it is not originally capable of finding top-k dominant values in incomplete big data, nor is it designed to do so. Several other algorithms …
-
Scheduling in MapReduce Clusters
MapReduce is a framework proposed by Google for processing huge amounts of data in a distributed environment. The simplicity of the programming model and the fault-tolerance feature of the framework make it very popular in Big Data processing. As MapReduce clusters get popular, their scheduling …
-
A hybrid framework of iterative MapReduce and MPI for molecular dynamics applications
… distributed data processing in parallel due to MapReduce framework. It is quite often that actual computations require multiple MapReduce cycles, which needs chained MapReduce jobs. However, Design by Hadoop is poor in addressing problems with iterative structures. In many iterative problems, …
-
Extending the Growing Hierarchical Self Organizing Maps for a Large Mixed-Attribute Dataset Using Spark MapReduce
In this thesis work, we propose a Map-Reduce variant of the Growing Hierarchical Self Organizing Map (GHSOM) called MR-GHSOM, which is capable of handling mixed attribute datasets of massive size. The Self Organizing Map (SOM) has proved to be a useful unsupervised data analysis algorithm. It …
-
Design och implementation av ett GPU-programspråk med högre ordningens funktioner
… through built-in higher-order functions such as map, reduce, and filter. This restricted access model is intended to facilitate optimisation by the compiler. We describe the design of the language as well as the implementation of its compiler, which includes code generation for NVIDIA and AMD …
-
Schedule data, not code
… or suitable for a limited model such as map/reduce, there is little help. We aim to address some major aspects of this still underserved area. We construct a model for parallelism, Data not Code (DnC), by starting with the observation that a majority of performance and problems in …
-
Towards Energy-Efficient, Fault-Tolerant, and Load-Balanced Mobile Cloud
… (e.g., video/image storage and processing or map-reduce type) on a single mobile device still remains off bounds since it requires large computation and storage capabilities. Computer scientists overcome this issue by exploiting the abundant computation and storage resources from traditional …
-
Latency-Tolerant Distributed Shared Memory For Data-Intensive Applications
… throughput. We evaluate Grappa with an in-memory map/reduce framework (10x faster than Spark); a vertex-centric framework inspired by GraphLab (1.33x faster than native GraphLab); and a relational query execution engine (12.5x faster than Shark). All these frameworks required only 60-690 lines of …
-
Experimental Evaluation of Big Geospatial Data Systems
… εφαρμογών που βασίζονται σε συστήματα τύπου Map-Reduce και υποδομών cloud. Αυτές οι εφαρμογές παρέχουν μια ποικιλία χαρακτηριστικών, παρόλα αυτά, διαφέρουν σε ότι αφορά τις χωρικές μεθόδους, τις τεχνικές καταμερισμού δεδομένων και το σύστημα ευρετηρίου που χρησιμοποιούν. …
-
Better Selection of Virtual Machines for a MapReduce Environment
… for issues. Out of this rose the paradigm of MapReduce. The basic idea of MapReduce is to minimize the work of the programmer and remove a lot of the chances of creating an error because of the distributed computation. To do this all the work is either done in the Map Phase by the Map Tasks or …
-
Adding big data analytics to GCSS-MC
… using Hadoop Distributed File System and Java Map Reduce. The results show that while it takes longer to program in Java (over SQL), the analytics are just as, or even more powerful ,as SQL, and the potential to save on hardware cost is significant.
-
Design and implementation of scalable hierarchical density based clustering
Clustering is a useful technique that divides data points into groups, also known as clusters, such that the data points of the same cluster exhibit similar properties. Typical clustering algorithms assign each data point to at least one cluster. However, in practical datasets like microarray gene …
-
Layered performance modelling and evaluation for cloud topic detection and tracking based big data applications
… on the individual processing components (e.g. map reduce). To tackle this challenge, in this thesis, we develop a layered performance model of cloud-based TDT applications that take into account big data characteristics, the data and event flow across myriad cloud software and hardware …
Page 1 of 4