An Innovative Approach to Achieve Compositionality Efficiently using Multi-Version Object Based Transactional Systems

In the modern era of multicore processors, utilizing cores is a tedious job. Synchronization and communication among processors involve high cost. Software transaction memory systems (STMs) addresses this issues and provide better concurrency in which programmer need not have to worry about consistency issues. Another advantage of STMs is that they facilitate compositionality of concurrent programs with great ease. Different concurrent operations that need to be composed to form a single atomic unit is achieved by encapsulating them in a single transaction. In this paper, we introduce a new STM system as multi-version object based STM (MVOSTM) which is the combination of both of these ideas for harnessing greater concurrency in STMs. As the name suggests MVOSTM, works on a higher level and maintains multiple versions corresponding to each key. We have developed MVOSTM with the unlimited number of versions corresponding to each key. In addition to that, we have developed garbage collection for MVOSTM (MVOSTM-GC) to delete unwanted versions corresponding to the keys to reduce traversal overhead. MVOSTM provides greater concurrency while reducing the number of aborts and it ensures compositionality by making the transactions atomic. Here, we have used MVOSTM for the list and hash-table data structure as list-MVOSTM and HT- MVOSTM. Experimental results of list-MVOSTM outperform almost two to twenty fold speedup than existing state-of-the-art list based STMs (Trans-list, Boosting-list, NOrec-list, list-MVTO, and list-OSTM). HT-MVOSTM shows a significant performance gain of almost two to nineteen times better than existing state-of-the-art hash-table based STMs (ESTM, RWSTMs, HT-MVTO, and HT-OSTM). MVOSTM with list and hash-table shows the least number of aborts among all the existing STM algorithms. MVOSTM satisfies correctness-criteria as opacity.Comment: 35 pages, 23 figure

Generalized dimensions of Feigenbaum's attractor from renormalization-group functional equations

A method is suggested for the computation of the generalized dimensions of fractal attractors at the period-doubling transition to chaos. The approach is based on an eigenvalue problem formulated in terms of functional equations, with a coefficient expressed in terms of Feigenbaum's universal fixed-point function. The accuracy of the results is determined only by precision of the representation of the universal function.Comment: 6 pages, 2 table

The effect of noise on the dynamics of a complex map at the period-tripling accumulation point

As shown recently (O.B.Isaeva et al., Phys.Rev E64, 055201), the phenomena intrinsic to dynamics of complex analytic maps under appropriate conditions may occur in physical systems. We study scaling regularities associated with the effect of additive noise upon the period-tripling bifurcation cascade generalizing the renormalization group approach of Crutchfield et al. (Phys.Rev.Lett., 46, 933) and Shraiman et al. (Phys.Rev.Lett., 46, 935), originally developed for the period doubling transition to chaos in the presence of noise. The universal constant determining the rescaling rule for the intensity of the noise in period-tripling is found to be $\gamma=12.2066409...$ Numerical evidence of the expected scaling is demonstrated.Comment: 9 pages, 4 figure

Features of pulsed synchronization of a systems with a tree-dimensional phase space

Features of synchronization picture in the system with the limit cycle embedded in a three-dimensional phase space are considered. By the example of Ressler system and Dmitriev - Kislov generator under the action of a periodic sequence of delta - function it is shown, that synchronization picture significantly depends on the direction of pulse action. Features of synchronization tons appeared in these models are observed.Comment: 16 pages, 11 figure