Analysis of replicated data algorithms on processor array architectures

DESIGNING A SYSTOLIC ALGORITHM FOR GENERATING WELL-FORMED PARENTHESIS STRINGS

Parallel Processing Letters ◽

10.1142/s0129626404001738 ◽

2004 ◽

Vol 14 (01) ◽

pp. 83-97

Author(s):

JONG-CHUANG TSAY

Keyword(s):

Linear Array ◽

Vlsi Implementation ◽

Processor Array ◽

Lexicographical Order ◽

Systolic Algorithm ◽

Left And Right ◽

Local Connection

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.

Download Full-text

Reducing power consumption for Dynamically Reconfigurable Processor Array with Partially Fixed Configuration Mapping

2010 International Conference on Field-Programmable Technology ◽

10.1109/fpt.2010.5681431 ◽

2010 ◽

Cited By ~ 1

Author(s):

Kazuei Hironaka ◽

Masayuki Kimura ◽

Yoshiki Saito ◽

Toru Sano ◽

Masaru Kato ◽

...

Keyword(s):

Power Consumption ◽

Reducing Power ◽

Processor Array ◽

Reconfigurable Processor ◽

Dynamically Reconfigurable

Download Full-text

A fast algorithm for online placement and reorganization of replicated data

Proceedings International Parallel and Distributed Processing Symposium ◽

10.1109/ipdps.2003.1213151 ◽

2004 ◽

Cited By ~ 31

Author(s):

R.J. Honicky ◽

E.L. Miller

Keyword(s):

Fast Algorithm ◽

Replicated Data ◽

Online Placement

Download Full-text

THREE DIMENSIONAL GRID STRUCTURE FOR EFFICIENT ACCESS OF REPLICATED DATA

Journal of Interconnection Networks ◽

10.1142/s0219265901000415 ◽

2001 ◽

Vol 02 (03) ◽

pp. 317-329 ◽

Cited By ~ 5

Author(s):

MUSTAFA MAT DERIS ◽

ALI MAMAT ◽

PUA CHAI SENG ◽

MOHD YAZID SAMAN

Keyword(s):

Distributed System ◽

Three Dimensional ◽

Data Replication ◽

High Availability ◽

Communication Cost ◽

Data Availability ◽

Grid Structure ◽

Communication Costs ◽

Replicated Data ◽

Efficient Access

This article addresses the performance of data replication protocol in terms of data availability and communication costs. Specifically, we present a new protocol called Three Dimensional Grid Structure (TDGS) protocol, to manage data replication in distributed system. The protocol provides high availability for read and write operations with limited fault-tolerance at low communication cost. With TDGS protocol, a read operation is limited to two data copies, while a write operation is required with minimal number of copies. In comparison to other protocols. TDGS requires lower communication cost for an operation, while providing higher data availability.

Download Full-text