Realistic Computer Models

Files in This Item:
File Description SizeFormat 
ajwani_realistic_computer_models.pdf814.34 kBAdobe PDFDownload
Title: Realistic Computer Models
Authors: Ajwani, Deepak
Meyerhenke, Henning
Permanent link:
Date: 1-Jan-2010
Online since: 2019-04-11T08:07:09Z
Abstract: 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.
Type of material: Conference Publication
Publisher: Springer
Start page: 194
End page: 236
Series/Report no.: Lecture Notes in Computer Science (LNCS, volume 5971)
Copyright (published version): 2010 Springer
Keywords: Parallel algorithmExternal memoryCache lineInternal memoryMemory hierarchy
DOI: 10.1007/978-3-642-14866-8_5
Language: en
Status of Item: Peer reviewed
Is part of: Muller-Hannemann, M., Schirra, S. (eds.). Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice
ISBN: 978-3-642-14865-1
Appears in Collections:Computer Science Research Collection

Show full item record

Citations 50

checked on Apr 19, 2019

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.