@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00717235v2> a dcat:Dataset ;
    dct:description """
              We consider a system of $n$ processes with ids not a priori known, that are drown from a large space, potentially unbounded. How can these $n$ processes communicate to solve a task? We show that $n$ a priori allocated Multi-Writer Multi-Reader (MWMR) registers are both needed and sufficient to solve any read-write wait-free solvable task. This contrasts with the existing possible solution borrowed from adaptive algorithms that require $\\Theta(n^2)$ MWMR registers. To obtain these results, the paper shows how the processes can \\emph{non-blocking} emulate a system of $n$ Single-Writer Multi-Reader (SWMR) registers on top of $n$ MWMR registers. It is impossible to do such an emulation with $n-1$ MWMR registers. Furthermore, we want to solve a sequence of tasks (potentially infinite) that are sequentially dependent (processes need the previous task's outputs in order to proceed to the next task). A non-blocking emulation might starve a processor forever. By doubling the space complexity, using $2n-1$ rather than just $n$ registers, processes can erase each other's write operation, just a bounded number of times, and consequently the computation is wait-free rather than non-blocking.
            """ ;
    dct:identifier "hal-00717235" ;
    dct:issued "2026-11-04T04:03:57.414769"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-11-04T04:03:57.414775"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Linear Space Boostrap Communication Scheme" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00717235v2/resource/46dcdf1c-165f-462b-8e29-c40d736d66c7> ;
    dcat:keyword "distributed-algorithms",
        "infoeu-reposemanticspreprint",
        "preprints-working-papers-",
        "readwrite-registers",
        "renaming",
        "sccocompcognitive-sciencecomputer-science",
        "shared-memory",
        "space-complexity",
        "wait-free" ;
    dcat:landingPage <https://hal.science/hal-00717235> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00717235v2/resource/46dcdf1c-165f-462b-8e29-c40d736d66c7> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-11-04T04:03:57.474597"^^xsd:dateTime ;
    dct:modified "2026-11-04T04:03:57.394613"^^xsd:dateTime ;
    dct:title "Linear Space Boostrap Communication Scheme" ;
    dcat:accessURL <https://hal.science/hal-00717235> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00717235> a foaf:Document .