Reactivity of some tetra substituted furans and thiophenes towards BF3-Et(2)O catalysed Diels-Alder reaction

Some tetra substituted furans and thiophenes were reacted with methyl acrylate under BF3-etherate catalysed Diels-Alder conditions. While the derivatives of furan underwent Diels-Alder reaction in a facile manner, an observation of 2,5-dimethyl-3,4-dianisylthiophene undergoing Diels-Alder reaction with methyl acrylate is remarkable. (C) 1997, Elsevier Science Ltd.

TCP: thread contention predictor for parallel programs

With proliferation of chip multicores (CMPs) on desktops and embedded platforms, multi-threaded programs have become ubiquitous. Existence of multiple threads may cause resource contention, such as, in on-chip shared cache and interconnects, depending upon how they access resources. Hence, we propose a tool - Thread Contention Predictor (TCP) to help quantify the number of threads sharing data and their sharing pattern. We demonstrate its use to predict a more profitable shared, last level on-chip cache (LLC) access policy on CMPs. Our cache configuration predictor is 2.2 times faster compared to the cycle-accurate simulations. We also demonstrate its use for identifying hot data structures in a program which may cause performance degradation due to false data sharing. We fix layout of such data structures and show up-to 10% and 18% improvement in execution time and energy-delay product (EDP), respectively.

A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs

In wireless sensor networks (WSNs) the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting at the same time. Such a situation is known as spatially correlated contention. The random access methods to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration and therefore generating an optimal or sub-optimal schedule is not very useful. On the other hand, if the algorithm takes very large time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. To efficiently handle the spatially correlated contention in WSNs, we present a distributed TDMA slot scheduling algorithm, called DTSS algorithm. The DTSS algorithm is designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph. The algorithm uses randomized TDMA channel access as the mechanism to transmit protocol messages, which bounds the message delay and therefore reduces the time required to get a feasible schedule. The DTSS algorithm supports unicast, multicast and broadcast scheduling, simultaneously without any modification in the protocol. The protocol has been simulated using Castalia simulator to evaluate the run time performance. Simulation results show that our protocol is able to considerably reduce the time required to schedule.

Insertion Reactions of Six-Membered Cyclopalladated N,N `,N `'-Triarylguanidine, Pd{kappa(2)(C,N)-C6H3Me-3(NHC(NHAr)(=NAr))-2)(mu-Br)](2) (Ar=2-MeC6H4) with PhCC C-C(O)OR (R = Me and Et): A Gateway to Second Orthopalladation through Novel Rearrangements

The reaction of Pd{kappa(2)(C,N)-C6H3Me-3-(NHC(NHAr)(=NAr))-2}(mu-Br)](2) (Ar = 2-MeC6H4; 1) with 4 equiv of PhC C-C(O)OMe in CH2Cl2 afforded Pd{kappa(2)(C,N)-C(Ph)=C(C(O)OMe)C(Ph)=C(C(O)-OMe)C6H3Me-3(N=C(NH Ar)(2))-2}Br] (Ar = 2-MeC6H4; 2) in 70% yield, and the aforementioned reaction carried out with 10 equiv of PhC C-C(O)OR (R = Me, and Et) afforded an admixture of two regioisomers of Pd{kappa(3)(N,C,O)-O=C(OR)-C5Ph3(C(O)OR)C(C(O)OR)C6H3Me-3(N=C(NHAr)( 2))- 2}Br] (Ar = 2-MeC6H4; R = Me (3a/3b), Et (4a/4b)) in 80 and 87% yields, respectively. In one attempt, the minor regioisomer, 4b, was isolated from the mixture in 6% yield by fractional crystallization. Palladacycles 3a/3b and 4a/4b, upon stirring in CH2Cl2/MeCN (1/1, v/v) mixture at ambient condition for S days, afforded Pd{eta(3)-allyl,(KN)-N-1)-C-5(C(O)OR)(2)Ph3C-(C(O)OR)C6H3Me-3(N=C(NH Ar)(2))(-2)}Br] (Ar = 2-MeC6H4; R = Me (5a/5b), Et (6a/6b)) in 94 and 93% yields, respectively. Palladacycles 3a/3b and 4a/4b, upon reaction with AgOTf in CH2CH2/Me2C(O) (1/1, v/v) mixture at ambient temperature for 15 min, afforded Pd{kappa(3)(N,C,O)-O=C(OR)C5Ph3(C(O)OR)C(C(O)OR)C6H3Me-3(N=C(NHAr)(2 ))-2}(OTf)] (Ar = 2-MeC6H4; R = Me (7a/7b), Et (8a/8b)) in 79 and 77% yields, respectively. Palladacycles 7a/7b and 8a/ 8b, upon reflux in PhC1 separately for 6 h, or palladacycles 5a/5b and 6a/6b, upon treatment with AgOTf in CH2Cl2/Me2C(O) (7/3, v/v) mixture for 15 min, afforded Pd{(eta(2)-Ph)C5Ph2(C(O)OR)kappa(2)(C,N)-C(C(O)OR)C6H3Me-3(N=C(NHAr) (2))-2}(OTf)] (Ar = 2-MeC6H4; R = Me (9a/9h), Et (10a/10b)) in >= 87% yields. Palladacycles 9a/9b, upon stirring in MeCN in the presence of excess NaOAc followed by crystallization of the reaction mixture in the same solvent, afforded Pd{kappa(3)(N,C,C)-(C6H4)C5Ph2(C(O)OMe)(2)C(C(O)OMe)(2)C6H3Me-3(N=C( NHAr)(2))-2}(NCMe)] (Ar = 2-MeC6H4; 11a/11b) in 82% yield. The new palladacycles were characterized by analytical, IR, and NMR (H-1 and C-13) spectroscopic techniques, and the molecular structures of 2, 3a, 4a, 4b, 5a, 6a, 7a, 9a, 10a, and 11a-d(3) were determined by single crystal X-ray diffraction. The frameworks in the aforementioned palladacycles, except that present in 2, are unprecedented. Plausible pathways for the formation of new palladacycles and the influence of the guanidine unit in 1, substituents in alkynes, reaction conditions, and electrophilicity of the bromide and the triflate upon the frameworks of the insertion products have been discussed.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

RD-TDMA: A Randomized and Distributed TDMA Scheduling for Correlated Contention in WSNs

In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well-known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.