DocumentCode
3351455
Title
Parallel network RAM: effectively utilizing global cluster memory for large data-intensive parallel programs
Author
Oleszkiewicz, John ; Xiao, Li ; Liu, Yunhao
Author_Institution
Dept. of Comput. Sci. & Eng., Michigan State Univ., USA
fYear
2004
fDate
15-18 Aug. 2004
Firstpage
353
Abstract
Large scientific parallel applications demand large amounts of memory space. Current parallel computing platforms schedule jobs without fully knowing their memory requirements. This leads to uneven memory allocation in which some nodes are overloaded. This, in turn, leads to disk paging, which is extremely expensive in the context of scientific parallel computing. To solve this problem, we propose a new peer-to-peer solution called parallel network RAM. This approach avoids the use of disk and better utilizes available RAM resources. This approach will allow larger problems to be solved while reducing the computational, communication and synchronization overhead typically involved in parallel applications.
Keywords
disc storage; natural sciences computing; paged storage; parallel programming; peer-to-peer computing; processor scheduling; random-access storage; resource allocation; storage allocation; disk paging; global cluster memory; job scheduling; large data-intensive parallel programs; large scientific parallel application; memory allocation; parallel computing; parallel network RAM; peer-to-peer solution; scientific parallel computing; Application software; Computer science; Concurrent computing; Context; Data engineering; Parallel processing; Peer to peer computing; Processor scheduling; Random access memory; Read-write memory;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 2004. ICPP 2004. International Conference on
ISSN
0190-3918
Print_ISBN
0-7695-2197-5
Type
conf
DOI
10.1109/ICPP.2004.1327942
Filename
1327942
Link To Document