By Topic

An Implementation of Novel Cloud Computing Model - Improved Map-reduce Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shi Hengliang ; Sch. of Comput. Sci., Nanjing Univ. of Sci. & Technol., Nanjing, China ; Bai Guangyi ; Gui Wenming

Although Map-reduce model is easy to deal with querying on a large scale data cluster, but difficult to deal with complex science computing due to its narrow application fields. Among complex applications, most user applications are not querying request simply, but query after complex computing, such as encryptions. This paper proposes a novel method which transforms user's application task DAG (directed a cyclic graph) into MCST (minimum cost spanning tree) firstly, and then works with map-reduce to complete parallel query. This idea can effectively deal with comprehensive problems which include complex computing and query on a large scale data cluster, such as TSP (travel sales problem), dynamic scheduling, route scheduling and others.

Published in:

Grid and Cooperative Computing (GCC), 2010 9th International Conference on

Date of Conference:

1-5 Nov. 2010