Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Computer architecture

Siblings5
  • Sort by title
  • Sort by date

  • In-memory computing - architecture
  • ISA - Instruction Set Architecture
  • Analog Architectures for ML
  • AI for microchip floorplanning
  • Algorithms and Data structures

Children2
  • Sort by title
  • Sort by date

  • Computing - bottlenecks
  • The Processor-Memory bottleneck
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

c

Author:Mihail Turlakov
Description:
# Algorithms and Data structures


## https://en.wikipedia.org/wiki/Parallel_algorithm

https://www.cs.cmu.edu/~guyb/papers/BM04.pdf
https://en.wikipedia.org/wiki/Load_balancing_(computing)

https://code.kx.com/q/wp/multi-thread/#query-optimizations-using-multi-threading

## https://en.wikipedia.org/wiki/Parallel_computing
⏎
## 2008 [Algorithms and Data Structures for External Memory- Jeffrey Scott Vitter](https://www.ittc.ku.edu/~jsv/Papers/Vit.IO_book.pdf)

- 4 Exploiting Locality and Load Balancing 25 (page 42)

Disk striping can be used to get optimal multiple-disk algorithms
for three of the four fundamental operations of Chapter 3 — streaming,
online search, and answer reporting — but it is nonoptimal for sorting

# Parents

* Computer architecture
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026