chapel
advent-of-code
chapel | advent-of-code | |
---|---|---|
26 | 25 | |
1,741 | 5 | |
1.0% | - | |
10.0 | 8.0 | |
1 day ago | 4 months ago | |
Chapel | Scala | |
GNU General Public License v3.0 or later | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
chapel
-
Introduction to GPU Programming in Chapel
Thanks, @subharmonicon!
While Chapel can run on many different systems, the main goal is making HPC programming much easier. Therefore, we are currently focusing on hardware that you can find in HPC systems (NVIDIA, AMD and Intel). Metal doesn't fall into that category, unfortunately. So far, the name came up infrequently in our discussions IIRC (especially targetting SPIRV), but we haven't heard from any [potential] user who may be interested in it. I would encourage you or anybody else interested in it to create an issue asking for the feature: https://github.com/chapel-lang/chapel/issues/new. Seeing public interest in that direction can change our prioritization.
One thing that I wanted to add that's not in the blogpost is the "cpu-as-device" mode. With that mode, you can use any machine, even one without a GPU, to write applications using Chapel's GPU features. That mode is for those who want to do initial development/debugging on their personal laptops before putting their application on an HPC system. In other words, while you can't use Metal directly, you can still write GPU-enabled applications in your Mac using Chapel, if the end goal is to run it on an HPC system. More details on cpu-as-device: https://chapel-lang.org/docs/main/technotes/gpu.html#cpu-as-...
-
Mojo is now available on Mac
Agreed. Here is a serious contender[0] minus all the hype and the $100M in VC money. You would expect a minimum of interest given how Mojo is received by the community, but not really in practice.
[0]: https://chapel-lang.org/
- Chapel 1.32.0 Released
-
Rust vs. Julia in Scientific Computing
Cray is pushing their own language as well, Chapel.
https://chapel-lang.org/
As for Julia on Cray,
"Julia β The Newest Petaflop Family Language We Have Started to Love"
https://www.avenga.com/magazine/julia-programming-language
> Julia is one of the few languages that are in the so-called PetaFlop family; the other languages are C, C++ and Fortrant. It achieved 1.54 petaflops with 1.3 million threads on the Cray XC40 supercomputer.
-
What languages are we missing on devenv.sh?
https://chapel-lang.org if possible, Nix was also recently mentioned in Chapel Workshop https://chapel-lang.org/CHIUW2023.html https://github.com/twesterhout/nix-chapel
- Chapel: Programming Language for Parallel Computing
-
Getting Past βAmpersand-Driven Developmentβ in Rust
See Val for a possible step into that direction.
https://www.val-lang.dev/
Or how the Chapel language for HPC is going at it,
https://chapel-lang.org/
-
Ask HN: How do I get the most benefit out of my programming language?
I suggest posting to a PLT focused resource, such as http://lambda-the-ultimate.org/
That said, a bit confused about the languages you reference in this context (Python, C#, JS) - didn't see any mention here or at your github repo of languages (some relatively ancient) in this space designed.
Sandia: Programming Languages for HPC [high performance computing] - is there life after MPI?
https://www.sandia.gov/app/uploads/sites/179/2022/04/SOS10-T...
Chapel:
https://chapel-lang.org/
https://en.wikipedia.org/wiki/Category:Array_programming_lan...
-
Twelve Days of Chapel: Advent of Code 2022
We needed the implicit conversion to `uint` in order for the overload resolution rules to make reasonable choices when faced with binary overloads for all of the numeric types. The document I linked talks through the examples. The case we were facing is something that we shared with `C#` -- in `C#` terms, if I make overloads for `f` for all numeric types (see https://github.com/chapel-lang/chapel/blob/main/test/types/coerce/allNumericsBinary.cs if you want to know exactly what I am talking about), then `f( myInt, myUlong )` runs `f(float, float)` which makes no sense. Especially if you care about numerical accuracy or program performance.
-
-π- 2022 Day 8 Solutions -π-
Code | Blog Walkthrough
advent-of-code
-
-π- 2022 Day 13 Solutions -π-
Scala using Β΅Json. Really happy with how concise this is. I was able to parse everything into a Packet class that extends Ordered, which gives us the compare function. So once that was implemented recursively according to the rules we were given, I was able to jsut call .sorted for part 2.
-
-π- 2022 Day 12 Solutions -π-
Scala using jgrapht. I thought part 2 would require a different graph (similar to 2018 day 22) since the story said "to avoid needing to get out your climbing gear..." Glad that wasn't the case!
-
-π- 2022 Day 11 Solutions -π-
Scala. Pretty happy with how I parsed these into anonymous instances of my Monkey trait. For me part 2 wasn't hard because of the modulo trick, but because I was using mutable queues. So I had to add a reset() method to get things back the way they were before running part 2
-
-π- 2022 Day 10 Solutions -π-
Scala using tail recursion. Not the prettiest, but it works
-
-π- 2022 Day 9 Solutions -π-
Scala. Not too bad with my Point helper class. After part 1 I refactored the movements into a move helper that just takes 2 arbitrary points; the current point and the one we are moving towards. Then it was easy enough to just apply that in order each iteration for part 2.
-
-π- 2022 Day 8 Solutions -π-
Scala. It's ugly, but it works Β―\_(γ)_/Β―
-
-π- 2022 Day 5 Solutions -π-
Scala. Parsing wasn't as hard as I thought it would be using transpose and then just filtering non-alphanumeric characters. I initially parsed to a Map[Int, mutable.Stack[Char]] but then that bit me in part 2 when I would have to "reset" it (dang mutability!). So instead I parse to Map[Int, String] and just build the mutable stacks twice.
-
-π- 2022 Day 4 Solutions -π-
Updated version using sets instead of ranges
-
-π- 2022 Day 2 Solutions -π-
Scala. A little more verbose than I would like, but it works Β―\_(γ)_/Β―
-
-π- 2022 Day 1 Solutions -π-
Scala
What are some alternatives?
zls - A Zig language server supporting Zig developers with features like autocomplete and goto definition
AdventOfCodeHaskell - Advent of Code in Haskell
ATS-Postiats - ATS2: Unleashing the Potentials of Types and Templates
advent-of-code
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
advent-of-code-rust - πStarter template for solving Advent of Code in Rust.
hacktoberfest-swag-list - Multiple companies go above and beyond for Hacktoberfest, and this repo tries to list them all.
advent-of-code-2022 - π My Advent of Code solutions in Rust. http://adventofcode.com/2022
gsoc-organizations - A site for viewing and analyzing the info of the organizations participating in Google Summer of Code.
adventofcode - Advent of Code challenge solutions
jmurmel - A standalone or embeddable JVM based interpreter/ compiler for Murmel, a single-namespace Lisp dialect inspired by Common Lisp
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup