Cart (Loading....) | Create Account
Close category search window

Performance Analysis of Parallel Processing Systems with Horizontal Decomposition

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)
Hanwei Chen ; Coll. of Comput. Sci. & Technol., Zhejiang Univ., Hangzhou, China ; Jianwei Yin ; Pu, C.

Parallel processing is an important pattern in cluster systems. To analyze the performance of parallel processing systems, we leveraged the fork-join queueing network (FJQN) models. However, there are no easy solutions to these models, especially for the multi-class closed ones. In this paper, a novel and efficient method named horizontal decomposition has been proposed. The main idea of our method is to approximate a non-product-form FJQN with some closed and open product-form networks. So the computational complexity can be dramatically reduced compared with the traditional hierarchical decomposition approach. And the algorithms for solving single-class and multi-class closed FJQNs have been developed respectively based on the horizontal decomposition. With these algorithms, the response time and throughput of each service center in a FJQN can be approximately calculated. The evaluation results show that 90 percentile of relative errors of most service centers are less than 15% except for the shared ones. The evaluation results also showed that the number of iterations in the algorithm for the multi-class FJQNs almost grows linearly with the population of networks.

Published in:

Cluster Computing (CLUSTER), 2012 IEEE International Conference on

Date of Conference:

24-28 Sept. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.