SearcharxivSearch

arXiv subjects

Salil Joshi

Publications and source records attributed to Salil Joshi.

2 recordsLinked to original sources

Quark cores in extensions of the MIT Bag model

Recent observations of massive pulsars having masses of the order of two solar mass pose a new challenge for compact objects such as hybrid stars and neutron stars. Extensions of the bag model and the Nambu-Jona-Lasino model have been used to model these stars to get higher mass stars. Quark matter has been predicted in the cores of these massive stars. In this work we show that an extension of the bag model, with a chemical potential dependent bag parameter can lead to an isentropic phase transition in the core of the neutron star. Our model shows that an EoS having all three quarks $u$, $d$ and $s$ would lead to massive stars with stable quark matter. We find that the mass of the stars not only depends on the bag constant but also on the mass of the strange quark. The mass - radius ratio which determines the redshift values on the surface, indicates that it is possible to obtain stable self bound strange quark matter stars with reasonable values of the bag pressure which correspond to the recent observations of large mass stars.

nucl-th

Compiling a Calculus for Relaxed Memory: Practical constraint-based low-level concurrency

Crary and Sullivan's Relaxed Memory Calculus (RMC) proposed a new declarative approach for writing low-level shared memory concurrent programs in the presence of modern relaxed-memory multi-processor architectures and optimizing compilers. In RMC, the programmer explicitly specifies constraints on the order of execution of operations and on the visibility of memory writes. These constraints are then enforced by the compiler, which has a wide degree of latitude in how to accomplish its goals. We present rmc-compiler, a Clang and LLVM-based compiler for RMC-extended C and C++. In addition to using barriers to enforce ordering, rmc-compiler can take advantage of control and data dependencies, something that is beyond the abilities of current C/C++ compilers. In rmc-compiler, RMC compilation is modeled as an SMT problem with a cost term; the solution with the minimum cost determines the compilation strategy. In testing on ARM and POWER devices, RMC performs quite well, with modest performance improvements relative to C++11 on most of our data structure benchmarks and (on some architectures) dramatic improvements on a read-mostly list test that heavily benefits from use of data dependencies for ordering.

cs.PL