A Markov Process for Sequential Allocation
| dc.creator | Stefanescu,Calina | |
| dc.date | 1995 | |
| dc.date.accessioned | 2024-02-06T12:48:06Z | |
| dc.date.available | 2024-02-06T12:48:06Z | |
| dc.description | We describe a Markov process which models the sequential allocation for two adjacent tables coexisting in memory by growing towards each other. The tables are expected to fill at the same rate, random deletions and insertions are allowed. 1.) 1991 Mathematics Subject Classification. Primary 60J20, Secondary 62M05, 68P05. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-001-12-0821 | |
| dc.identifier | https://lib.jucs.org/article/27200/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/6897 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 1(12): 821-827 | |
| dc.title | A Markov Process for Sequential Allocation | |
| dc.type | Research Article |