SOME PROPERTIES OF THE PARALLEL BUBBLING AND PARALLEL SORTS ON A MESH–CONNECTED PROCESSOR ARRAY

Author(s):  
Kazuhiro SADO ◽  
Yoshihide IGARASHI
Keyword(s):  
2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.


1998 ◽  
Vol 84 (6) ◽  
pp. 615-624 ◽  
Author(s):  
D. SOUDRIS ◽  
P. POECHMUELLER ◽  
E. D. KYRIAKIS-BITZAROS ◽  
M. BIRBAS ◽  
C. GOUTIS ◽  
...  

1993 ◽  
Vol 03 (02) ◽  
pp. 157-164 ◽  
Author(s):  
P. THANGAVEL ◽  
V.P. MUTHUSWAMY

A simple parallel algorithm for generating N-ary reflected Gray codes is presented. The algorithm is derived from the pattern of N-ary reflected Gray codes. The algorithm runs on a linear processor array with a reconfigurable bus system. A reconfigurable bus system is a bus system whose configuration can be dynamically changed. Recently processor arrays with reconfigurable bus systems were used to solve many problems in constant time. There already exists experimental reconfigurable chips.


2020 ◽  
Vol 138 ◽  
pp. 32-47
Author(s):  
Aaron Stillmaker ◽  
Brent Bohnenstiehl ◽  
Lucas Stillmaker ◽  
Bevan Baas

Sign in / Sign up

Export Citation Format

Share Document