检索结果-内蒙古大学图书馆

International Conference on Networked Sensing Systems

作者： Andreas Lachenmann Venkatesh Bommasandra Sadasiva Frank Siegemund European Microsoft Innovation Center GmbH

ISBN: (纸本)9781424463138;9781424463145

In sensor network applications that do complex in-network processing, each node may perform its own task rather than all nodes executing the same aggregation function. To support the development of such applications, this paper introduces a network-level programming model that is based on the data flow in the application. When deploying the application, such a high-level model has to be mapped to nodes in the specific network topology. This paper presents an operator placement algorithm that tries to find an optimal mapping that minimizes data transmission throughout the network.

关键词： Wireless sensor network Operator placement Data flow data flow Wireless sensor networks placement algorithm Ganglia Complex Complexes trees (mathematics) Network topology

来源：评论

学校读者我要写书评

暂无评论

Intelligent Merging Online Task placement algorithm for Partial Reconfigurable Systems 08

Intelligent Merging Online Task Placement Algorithm for Part...

引用

2008 Design, Automation and Test in Europe (DATE 2008), vol.3

作者： Thomas Marconi Yi Lu Koen Bertels Georgi Gaydadjiev TU Delft The Netherlands

ISBN: (纸本)9783981080131

Speed and placement quality are two very important attributes of a good online placement algorithm, because the time taken by the algorithm is considered as an overhead to the application overall execution time. To solve this problem, we propose three techniques: Merging Only if Needed (MON), Partial Merging (PM), and Direct Combine (DC). Our IM (intelligent merging) algorithm uses dynamically these three techniques to exploit their specific advantages. IM outperforms Bazargan's algorithm as it has placement quality within 0.89% but is 1.72 times faster.

关键词： merger placement algorithm execution time algorithms configurability direct current Instant messaging

来源：评论

学校读者我要写书评

暂无评论

Novel Meter placement algorithm for Enhanced Accuracy of Distribution System State Estimation

Novel Meter Placement Algorithm for Enhanced Accuracy of Dis...

引用

IEEE Power and Energy Society General Meeting

作者： N. Nusrat M. Irving G. Taylor Brunel Institute of Power System Brunel University Uxbridge London United Kingdom.

ISBN: (纸本)9781467327275

As distribution networks are turning into active systems, enhanced observability and continuous monitoring becomes essential for effective management and control. Distribution networks require further instrumentation with sensors and meters to monitor the network in the control room close to real time. The metered data will be fed into the state estimation tool which will compute all the states of the network. The cost of this meter placement is a major issue as the network operator will have to engage in a massive investment. In this paper we propose a stochastic meter placement algorithm to reduce the voltage magnitude estimation errors, along with improving the robustness of the state estimation problem, via minimum measurement placements. The algorithm exploits the scaling property of the singular values obtained from the singular value decomposition of a matrix for reduced computation.

关键词： Distribution Network State Estimation Weighted Least Squares Meter placement Singular Value Decomposition Singular Values State estimation placement algorithm Network operators Power grids active system CONTROL ROOM Observability dispensing system Singular value decomposition Continuous monitoring

来源：评论

学校读者我要写书评

暂无评论

Online placement and scheduling algorithm for reconfigurable cells in self-repairable field-programmable gate array systems

引用

COMPUTERS & ELECTRICAL ENGINEERING 2018年 67卷 836-850页

作者： Pradeep, C. Eapen, Madhuri Elsa Joby, P. P. Kizhakkethottam, Jubilant J. Mar Baselios Christian Coll Engn & Technol Peermade Kerala India MBC Coll Engn & Technol Ctr Res Initiat Sci & Engn Peermade Kerala India Saintgits Coll Engn Kottayam Kerala India

Most of the high-end very-large-scale integration- (VLSI-) based systems use a field programmable gate array (FPGA) as their core component. As the complexity of systems increases, the chances of fault occurrence also increase. For systems that are part of safety critical and mission-critical applications, even a single fault can result in entire mission failure. Fault tolerance techniques need to be installed in such systems to ensure reliable, prolonged operation in spite of fault occurrence. The level of fault tolerance exhibited in nature is very remarkable. Scientists are trying to reach that level of fault tolerance in the electronics world as well, which is not always completely acquirable. Basically, fault tolerance in an FPGA is achieved by the use of spare modules, which leads to high area overheads and routing complexity. The higher the number of faults to be handled, the greater the number of spares that will be required. Partial reconfiguration has always been a proven technique to improve the efficiency and flexibility of FPGAs. This paper discusses a multiple-fault repair algorithm for FPGA-based reconfigurable systems, using dynamic runtime partial reconfiguration, in order to relocate faulty modules. Three variants or cases of repair using the algorithm are discussed and demonstrated, namely, placement with the best resource utilization, placement with the least routing overhead, and a case to generate continuous free space for the relocation of a faulty module. The main advantage of the algorithm is its flexibility, which means that it can be used according to user demands and system lifetime requirements. Maximum care is taken to eliminate chances of an un-repaired fault or a repair that degrades the performance of the system. The algorithm can handle multiple permanent faults with the best resource utilization and the least overheads. The performance of the algorithm is analyzed quantitatively, while a comparison is made with some previous studie

关键词： Relocation Reconfigurable modules Self-repair placement algorithm FPGA Dynamic runtime partial reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Research on the Multi-tenant placement Genetic algorithm Based on Eucalyptus Platform 12

Research on the Multi-tenant Placement Genetic Algorithm Bas...

引用

12th International Conference on Computational Intelligence and Security (CIS)

作者： Wang, Feng Li, Jun Huai Zhang, Jing Huang, Qiang Xian Univ Technol Fac Comp Sci & Engn Xian Peoples R China Xian Univ Technol Inst Water Resources & Hydroelect Engn Xian Peoples R China

ISBN: (纸本)9781509048403

This paper describes a database system with tenant technology on Eucalyptus platform for a rural drinking water supply system. This database use a sharing model to store data and a tenant placement algorithm to properly put tenants in virtual machine therefore it can ensure the service quality for the tenants with the minimum use of hardware resources. The experiment results show that the tenant placement algorithm is feasible and effective.

关键词： Eucalyptus Multi-tenant placement algorithm

来源：评论

学校读者我要写书评

暂无评论

An FPGA fast combination placement optimization algorithm research

An FPGA fast combination placement optimization algorithm re...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Kang Wang Ning Xu Kai Hu School of Information Engineering Wuhan University of Technology The 58th Research Institute CETC

With the scale of FPGA increasingly becoming larger than before, how to spend less time to reduce the total length of the interconnections to ensure the quality of the placement algorithm needs to be

ISBN: (纸本)9781467389808

With the scale of FPGA increasingly becoming larger than before, how to spend less time to reduce the total length of the interconnections to ensure the quality of the placement algorithm needs to be

关键词： placement Quadratic analytic algorithm Low temperature simulated annealing Local optimization local optimization placement placement algorithm fast speed Field programmable gate arrays Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

MAP-MIND: An Offline algorithm for Optimizing Game Engine Module placement in Cloud Gaming

引用

IEEE ACCESS 2024年 12卷 44905-44921页

作者： Lotfimahyari, Iman De Giovanni, Luigi Gadia, Davide Giaccone, Paolo Maggiorini, Dario Palazzi, Claudio E. Politecn Torino Dept Elect & Telecommun I-10129 Turin Italy Univ Padua Dept Math I-35131 Padua Italy Univ Milan Dept Comp Sci I-20133 Milan Italy

Online gaming has seen a significant surge in popularity, becoming a dominant form of entertainment worldwide. This growth has necessitated the evolution of game servers from centralized to distributed models, leading to the emergence of distributed game engines. These engines allow for the distribution of game engine modules (GEMs) across multiple servers, improving scalability and performance. However, this distribution presents a new challenge: the game engine module placement problem. This problem involves strategically placing GEMs to maximize the number of accepted placement requests while minimizing the delay experienced by players, a critical factor in enhancing the gaming experience. The problem can be formulated as an Integer Linear Programming (ILP) model, which provides an optimal solution but suffers from high computational complexity, making it impractical for real-world applications. To address this challenge, this paper introduces two novel heuristic algorithms, MAP-MIND and MAP-MIND*. The MAP-MIND algorithm demonstrates superior performance, achieving near-optimal delay and more than 92% GEM request acceptance in the worst heterogeneous scenarios. The MAP-MIND* algorithm, while slightly under-performing MAP-MIND in terms of delay, proves to be significantly faster, making it a viable alternative for real-world applications with equal GEM request acceptance. The trade-off between the two algorithms offers a flexible approach to GEM placement, balancing performance and computational efficiency.

关键词： Cloud gaming distributed game engines placement algorithm

来源：评论

学校读者我要写书评

暂无评论

TerrorClassify: An algorithm for Terror Groups placement Into Hierarchical Categories of Casualties and Consequences

引用

JOURNAL OF APPLIED SECURITY RESEARCH 2020年第4期15卷 568-579页

作者： Atsa'am, Donald Douglas Wario, Ruth Okpo, Fiona Emokpaire Univ Free State Fac Nat & Agr Sci Dept Comp Sci & Informat ZA-9866 Qwaqwa South Africa Univ Agr Dept Math Stat & Comp Sci Makurdi Nigeria

This study developed an algorithm, TerrorClassify, which places terror organizations into hierarchical categories of casualties and consequences. A previous study proposed a method of categorizing terrorists into four classes based on the extent of havoc caused by individual terror groups. The classes include low-casualty, medium-consequence terror groups;medium-casualty, high-consequence terror groups;high-casualty, low-consequence terror groups;and higher-casualty, low-consequence terror groups. In this research, an algorithm was designed to show the procedures to be followed in placing terror groups into the four classes using the records in the global terrorism database. The algorithm can be implemented with any programming language.

关键词： Terrorism categories casualties and consequences placement algorithm global terrorism database hierarchical clusters

来源：评论

学校读者我要写书评

暂无评论

Propagation Modeling and placement algorithms for Wireless Sensor Networks

Propagation Modeling and Placement Algorithms for Wireless S...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Luntovskyy, Andriy Vasyutynskyy, Volodymyr Kabitzsch, Klaus BA Dresden Univ Cooperat Educ Heidepk Str 8 D-01099 Dresden Germany Tech Univ Dresden D-01062 Dresden Germany

ISBN: (纸本)9781424463916

The energy efficiency is critical for application of wireless sensor networks, since it is a main precondition for their long-live functionality, small modification costs and reliability. This paper deals with the placement of wireless nodes based on the modeling of radio wave propagation. The methods are realized in a planning tool CANDY Wireless Site Finder that provides optimized topologies of wireless networks under considering of transmitted power, frequencies, propagation environments (in-door/out-door) and obstacles given in CAD-compatible formats. The tool is integrated in the framework of other CANDY tools aimed to efficient planning of heterogeneous wired and wireless networks.

关键词： CAD-compatible format CANDY wireless site finder tool energy efficiency long-live functionality modification cost network planning network topology placement algorithm planning tool propagation modeling radio wave propagation radiowave propagation reliability telecommunication network planning telecommunication network reliability telecommunication network topology wireless node wireless sensor network wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

KOAN ANAGRAM-II - NEW TOOLS FOR DEVICE-LEVEL ANALOG placement AND ROUTING

引用

IEEE JOURNAL OF SOLID-STATE CIRCUITS 1991年第3期26卷 330-342页

作者： COHN, JM GARROD, DJ RUTENBAR, RA CARLEY, LR Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA

This paper describes KOAN and ANAGRAM II, new tools for device-level analog placement and routing. A block place-and-route style from macrocell digital IC's has recently emerged as a viable methodology for the automatic layout of custom analog cells. In this macrocell style, parameterized module generators produce geometry for individual devices, a placer arranges these devices, and a router embeds the wiring. However, analog layout tools that merely apply known digital macrocell techniques fall far short of achieving the density and performance of handcrafted analog cells. KOAN and ANAGRAM II differ from existing approaches by employing general algorithmic techniques to find critical device-level layout optimizations rather than relying on a large library of fixed-topology module generators. New placement algorithms implemented in KOAN handle complex layout symmetries, dynamic merging and abutment of individual devices, and flexible generation of wells and bulk contacts. New routing algorithms implemented in ANAGRAM II handle arbitrary gridless design rules in addition to over-the-device, crosstalk avoiding, mirror-symmetric, and self-symmetric wiring. Examples of CMOS and BiCMOS analog cell layouts produced by these tools are presented.

关键词： placement WELLS EQUIPMENT Complementary Metal Oxide Semiconductor cell layout Network routing layouts placement algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：