DSpace@nitr: Item 2080/1439

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1439

Full metadata record

DC Field	Value	Language
contributor.author	Panda, A C	-
contributor.author	Sa, Pankaj K	-
contributor.author	Majhi, B	-
date.accessioned	2011-04-25T05:58:16Z	-
date.available	2011-04-25T05:58:16Z	-
date.issued	2011-02	-
identifier.citation	International Conference on Communication, Computing and Security(ICCCS'11), 12-14 February 2011, P 273-276	en
identifier.isbn	978-1-4503-0464-1	-
identifier.uri	http://hdl.handle.net/2080/1439	-
description	Copyright belongs to the Proceedings Publisher.	en
description.abstract	This paper presents a bitonic sort scheme in a shared memory mesh-connected SIMD array processor. In addition, it uses the two types of comparators of sorting networks in the mesh-connected parallel computer. This scheme uses variable multiple pivots and non-pivots. Parity strategy has been implemented to minimize the number of accesses in the mesh-connected interconnection network by introducing the concept of global and local memory. The proposed scheme is sufficiently general which is independent of hardware and interconnection network among them. From results it has been observed that by reducing the internetwork communication a performance improvement is achieved.	en
format.extent	293970 bytes	-
format.mimetype	application/pdf	-
language.iso	en	-
publisher	ACM	en
subject	SIMD Array Processor	en
subject	Bitonic Sort	en
subject	Parity Strategy	en
title	Bitonic Sort in Shared SIMD Array Processor	en
type	Article	en
Appears in Collections:	Conference Papers

Files in This Item:

File	Description	Size	Format
p273-panda.pdf		287Kb	Adobe PDF	View/Open

Feedback