An optimal boundary fair scheduling

Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.

Bioelectrochemically-assisted reductive dechlorination of 1,2-dichloroethane by a Dehalococcoides-enriched microbial culture

The aim of this study was to verify the possibility to use a polarized graphite electrode as an electron donor for the reductive dechlorination of 1,2-dichloroethane, an ubiquitous groundwater contaminant. The rate of 1,2-DCA dechlorination almost linearly increased by decreasing the set cathode potential over a broad range of set cathode potentials (i.e., from −300 mV to −900 mV vs. the standard hydrogen electrode). This process was primarily dependent on electrolytic H2 generation. On the other hand, reductive dechlorination proceeded (although quite slowly) with a very high Coulombic efficiency (near 70%) at a set cathode potential of −300 mV, where no H2 production occurred. Under this condition, reductive dechlorination was likely driven by direct electron uptake from the surface of the polarized electrode. Taken as a whole, this study further extends the range of chlorinated contaminants which can be treated with bioelectrochemical systems.