m110400
oMiser Articles
Omiser Objects
(MOb) Directory Operation
Notes & Work Items
|
|
m110400
oMiser Articles |
|
Status |
Date |
Description |
|
| 2025-11-19 | There is a constraint that I hope is not fatal. In running oMiser, when we need to clean heap-0 on the "hardware" stack, we need a way to know what items are referenced from outside of heap-0. A couple of those might involve "working" pointers about to be used in the interpreter or other process. There may be others referenced from the MOb, but technically not from older heaps. There has to be a rule that older heaps can't point into younger ones. That breaks the partial ordering on obs, for one thing. Now there's a problem with synthetics. And individuals generally, perhaps. In some sense, the MOb is the oldest heap of all, and everything it points to is, in this sense, younger than itself. This situation is making my head hurt and I need to work this out better, also with a general memory-management organization and appropriate principles. | ||
| 2025-11-19 | I notice some confusion between the key and hash-function terminology in the Wikipedia article. In particular, there is the assumption that the key and content are together. That's not great for variable-size and even changing content. For oMiser, we have the desire for some content be moveable as part of garbage-collection, although it is unclear whether some content goes into a different kind of storage. Hmm, and if we generate some kind of computer code, that code must work when relocated as a block. Basically, the problem I think I am avoiding is holding pointers into the MOb that would then have to be fixed if a MOb entry were moved (i.e.., as a result of splitting/shrinking). We're talking about operations within a single memory and that might make this all easier. | ||
| 2025-11-19 | On 2011-04-19 (#66.98) I also referenced Griswold and Townsend in Software Practice & Experience but had no link. The Wikipedia Linear Hashing does find the reference for [Griswold1993]. This has a relevant usage and I must (1) capture it in bib/ and (2) explore it for useful information on oMiser memory management. | ||
| 2025-11-19 | On 2011-04-22 (#66.98) I mention a Wikipedia Linear Hashing article. The current article is useful but evidently different. It also seems a bit sloppy. I need to go through the citations and incorporate good links in my bib/ I also think that the LH* extension simply doesn't apply to oMiser. For a distributed Miser operation, maybe. The Talk on this article consists of 7 remarks from October 2005 to January 2008 and that's it. | ||
| 2025-11-19 | There needs to be a separate topic on Memory Management overall. I know I was interested in buddy systems very early, I just don't know that it figurd into my thinking about Miser and I haven't found any helpful notes on the topic. | ||
| 2025-11-19 | I am musing that Memory Management, apart from the stack, should be by a Knuth buddy system, if the use of powers-of-2 holds up. A lot of this, and ever doing deletions from the MOb needs to be figured out. But a buddy system can work with the creation of generations as well as MOb growth. Just wondering for now. Much would need to be tested and I think instrumentation will be indispensible. Of course that will impact things, so hopefully not detrimental. I also need to think about this controlled "heaping" with regard to the C/C++ Language Heap that is part of the run-time platform and how memory-management is handled generally. | ||
| 2025-11-19 | Use ]Larson1988] as the better source for laying out how Linear Hashing works. | ||
| 2025-11-16 | Resolve the connection of an ob-cell with additional materials of any kind, lifecycle management of any of them, and determining generational memory-management associations. | ||
| 2025-11-16 | Recover the principles of operation around Linear Hashing and the fundamental technique. | ||
|
in progress |
2025-11-16 | Scan through the 2011-04-19/30 (#66.98, .101-.109, .112-.113, .116) notes to create bib/ citations of materials around the Linear Hashing technique and descriptions/applications of it. | |
| done | 2025-11-16 |
Create this this page from the hybridForm examplar |
|
| done | 2025-11-06 |
|
|
 |
|
created 2025-11-16T23:20Z by orcmid |