Localization of Data Transfer in Processor Arrays
نویسندگان
چکیده
منابع مشابه
Multiple-array passive acoustic source localization in shallow water.
This paper considers concurrent matched-field processing of data from multiple, spatially-separated acoustic arrays with application to towed-source data received on two bottom-moored horizontal line arrays from the SWellEx-96 shallow water experiment. Matched-field processors are derived for multiple arrays and multiple-snapshot data using maximum-likelihood estimates for unknown complex-value...
متن کاملMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Multimedia signal processing software typically have to process large amounts of data. The algorithms often involve the handling of data arrays in the form of nested loops. Experiments show that for this kind of applications data transfer (memory access) operations consume much more power than data-path operations. Our objective is to reduce memory access related power consumption by reducing t...
متن کاملMapping of Hierarchically Partitioned Regular Algorithms onto Processor Arrays
In the last decade, there has been a dramatic growth in research and development of massively parallel processor arrays both in academia and industry. The processor array architectures provide an optimal platform for parallel execution of number crunching loop programs from fields of digital signal processing, image processing, linear algebra, etc. However due to lack of mapping tools, these ma...
متن کاملCalibration of Low Density EEG Sensor Arrays for Brain Source Localization
This paper investigates the performance of calibration techniques on synthetic Electroencephalography (EEG) data. Brain source localization was performed using an iterative algorithm. A transfer-function-based calibration technique was developed. This technique can be applied in two forms: external calibration and autocalibration. For a low density EEG array system, it was shown that the propos...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999