Randomized scheduling algorithms for high-aggregate bandwidth switches

The aggregate bandwidth of a switch is its port count multiplied by its operating line rate. We consider switches with high-aggregate bandwidths; for example, a 30-port switch operating at 40 Gb/s or a 1000-port switch operating at 1 Gb/s. Designing high-performance schedulers for such switches with input queues is a challenging problem for the following reasons: (1) high performance requires finding good matchings; (2) good matchings take time to find; and (3) in high-aggregate bandwidth switches there is either too little time (due to high line rates) or there is too much work to do (due to a high port count). We exploit the following features of the switching problem to devise simple-to-implement, high-performance schedulers for high-aggregate bandwidth switches: (1) the state of the switch (carried in the lengths of its queues) changes slowly with time, implying that heavy matchings will likely stay heavy over a period of time and (2) observing arriving packets will convey useful information about the state of the switch. The above features are exploited using hardware parallelism and randomization to yield three scheduling algorithms - APSARA, LAURA, and SERENA. These algorithms are shown to achieve 100% throughput and simulations show that their delay performance is quite close to that of the maximum weight matching, even when the traffic is correlated. We also consider the stability property of these algorithms under generic admissible traffic using the fluid-model technique. The main contribution of this paper is a suite of simple to implement, high-performance scheduling algorithms for input-queued switches. We exploit a novel operation, called MERGE, which combines the edges of two matchings to produce a heavier match, and study of the properties of this operation via simulations and theory. The stability proof of the randomized algorithms we present involves a derandomization procedure and uses methods which may have wider applicability.     

Review Processing, properties and applications of reactive silica from rice husk—an overview

Rice husk is an abundantly available waste material in all rice producing countries. In certain regions, it is sometimes used as a fuel for parboiling paddy in the rice mills. The partially burnt rice husk in turn contributes to more environmental pollution. There have been efforts not only to overcome this but also to find value addition to these wastes using them as secondary source of materials. Rice husk contains nearly 20% silica, which is present in hydrated amorphous form. On thermal treatment, the silica converts to crystobalite, which is a crystalline form of silica. However, under controlled burning conditions, amorphous silica with high reactivity, ultra fine size and large surface area is produced. This micro silica can be a source for preparing advanced materials like SiC, Si₃N₄, elemental Si and Mg₂Si. Due to the high pozzolanic activity, this rice husk silica also finds application in high strength concrete as a substitute for silica fume. Possibility of using this silica as filler in polymers is also studied. The present paper is an attempt to consolidate and critically analyse the research work carried out so far on the processing, properties and application of rice husk silica in various laboratories and also highlighting some results on the processing and characterization of RHA and reactive silica obtained from it in the authors' laboratory.     

An investigation of sugar extraction methods and the use of microwave power for date syrup processing: efficiency and color related considerations.

This study investigates the effect of extraction methods on the color of date syrup and the potential use of microwave power for syrup processing. Sugar solutions were extracted from dates by boiling, soaking and blending. Color and sugar content of the extracted solutions were measured, and the percentage of sugar extracted form the total fruit sugar determined. Boiling was found to be the most efficient method of extraction whereby 74% of total samples sugar was extracted. In contrast, only 54.2% of fruit sugar was extracted by blending and 42% by soaking. In addition, solutions extracted by soaking and blending had a foaming problem in the subsequent concentration process. The extraction method had no effect on the product final color. The extracted solution was concentrated using two heating methods: conventional and microwave heating at a 600 W capacity and a frequency of 2450 MHz applied at three power levels: 10, 7, and 6. In the heating process, 180 minutes were needed to achieve a 77% degrees Brix using convective heating, while it took 81, 138, and 166 minutes of microwave heating at power level 10, 7, and 6, respectively to achieve the same concentration. Water activity of the syrup was measured within a sugar content range of 50 to 80% degrees Brix and the sugar concentration at which the product is shelf stable was determined at 76%.     

Electrical characterization of carbon nanotube Y-junctions: a foundation for new nanoelectronics

A review on the syntheses and electrical characterization of Y-shaped multi-walled carbon nanotube morphologies is presented. Modified thermal CVD processes, using Ti precursors, are used to grow Y-junctions of different geometries and distribution of catalyst particles. It has been established that novel electrical switching behavior is feasible, where any one of the three branches of the Y-junction can be used for modulating the electrical current flow through the other two branches. Current blocking behavior, leading to perfect rectification, is seen which could be related to the interplay of the carrier lifetime and the transit time. The overall goal is to investigate the possibility of obtaining novel functionality at the nanoscale, which can lead to new device paradigms.     

Itemset trees for targeted association querying

Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.     

Presentation and treatment of spontaneous aortocaval fistula

BACKGROUND: Spontaneous rupture of abdominal aortic aneurysm into the inferior vena cava is rare. The clinical presentation is highly variable, and the diagnosis can be difficult, often being made only at operation. The aortocaval fistula results in a large left-to-right shunt, which can cause cardiac failure. Once the diagnosis is made, treatment is by surgical closure of the fistula and repair of the aneurysm with a graft. METHODS: This is a retrospective review of a single surgeon's experience with aortocaval fistula complicating abdominal aortic aneurysms. RESULTS: Over a 15-year period, we had five patients with spontaneous aortocaval fistula who were treated operatively. Preoperative diagnosis was made in two, suspected in one, and not made in two, one of whom died (the only perioperative death in the series). CONCLUSIONS: Spontaneous aortocaval fistulas are uncommon, and their preoperative recognition is difficult. Hematuria in association with an abdominal aortic aneurysm should raise the suspicion of an aortocaval fistula. Surgical correction is possible, with survival rates comparable to those associated with rupture of aneurysms into the retroperitoneum. Early operative control of the fistula is important to optimize the preload to the heart.     

Synchronization models for multimedia presentation with user participation

This paper addresses the key issue of providingflexible multimedia presentation with user participation and suggests synchronization models that can specify the user participation during the presentation. We study models like the Petrinet-based hypertext model and the object composition Petri nets (OCPN). We suggest adynamic timed Petri nets structure that can model pre-emptions and modifications to the temporal characteristics of the net. This structure can be adopted by the OCPN to facilitate modeling of multimedia synchronization characteristics with dynamic user participation. We show that the suggested enhancements for the dynamic timed Petri nets satisfy all the properties of the Petri net theory. We use the suggested enhancements to model typical scenarios in a multimedia presentation with user inputs.