Introduction
Many real-world applications involve storing and processing large amounts of data. These data sets need to be either stored over the memory hierarchy of one computer or distributed and processed over many parallel computing devices or both. In fact, in many such applications, choosing a realistic computation model proves to be a critical factor in obtaining practically acceptable solutions. In this chapter, we focus on realistic computation models that capture the running time of algorithms involving large data sets on modern computers better than the traditional RAM (and its parallel counterpart PRAM) model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ajwani, D., Meyerhenke, H. (2010). Chapter 5. Realistic Computer Models. In: Müller-Hannemann, M., Schirra, S. (eds) Algorithm Engineering. Lecture Notes in Computer Science, vol 5971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14866-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-14866-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14865-1
Online ISBN: 978-3-642-14866-8
eBook Packages: Computer ScienceComputer Science (R0)