Referenced Items are not available for this document.
This paper proposes a new parallel algorithm for the maximal elements problem with no constraints. It is proposed for a linear array with reconfigurable pipelined bus system (LARPBS) model and on its latest variant, LARPBS(p) model also. It runs in O(log log n ldr log n) time with O(n) processors. Its significance is that it works for any instance of the problem with no constraint laid in [2].
Published in:
Advanced Computing and Communications, 2006. ADCOM 2006. International Conference on
Date of Conference: 20-23 Dec. 2006
- Page(s):
- 12 - 15
- E-ISBN :
- 1-4244-0716-8
- Print ISBN:
- 1-4244-0716-8
- INSPEC Accession Number:
- 9703653
- Conference Location :
- Surathkal
- Digital Object Identifier :
- 10.1109/ADCOM.2006.4289847
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
