Communication Steps for Parallel Query Processing

We consider the problem of computing a relational query $q$ on a large input database of size $n$, using a large number $p$ of servers. The computation is performed in rounds, and each server can receive only $O(n/p^{1-\varepsilon})$ bits of data, where $\varepsilon \in [0,1]$ is a parameter that controls replication. We examine how many global communication steps are needed to compute $q$. We establish both lower and upper bounds, in two settings. For a single round of communication, we give lower bounds in the strongest possible model, where arbitrary bits may be exchanged; we show that any algorithm requires $\varepsilon \geq 1-1/\tau^*$, where $\tau^*$ is the fractional vertex cover of the hypergraph of $q$. We also give an algorithm that matches the lower bound for a specific class of databases. For multiple rounds of communication, we present lower bounds in a model where routing decisions for a tuple are tuple-based. We show that for the class of tree-like queries there exists a tradeoff between the number of rounds and the space exponent $\varepsilon$. The lower bounds for multiple rounds are the first of their kind. Our results also imply that transitive closure cannot be computed in O(1) rounds of communication

Data analysis techniques: Spectral processing

The individual steps in the data processing scheme applied to most radars used for wind sounding are analyzed. This processing method uses spectral analysis and assumes a pulse Doppler radar. Improvement in the signal to noise ratio of some radars is discussed

An automated workflow for parallel processing of large multiview SPIM recordings

Multiview light sheet fluorescence microscopy (LSFM) allows to image developing organisms in 3D at unprecedented temporal resolution over long periods of time. The resulting massive amounts of raw image data requires extensive processing interactively via dedicated graphical user interface (GUI) applications. The consecutive processing steps can be easily automated and the individual time points can be processed independently, which lends itself to trivial parallelization on a high performance cluster (HPC). Here we introduce an automated workflow for processing large multiview, multi-channel, multi-illumination time-lapse LSFM data on a single workstation or in parallel on a HPC. The pipeline relies on snakemake to resolve dependencies among consecutive processing steps and can be easily adapted to any cluster environment for processing LSFM data in a fraction of the time required to collect it.Comment: 13 pages with supplement, LATEX; 1 table, 1 figure, 2 supplementary figures, 2 supplementary lists, 2 supplementary tables; corrected error in results table, results unchange

Can bio-inspired information processing steps be realized as synthetic biochemical processes?

We consider possible designs and experimental realiza-tions in synthesized rather than naturally occurring bio-chemical systems of a selection of basic bio-inspired information processing steps. These include feed-forward loops, which have been identified as the most common information processing motifs in many natural pathways in cellular functioning, and memory-involving processes, specifically, associative memory. Such systems should not be designed to literally mimic nature. Rather, we can be guided by nature's mechanisms for experimenting with new information/signal processing steps which are based on coupled biochemical reactions, but are vastly simpler than natural processes, and which will provide tools for the long-term goal of understanding and harnessing nature's information processing paradigm. Our biochemical processes of choice are enzymatic cascades because of their compatibility with physiological processes in vivo and with electronics (e.g., electrodes) in vitro allowing for networking and interfacing of enzyme-catalyzed processes with other chemical and biochemical reactions. In addition to designing and realizing feed-forward loops and other processes, one has to develop approaches to probe their response to external control of the time-dependence of the input(s), by measuring the resulting time-dependence of the output. The goal will be to demonstrate the expected features, for example, the delayed response and stabilizing effect of the feed-forward loops

Reversible implementation of a disrete linear transformation

Discrete linear transformations form important steps in processing information. Many such transformations are injective and therefore are prime candidates for a physically reversible implementation into hardware. We present here the first steps towards a reversible digital implementation of two different integer transformations on four inputs: The Haar wavelet and the H.264 transform

Signal processing at the Poker Flat MST radar

Signal processing for Mesosphere-Stratosphere-Troposphere (MST) radar is carried out by a combination of hardware in high-speed, special-purpose devices and software in a general-purpose, minicomputer/array processor. A block diagram of the signal processing system is presented, and the steps in the processing pathway are described. The current processing capabilities are given, and a system offering greater coherent integration speed is advanced which hinges upon a high speed preprocessor

Multi-Step Processing of Spatial Joins

Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended spatial objects in twodimensional data space. We present an approach for spatial join processing that is based on three steps. First, a spatial join is performed on the minimum bounding rectangles of the objects returning a set of candidates. Various approaches for accelerating this step of join processing have been examined at the last year’s conference [BKS 93a]. In this paper, we focus on the problem how to compute the answers from the set of candidates which is handled by the following two steps. First of all, sophisticated approximations are used to identify answers as well as to filter out false hits from the set of candidates. For this purpose, we investigate various types of conservative and progressive approximations. In the last step, the exact geometry of the remaining candidates has to be tested against the join predicate. The time required for computing spatial join predicates can essentially be reduced when objects are adequately organized in main memory. In our approach, objects are first decomposed into simple components which are exclusively organized by a main-memory resident spatial data structure. Overall, we present a complete approach of spatial join processing on complex spatial objects. The performance of the individual steps of our approach is evaluated with data sets from real cartographic applications. The results show that our approach reduces the total execution time of the spatial join by factors

Sequence-based Anytime Control

We present two related anytime algorithms for control of nonlinear systems when the processing resources available are time-varying. The basic idea is to calculate tentative control input sequences for as many time steps into the future as allowed by the available processing resources at every time step. This serves to compensate for the time steps when the processor is not available to perform any control calculations. Using a stochastic Lyapunov function based approach, we analyze the stability of the resulting closed loop system for the cases when the processor availability can be modeled as an independent and identically distributed sequence and via an underlying Markov chain. Numerical simulations indicate that the increase in performance due to the proposed algorithms can be significant.Comment: 14 page