A new equilibrium torus solution and GRMHD initial conditions

General relativistic magnetohydrodynamic (GRMHD) simulations are providing influential models for black hole spin measurements, gamma ray bursts, and supermassive black hole feedback. Many of these simulations use the same initial condition: a rotating torus of fluid in hydrostatic equilibrium. A persistent concern is that simulation results sometimes depend on arbitrary features of the initial torus. For example, the Bernoulli parameter (which is related to outflows), appears to be controlled by the Bernoulli parameter of the initial torus. In this paper, we give a new equilibrium torus solution and describe two applications for the future. First, it can be used as a more physical initial condition for GRMHD simulations than earlier torus solutions. Second, it can be used in conjunction with earlier torus solutions to isolate the simulation results that depend on initial conditions. We assume axisymmetry, an ideal gas equation of state, constant entropy, and ignore self-gravity. We fix an angular momentum distribution and solve the relativistic Euler equations in the Kerr metric. The Bernoulli parameter, rotation rate, and geometrical thickness of the torus can be adjusted independently. Our torus tends to be more bound and have a larger radial extent than earlier torus solutions. While this paper was in preparation, several GRMHD simulations appeared based on our equilibrium torus. We believe it will continue to provide a more realistic starting point for future simulations.Comment: 8 pages, 4 figures, A&A accepte

Model checking time-constrained scenario-based specifications

We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with timing constraints. Our system model is a network of communicating finite state machines with local clocks, whose global behaviour can be regarded as a timed automaton. Our goal is to verify that all timed behaviours exhibited by the system conform to the timing constraints imposed by the specification. In general, this corresponds to checking inclusion for timed languages, which is an undecidable problem even for timed regular languages. However, we show that we can translate regular collections of time-constrained MSCs into a special class of event-clock automata that can be determinized and complemented, thus permitting an algorithmic solution to the model checking problem

GRMHD simulations of magnetized advection-dominated accretion on a non-spinning black hole: role of outflows

We present results from two long-duration GRMHD simulations of advection-dominated accretion around a non-spinning black hole. The first simulation was designed to avoid significant accumulation of magnetic flux around the black hole. This simulation was run for a time of 200,000GM/c^3 and achieved inflow equilibrium out to a radius \sim90GM/c^2. Even at this relatively large radius, the mass outflow rate \dot{M}_{out} is found to be only 60% of the net mass inflow rate \dot{M}_{BH} into the black hole. The second simulation was designed to achieve substantial magnetic flux accumulation around the black hole in a magnetically arrested disc. This simulation was run for a shorter time of 100,000GM/c^3. Nevertheless, because the mean radial velocity was several times larger than in the first simulation, it reached inflow equilibrium out to a radius \sim170GM/c^2. Here, \dot{M}_{out} becomes equal to \dot{M}_{BH} at r\sim 160GM/c^2. Since the mass outflow rates in the two simulations do not show robust convergence with time, it is likely that the true outflow rates are lower than our estimates. The effect of black hole spin on mass outflow remains to be explored. Neither simulation shows strong evidence for convection, though a complete analysis including the effect of magnetic fields is left for the future.Astronom

Bringing Reconfigurability to the Network Stack

Reconfiguring the network stack allows applications to specialize the implementations of communication libraries depending on where they run, the requests they serve, and the performance they need to provide. Specializing applications in this way is challenging because developers need to choose the libraries they use when writing a program and cannot easily change them at runtime. This paper introduces Bertha, which allows these choices to be changed at runtime without limiting developer flexibility in the choice of network and communication functions. Bertha allows applications to safely use optimized communication primitives (including ones with deployment limitations) without limiting deployability. Our evaluation shows cases where this results in 16x higher throughput and 63% lower latency than current portable approaches while imposing minimal overheads when compared to a hand-optimized versions that use deployment-specific communication primitives.Comment: 12 pages, 10 figure

SEAPoT-RL: Selective exploration algorithm for policy transfer in RL

National Research Foundation (NRF) Singapore under SMART and Future Mobility; Ministry of Education, Singapore under its Academic Research Funding Tier

An efficient approach to model-based hierarchical reinforcement learning

National Research Foundation (NRF) Singapore under SMART and Future Mobility; Ministry of Education, Singapore under its Academic Research Funding Tier