16,570 research outputs found
Parallel Finger Search Structures
In this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and deletions, and has a finger at each end. This is to our knowledge the first implementation of a parallel search structure that is work-optimal with respect to the finger bound and yet has very good parallelism (within a factor of O(log p)^2) of optimal). We utilize an extended implicit batching framework that transparently facilitates the use of FS by any parallel program P that is modelled by a dynamically generated DAG D where each node is either a unit-time instruction or a call to FS.
The work done by FS is bounded by the finger bound F_L (for some linearization L of D), i.e. each operation on an item with distance r from a finger takes O(log r+1) amortized work. Running P using the simpler version takes O((T_1+F_L)/p + T_infty + d * ((log p)^2 + log n)) time on a greedy scheduler, where T_1, T_infty are the size and span of D respectively, and n is the maximum number of items in FS, and d is the maximum number of calls to FS along any path in D. Using the faster version, this is reduced to O((T_1+F_L)/p + T_infty + d *(log p)^2 + s_L) time, where s_L is the weighted span of D where each call to FS is weighted by its cost according to F_L. FS can be extended to a fixed number of movable fingers.
The data structures in our paper fit into the dynamic multithreading paradigm, and their performance bounds are directly composable with other data structures given in the same paradigm. Also, the results can be translated to practical implementations using work-stealing schedulers
Development and performance evaluation of a prototype electric hybrid powertrain system for automotive applications
Researchers at Universiti Teknologi Malaysia (UTM) have developed a dedicated hybrid power plant based on the parallel configuration using a gasoline engine coupled to a high performance electric motor, specifically targeted for automotive application. The aims are to achieve even lower exhaust emissions, better fuel economy and better performance than the conventional arrangement, demonstrating an alternative solution to the conventional power plant. The engine used is a 1.3 litre spark-ignition, coupled with a 27.5 kW Nexus electric motor. The control strategy developed in conjunction with the program is to use the electric drive motor for initial acceleration and for regeneration braking energy recovery, and for reducing the peak load and transients seen by the engine. A relatively small pack of advanced lead acid batteries is use for energy storage. The design, development and evaluation exercises are fully described giving a comprehensive insight of the prototype and its capabilities
Technical Report: Compressive Temporal Higher Order Cyclostationary Statistics
The application of nonlinear transformations to a cyclostationary signal for
the purpose of revealing hidden periodicities has proven to be useful for
applications requiring signal selectivity and noise tolerance. The fact that
the hidden periodicities, referred to as cyclic moments, are often compressible
in the Fourier domain motivates the use of compressive sensing (CS) as an
efficient acquisition protocol for capturing such signals. In this work, we
consider the class of Temporal Higher Order Cyclostationary Statistics (THOCS)
estimators when CS is used to acquire the cyclostationary signal assuming
compressible cyclic moments in the Fourier domain. We develop a theoretical
framework for estimating THOCS using the low-rate nonuniform sampling protocol
from CS and illustrate the performance of this framework using simulated data
- …