✦ LIBER ✦

Some parallel sorts on a mesh-connected processor array and their time efficiency

✍ Scribed by Kazuhiro Sado; Yoshihide Igarashi

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 684 KB
Volume: 3
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(86)90023-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel image normalization on a mesh c

Parallel image normalization on a mesh connected array processor

✍ S.-Y. Lee; S. Yalamanchili; J.K. Aggarwal 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Time lower bounds for sorting on multi-d

Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays

✍ Yijie Han; Yoshihide Igarashi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Parallel B-Spline Surface Interpolation

Parallel B-Spline Surface Interpolation on a Mesh-Connected Processor Array

✍ F.H. Cheng; G.W. Wasilkowski; J.Y. Wang; C.M. Zhang; W.P. Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 422 KB

A parallel implementation of Chebyshev method is presented for the B-spline surface interpolation problem. The algorithm finds the control points of a uniform bicubic B-spline surface that interpolates \(m \times n\) data points on an \(m \times n\) mesh-connected processor array in constant time. H

An optimal and processor efficient paral

An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

✍ Min He; Xiaolong Wu; Si Qing Zheng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 513 KB