DocumentCode
3162615
Title
Memory allocation constructs to complement NUMA memory management
Author
Adema, Roger L. ; Ellis, Carla Schlatter
Author_Institution
Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
fYear
1991
fDate
2-5 Dec 1991
Firstpage
878
Lastpage
885
Abstract
Nonuniform memory access time (referred to as NUMA) is an important feature in the design of large scale shared memory multiprocessors. However, one implication of the NUMA architecture is that locality of the data is crucial to performance. In the absence of any system support, the programmer is forced to explicitly manage these locality issues, significantly increasing the development time for parallel applications. The authors have enhanced the uniform system programming environment of BBN to allow a programmer to easily separate data structures based on expected reference patterns instead of requiring an understanding of the NUMA memory architecture as the basis for allocation decisions. An operating system providing dynamic page placement can exploit the more homogeneous allocation of data structures to virtual pages
Keywords
data structures; programming environments; shared memory systems; storage allocation; storage management; BBN; NUMA memory management; data structures; dynamic page placement; large scale shared memory multiprocessors; memory allocation constructs; nonuniform memory access; operating system; performance; uniform system programming environment; virtual pages; Computer architecture; Computer science; Data structures; Large-scale systems; Memory architecture; Memory management; Operating systems; Parallel architectures; Parallel programming; Programming profession;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2310-1
Type
conf
DOI
10.1109/SPDP.1991.218228
Filename
218228
Link To Document