Two-Way Trees: A Distributed Algorithm for Efficient Replica Search and Placement
Gespeichert in:
| Veröffentlicht in: | APOCS (1. : 2020 : Salt Lake City, Utah) Symposium on Algorithmic Principles of Computer Systems (APOCS20) |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , , |
| Pages: | 20 |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Titel | Jahr | Verfasser |
|---|---|---|
| Learning Software Constraints via Installation Attempts | 2021 | Basat, Ran Ben |
| Eccentricity Heuristics through Sublinear Analysis Lenses | 2021 | Wagner, Tal |
| Fast Distributed Backup Placement in Sparse and Dense Networks | 2021 | Barenboim, Leonid |
| Parallel Algorithms for Butterfly Computations | 2021 | Shi, Jessica |
| Two-Way Trees: A Distributed Algorithm for Efficient Replica Search and Placement | 2021 | Park, Gahyun |
| Scheduling I/O Latency-Hiding Futures in Task-Parallel Platforms | 2021 | Singer, Kyle |
| Writeback-Aware Caching | 2021 | Beckmann, Nathan |
| Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms | 2021 | Liu, Zaoxing |
| Lock-Free Hopscotch Hashing | 2021 | Kelly, Robert |
| Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming | 2021 | Blelloch, Guy E. |
| Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs | 2021 | Kaler, Tim |
| Online Flow Computation on Unit-Vertex-Capacitated Networks | 2021 | Arsenis, Makis |