Description: An Efficient and Effective Detailed Placement Algorithm
Global Swap
To identify a pair of cells that can be swapped to reduce wirelength (others are fixed).
2. Vertical Swap
Swap a cell with a nearby cell in the segment above or below.
3. Local Re-ordering
Re-order consecutive cells locally to reduce wirelength.
4. Single-Segment Clustering
Place cells optimally within a segment.
Platform: |
Size: 27261 |
Author:Hsieh |
Hits:
Description: An Efficient and Effective Detailed Placement Algorithm
Global Swap
To identify a pair of cells that can be swapped to reduce wirelength (others are fixed).
2. Vertical Swap
Swap a cell with a nearby cell in the segment above or below.
3. Local Re-ordering
Re-order consecutive cells locally to reduce wirelength.
4. Single-Segment Clustering
Place cells optimally within a segment.
Platform: |
Size: 26624 |
Author:Hsieh |
Hits:
Description: In a Wireless Mesh Network (WMN), the traffic is
aggregated and forwarded towards the gateways. Strategically
placing and connecting the gateways to the wired backbone is
critical to the management and efficient operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios. -In a Wireless Mesh Network (WMN), the traffic is
aggregated and forwarded towards the gateways. Strategically
placing and connecting the gateways to the wired backbone is
critical to the management and efficient operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios. Platform: |
Size: 240640 |
Author:Dinh Huu Nghia |
Hits:
Description: 本文给出了分布式存储系统中副本放置的一个算法kinesis，大大提高了系统的负载均衡-In this paper, a copy of the distributed storage system placed on an algorithm kinesis, greatly improving the load balance Platform: |
Size: 625664 |
Author:Joey |
Hits:
Description: 论文 在使用无线传感器网络进行目标检测时,如何布置尽可能少的传感器节点而同时实现高的正确检测概率和
低的误警率,是关键问题之一。采用数据融合技术,能实现传感器节点之间的协同,从而大幅提高目标检测精度。提
出了用于目标检测的精度模型,分析了数据融合半径与传感器节点密度之间的关系,设计聚类方法将目标点组织成布
置单元,从高密度单元到低密度单元布置传感器节点覆盖目标区域。仿真结果表明,算法在保证检测精度的同时能有
效减少所使用的传感器节点数目。
-
Sensor placement is a key issue in target detection,placing smaller sensors to achieve high detection accuracy
which presented as a specific high detection probability and a low false alarm rate is very important.Data fusion based
collaboration between sensors can boost the level of accuracy in general.In this paper,the accuracy model and the rela-
tionship between the fusion radius and density of sensors were analyzed a quality-threshold clustering algorithm was
employed to organize the surveillance locations into placement units,place sensors in them from the intensive to sparse
one.Simulation results show that this placement algorithm can significantly reduce the total number of sensors with
guaranteed accuracy. Platform: |
Size: 238592 |
Author:子木 |
Hits:
Description: 针对分布式媒体服务系统中的副本放置问题，从优化节点间的传输代价出发，提出一种基于全局信息的启发式副本放置算法——
Zero2min，与现有算法相比，节省传输代价10 ~36 。根据Zero2min 算法的思路，给出媒体内容逐渐增加情况下的一种动态放置方法，仿真结果表明，其代价小于Max2min。-Aiming at the problem of replica placement in a distributed media system to reduce the cost of transferring data among nodes, this paper
proposes an heuristic replica placement algorithm——Zero2min based on global information, compared with common algorithm, its cost is reduced
by 10 ~36 . It further proposes a method to place the media data when the data is imported into the system. Simulation results show that its cost is less than Max2min. Platform: |
Size: 1215488 |
Author:compiler |
Hits:
Description: DG Placement optimization in 33-bus and 69-bus distribution power systems using Imperialistic Competition optimization algorithm. Platform: |
Size: 52224 |
Author:arman9069
|
Hits:
Description: This paper presents a new method to solve the network reconfiguration problem in the presence of distributed generation (DG) with an objective of minimizing real power loss and improving voltage profile in distribution system. A meta heuristic Harmony Search Algorithm (HSA) is used to simultaneously reconfigure and identify the optimal locations for installation of DG units in a distribution network. Sensitivity analysis is used to identify optimal locations for installation of DG units. Different scenarios of DG placement and reconfiguration of network are considered to study the performance of the proposed method. The constraints of voltage and branch current carrying capacity are included in the uation of the objective function. The method has been tested on 33-bus and 69-bus radial distribution systems at three different load levels to demonstrate the performance and effectiveness of the proposed method. The results obtained are encouraging. (2014-11-17 Platform: |
Size: 58368 |
Author:salameh |
Hits:
Search - Placement Algorithm