.png){kind=icon}
Return
DOMAIN DECOMPOSITION FOR PARALLEL PROCESSING OF SPATIAL PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0198-9715(92)90041-O.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Spatial models often are not used to their fullest potential because they have massive computational requirements. Existing workstations and microcomputers often must solve these models in batch mode and, consequently, decision makers are unable to explore and resolve complex spatial problems in an interactive and graphical environment similar to that provided by general purpose business software. Parallel processing can solve spatial models at high speed, however, greatly decreasing turnaround times and enabling decision makers quickly to see the results of revising parameters and criteria To reap these benefits in a parallel processing environment, researchers must recast modelling procedures from their existing sequentially-oriented form to one in which parallelism can be exploited. This process, referred to as domain decomposition, is a fundamental enterprise in parallel spatial modelling. Domain decomposition for spatial problems can be structured by a set of general principles which are described and illustrated using an example from location-allocation modelling.
Keywords:
DECISION SUPPORT SYSTEM
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.6K
Citations:
8.3K
Organization
No organization information available
Cited Papers
ShareSaveShareSave
ShareSaveShareSavePrealternate molt-migration in Rusty Blackbirds and its implications for stopover biology.png)
The Condor
OAAI
The CondorIF0
OAAIShareSave
View more