Circular Dichroism is Sensitive to Monovalent Cation Binding in Monensin Complexes

We present a lock-free version of the light-weight userlevel task management library called Wool, in an aim to show that even extremely well tuned, in terms of synchronization,applications can benefit from lock-free programming.Explicit multi-threading is an efficient way to exploit the offered parallelism of multi-core and multi-processor based systems. However, it can sometimes be hard to expressthe inherited parallelism in programs using a limited number of long lived threads. Often it can be more straightforwardto dynamically create a large number of small tasks that in turn automatically execute on the available threads.Wool is a promising and efficient library and framework that allows the programmer to create user tasks in C with a very low overhead. The library automatically executestasks and balances the load evenly on a given number of threads by utilizing work stealing techniques. However, thesynchronization for stealing tasks is based on mutual exclusion which is known to limit parallelism and efficiency. We have designed and implemented a new lock-free algorithmfor synchronization of stealing tasks in Wool. Experiments show similar or significantly improved performance on a setof benchmarks executed on a multi-core platform

A Comparison of some recent Task-based Parallel Programming Models

The need for parallel programming models that are simple to use and at the same time efficient for current ant future parallel platforms has led to recent attention to task-based models such as Cilk++, Intel TBB and the task concept in OpenMP version 3.0. The choice of model and implementation can have a major impact on the final performance and in order to understand some of the trade-offs we have made a quantitative study comparing four implementations of OpenMP (gcc, Intel icc, Sun studio and the research compiler Mercurium/nanos mcc), Cilk++ and Wool, a high-performance task-based library developed at SICS. Abstract. We use microbenchmarks to characterize costs for task-creation and stealing and the Barcelona OpenMP Tasks Suite for characterizing application performance. By far Wool and Cilk++ have the lowest overhead in both spawning and stealing tasks. This is reflected in application performance when many tasks with small granularity are spawned where Cilk++ and, in particular, has the highest performance. For coarse granularity applications, the OpenMP implementations have quite similar performance as the more light-weight Cilk++ and Wool except for one application where mcc is superior thanks to a superior task scheduler. Abstract. The OpenMP implemenations are generally not yet ready for use when the task granularity becomes very small. There is no inherent reason for this, so we expect future implementations of OpenMP to focus on this issue

Dense matrix computations on NUMA architectures with distance-aware work stealing

We employ the dynamic runtime system OmpSs to decrease the overhead of data motion in the now ubiquitous non-uniform memory access (NUMA) high concurrency environment of multicore processors. The dense numerical linear algebra algorithms of Cholesky factorization and symmetric matrix inversion are employed as representative benchmarks. Work stealing occurs within an innovative NUMA-aware scheduling policy to reduce data movement between NUMA nodes. The overall approach achieves separation of concerns by abstracting the complexity of the hardware from the end users so that high productivity can be achieved. Performance results on a large NUMA system outperform the state-of-the-art existing implementations up to a two fold speedup for the Cholesky factorization, as well as the symmetric matrix inversion, while the OmpSs-enabled code maintains strong similarity to its original sequential version.The authors would like to thank the National Institute for Computational Sciences for granting us access on the Nautilus system. The KAUST authors acknowledge support of the Extreme Computing Research Center. The BSC-affiliated authors thankfully acknowledges the support of the European Commission through the HiPEAC-3 Network of Excellence (FP7-ICT 287759), Intel-BSC Exascale Lab and IBM/BSC Exascale Initiative collaboration, Spanish Ministry of Education (FPU), Computación de Altas Prestaciones VI (TIN2012-34557), Generalitat de Catalunya (2014-SGR-1051) and the grant SEV-2011-00067 of the Severo Ochoa Program.Peer ReviewedPostprint (published version

Spartan Daily, February 1, 1935

Volume 23, Issue 75https://scholarworks.sjsu.edu/spartandaily/2254/thumbnail.jp

State College Times, October 27, 1931

Volume 20, Issue 6https://scholarworks.sjsu.edu/spartandaily/12692/thumbnail.jp

The City Summary Courts in the late 18th century: courts for the people?

The City of London had two summary courts in the 18th Century, at Guildhall and Mansion House. In these the Lord Mayor and City aldermen used their wide ranging powers to punish vagrants and thieves, reprimand prostitutes and bullock hunters and settle disputes between brawling drunks and warring neighbours. This talk will explore the nature of these courts, the offences they heard and the people they served, using primary court sources from the City’s archive

Spartan Daily, May 11, 1937

Volume 25, Issue 131https://scholarworks.sjsu.edu/spartandaily/2615/thumbnail.jp

Special Libraries, December 1917

Volume 8, Issue 10https://scholarworks.sjsu.edu/sla_sl_1917/1009/thumbnail.jp