A Memory Contention Responsive Hash Join Algorithm Design and Implementation on Apache AsterixDB

Efficient data management is crucial in complex computer systems, and Database Management Systems (DBMS) are indispensable for handling and processing large datasets. In DBMSs that concurrently execute multiple queries, adapting to varying workloads is desirable. Yet, predicting the fluctuating quantity and size of queries in such environments proves challenging. Over-allocating resources to a single query can impede the execution of future queries while under-allocating resources to a query expecting increased workload can lead to significant processing delays. Moreover, join operations place substantial demands on memory. This resource’s availability fluctuates as queries enter and exit the DBMS. The development of join operators capable of dynamically adapting to memory fluctuations is a complex undertaking, with few recent authors proposing memory-adaptive algorithms. This scarcity of proposals suggests the inherent difficulty in designing, implementing, and analyzing such algorithms. This thesis proposes a new memory adaptive Hash-Based join algorithm extended from designs presented by prior authors. This algorithm is implemented and experimented with in a real DBMS environment to evaluate its memory fluctuation responsiveness. A mathematical model for the increase in I/O caused by it is proposed and compared with actual results. The impacts of memory variation and frequence of memory updates reveal the importance of this thesis for further development of memory adaptive algorithms

GPERF : a perfect hash function generator

gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element lookup table and a pair of functions, phash and in_word_set. phash uniquely maps keywords in keyfile onto the range 0 .. k - 1, where k >/= n. If k = n, then phash is considered a minimal perfect hash function. in_word_set uses phash to determine whether a particular string of characters str occurs in the keyfile, using at most one string comparison.This paper describes the user-interface, options, features, algorithm design and implementation strategies incorporated in gperf. It also presents the results from an empirical comparison between gperf-generated recognizers and other popular techniques for reserved word lookup

Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms

We introduce a new programming language for expressing reversibility, Energy-Efficient Language (Eel), geared toward algorithm design and implementation. Eel is the first language to take advantage of a partially reversible computation model, where programs can be composed of both reversible and irreversible operations. In this model, irreversible operations cost energy for every bit of information created or destroyed. To handle programs of varying degrees of reversibility, Eel supports a log stack to automatically trade energy costs for space costs, and introduces many powerful control logic operators including protected conditional, general conditional, protected loops, and general loops. In this paper, we present the design and compiler for the three language levels of Eel along with an interpreter to simulate and annotate incurred energy costs of a program.Comment: 17 pages, 0 additional figures, pre-print to be published in The 8th Conference on Reversible Computing (RC2016

Disturbance Suppression in PMSM Drives Physical Investigation, Algorithm Design and Implementation

The work of this Ph.D. focuses on the investigation of advanced control algorithms for the control of constant and periodic disturbances in Permanent Magnet Synchronous Machines (PMSMs), with the discussion of different methods for improving their negative influence on the machine current and the torque produced at the shaft. The discussion of the disturbances from a control perspective starts with the study of the parameter uncertainties effect on the dynamical performances of the current control and after the detailed analysis in the frequency domain, simple methods for improving the state-of-art decoupling network are given and validated on the testbench. Thanks to the feature of the introduced estimator, the transient behavior of the proposed strategy results in a consistent fast and precise performance. The control scheme allows to avoid the implementation of anti-windup mechanisms in the current control, making the overall controller less sensitive to parameter mismatch. Further, due to the low computational burden, the algorithm is suitable for low cost hardware. Subsequently, the more complex issue of periodic disturbances has been deeply investigated. The theoretical model proposed is validated by comparing the real measured torque with an estimation based on the recovered disturbance affecting the observed voltages and currents. The results are clearly acceptable and further, the experimental validation stresses out the fact that few terms have a predominant role in producing the harmonic disturbances, compared to the others. This consideration lets develop two strategies for suppressing the different harmonic orders present in the machine torque at low-speed operation. One strategy relies on on-line adaptive policies, where the estimated information is passed through a sequence of optimization algorithms with different objectives. In this context, hints on the guaranteed stability are also provided in order to confirm the practical feasibility of the algorithm. The other strategy is based on the off-line generation of some pre-determined functions, limiting the on-line burden to the computation of look-up tables. Both methods brought satisfactory results during the experimental validation, confirming the validity of our approximations made on the original complex model. Although the hardware testbed setup limited the opportunity to validate the methodologies at low speed, this represents a realistic scenario, in fact at higher speed the artificial injection of harmonics within the machine current becomes challenging due to the high electrical rotational speed and it brings more negative effects, in terms of losses and audible noise than benefits on the shaft stress, in fact, the machine inertia acts as a natural filter for the high frequencies harmonics. In summary, it can be said that the research work on advanced control algorithms for the disturbance suppression in PMSM drives has produced affordable and reliable methodologies, which can be of practical implementation for various industrial drives

Image processing algorithm design and implementation for real-time autonomous inspection of mixed waste

The ARIES {number_sign}1 (Autonomous Robotic Inspection Experimental System) vision system is used to acquire drum surface images under controlled conditions and subsequently perform autonomous visual inspection leading to a classification as `acceptable` or `suspect`. Specific topics described include vision system design methodology, algorithmic structure,hardware processing structure, and image acquisition hardware. Most of these capabilities were demonstrated at the ARIES Phase II Demo held on Nov. 30, 1995. Finally, Phase III efforts are briefly addressed

Genus Computing for 3D digital objects: algorithm and implementation

This paper deals with computing topological invariants such as connected components, boundary surface genus, and homology groups. For each input data set, we have designed or implemented algorithms to calculate connected components, boundary surfaces and their genus, and homology groups. Due to the fact that genus calculation dominates the entire task for 3D object in 3D space, in this paper, we mainly discuss the calculation of the genus. The new algorithms designed in this paper will perform: (1) pathological cases detection and deletion, (2) raster space to point space (dual space) transformation, (3) the linear time algorithm for boundary point classification, and (4) genus calculation.Comment: 12 pages 7 figures. In Proceedings of the Workshop on Computational Topology in image context 2009, Aug. 26-28, Austria, Edited by W. Kropatsch, H. M. Abril and A. Ion, 200