panama-foreign VS grpc_bench

Going to copy my Reddit comment over to HN because I think it's valuable:

---

One of the coolest things that's been worked on (by this same author, no less!) isn't even in the article!

Per has written a pretty-printer for MemorySegments and ByteBuffers that can hex-dump memory or render memory/buffers as their "struct" representations given some MemoryLayout.

You can also customize it with your own printers, it's wicked cool and helps so much to debug buffers when working with them.

https://github.com/openjdk/panama-foreign/pull/695

What do I mean by that? Have a look at this comment for an image of a raw memory structure layout I represented with MemoryLayout, and the pretty-print rendering of it:

https://github.com/openjdk/panama-foreign/pull/695#issuecomm...

[Here's the project github](https://github.com/openjdk/panama-foreign)

I am not using any special flag (is there one?) but the overhead seems quite high, especially considering the explanation on how these methods are compiled https://github.com/openjdk/panama-foreign/blob/foreign-jextract/doc/panama_ffi.md

https://github.com/openjdk/panama-foreign/blob/foreign-jextract/doc/panama_jextract.md ..look at these examples

I found the full context for the change written up here https://github.com/openjdk/panama-foreign/pull/554

Incentive for JVM devs? We know that C interoperability, malloc, free, structs are already supported on JVM natively since Java 14 with project panama's foreign-memory-api without JNI. I've been using sun.misc.Unsafe since Java8 and also LWJGL's C API.

SayHello, GetUser, and Sum differ only by payload size. Sum is the simplest one - (int, int) -> int, GetUser is (long) -> User (medium payload), and SayHello uses exactly the same payload as this test: https://github.com/LesnyRumcajs/grpc_bench/tree/master/dotnet_grpc_bench

This is correct. The problem is not with the benchmark itself but with the implementation. If you look at the result, you can see that even with 6 "allowed" CPUs, the vertx server utilizes less than 100%. Apparently, the current vertx implementation (the one implemented in https://github.com/LesnyRumcajs/grpc_bench/tree/master/java_vertx_grpc_bench) is single-threaded or has some other limitation.

Another iteration of grpc_bench!

Because it's fast and runs on Windows, Linux, and MacOS

In general though, akka/pekko-streams are known to be one of the fastest implementations out there. Their grpc client for example even beats languages like Rust (see https://www.lightbend.com/blog/akka-grpc-update-delivers-1200-percent-performance-improvement and https://github.com/LesnyRumcajs/grpc_bench/wiki/2022-03-15-bench-results).

The whole point I was making is at least up until 8 months ago (at best, I can't commend on the stability/maturity/performance of shardcake) Akka was the only mature library/ecosystem solving this problem with also a very strong focus on performance (for example still to this day, akka/pekko-grpc is generally one of the fastest grpc implementations I am aware of, its even beating rust if you have at least 2 cores (see https://github.com/LesnyRumcajs/grpc_bench/wiki/2022-03-15-bench-results)

It would be interesting to create a new java benchmark with your implementation.

Also worth checking out the gRPC benchmarks: https://github.com/LesnyRumcajs/grpc_bench/discussions/284

dotnet is up there with Rust.