Concurrent counting is harder than queuing (Q604464): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60148586, #quickstatements; #temporary_batch_1710982311091 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Counting networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The cost of concurrent, low-contention Read \& Modify \& Write / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4436061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Competitive concurrent distributed queuing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inherent bottleneck in distributed counting / rank | |||
Normal rank |
Revision as of 10:45, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Concurrent counting is harder than queuing |
scientific article |
Statements
Concurrent counting is harder than queuing (English)
0 references
11 November 2010
0 references
distributed algorithms
0 references
distributed data structures
0 references
distributed counting
0 references
distributed queuing
0 references
0 references