An Efficient MPI_Allgather for Grids

Allgather is an important MPI collective communication. Most of the algorithms for allgather have been designed for homogeneous and tightly coupled systems. The existing algorithms for allgather on Gridsystems do not efficiently utilize the bandwidths available on slow wide-area links of the grid. In this paper, we present an algorithm for allgather on grids that efficiently utilizes wide-area bandwidths and is also wide-area optimal. Our algorithm is also adaptive to gridload dynamics since it considers transient network characteristics for dividing the nodes into clusters. Our experiments on a real-grid setup consisting of 3 sites show that our algorithm gives an average performance improvement of 52% over existing strategies.

Perfluoroalkyl bile esters: a new class of efficient gelators of organic and aqueous-organic media

A new class of fluorinated gelators derived from bile acids is reported. Perfluoroalkyl chains were attached to the bile acids through two different ester linkages and were synthesized following simple transformations. The gelation property of these derivatives is a function of the bile acid moiety, the spacer and the fluoroalkyl chain length. By varying these parameters, gels were obtained in aromatic hydrocarbons, DMSO and DMSO/DMF-H(2)O mixtures of different proportions. Several derivatives of deoxycholic and lithocholic acids were found to be efficient organogelators, while the reported bile-acid based organogelators are mostly derived from the cholic acid moiety. The efficient gelators among these compounds formed gels well below 1.0% (w/v) and hence they can be termed as supergelators. The mechanical properties of these gels could be modulated by changing either the bile acid moiety or by varying the length of the fluoroalkyl segment. The presence of CO(2)-philic perfluoroalkyl groups is also expected to enhance their solubility in supercritical CO(2) and hence these compounds are promising candidates for making aerogels.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Efficient synthesis of carbonyl compounds: oxidation of azides and alcohols catalyzed by vanadium pentoxide in water using tert-butylhydroperoxide

Catalytic amount of vanadium reagent with tert-butylhydroperoxide as the oxidant was found to be an excellent oxidizing agent in aqueous medium. Vanadium pentoxide with aq tert-butylhydroperoxide readily oxidizes primary benzylic azides to the corresponding acids and secondary benzylic azides to the corresponding ketones in excellent yields. Further, vanadium pentoxide and aq tert-butylhydroperoxide combination turned out to be an effective catalyst for the oxidation of alcohols. Using vanadium pentoxide and aq tert-butylhydroperoxide primary alcohols were oxidized to the corresponding acids, whereas secondary alcohols underwent a smooth transformation to furnish corresponding ketones in excellent yields. All the oxidations are performed in water. (C) 2011 Elsevier Ltd. All rights reserved.

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.

Efficient Key Management and Distribution for MANET

Ad hoc networks are being used in applications ranging from disaster recovery to distributed collaborative entertainment applications. Ad hoc networks have become one of the most attractive solution for rapid deployment of interconnecting large number of mobile personal devices. The user community of mobile personal devices are demanding a variety of value added multimedia entertainment services. The popularity of peer group is increasing and one or some members of the peer group need to send data to some or all members of the peer group. The increasing demand for group oriented value added services is driving for efficient multicast service over ad hoc networks. Access control mechanisms need to be deployed to provide guarantee that the unauthorized users cannot access the multicast content. In this paper, we present a topology aware key management and distribution scheme for secure overlay multicast over MANET to address node mobility related issues for multicast key management. We use overlay approach for key distribution and our objective is to keep communication overhead low for key management and distribution. We also incorporate reliability using explicit acknowledgments with the key distribution scheme. Through simulations we show that the proposed key management scheme has low communication overhead for rekeying and improves the reliability of key distribution.

Highly efficient dialkylphosphate-mediated syntheses of hydantoins and a bicyclohydantoin under solvent-free conditions

Diversely substituted hydantoins have been synthesized by new strategy from cyanamide based precursor, that is, methyl N-cyano-N-alkyl/arylaminoacetate. Dialkylphosphates were employed as the mild reagent to hydrolyze and cyclize the substrate in one step to give quantitative yields of the desired products. Syntheses of multivalent hydantoins viz bis-hydantoin, bicyclohydantoin have potentially widened the scope and applicability of the present method. Solvent-free conditions and very easy work-up procedure make the reaction convenient and eco-friendly. Single crystal structures of some of the representative compounds are also reported. (C) 2011 Elsevier Ltd. All rights reserved.

Energy-efficient redundant execution for chip multiprocessors

Relentless CMOS scaling coupled with lower design tolerances is making ICs increasingly susceptible to wear-out related permanent faults and transient faults, necessitating on-chip fault tolerance in future chip microprocessors (CMPs). In this paper, we describe a power-efficient architecture for redundant execution on chip multiprocessors (CMPs) which when coupled with our per-core dynamic voltage and frequency scaling (DVFS) algorithm significantly reduces the energy overhead of redundant execution without sacrificing performance. Our evaluation shows that this architecture has a performance overhead of only 0.3% and consumes only 1.48 times the energy of a non-fault-tolerant baseline.

An Area-Efficient Noise-Adaptive Neural Amplifier in 130 nm CMOS Technology

Chronic recording of neural signals is indispensable in designing efficient brain–machine interfaces and to elucidate human neurophysiology. The advent of multichannel micro-electrode arrays has driven the need for electronics to record neural signals from many neurons. The dynamic range of the system can vary over time due to change in electrode–neuron distance and background noise. We propose a neural amplifier in UMC 130 nm, 1P8M complementary metal–oxide–semiconductor (CMOS) technology. It can be biased adaptively from 200 nA to 2 $mu{rm A}$, modulating input referred noise from 9.92 $mu{rm V}$ to 3.9 $mu{rm V}$. We also describe a low noise design technique which minimizes the noise contribution of the load circuitry. Optimum sizing of the input transistors minimizes the accentuation of the input referred noise of the amplifier and obviates the need of large input capacitance. The amplifier achieves a noise efficiency factor of 2.58. The amplifier can pass signal from 5 Hz to 7 kHz and the bandwidth of the amplifier can be tuned for rejecting low field potentials (LFP) and power line interference. The amplifier achieves a mid-band voltage gain of 37 dB. In vitro experiments are performed to validate the applicability of the neural low noise amplifier in neural recording systems.