Reliable Synchronization Primitives for Java

Java is an architecture-independent, object-oriented language designed to facilitate code-sharing across the Internet in general, via the Web in particular. Java is multithreaded, providing thread creation and synchronization constructs based on generalized monitors. Although these primitives are appropriate for many windowing applications, they are not necessarily well-suited for the larger class of multithreaded programs that occur as part of distributed systems. We demonstrate how the Java primitives, in conjunction with the object-oriented aspects of the language, can be used to implement a collection of other traditional synchronization paradigms. These paradigms are formally specified, their implementations are rigorously verified, and their use is illustrated with several examples

Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs

Enumerating consistent global states of a computation is a fundamental problem in parallel computing with applications to debug- ging, testing and runtime verification of parallel programs. Breadth-first search (BFS) enumeration is especially useful for these applications as it finds an erroneous consistent global state with the least number of events possible. The total number of executed events in a global state is called its rank. BFS also allows enumeration of all global states of a given rank or within a range of ranks. If a computation on n processes has m events per process on average, then the traditional BFS (Cooper-Marzullo and its variants) requires $\mathcal{O}(\frac{m^{n-1}}{n})$ space in the worst case, whereas ou r algorithm performs the BFS requires $\mathcal{O}(m^2n^2)$ space. Thus, we reduce the space complexity for BFS enumeration of consistent global states exponentially. and give the first polynomial space algorithm for this task. In our experimental evaluation of seven benchmarks, traditional BFS fails in many cases by exhausting the 2 GB heap space allowed to the JVM. In contrast, our implementation uses less than 60 MB memory and is also faster in many cases

Internet Predictions

More than a dozen leading experts give their opinions on where the Internet is headed and where it will be in the next decade in terms of technology, policy, and applications. They cover topics ranging from the Internet of Things to climate change to the digital storage of the future. A summary of the articles is available in the Web extras section

Update statistics in conservative parallel discrete event simulations of asynchronous systems

We model the performance of an ideal closed chain of L processing elements that work in parallel in an asynchronous manner. Their state updates follow a generic conservative algorithm. The conservative update rule determines the growth of a virtual time surface. The physics of this growth is reflected in the utilization (the fraction of working processors) and in the interface width. We show that it is possible to nake an explicit connection between the utilization and the macroscopic structure of the virtual time interface. We exploit this connection to derive the theoretical probability distribution of updates in the system within an approximate model. It follows that the theoretical lower bound for the computational speed-up is s=(L+1)/4 for L>3. Our approach uses simple statistics to count distinct surface configuration classes consistent with the model growth rule. It enables one to compute analytically microscopic properties of an interface, which are unavailable by continuum methods.Comment: 15 pages, 12 figure

Molecular genetics of hereditary prothrombin deficiency in Indian patients: identification of a novel Ala362→Thr (Prothrombin Vellore 1) mutation

Prothrombin deficiency is a rare (1:200 000) autosomal recessive disorder caused by diverse mutations in prothrombin gene. We have studied the molecular basis of this disorder in four unrelated Indian patients. The diagnosis was based on prolonged prothrombin (PT) and activated partial thromboplastin times and low factor II coagulant activity (FII: C) measured using a PT based assay. FII: C levels ranged between 4.7% and 17.5%. Mutations were identified in all the four patients. Five different causative mutations including four (80%) missense and an in-frame deletion (20%) were identified. One of them was a novel, Ala362→Thr aminoacid change affecting 'B' chain of α-thrombin. This mutation was present in a compound heterozygous state with a previously reported Arg-1→Gln missense change affecting pro-peptide cleavage site. Ala362→Thr occurred at a codon, evolutionarily conserved in all the 24 different prothrombins or its related serine proteases studied. Molecular modeling of this mutation was found to cause a conformational change around the region involving a catalytic triad residue His363 and a cysteine residue at codon 364. The FII: C level in this patient was 17.5%. Three other previously reported mutations were also detected in the homozygous state: Arg271→Cys in Kringle-2 region, a Glu309?Lys in 'A' chain of α-thrombin and an in-frame deletion of 3 bp (AAG) leading to Del Lys301/302 in 'A' chain of α-thrombin. This is the first report of the molecular basis of prothrombin deficiency in Indian patients and we suggest the eponym 'Prothrombin Vellore 1' for Ala362→Thr mutation

Synchronization Landscapes in Small-World-Connected Computer Networks

Motivated by a synchronization problem in distributed computing we studied a simple growth model on regular and small-world networks, embedded in one and two-dimensions. We find that the synchronization landscape (corresponding to the progress of the individual processors) exhibits Kardar-Parisi-Zhang-like kinetic roughening on regular networks with short-range communication links. Although the processors, on average, progress at a nonzero rate, their spread (the width of the synchronization landscape) diverges with the number of nodes (desynchronized state) hindering efficient data management. When random communication links are added on top of the one and two-dimensional regular networks (resulting in a small-world network), large fluctuations in the synchronization landscape are suppressed and the width approaches a finite value in the large system-size limit (synchronized state). In the resulting synchronization scheme, the processors make close-to-uniform progress with a nonzero rate without global intervention. We obtain our results by ``simulating the simulations", based on the exact algorithmic rules, supported by coarse-grained arguments.Comment: 20 pages, 22 figure

The combinatorics of resource sharing

We discuss general models of resource-sharing computations, with emphasis on the combinatorial structures and concepts that underlie the various deadlock models that have been proposed, the design of algorithms and deadlock-handling policies, and concurrency issues. These structures are mostly graph-theoretic in nature, or partially ordered sets for the establishment of priorities among processes and acquisition orders on resources. We also discuss graph-coloring concepts as they relate to resource sharing.Comment: R. Correa et alii (eds.), Models for Parallel and Distributed Computation, pp. 27-52. Kluwer Academic Publishers, Dordrecht, The Netherlands, 200

Reverse Remodeling of the Atria After Treatment of Chronic Stretch in Humans Implications for the Atrial Fibrillation Substrate

ObjectivesThe aim of this report was to study the effect of chronic stretch reversal on the electrophysiological characteristics of the atria in humans.BackgroundAtrial stretch is an important determinant for atrial fibrillation. Whether relief of stretch reverses the substrate predisposed to atrial fibrillation is unknown.MethodsTwenty-one patients with mitral stenosis undergoing mitral commissurotomy (MC) were studied before and after intervention. Catheters were placed at multiple sites in the right atrium (RA) and sequentially within the left atrium (LA) to determine: effective refractory period (ERP) at 10 sites (600 and 450 ms) and P-wave duration (PWD). Bi-atrial electroanatomic maps determined conduction velocity (CV) and voltage. In 14 patients, RA studies were repeated ≥6 months after MC.ResultsImmediately after MC, there was significant increase in mitral valve area (2.1 ± 0.2 cm2, p < 0.0001) with decrease in LA (23 ± 7 mm Hg to 10 ± 4 mm Hg, p < 0.0001) and pulmonary arterial pressures (38 ± 16 mm Hg to 27 ± 12 mm Hg, p < 0.0001) and LA volume (75 ± 20 ml to 52 ± 18 ml, p < 0.0001). This was associated with reduction in PWD (139 ± 19 ms to 135 ± 20 ms, p = 0.047), increase in CV (LA: 1.3 ± 0.3 mm/ms to 1.7 ± 0.2 mm/ms, p = 0.006; and RA: 1.0 ± 0.1 mm/ms to 1.3 ± 0.3 mm/ms, p = 0.002) and voltage (LA: 1.7 ± 0.6 mV to 2.5 ± 1.0 mV, p = 0.005; and RA: 1.8 ± 0.6 mV to 2.2 ± 0.7 mV, p = 0.09), and no change in ERP. Late after MC, mitral valve area remained at 2.1 ± 0.3 cm2 (p = 0.7) but with further decrease in PWD (113 ± 19 ms, p = 0.04) and RA ERP (at 600 ms, p < 0.0001), with increase in CV (1.0 ± 0.1 mm/ms to 1.3 ± 0.2 mm/ms, p = 0.006) and voltage (1.8 ± 0.7 mV to 2.8 ± 0.6 mV, p = 0.002).ConclusionsThe atrial electrophysiologic and electroanatomic abnormalities that result from chronic stretch due to MS reverses after MC. These observations suggest that the substrate predisposing to atrial arrhythmias might be reversed

Roughening of the (1+1) interfaces in two-component surface growth with an admixture of random deposition

We simulate competitive two-component growth on a one dimensional substrate of $L$ sites. One component is a Poisson-type deposition that generates Kardar-Parisi-Zhang (KPZ) correlations. The other is random deposition (RD). We derive the universal scaling function of the interface width for this model and show that the RD admixture acts as a dilatation mechanism to the fundamental time and height scales, but leaves the KPZ correlations intact. This observation is generalized to other growth models. It is shown that the flat-substrate initial condition is responsible for the existence of an early non-scaling phase in the interface evolution. The length of this initial phase is a non-universal parameter, but its presence is universal. In application to parallel and distributed computations, the important consequence of the derived scaling is the existence of the upper bound for the desynchronization in a conservative update algorithm for parallel discrete-event simulations. It is shown that such algorithms are generally scalable in a ring communication topology.Comment: 16 pages, 16 figures, 77 reference