Survey: Computational Models for Asymmetric Read and Write Costs

With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of writing to memory. This raises new challenges to algorithm design since many of the classic algorithms use approximately the same number of reads...

Full description

Saved in:

Bibliographic Details
Published in:	2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) pp. 733 - 743
Main Author:	Gu, Yan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2018
Subjects:	Analytical models asymmetric memory Complexity theory computational model Computational modeling I/O efficient algorithms Memory management nested parallel computation non volatile memory Phase change random access memory Task analysis write efficient algorithms
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of writing to memory. This raises new challenges to algorithm design since many of the classic algorithms use approximately the same number of reads and writes. In this survey, we review the existing computational models that measure the cost of operations and memory accesses to the NVMs, and scheduler of parallel algorithms on the new hardware. The new models meanwhile allow theoretical analysis and showing lower bounds on the hardness of the classic problems. We also list some existing results on lower and upper bounds on the most common problems like sorting, searching, graph traversal, based on these models.
DOI:	10.1109/IPDPSW.2018.00120