Integration of zero and sequential algorithm in shuffle exchange with Minus One Stage

Citation

Md Yunus, Nur Arzilawati and Othman, Mohamed and Mohd Hanapi, Zurina (2013) Integration of zero and sequential algorithm in shuffle exchange with Minus One Stage. In: International Conference on Advances in Computing, Control, and Telecommunication Technologies 2012, 1-2 Nov. 2012, Kuala Lumpur, Malaysia. (pp. 7-12).

Abstract

This paper focused on comparing the algorithm based on shuffle exchange network connection to achieve the optimal routing time as well as the number of passes to route in a given permutation. The algorithms consist of six algorithms namely ZeroX, ZeroY, ZeroXbit, ZeroYbit, Sequential Increasing and Sequential Decreasing algorithm. These six algorithms will compare with the proposed Shuffle Exchange Network with Minus One Stage (SEN-). This paper also shows the details of the illustrative examples used to explain each algorithm. At the end of this chapter, the comparative analysis shows the performance of each algorithm with the integration of shuffle exchange connection pattern in terms of the execution time and number of passes.

Download File

PDF
40602.pdf - Published Version
Restricted to Repository staff only
Download (118kB)

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Computer Science and Information Technology
Publisher:	Elsevier India
Keywords:	Shuffle exchange network; Integration; Routing algorithm; Execution time; Number of passes
Depositing User:	Azian Edawati Zakaria
Date Deposited:	17 Sep 2015 06:52
Last Modified:	26 Jan 2016 02:46
URI:	http://psasir.upm.edu.my/id/eprint/40602
Statistic Details:	View Download Statistic

Actions (login required)

View Item