Výsledky vyhľadávania - "shared‐memory algorithms"

Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces Autor Bessani, A.N., Correia, M., da Silva Fraga, J., Lau Cheuk Lung

“…Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes subject to Byzantine…”
Získať plný text

Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads (Artifact) Autor Nemitz, Catherine E., Caspin, Shai, Anderson, James H., Ward, Bryan C.

“… It is shown that state-of-the-art real-time reader/writer locking protocols are subject to performance limitations when reads dominate, and that existing schedulability analysis fails to leverage…”
Získať plný text

Using local-spin k -exclusion algorithms to improve wait-free object implementations Autor Anderson, James H., Moir, Mark

“…We present the first shared-memory algorithms for k-exclusion in which all process blocking is achieved through the use of 'local-spin' busy waiting…”
Získať plný text

Counting and generating integer partitions in parallel Autor Sanchis, L.A.

“…The author presents parallel shared memory algorithms for counting the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being…”
Získať plný text