東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

yInMem: A Parallel Distributed Index...

Huang, Yin.

FindBook

Google Book

Amazon

博客來

yInMem: A Parallel Distributed Indexed In-Memory Computation System for Big Data Analytics.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	yInMem: A Parallel Distributed Indexed In-Memory Computation System for Big Data Analytics./
作者:	Huang, Yin.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	132 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10277192
ISBN:	9781369807899

yInMem: A Parallel Distributed Indexed In-Memory Computation System for Big Data Analytics.
Huang, Yin.

yInMem: A Parallel Distributed Indexed In-Memory Computation System for Big Data Analytics. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 132 p.

Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.

Thesis (Ph.D.)--University of Maryland, Baltimore County, 2017.

Cluster computing is experiencing a surge of interest in in-memory computing system with the advances in hardware such as memory. However, the network media has the smallest bandwidth as compared to memory and disk in a typical setting of cluster computing environment. In addition, the sparse nature of graph applications, such as social network, imposes new challenges for in-memory computing system. Examples of such challenges are data locality, workload balance and memory management. As a result, fine control over data partitioning and data sharing plays a crucial role in improving the speed of large-scale data-parallel processing systems by reducing the cross-node communication. In order to maximize the performance, in-memory computing system should be offering optimized data throughput for parallel computation in large-scale data analytics.

ISBN: 9781369807899Subjects--Topical Terms:

523869
Computer science.

yInMem: A Parallel Distributed Indexed In-Memory Computation System for Big Data Analytics.
LDR:03249nmm a2200325 4500 001 2154603
005 20180419104823.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9781369807899
035 $a (MiAaPQ)AAI10277192
035 $a (MiAaPQ)umbc:11647
035 $a AAI10277192
040 $a MiAaPQ $c MiAaPQ
100 1 $a Huang, Yin. $3 3181567
245 1 0 $a yInMem: A Parallel Distributed Indexed In-Memory Computation System for Big Data Analytics.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 132 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Adviser: Yelena Yesha.
502 $a Thesis (Ph.D.)--University of Maryland, Baltimore County, 2017.
520 $a Cluster computing is experiencing a surge of interest in in-memory computing system with the advances in hardware such as memory. However, the network media has the smallest bandwidth as compared to memory and disk in a typical setting of cluster computing environment. In addition, the sparse nature of graph applications, such as social network, imposes new challenges for in-memory computing system. Examples of such challenges are data locality, workload balance and memory management. As a result, fine control over data partitioning and data sharing plays a crucial role in improving the speed of large-scale data-parallel processing systems by reducing the cross-node communication. In order to maximize the performance, in-memory computing system should be offering optimized data throughput for parallel computation in large-scale data analytics.
520 $a This dissertation presents yInMem: a parallel, distributed, indexed, in-memory computing system for big data analytics. With the goal of building an in-memory computing system that enables optimal data partitioning and improves efficiency of iterative machine learning and graph algorithms, yInMem bridges the gap between HPC and Hadoop by parallelizing the computation with MPI while obtaining the advantage of distributed data storage, such as NoSQL database built on top of Hadoop. The novelty of yInMem results from introducing indexes or associative arrays to the in-memory computing system. Such a design offers benefits of fine control over data distribution with parallel computation to maximize the computing resources usage in the cluster.
520 $a By analyzing the linear algebra characteristics of iterative machine learning and graph algorithms, such as spectral clustering and PageRank, we find that yInMem is capable of maximizing the usage of computing resources in the cluster. Leveraging the insights of Sparse Matrix-Vector Multiplication (SpMV), we also provide an optimal data partitioning algorithm on top of yInMem for load balance and data locality.
520 $a In order to evaluate yInMem, we investigate iterative machine learning and graph algorithms using both synthetic benchmarks and real user applications. yInMem matches or exceeds the performance of existing specialized systems.
590 $a School code: 0434.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a University of Maryland, Baltimore County. $b Computer Science. $3 1018441
773 0 $t Dissertation Abstracts International $g 78-10B(E).
790 $a 0434
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10277192