DocumentCode :
1931703
Title :
Heaps and stacks in distributed shared memory
Author :
Pizka, M. ; Rehn, C.
Author_Institution :
Technische Universitat Munchen
fYear :
2001
fDate :
15-19 April 2001
Abstract :
Software-based distributed shared memory (DSM) systems do usually not provide any means to use shared memory regions as stacks or via an efficient heap memory allocator. Instead DSM users are forced to work with very rudimentary and coarse grain memory (de-)allocation primitives. As a consequence most DSM applications have to ??reinvent the wheel??, that is to implement simple stack or heap semantics within the shared regions. Obviously, this has several disadvantages. It is error-prone, timeconsuming and inefficient. This paper presents an all in software DSM that does not suffer from these drawbacks. Stack and heap organization is adapted to the changed requirements in DSM environments and both, stacks and heaps, are transparently placed in DSM space by the operating system.
Keywords :
Application software; Distributed processing; Memory management; Operating systems; Optimizing compilers; Performance loss; Runtime environment; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM
Conference_Location :
Ft. Lauderdale, FL
Print_ISBN :
0-7695-1573-8
Type :
conf
DOI :
10.1109/IPDPS.2002.1016494
Filename :
1016494
Link To Document :
بازگشت