Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1439
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Panda, A C | - |
dc.contributor.author | Sa, Pankaj K | - |
dc.contributor.author | Majhi, B | - |
dc.date.accessioned | 2011-04-25T05:58:16Z | - |
dc.date.available | 2011-04-25T05:58:16Z | - |
dc.date.issued | 2011-02 | - |
dc.identifier.citation | International Conference on Communication, Computing and Security(ICCCS'11), 12-14 February 2011, P 273-276 | en |
dc.identifier.isbn | 978-1-4503-0464-1 | - |
dc.identifier.uri | http://hdl.handle.net/2080/1439 | - |
dc.description | Copyright belongs to the Proceedings Publisher. | en |
dc.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 |
dc.format.extent | 293970 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | ACM | en |
dc.subject | SIMD Array Processor | en |
dc.subject | Bitonic Sort | en |
dc.subject | Parity Strategy | en |
dc.title | Bitonic Sort in Shared SIMD Array Processor | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
p273-panda.pdf | 287.08 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.