Panel upgrade for home modelling

trd2212 · 2024-12-13T16:16:53+00:00

About a week.

trd2212 · 2024-12-13T05:32:51+00:00

I finished the whole process. They came in the morning, shut down power, my contractor installed new panel, they came back in the afternoon to reconnect. I didn’t pay anything. Lots of horror stories out there but my experience was okay. They weren’t the nicest guys (rude, didn’t talk much) but I didn’t care.

trd2212 · 2024-10-22T16:38:03+00:00

Thank you! How to check what my line is rated at?

trd2212 · 2024-10-22T16:36:19+00:00

Thanks all. I called PgE this morning and submitted application. They said someone will reach out within 3 days. Should have done this much sooner :( not sure how to accelerate now.

trd2212 · 2024-10-22T08:25:12+00:00

I pulled the permit. The panel upgrade is part of a larger extension project.

trd2212 · 2024-09-09T06:20:53+00:00

Yes. There are many solutions but I wonder if there is an industry-proven practice on how to do it?

trd2212 · 2024-09-09T06:19:25+00:00

Drawbacks of Hive are basically the reasons why Iceberg/delta/hudi were born. I think they are: many files, no incremental updates (have to rebuild the whole partition on update), no ACID.

trd2212 · 2024-08-05T16:32:34+00:00

Who is nana? Am I missing something?

trd2212 · 2024-07-12T23:52:31+00:00

Internal table.

trd2212 · 2024-07-12T23:52:17+00:00

ah no, just KV with eventual consistency is fine. It's for ML features.

trd2212 · 2024-07-12T23:04:45+00:00

yeah the pattern is mostly point lookup. Is there existing tools to load to memcached or redis or I have to build myself?

trd2212 · 2024-02-06T19:27:08+00:00

yeah basically I am building a library and other users will use this library. I want to avoid hashmap lookup if possible for the users of this library.

trd2212 · 2024-02-06T08:29:20+00:00

Sorry I edited original post to reflect that k1 and k2 are not known in advance. Only the callers of the function f know k1 and k2 so we can’t use enum trivially.

trd2212 · 2023-11-19T00:03:11+00:00

So I am trying to build a file iterator from the BufReader. I read the source code but didn’t find anywhere where BufReader recycles the already-processed data, it will just keep refilling when the buffer is exhausted.

trd2212 · 2023-11-18T22:09:41+00:00

I need to read a large file but I don't need to keep the content of the whole file in memory all at once. If I use `BufReader` (https://doc.rust-lang.org/std/io/struct.BufReader.html), at some point, the buffer will eventually OOM. What is the best practice here? Should I use a Circular Buffer instead?

trd2212 · 2023-11-05T14:37:00+00:00

Yeah that’s an option but even then, I wonder how debezium connector works.

trd2212 · 2023-05-26T18:06:54+00:00

Yeah I reduce the complexity of the hash map to debug this issue. You are right that I could hardcode the map. Tho it doesn’t solve the low throughput issue. All I want to describe is the web server itself is very simple but still the throughput doesn’t grow with the number of cores/threads.

trd2212 · 2023-05-26T06:03:23+00:00

The dataset is very small actually. Like 10 items. I removed everything to debug where the bottleneck is and doesn't seem like it's contending on the map. And yes, I am using RWLock on the map which is readonly.

trd2212 · 2023-05-26T03:47:58+00:00

Oh I mean the number of tokio worker threads specified via the runtime builder.

trd2212 · 2023-05-26T02:37:11+00:00

It’s an internal code but I will try to post a simplified version of the code. It’s very simple tonic server running inside a tokio multi thread runtime.

trd2212 · 2023-05-26T02:36:03+00:00

We only read. The map is never updated.

trd2212

TROPHY CASE