• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.4
• /
• pp.21-30
• /
• 2010

In this paper, the parallel distributed rainfall runoff model(K-DRUM) using MPI(Message Passing Interface) technique was developed to solve the problem of calculation time as it is one of the demerits of the distributed model for performing physical and complicated numerical calculations for large scale watersheds. The K-DRUM model which is based on GIS can simulate temporal and spatial distribution of surface flow and sub-surface flow during flood period, and input parameters of ASCII format as pre-process can be extracted using ArcView. The comparison studies were performed with various domain divisions in Namgang Dam watershed in case of typoon 'Ewiniar' at 2006. The numerical simulation using the cluster system was performed to check a parallelization effectiveness increasing the domain divisions from 1 to 25. As a result, the computer memory size reduced and the calculation time was decreased with increase of divided domains. And also, the tool was suggested in order to decreasing the discharge error on each domain connections. The result shows that the calculation and communication times in each domain have to repeats three times at each time steps in order to minimization of discharge error.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.349-358
• /
• 2005

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover. the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in a page-based DSM system, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose call-site tracing-based shared memory allocator. shortly CSTallocator. CSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So CSTailocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our CSTallocator. Our observations show that by using CSTallocator a considerable amount of false sharing misses can be additionally reduced in comparison with the existing techniques.