Chapel Programming LanguageChapelCon '25 is open for submissions! Working on something cool with Chapel? We are accepting contributions in a variety of formats: presentations, demos, posters, or extended abstracts. Submit today: https://easychair.org/conferences/?conf=chapelcon25
In this month's edition of "10 Myths of Scalable Parallel Programming Languages", Brad focuses on the question of the adoptability of new parallel languages and the extent to which extending an existing language might help vs. not.
Find it at: https://chapel-lang.org/blog/posts/10myths-part3/
Looking to share your work using Chapel? Look no further. The ChapelCon '25 Call for Papers is live! Submissions open June 27th and close July 25th. We're excited to see what you've been working on! http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=188767
This month's 2.5 release introduced Chapel editions, inspired by Rust. This allows the language to continue to evolve by introducing breaking changes, without requiring users to update their code for such changes immediately.
For details, see: https://chapel-lang.org/blog/posts/announcing-chapel-2.5/#chapel-editions
Chapel 2.5 adds a fast new distributed sort implementation to the standard library! It out-scales other distributed Chapel sorts. To use it, pass a Block-distributed array to the standard sort() procedure.
See the Chapel 2.5 release notes for more information:
https://chapel-lang.org/blog/posts/announcing-chapel-2.5/#distributed-sorting
HPE Discover has started! If you are attending and interested in learning more about Chapel and Arkouda, visit our demo station in the Showcase!
Can one programming language be used to program multicore processors, GPU-packed supercomputers, and everything in between? Chapel can! Engin Kayraklioglu will give a public talk about Chapel's portability at Los Alamos National Laboratory on June 18th at 10AM PT!
mppfI made the new scalable sort routine for the Chapel standard library! Now it's possible to easily sort a distributed array just by calling the standard library 'sort'. It even outperforms the best distributed Chapel sort to date, and it performs competitively with the KaDiS AMS sort written in MPI. There are more details in the release announcement linked below.
https://mastodon.social/@chapelprogramminglanguage/114676137038270218
Chapel 2.5 is being released today! Highlights include a new scalable sort routine, an editions feature for experimental breaking changes, a new aliasing reshape() for arrays, initial support for VSCode debugging, dynamically loaded libraries, and more!
It’s been a while since our last live demo on GPU programming with Chapel—join us Thursday, June 12th at 10 AM Pacific Time (US) for a fresh look! We will discuss how Chapel’s first-class parallelism and locality support makes it a breeze to program multi-GPU, multilocale systems!
