Improved Parallel Prefix Algorithm on OTIS-Mesh of Trees
نویسنده
چکیده
A parallel algorithm for prefix computation reported recently on interconnection network called OTIS-Mesh Of Trees[4]. Using n4 processors, algorithm shown to run in 13log n + O(1) electronic moves and 2 optical moves for n4 data points. In this paper we present new and improved parallel algorithm for prefix on OTIS-Mesh of Trees. The algorithm requires 10log n + O(1) electronic steps + 1 optical step for prefix computation on the same number of processors and data points as considered in [4].
منابع مشابه
Parallel Prefix on Mesh of Trees and OTIS Mesh of Trees
$ The corresponding author, Member, IEEE and IEEE Computer Society Abstract: In this paper, we first develop a parallel algorithm for prefix computation on an n × n mesh of trees (MOT). For n data elements, the algorithm requires 4 log n + O(1) time using n2 processors. Using the MOT prefix, we next propose a prefix algorithm on an n × n OTIS mesh of trees. This algorithm for n4 data elements i...
متن کاملImproved Parallel Algorithm for Time Series Based Forecasting Using OTIS-Mesh
Forecasting always plays an important role in business, technology and many others and it helps organizations to increase profits, reduce lost sales and more eff icient production planning. A parallel algorithm for forecasting reported recently on OTIS-Mesh[9]. This parallel algorithm requires 5( – 1) electronic steps and 4 optical steps. In this paper we present an improved parallel algorithm ...
متن کاملParallel Algorithm for Prefix Computation on OTIS k-Ary 3-Cube Parallel Computers
The OTIS (Optical Transpose Interconnection System) has been a popular interconnection model for developing parallel processing systems. Various real-life problems including job scheduling, knapsack, loop optimization, evaluation of polynomials, solutions of linear equations, and polynomial interpolation depend on the time complexity of prefix computation for the efficiency of their respective ...
متن کاملComputational Geometry On The OTIS-Mesh Optoelectronic Computer
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...
متن کاملParallel Algorithm for Time Series Based Forecasting on OTIS-Mesh
Forecasting plays an important role in business, technology, climate and many others. As an example, effective forecasting can enable an organization to reduce lost sales, increase profits and more efficient production planning. In this paper, we present a parallel algorithm for short term forecasting based on a time series model called weighted moving average. Our algorithm is mapped on OTIS-m...
متن کامل