Premium
An automated approach for estimating the memory footprint of nonlinear data objects
Author(s) -
Dreßler Sebastian,
Steinke Thomas
Publication year - 2014
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3345
Subject(s) - computer science , memory footprint , disjoint sets , graph , data structure , task (project management) , data type , memory management , theoretical computer science , programming language , overlay , mathematics , management , combinatorics , economics
Summary Current programming models for heterogeneous devices with disjoint physical memory spaces require explicit allocation of device memory and explicit data transfers. While it is quite easy to manually implement these operations for linear data objects like arrays, this task becomes more difficult for nonlinear objects, for example, linked lists or multiple inherited classes. The difficulties arise because of memory requirements known only at run‐time and the composition of complex data structures from basic types. In this paper, we present a novel method to build a graph‐based static data‐type description that is used to create code for injectable functions that automatically determine the memory footprint of data objects at run‐time. Our approach is extensible to implement automatically generated optimized data transfers across physical memory spaces. Copyright © 2014 John Wiley & Sons, Ltd.