Cosmology simulations are highly communicationintensive, thus it is critical to exploit topology-aware task mapping techniques for performance optimization. To exploit the architectural properties of multiprocessor clusters (the performance gap between inter-node and intra-node communication as well as the gap between inter-socket and intra-socket communication), we design and develop a hierarchical task mapping scheme for cell-based AMR (Adaptive Mesh Refinement) cosmology simulations, in particular, the ART application. Our scheme consists of two parts: (1) an inter-node mapping to map application processes onto nodes with the objective of minimizing network traffic among nodes and (2) an intra-node mapping within each node to minimize the maximum size of messages transmitted between CPU sockets. Experiments on production supercomputers with 3D torus and fat-tree topologies show that our scheme can significantly reduce application communication cost by up to 50%. More importantly, our scheme is generic and can be extended to many other applications.
Power flow calculation in EMS is required to accommodate large and complex power system. To achieve a faster than real-time calculation, a graph based power flow calculation is proposed in this paper. Graph database and graph computing advantages in power system calculations are presented. A linear solver for power flow application is formulated and decomposed in nodal parallelism and hierarchical parallelism to fully utilize graph parallel computing capability. Comparison of the algorithm with traditional sequential programs shows significant benefits on computation efficiency. Case studies on practical large-scale systems provide supporting evidence that the new algorithm is promising for online computing for EMS.
Urban millimeter wave (mmWave) communications are limited by link outage due to frequent blockages by obstacles. One approach to this problem is to increase the density of base stations (BSs) to achieve macro diversity gains. Dense BS deployment, however, incurs the increased BS installation cost as well as power consumption. In this work, we propose a framework for connectivity-constrained minimum cost mmWave BS deployment in Manhattan-type geometry (MTG). A closed-form expression of network connectivity is characterized as a function of various factors such as obstacle sizes, BS transmit power, and the densities of obstacles and BSs. Optimization that attains the minimum cost is made possible by incorporating a tight lower bound of the analyzed connectivity expression. A low-complexity algorithm is devised to effectively find an optimal tradeoff between the BS density and transmit power that results in the minimum BS deployment cost while guaranteeing network connectivity. Numerical simulations corroborate our analysis and quantify the best tradeoff of the BS density and transmit power. The proposed BS deployment strategies are evaluated in different network cost configurations, providing useful insights in mmWave network planning and dimensioning.INDEX TERMS Millimeter wave network, connectivity, base station deployment cost, Manhattan-type geometry, lattice process.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.