نتایج جستجو برای: grid partitioning and subtractiveclustering
تعداد نتایج: 16843211 فیلتر نتایج به سال:
A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strateg...
The poor scaling behavior of grid-partitioning fuzzy systems in case of increasing data dimensionality suggests using fuzzy systems with a scatter-partition of the input space. Jang has shown that zero-order Sugeno fuzzy systems are equivalent to radial basis function networks (RBFNs). Methods for nding scatter partitions for RBFNs are available, and it is possible to use them for creating scat...
Dynamic adaptive mesh re nement methods for the numerical solution to partial di erential equations yield highly advantageous ratios for cost/accuracy as compared to methods based upon static uniform approximations. Distributed implementations of these techniques have the potential for enabling realistic simulations of complex systems. These implementations however, present signi cant challenge...
The present paper introduces a new communication and load-balancing scheme based on a clustering of the grid which we use for the efficient parallelization of simulations on dynamically adaptive grids. With a partitioning based on space-filling curves (SFCs), this yields several advantageous properties regarding the memory requirements and load balancing. However, for such an SFC-based partitio...
Cost-Based Assessment of Partitioning Algorithms of Agent-Based Systems on Hybrid Cloud Environments
Distributing agent-based simulators reveals many challenges while deploying them on a hybrid cloud infrastructure. In fact, a researcher’s main motivations by running simulations on hybrid clouds, are reaching more scalable systems as well as reducing monetary costs. Indeed, hybrid cloud environment, despite providing scalability and effective control over proper data, requires an efficient dep...
Bounding Volume Hierarchies (BVHs) and k-d trees have been used to create interactive ray tracing. Ray tracing dynamic scenes using nVidia’s R © OptiX TM has already provided thirty to sixty frames per second or better. In this paper, we implement space partitioning methods, such as grid method and the proximity clouds (PCs), on multiple GPUs. Our motivation is to investigate the use of such me...
A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
This paper investigates the effect of sub-grid rainfall variability on the simulation of land surface hydrologic processes of three regions (Europe, Africa and Amazon) with contrasting precipitation and vegetation characteristics. The sub-grid rainfall variability is defined in terms of the rainfall coverage fraction at the model’s grid cells, and the statistical distribution of rain rates with...
This paper proposes a novel stochastic process that represents the arbitrary rectangular partitioning of an infinite-dimensional matrix as the conditional projective limit. Rectangular partitioning is used in relational data analysis, and is classified into three types: regular grid, hierarchical, and arbitrary. Conventionally, a variety of probabilistic models have been advanced for the first ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید