A Sliding Memory Plane Array Processor

نویسندگان

  • Myung Hoon Sunwoo
  • Jake K. Aggarwal
چکیده

This paper describes a new mesh-connected SIMD architecture, called a Sliding Memory Plane (SIiM) Array Processor. On SIiM, the inter-processing element (inter-PE) communication, using the sliding memory plane, and the data input/output (I/O), using two U 0 planes, can occur without interrupting the PE’s, which greatly diminishes the communication and I/O overhead. SliM is unique in its ability to overlap inter-PE communication with computation, regardless of window size and shape and without using a coprocessor or an on-chip DMA controller. In addition, SliM uses four rather than eight links per PE to provide eight-way connectivity using the by-passing path, thus reducing the diagonal communication time and eliminating the necessity of diagonal links. The realization of these virtual links for diagonal communication without instruction overhead is another novel feature of SYM. An alternative method to achieve diagonal communication is to use two sliding memory plane shifts that can be overlapped with computation. The bypassing path can also accomplish nonlocal communication and broadcast. This paper illustrates the unique advantages of these inter-PE and diagonal communication schemes and proposes new parallel algorithms for image processing on SliM that have a zero or an O(1) communication complexity. With these salient features, SliM shows a significant performance improvement, illustrated with several tasks including the DARPA low level vision benchmarks. Index Tems-Computer architectures, computer vision, image processing, parallel architectures and algorithms, mesh-connected SIMD machines, VLSI architectures, VLSI design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of a SliM Array Processor

This paper presents the design and implementation of a Sliding Memory Plane (SliM) Array Processor, a mesh-connected SIMD architecture. To build the array processor, we developed the SliM chip consisting of mesh-connected 5 x 5 processing elements (PEs). Due to the idea of sliding, that is, overlapping the inter-PE communication with the computation, the SliM chip can greatly reduce the inter-P...

متن کامل

Design and Implementation of Field Programmable Gate Array Based Baseband Processor for Passive Radio Frequency Identification Tag (TECHNICAL NOTE)

In this paper, an Ultra High Frequency (UHF) base band processor for a passive tag is presented. It proposes a Radio Frequency Identification (RFID) tag digital base band architecture which is compatible with the EPC C C2/ISO18000-6B protocol. Several design approaches such as clock gating technique, clock strobe design and clock management are used. In order to reduce the area Decimal Matrix C...

متن کامل

Maximum Power Point Tracking Using Sliding Mode Control for Photovoltaic Array

In this paper, a robust Maximum Power Point Tracking (MPPT) for PV array has been proposed using sliding mode control by defining a new formulation for sliding surface which is based on increment conductance (INC) method. The stability and robustness of the proposed controller are investigated to load variations and environment changes. Three different types of DC-DC converter are used in Maxim...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1993