Efficient adaptive collect algorithms (Q1954244)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Efficient adaptive collect algorithms	scientific article

Statements

scholarly article

0 references

Efficient adaptive collect algorithms (English)

0 references

0 references

0 references

Distributed Computing

0 references

publication date

20 June 2013

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00446-007-0041-1

0 references

Atomic snapshots of shared memory

0 references

Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)

0 references

Algorithms adapting to point contention

0 references

Lower bounds for adaptive collect and related objects

0 references

Efficient adaptive collect using randomization

0 references

Efficient Adaptive Collect Using Randomization

0 references

Adapting to Point Contention with Long-Lived Safe Agreement

0 references

Distributed Computing

0 references

The concurrency hierarchy, and algorithms for unbounded concurrency

0 references

0 references

Wait-free algorithms for fast, long-lived renaming

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00446-007-0041-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1954244

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1954244&oldid=38808732"