scientific article; zbMATH DE number 2006662

MaRDI QIDQ4436061zbMATH OpenFDO

Authors Panagiota Fatourou, Maurice Herlihy

Publication date 23 November 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2180/21800330.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Read-modify-write networks
• Counting networks
• Contention in shared memory algorithms
• An efficient counting network
• Linearizable counting networks

Cited in

(4)

• The cost of concurrent, low-contention Read \& Modify \& Write
• Counting networks
• Read-modify-write networks
• Concurrent counting is harder than queuing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436061)