An Impact Of Various Shroud Bleed Slot Configurations And Cavity Vanes On Compressor Map Width And The Inducer Flow Field

This paper describes an investigation of map width enhancement and a detailed analysis of the inducer flow field due to various bleed slot configurations and vanes in the annular cavity of a turbocharger centrifugal compressor. The compressor under investigation is used in a turbocharger application for a heavy duty diesel engine of approximately 400 hp. This investigation has been undertaken using a computational fluid dynamics (CFD) model of the full compressor stage, which includes a manual multiblock-structured grid generation method. The influence of the bleed slot flow on the inducer flow field at a range of operating conditions has been analyzed, highlighting the improvement in surge and choked flow capability. The impact of the bleed slot geometry variations and the inclusion of cavity vanes on the inlet incidence angle have been studied in detail by considering the swirl component introduced at the leading edge by the recirculating flow through the slot. Further, the overall stage efficiency and the nonuniform flow field at the inducer inlet have been also analyzed. The analysis revealed that increasing the slot width has increased the map width by about 17%. However, it has a small impact on the efficiency, due to the frictional and mixing losses. Moreover, adding vanes in the cavity improved the pressure ratio and compressor performance noticeably. A detail analysis of the compressor with cavity vanes has also been presented.

Double split ring slot FSS reflectarray for difference pattern generation

A report is presented on a split ring slot frequency selective surface (FSS) reflector whose element design and distribution allows generation of far-field difference patterns. The reflector operates by converting linearly polarised plane wave fronts into two orthogonal polarisations each with a deep null in the centre of the radiation pattern. The far-field measurement presented is in good agreement with the simulation and demonstrates a null depth of ?20dB in the centre of the radiation pattern.

A double U-slot patch antenna with dual wideband characteristics

Microstrip patch antennas are strong candidates for use in many wireless communications applications. This paper proposes the use of a patch antenna with two U-shaped slots to achieve dual band operation. A thick substrate helps broaden the individual bandwidths. The antenna is designed based on extensive IE3D simulation studies. A prototype antenna is fabricated and experimentally verified for the required performance.

An Investigation of Compressor Map Width Enhancement and the Inducer Flow Field Using Various Configurations of Shroud Bleed Slot

This paper describes an investigation of various shroud bleed slot configurations of a centrifugal compressor using CFD with a manual multi-block structured grid generation method. The compressor under investigation is used in a turbocharger application for a heavy duty diesel engine of approximately 400hp. The baseline numerical model has been developed and validated against experimental performance measurements. The influence of the bleed slot flow field on a range of operating conditions between surge and choke has been analysed in detail. The impact of the returning bleed flow on the incidence at the impeller blade leading edge due to its mixing with the main through-flow has also been studied. From the baseline geometry, a number of modifications to the bleed slot width have been proposed, and a detailed comparison of the flow characteristics performed. The impact of slot variations on the inlet incidence angle has been investigated, highlighting the improvement in surge and choked flow capability. Along with this, the influence of the bleed slot on stabilizing the blade passage flow by the suction of the tip and over-tip vortex flow by the slot has been considered near surge.

SIW slot antenna for E-band communications

The paper proposes novel substrate integrated waveguide (SIW) slot antenna for E-band communications. The antenna is designed at a two-layer low temperature co-fired ceramic (LTCC) substrate in 71-76 GHz frequency band. The proposed antenna demonstrates a gain better than 11.3 dBi and efficiency of 85% and can be used as a standalone antenna or as an element of a larger array.

Slot width augmentation in a slotted-wall transonic linear cascade wind tunnel

Transonic tests in linear cascade wind tunnels can suffer
from significant test section boundary interference effects in pitch. A slotted tailboard has been designed and optimised with an in-house Euler numerical method to reduce such ef- fects. Wind tunnel measurements on an overspeed Mach 1.27 discharge from a Rolls-Royce T2 cascade, featuring strong end-wall shock-induced interference, showed a 77% reduction in the flow pitchwise periodicity error with the optimised tail- board, with respect to the baseline open-jet cascade flow. Two-dimensional Euler predictions were also cross-validated against a three-dimensional Reynolds averaged computation, to explore the three-dimensionality of the discharge

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Analyzing TDMA with slot skipping

Distributed real-time systems, such as factory automation systems, require that computer nodes communicate with a known and low bound on the communication delay. This can be achieved with traditional time division multiple access (TDMA). But improved flexibility and simpler upgrades are possible through the use of TDMA with slot-skipping (TDMA/SS), meaning that a slot is skipped whenever it is not used and consequently the slot after the skipped slot starts earlier. We propose a schedulability analysis for TDMA/SS. We assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to deadline monotonic. Firstly, we present a non-exact (but fast) analysis and then, at the cost of computation time, we also present an algorithm that computes exact queuing times.