The Locality-First Strategy for Developing Efficient Multicore Algorithm
To scale applications on multicores up to bigger problems, software systems must be optimized both for parallelism to take full advantage of the multiple cores and for locality to exploit the memory system for cache-friendliness. Parallelization alone does not suffice to reach peak performance due t...
Main Author: | Xu, Helen Jiang |
---|---|
Other Authors: | Leiserson, Charles E. |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/143200 https://orcid.org/0000-0003-2232-3305 |
Similar Items
-
Multicore Paging Algorithms Cannot Be Competitive
by: Xu, Helen, et al.
Published: (2022) -
An Efficient Multicore Algorithm for Minimal Length Addition Chains
by: Hazem M. Bahig, et al.
Published: (2019-03-01) -
Developing Efficient Discrete Simulations on Multicore and GPU Architectures
by: Daniel Cagigas-Muñiz, et al.
Published: (2020-01-01) -
Modelling and developing co-scheduling strategies on multicore processors
by: Zhu, H, et al.
Published: (2015) -
Multicore computing : algorithms, architectures, and applications /
by: Rajasekaran, Sanguthevar, editor, et al.
Published: (2013)