Timeline for Why is processing a sorted array faster than processing an unsorted array?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2021 at 21:23 | history | edited | Peter Mortensen | CC BY-SA 4.0 |
Active reading [<https://en.wikipedia.org/wiki/Branch_predictor> <https://www.youtube.com/watch?v=1Dax90QyXgI&t=17m54s> <https://www.youtube.com/watch?v=1Dax90QyXgI&t=19m05s>]. Added some context. Used more standard formatting (we have italics and bold on this platform).
|
| Dec 13, 2019 at 14:29 | comment | added | Peter Cordes | The instructions stay hot in the CPU's L1 instruction cache regardless of mispredicts. The problem is fetching them into the pipeline in the right order, before the immediately-previous instructions have decoded and finished executing. | |
| Dec 13, 2019 at 13:46 | history | edited | hatirlatici | CC BY-SA 4.0 |
It is an academic paper, not report.
|
| S Nov 17, 2019 at 17:21 | history | suggested | Meraj al Maksud | CC BY-SA 4.0 |
minor edit
|
| Nov 17, 2019 at 15:52 | review | Suggested edits | |||
| S Nov 17, 2019 at 17:21 | |||||
| Oct 23, 2019 at 21:35 | history | answered | hatirlatici | CC BY-SA 4.0 |