A Parallel Solution for the Unconstrained Maximum Elements Problem

Author

Arock, Michael ; Ponalagusamy, R.

Author_Institution

Nat. Inst. of Technol., Tiruchirappalli

fYear

2006

fDate

20-23 Dec. 2006

Firstpage

12

Lastpage

15

Abstract

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].

Keywords

computational complexity; computational geometry; parallel algorithms; pipeline processing; reconfigurable architectures; LARPBS model; computational geometry; linear array; parallel algorithm; reconfigurable pipelined bus system; time complexity; unconstrained maximum elements problem; Broadcasting; Computational efficiency; Computational modeling; Computer applications; Mathematics; Optical arrays; Parallel algorithms; Prediction algorithms; Predictive models; Propagation delay; Computational Geometry; Maximal Elements; Parallel Algorithm; Reconfigurable Pipelined Bus System;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Computing and Communications, 2006. ADCOM 2006. International Conference on

Conference_Location

Surathkal

Print_ISBN

1-4244-0716-8

Electronic_ISBN

1-4244-0716-8

Type

conf

DOI

10.1109/ADCOM.2006.4289847

Filename

4289847