Conventional address translation mechanisms generally use a translation lookaside buffer cache (TLB) of current page translations to provide virtual to physical page addressing. This translation cache is generally sha...
详细信息
ISBN:
(纸本)0818677430
Conventional address translation mechanisms generally use a translation lookaside buffer cache (TLB) of current page translations to provide virtual to physical page addressing. This translation cache is generally shared amongst all processes, and between reference types irrespective as to whether they relate to instruction or data references. In this paper we introduce a reconfigurable partitioned TLB which improves TLB performance by removing cache conflict misses between the distinct reference types. Extensive simulations using selected SPEC95 workloads show that data reference translations unfairly compete with instruction reference translations by dominating a standard shared TLB. We compare the traditional shared TLB with both fixed partition and re-configurable fixed partition TLB structures that segregate instruction and data page translation entries. We show that the partitioned TLB operates optimally when the miss ratio of the instruction reference partition is maintained at a lower level than the miss radio for the data reference? partition. By dynamically preserving a balance between the translation performance Of instruction and data components, a protected 'working set' of instruction translation entries can be maintained. This can be achieved within the one TLB structure with soft partitions separating reference types.
Database partitioning technique which adopts “divide and conquer” method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning....
详细信息
Database partitioning technique which adopts “divide and conquer” method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without an increased partitioning algorithm, so it does not adapt to the partitioning in the realtime data environment. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and repartitioning tables in the large database or realtime environment.
This article presents a zone formation algorithm for tandem AGV systems. The goal of the algorithm is to partition a given layout into a set of non overlapping zones in order to minimize the part flows between zones (...
详细信息
This article presents a zone formation algorithm for tandem AGV systems. The goal of the algorithm is to partition a given layout into a set of non overlapping zones in order to minimize the part flows between zones (or inter-zone part flows). The proposed algorithm is based on the principle of clustering. At the start of the algorithm, we allocate each station to a zone. Later, we merge zones at various runs of the algorithm to form new zones using inter-zone parts flow and distance criteria. The restriction on the size and the parts flow in the zones is obtained by comparison against user-defined values. The algorithm terminates when all the zones satisfy the desired size and parts flow limits. We demonstrate the applicability of our approach using a numerical illustration.
Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, t...
详细信息
Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the following indexes of the classic inter-satellite routing algorithms and the balanced partition routing algorithm: computation complexity, single-node computation pressure, routing path delay, path delay variance (data in Topo table satisfy mu = 5, sigma(2) = 10). The results reveal that the balanced partition routing algorithm achieves better performance. In this paper, two optimization directions of the balanced partition routing algorithm are simulated under conditions that the data in the Topo table satisfy mu = 5, sigma(2) = 6, sigma(2) = 10 and sigma(2) = 15, respectively, when comparing their performance indicators. The experiments show that these two optimization methods can be adapted to various application scenarios and can further reduce the hardware cost of satellite nodes.
A kind of new partitioning algorithm that solves the linear equation system with block cycle coefficient matrix is presented in this paper. The original problem is partitioned into a series of independent subproblems....
详细信息
A kind of new partitioning algorithm that solves the linear equation system with block cycle coefficient matrix is presented in this paper. The original problem is partitioned into a series of independent subproblems. Compared with the original problem, the dimension of all these subproblems are vary small. This point ensures that it have a better conditioning and give smaller round-off errors. More importantly, the technique leads to a higher efficiency of computation.
Piracy on the high seas is a problem of world-wide concern. In response to this threat, the US Navy has developed a visualization tool known as the Pirate Attack Risk Surface (PARS) that integrates intelligence data, ...
详细信息
ISBN:
(纸本)9780982443859
Piracy on the high seas is a problem of world-wide concern. In response to this threat, the US Navy has developed a visualization tool known as the Pirate Attack Risk Surface (PARS) that integrates intelligence data, commercial shipping routes, and meteorological and oceanographic (METOC) information to predict regions where pirates may be present and where they may strike next. This paper proposes an algorithmic augmentation or add-on to PARS that allocates interdiction and surveillance assets so as to minimize the likelihood of a successful pirate attack over a fixed planning horizon. This augmentation, viewed as a tool for human planners, can be mapped closely to the decision support layer of the Battlespace on Demand (BonD) framework [32]. Our solution approach decomposes this NPhard optimization problem into two sequential phases. In Phase I, we solve the problem of allocating only the interdiction assets, such that regions with high cumulative probability of attack over the planning horizon are maximally covered. In Phase II, we solve the surveillance problem, where the area not covered by interdiction assets is partitioned into non-overlapping search regions (e.g., rectangular boxes) and assigned to a set of surveillance assets to maximize the cumulative detection probability over the planning horizon. In order to overcome the curse of dimensionality associated with Dynamic Programming (DP), we propose a Gauss-Seidel algorithm coupled with a rollout strategy for the interdiction problem. For the surveillance problem, we propose a partitioning algorithm coupled with an asymmetric assignment algorithm for allocating assets to the partitioned regions. Once the surveillance assets are assigned to search regions, the search path for each asset is determined based on a specific search strategy. The proposed algorithms are illustrated using a hypothetical scenario for conducting counterpiracy operations in a given Area of Responsibility (AOR).
暂无评论