Chess endgame update

This is a review of progress in the Chess Endgame field. It includes news of the promulgation of Endgame Tables, their use, non-use and potential runtime creation. It includes news of data-mining achievements related to 7-man chess and to the field of Chess Studies. It includes news of an algorithm to create Endgame Tables for variants of the normal game of chess.

Unravelling the conundrum of tannins in animal nutrition and health

This paper examines the nutritional and veterinary effects of tannins on ruminants and makes some comparisons with non-ruminants. Tannin chemistry per se is not covered and readers are referred to several excellent reviews instead: (a) Okuda T et al. Heterocycles 30:1195-1218 (1990); (b) Ferreira D and Slade D. Nat Prod Rep 19:517-541 (2002); (c) Yoshida T et al. In Studies in Natural Product Chemistry. Elsevier Science, Amsterdam, pp. 395-453 (2000); (d) Khanbabaee K and van Ree T. Nat Prod Rep 18:641-649 (2001); (e) Okuda et al. Phytochemistvy 55:513-529 (2000). The effects of tannins on rumen micro-organisms are also not reviewed, as these have been addressed by others: (a) McSweeney CS et al. Anim Feed Sci Technol 91:83-93 (2001); (b) Smith AH and Mackie RI. Appl Environ Microbiol 70:1104-1115 (2004). This paper deals first with the nutritional effects of tannins in animal feeds, their qualitative and quantitative diversity, and the implications of tannin-protein complexation. It then summarises the known physiological and harmful effects and discusses the equivocal evidence of the bioavailability of tannins. Issues concerning tannin metabolism and systemic effects are also considered. Opportunities are presented on how to treat feeds with high tannin contents, and some lesser-known but successful feeding strategies are highlighted. Recent research has explored the use of tannins for preventing animal deaths from bloat, for reducing intestinal parasites and for lowering gaseous ammonia and methane emissions. Finally, several tannin assays and a hypothesis are discussed that merit further investigation in order to assess their suitability for predicting animal responses. The aim is to provoke discussion and spur readers into new approaches. An attempt is made to synthesise the emerging information for relating tannin structures with their activities. Although many plants with high levels of tannins produce negative effects and require treatments, others are very useful animal feeds. Our ability to predict whether tannin-containing feeds confer positive or negative effects will depend on interdisciplinary research between animal nutritionists and plant chemists. The elucidation of tannin structure-activity relationships presents exciting opportunities for future feeding strategies that will benefit ruminants and the environment within the contexts of extensive, semi-intensive and some intensive agricultural systems. (c) 2006 Society of Chemical Industry

Unravelling the conundrum of tannins in animal nutrition and health

This paper examines the nutritional and veterinary effects of tannins on ruminants and makes some comparisons with non-ruminants. Tannin chemistry per se is not covered and readers are referred to several excellent reviews instead: (a) Okuda T et al. Heterocycles 30:1195-1218 (1990); (b) Ferreira D and Slade D. Nat Prod Rep 19:517-541 (2002); (c) Yoshida T et al. In Studies in Natural Product Chemistry. Elsevier Science, Amsterdam, pp. 395-453 (2000); (d) Khanbabaee K and van Ree T. Nat Prod Rep 18:641-649 (2001); (e) Okuda et al. Phytochemistvy 55:513-529 (2000). The effects of tannins on rumen micro-organisms are also not reviewed, as these have been addressed by others: (a) McSweeney CS et al. Anim Feed Sci Technol 91:83-93 (2001); (b) Smith AH and Mackie RI. Appl Environ Microbiol 70:1104-1115 (2004). This paper deals first with the nutritional effects of tannins in animal feeds, their qualitative and quantitative diversity, and the implications of tannin-protein complexation. It then summarises the known physiological and harmful effects and discusses the equivocal evidence of the bioavailability of tannins. Issues concerning tannin metabolism and systemic effects are also considered. Opportunities are presented on how to treat feeds with high tannin contents, and some lesser-known but successful feeding strategies are highlighted. Recent research has explored the use of tannins for preventing animal deaths from bloat, for reducing intestinal parasites and for lowering gaseous ammonia and methane emissions. Finally, several tannin assays and a hypothesis are discussed that merit further investigation in order to assess their suitability for predicting animal responses. The aim is to provoke discussion and spur readers into new approaches. An attempt is made to synthesise the emerging information for relating tannin structures with their activities. Although many plants with high levels of tannins produce negative effects and require treatments, others are very useful animal feeds. Our ability to predict whether tannin-containing feeds confer positive or negative effects will depend on interdisciplinary research between animal nutritionists and plant chemists. The elucidation of tannin structure-activity relationships presents exciting opportunities for future feeding strategies that will benefit ruminants and the environment within the contexts of extensive, semi-intensive and some intensive agricultural systems. (c) 2006 Society of Chemical Industry

Slogger: a profiling and analysis system based on semantic web technologies

Increasingly, distributed systems are being used to host all manner of applications. While these platforms provide a relatively cheap and effective means of executing applications, so far there has been little work in developing tools and utilities that can help application developers understand problems with the supporting software, or the executing applications. To fully understand why an application executing on a distributed system is not behaving as would be expected it is important that not only the application, but also the underlying middleware, and the operating system are analysed too, otherwise issues could be missed and certainly overall performance profiling and fault diagnoses would be harder to understand. We believe that one approach to profiling and the analysis of distributed systems and the associated applications is via the plethora of log files generated at runtime. In this paper we report on a system (Slogger), that utilises various emerging Semantic Web technologies to gather the heterogeneous log files generated by the various layers in a distributed system and unify them in common data store. Once unified, the log data can be queried and visualised in order to highlight potential problems or issues that may be occurring in the supporting software or the application itself.

A comparative study of Java and C performance in two large-scale parallel applications

In the 1990s the Message Passing Interface Forum defined MPI bindings for Fortran, C, and C++. With the success of MPI these relatively conservative languages have continued to dominate in the parallel computing community. There are compelling arguments in favour of more modern languages like Java. These include portability, better runtime error checking, modularity, and multi-threading. But these arguments have not converted many HPC programmers, perhaps due to the scarcity of full-scale scientific Java codes, and the lack of evidence for performance competitive with C or Fortran. This paper tries to redress this situation by porting two scientific applications to Java. Both of these applications are parallelized using our thread-safe Java messaging system—MPJ Express. The first application is the Gadget-2 code, which is a massively parallel structure formation code for cosmological simulations. The second application uses the finite-domain time-difference method for simulations in the area of computational electromagnetics. We evaluate and compare the performance of the Java and C versions of these two scientific applications, and demonstrate that the Java codes can achieve performance comparable with legacy applications written in conventional HPC languages. Copyright © 2009 John Wiley & Sons, Ltd.

Multicore-enabling the MPJ express messaging library

With the transition to multicore processors almost complete, the parallel processing community is seeking efficient ways to port legacy message passing applications on shared memory and multicore processors. MPJ Express is our reference implementation of Message Passing Interface (MPI)-like bindings for the Java language. Starting with the current release, the MPJ Express software can be configured in two modes: the multicore and the cluster mode. In the multicore mode, parallel Java applications execute on shared memory or multicore processors. In the cluster mode, Java applications parallelized using MPJ Express can be executed on distributed memory platforms like compute clusters and clouds. The multicore device has been implemented using Java threads in order to satisfy two main design goals of portability and performance. We also discuss the challenges of integrating the multicore device in the MPJ Express software. This turned out to be a challenging task because the parallel application executes in a single JVM in the multicore mode. On the contrary in the cluster mode, the parallel user application executes in multiple JVMs. Due to these inherent architectural differences between the two modes, the MPJ Express runtime is modified to ensure correct semantics of the parallel program. Towards the end, we compare performance of MPJ Express (multicore mode) with other C and Java message passing libraries---including mpiJava, MPJ/Ibis, MPICH2, MPJ Express (cluster mode)---on shared memory and multicore processors. We found out that MPJ Express performs signicantly better in the multicore mode than in the cluster mode. Not only this but the MPJ Express software also performs better in comparison to other Java messaging libraries including mpiJava and MPJ/Ibis when used in the multicore mode on shared memory or multicore processors. We also demonstrate effectiveness of the MPJ Express multicore device in Gadget-2, which is a massively parallel astrophysics N-body siimulation code.

A benchmark-driven modelling approach for evaluating deployment choices on a multi-core architecture

The complexity of current and emerging architectures provides users with options about how best to use the available resources, but makes predicting performance challenging. In this work a benchmark-driven model is developed for a simple shallow water code on a Cray XE6 system, to explore how deployment choices such as domain decomposition and core affinity affect performance. The resource sharing present in modern multi-core architectures adds various levels of heterogeneity to the system. Shared resources often includes cache, memory, network controllers and in some cases floating point units (as in the AMD Bulldozer), which mean that the access time depends on the mapping of application tasks, and the core's location within the system. Heterogeneity further increases with the use of hardware-accelerators such as GPUs and the Intel Xeon Phi, where many specialist cores are attached to general-purpose cores. This trend for shared resources and non-uniform cores is expected to continue into the exascale era. The complexity of these systems means that various runtime scenarios are possible, and it has been found that under-populating nodes, altering the domain decomposition and non-standard task to core mappings can dramatically alter performance. To find this out, however, is often a process of trial and error. To better inform this process, a performance model was developed for a simple regular grid-based kernel code, shallow. The code comprises two distinct types of work, loop-based array updates and nearest-neighbour halo-exchanges. Separate performance models were developed for each part, both based on a similar methodology. Application specific benchmarks were run to measure performance for different problem sizes under different execution scenarios. These results were then fed into a performance model that derives resource usage for a given deployment scenario, with interpolation between results as necessary.

Acceleration and visualization of Dynamic Network Optimization

With the emerging prevalence of smart phones and 4G LTE networks, the demand for faster-better-cheaper mobile services anytime and anywhere is ever growing. The Dynamic Network Optimization (DNO) concept emerged as a solution that optimally and continuously tunes the network settings, in response to varying network conditions and subscriber needs. Yet, the DNO realization is still at infancy, largely hindered by the bottleneck of the lengthy optimization runtime. This paper presents the design and prototype of a novel cloud based parallel solution that further enhances the scalability of our prior work on various parallel solutions that accelerate network optimization algorithms. The solution aims to satisfy the high performance required by DNO, preliminarily on a sub-hourly basis. The paper subsequently visualizes a design and a full cycle of a DNO system. A set of potential solutions to large network and real-time DNO are also proposed. Overall, this work creates a breakthrough towards the realization of DNO.

Distributed parallelization of greedy Mobile Network Optimization algorithms

The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

Asynchronous distributed parallelization of mobile network optimization algorithms

It has been years since the introduction of the Dynamic Network Optimization (DNO) concept, yet the DNO development is still at its infant stage, largely due to a lack of breakthrough in minimizing the lengthy optimization runtime. Our previous work, a distributed parallel solution, has achieved a significant speed gain. To cater for the increased optimization complexity pressed by the uptake of smartphones and tablets, however, this paper examines the potential areas for further improvement and presents a novel asynchronous distributed parallel design that minimizes the inter-process communications. The new approach is implemented and applied to real-life projects whose results demonstrate an augmented acceleration of 7.5 times on a 16-core distributed system compared to 6.1 of our previous solution. Moreover, there is no degradation in the optimization outcome. This is a solid sprint towards the realization of DNO.

Optimised frequency grids for infrared radiative transfer simulations in cloudy conditions

This paper shows that radiometer channel radiances for cloudy atmospheric conditions can be simulated with an optimised frequency grid derived under clear-sky conditions. A new clear-sky optimised grid is derived for AVHRR channel 5 ð12 m m, 833 cm �1 Þ. For HIRS channel 11 ð7:33 m m, 1364 cm �1 Þ and AVHRR channel 5, radiative transfer simulations using an optimised frequency grid are compared with simulations using a reference grid, where the optimised grid has roughly 100–1000 times less frequencies than the full grid. The root mean square error between the optimised and the reference simulation is found to be less than 0.3 K for both comparisons, with the magnitude of the bias less than 0.03 K. The simulations have been carried out with the radiative transfer model Atmospheric Radiative Transfer Simulator (ARTS), version 2, using a backward Monte Carlo module for the treatment of clouds. With this module, the optimised simulations are more than 10 times faster than the reference simulations. Although the number of photons is the same, the smaller number of frequencies reduces the overhead for preparing the optical properties for each frequency. With deterministic scattering solvers, the relative decrease in runtime would be even more. The results allow for new radiative transfer applications, such as the development of new retrievals, because it becomes much quicker to carry out a large number of simulations. The conclusions are applicable to any downlooking infrared radiometer.