On-the-fly memory compression for multibody algorithms.

Memory and bandwidth demands challenge developers of particle-based codes that have to scale on new architectures, as the growth of concurrency outperforms improvements in memory access facilities, as the memory per core tends to stagnate, and as communication networks cannot increase bandwidth arbitrary. We propose to analyse each particle of such a code to find out whether a hierarchical data representation storing data with reduced precision caps the memory demands without exceeding given error bounds. For admissible candidates, we perform this compression and thus reduce the pressure on the memory subsystem, lower the total memory footprint and reduce the data to be exchanged via MPI. Notably, our analysis and transformation changes the data compression dynamically, i.e. the choice of data format follows the solution characteristics, and it does not require us to alter the core simulation code

On-the-fly memory compression for multibody algorithms

Memory and bandwidth demands challenge developers of particle-based codes that have to scale on new architectures, as the growth of concurrency outperforms improvements in memory access facilities, as the memory per core tends to stagnate, and as communication networks cannot increase bandwidth arbitrary. We propose to analyse each particle of such a code to find out whether a hierarchical data representation storing data with reduced precision caps the memory demands without exceeding given error bounds. For admissible candidates, we perform this compression and thus reduce the pressure on the memory subsystem, lower the total memory footprint and reduce the data to be exchanged via MPI. Notably, our analysis and transformation changes the data compression dynamically, i.e. the choice of data format follows the solution characteristics, and it does not require us to alter the core simulation code

School-based prevention for adolescent Internet addiction: prevention is the key. A systematic literature review

Adolescents’ media use represents a normative need for information, communication, recreation and functionality, yet problematic Internet use has increased. Given the arguably alarming prevalence rates worldwide and the increasingly problematic use of gaming and social media, the need for an integration of prevention efforts appears to be timely. The aim of this systematic literature review is (i) to identify school-based prevention programmes or protocols for Internet Addiction targeting adolescents within the school context and to examine the programmes’ effectiveness, and (ii) to highlight strengths, limitations, and best practices to inform the design of new initiatives, by capitalizing on these studies’ recommendations. The findings of the reviewed studies to date presented mixed outcomes and are in need of further empirical evidence. The current review identified the following needs to be addressed in future designs to: (i) define the clinical status of Internet Addiction more precisely, (ii) use more current psychometrically robust assessment tools for the measurement of effectiveness (based on the most recent empirical developments), (iii) reconsider the main outcome of Internet time reduction as it appears to be problematic, (iv) build methodologically sound evidence-based prevention programmes, (v) focus on skill enhancement and the use of protective and harm-reducing factors, and (vi) include IA as one of the risk behaviours in multi-risk behaviour interventions. These appear to be crucial factors in addressing future research designs and the formulation of new prevention initiatives. Validated findings could then inform promising strategies for IA and gaming prevention in public policy and education

Active Resource Management for Multi-Core Runtime Systems Serving Malleable Applications

Malleable applications are programs that may run with varying numbers of threads and thus on varying numbers of cores because the exact number of threads/cores used is irrelevant for the program logic and typically determined at program startup. We argue that any fixed choice of kernel threads is suboptimal for both performance and energy consumption. Firstly, an application may temporarily expose less concurrency than the underlying hardware offers, leading to waste of energy. Secondly, the number of hardware cores effectively available to an application may dynamically change in multi-application and/or multi-user environments. This leads to an over-subscription of the available hardware by individual applications, costly time scheduling by the operating system and, as a consequence, to both waste of energy and loss of performance. We propose an active resource management service that continuously mediates betwen dynamically changing intra-application requirements as well as on dynamically changing system load characteristics in a near-optimal way