We are pleased to announce that two of our academic staff members, Dr Jonny Foss and Dr Ian Saunders, have been awarded professional fellowships by Advance HE, recognising their commitment to educational excellence.

iGEM is a global synthetic biology competition that involves more than 400 teams worldwide.

The University of Warwick iGEM team 2024 – team BEACON – took part in the iGEM competition, which culminated with the iGEM Jamboree in Paris, at the end of October. We would like to congratulate Aaron Lee (CSE) for their fantastic work on the project within the team including 9 other UG students from various departments, including Life Sciences, Chemistry, Engineering and Mathematics. For their interdisciplinary project, they addressed the need for developing better ways to recycle lanthanides, such as the ones found in electronic devices. They engineered bacteria to scavenge for lanthanide ions and swim towards a point for collection through an engineered chemotactic system. Team BEACON were awarded a Gold medal (grade) at the Jamboree, in recognition of their success during the project.

A paperLink opens in a new window co-authored by Arpan MukhopadhyayLink opens in a new window has received the Best Paper Award at ACM Mobihoc 2024Link opens in a new window. Mobihoc is a premier international conference on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing. The other authors in the paper are Samira Ghanbarian (uWaterloo), Ravi R. Mazumdar (uWaterloo), and Fabrice Guillemin (Orange Labs, France).

The paper addresses the problem of optimally allocating processors to parallelisable tasks having arbitrary concave speed-up functions. In general, determining the optimal number of processors to allocate to each task in an online fashion is a hard problem since allocating too many processors to one job will make those processors unavailable to other jobs whereas allocating too few processors will result in a small speed-up for the job. The paper proposes a simple randomised algorithm for determining the optimal number of processors to allocate to each job without requiring preemption (or repacking). It shows that the proposed algorithm is asymptotically optimal as the number of processors becomes large (which is often the case in modern clouds) and is also robust to variations in the job size distribution. This is the first time such an algorithm has been found in the literature.