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

placement AND ROUTING TOOLS FOR THE TRIPTYCH FPGA

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 1995年第4期3卷 473-482页

作者： EBELING, C MCMURCHIE, L HAUCK, SA BURNS, S Dept. of Comput. Sci. & Eng. Washington Univ. Seattle WA USA

Field-programmable gate arrays (FPGA's) are becoming an increasingly important implementation medium for digital logic, One of the most important keys to using FPGA's effectively is a complete, automated software system for blahmapping onto the FPGA architecture, Unfortunately, many of the tools necessary require different techniques than traditional circuit implementation options, and these techniques are often developed specifically for only a single FPGA architecture, In this paper me describe automatic mapping tools for Triptych [15], an FPGA architecture with improved logic density and performance over commercial FPGA's, These tools include a simulated-annealing placement algorithm that handles the routability issues of fine-grained FPGA's, and an architecture-adaptive routing algorithm that can easily be retargeted to other FPGA's. We also describe extensions to these algorithms for mapping asynchronous circuits to Montage, the first FPGA architecture to completely support asynchronous and synchronous interface applications.

关键词： placement ARCHITECTURE Building construction EQUIPMENT Field programmable gate arrays Software systems Asynchronous placement algorithm

来源：评论

学校读者我要写书评

暂无评论

A STANDARD MODEL OF THE placement PROBLEM AIMED AT RESOLVING A CUTTING STOCK PROBLEM

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 1992年第6期28卷 1406-1415页

作者： DMITROVIC, B WOLF, D HUSON, RHC UNIV NANCY INST NATL POLYTECH LORRAINEVANDOEUVRE NANCYFRANCE CTR RECU & AUTOMAT CNRSURA 821NANCYFRANCE

Traditionally, cutting stock problems have been resolved using linear programming or heuristic algorithms. To deal with a new class of problems, where dimensions of objects to be cut are unknown beforehand, we are proposing a cutting optimization technique. This solution has been applied to the wood industry. It is based on a two-level hierarchical structure: a placement algorithm assigned to a given plank to optimize the cutting a process control procedure permitting production of a requested list of pieces that is the best on a limited horizon. This paper is designed to model the placement algorithm in order to formalize the control strategy. In particular, we propose a method for connecting a system of discrete events to the more classical theory of continuous sampled systems. Thanks to this model and under the given hypothesis, we establish an optimal control policy.

关键词： control strategy placement self-harm Cutting wood industry Cuttings Debris PLANKS placement algorithm bin packing Standard model

来源：评论

学校读者我要写书评

暂无评论

Docker Layer placement for On-Demand Provisioning of Services on Edge Clouds

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2018年第3期15卷 1161-1174页

作者： Smet, Piet Dhoedt, Bart Simoens, Pieter Univ Ghent Imec Dept Informat Technol IDLab B-9052 Ghent Belgium

Driven by the increasing popularity of the microservice architecture, we see an increase in services with unknown demand pattern located in the edge network. Pre-deployed instances of such services would be idle most of the time, which is economically infeasible. Also, the finite storage capacity limits the amount of deployed instances we can offer. Instead, we present an on-demand deployment scheme using the Docker platform. In Docker, service images consist of layers, each layer adding specific functionality. This allows different services to reuse layers, avoiding cluttering the storages with redundant replicas. We propose a layer placement method which allows users to connect to a server, retrieve all necessary layers-possibly from multiple locations- and deploy an instance of the requested service within the desired response time. We search for the best layer placement which maximizes the satisfied demand given the storage and delay constraints. We developed an iterative optimization heuristic which is less exhaustive by dividing the global problem in smaller subproblems. Our simulation results show that our heuristic is able to solve the problem with less system resources. Last, we present interesting use-cases to use this approach in real-life scenarios.

关键词： Service-centric on-demand placement algorithm long-tail services docker

来源：评论

学校读者我要写书评

暂无评论

State and Parameter Estimation in Distributed Constrained Systems. 2. GA-EKF Based Sensor placement for a Water Gas Shift Reactor

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2017年第1期56卷 216-224页

作者： Mobed, Parham Munusamy, Sudhakar Bhattacharyya, Debangsu Rengaswamy, Raghunathan Texas Tech Univ Dept Chem Engn Lubbock TX 79409 USA West Virginia Univ Dept Chem Engn Morgantown WV 26506 USA Indian Inst Technol Dept Chem Engn Madras 600036 Tamil Nadu India

Growing complexity of processes necessitates the use of information from sensors along with first-principles mathematical models to ensure safe and optimal operations. Use of sensors in complex processes requires identifying optimal location of sensors that can maximize information from a process. Classical sensor placement approaches for nonlinear systems that use state estimation schemes usually incorporate linearized models around the steady-state operating point. However, such approaches face difficulties when abnormalities or disturbances drift the system away from the normal operating point. Therefore, use of models that can appropriately track the behavior of the system in the sensor placement framework are of interest. However, the computational complexity of the detailed models makes such approaches intractable. In this work, we develop a sensor placement framework that combines genetic algorithms and the extended Kalman filter to obtain optimal sensor locations. Within this framework, we have investigated the applicability of simplified models by comparing the results of sensor placement for simplified and detailed models. The effect of the simplified models on the estimation accuracy and the optimal sensor network is further evaluated by analyzing the sensitivity to different parameters. Results show that an appropriate simplified model can not only significantly reduce the computational time of the sensor placement algorithm, but also yield a senor network with similar characteristics as the sensor network obtained using the detailed model. Further, information loss in using simplified models in sensor placement may be partially compensated through tuning of the filter parameters, resulting in acceptable, optimal sensor placement solutions.

关键词： sensor placement Sensor networks placement algorithm Parameter estimation Sensors filter parameters

来源：评论

学校读者我要写书评

暂无评论

Optimal well placement in heterogeneous reservoirs through semianalytic modeling

引用

SPE JOURNAL 2005年第3期10卷 286-296页

作者： Hazlett, RD Babu, DK Potential Research Solutions

The need for accurate well-productivity models with arbitrary well trajectories spurred a revival in analytic solution methodology for fluid transport problems. Analytic formulations often depict single-phase flow throughout the reservoir. The Babu-Odeh horizontal-well solution for a box-shaped reservoir with spatially invariant properties is generalized here to allow closed-form solutions for heterogeneous media. A reservoir is decomposed into interacting regions, each with its own reservoir properties and associated analytic potential flow solution. Using established boundary element techniques, pressure and flux continuity are imposed at selected interface points to solve for the steady material exchange between regions. Constant pressure and zero flux features (fractures and barriers) are easily entertained at region boundaries. The 2D, pseudosteady-state solution for heterogeneous media is embedded within a reservoir performance feedback loop of a powerful gradient search method to produce a robust optimal infill well placement algorithm. Utilizing this approach, new criteria are developed concerning optimal placement of vertical wells for primary production with respect to heterogeneity, asymmetry, and anisotropy. The semianalytic method has been extended to 3D flows to serve as a compute engine for a new generation of reservoir management and optimization tools.

关键词： placement reservoirs Boundary Elements RESERVOIR HETEROGENEITY Search methods placement algorithm Primary production Optimal WELLS region boundary Reservoir management Heterogeneous single-phase flow Reservoir characteristics

来源：评论

学校读者我要写书评

暂无评论

A Detailed Routing-aware Detailed placement Technique

A Detailed Routing-aware Detailed Placement Technique

引用

IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Tabrizi, Aysa Fakheri Darav, Nima Karimpour Rakai, Logan Kennings, Andrew Swartz, William Behjat, Laleh Univ Calgary Dept Elect & Comp Engn Calgary AB T2N 1N4 Canada Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Univ Texas Dallas Dept Elect Engn Richardson TX 75083 USA

ISBN: (纸本)9781479987191

In this paper we propose a detailed placement algorithm targeting detailed routability for designs at or smaller than 22nm. The sheer number and complexity of routing design rules at these feature sizes preclude direct incorporation of detailed routing rules into a placement algorithm. However, using the detail routing information to guide the placement can significantly reduce the overall design time and improve the performance of the circuit. Our proposed detailed routing-aware detailed placement (DrDp) is developed as an add-on to the detailed placement process to improve detailed routability in a relatively short runtime. The proposed technique is added to the code obtained from one of the top three teams in the ISPD 2014 detailed routing-driven placement contest and tested on ISPD 2014 benchmark suite. Numerical results show that the proposed technique can improve the detailed routing quality with no significant change in detailed placement score, total wirelength or runtime.

关键词： integrated circuit layout network routing detailed placement score placement algorithm routing aware detailed placement technique routing rules total wire length algorithm design and analysis Benchmark testing Pins Routing Runtime Time complexity Network routing placement algorithm Runtime algorithm design and analysis Benchmark testing integrated circuit layout complexity classes PIN Bone Nails placement ISPD gene

来源：评论

学校读者我要写书评

暂无评论

Research on the placement Method of UAV Base Stations for Dynamic Users 17

Research on the Placement Method of UAV Base Stations for Dy...

引用

17th IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS)

作者： Ozasa, Masanori Gia Khanh Tran Sakaguchi, Kei Tokyo Inst Technol Dept Elect & Elect Engn Tokyo Japan

ISBN: (纸本)9781665401203

The high density of temporary hotspots will result in a significant reduction in data rates per user. In addition, when base stations are no longer functional in the disaster area, it is necessary to develop wireless infrastructure as soon as possible. To address this situation, we focus on UAVs (Unmanned Aerial Vehicles) equipped with wireless communication infrastructure to provide services. Building a wireless network with mobility, UAVs can provide high data rates for ever-changing user distribution. In this paper, for dynamic user distributions, which have not been considered much so far, we identify issues due to differences from static user distributions and propose methods to solve them. This paper reports on the study of UAV placement method from the viewpoint of data rate and power consumption.

关键词： UAV base station Dynamic user distributions Power consumption placement algorithm K-means method

来源：评论

学校读者我要写书评

暂无评论

A Fast Non-Uniform Knots placement Method for B-Spline Fitting

A Fast Non-Uniform Knots Placement Method for B-Spline Fitti...

引用

IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)

作者： Tjahjowidodo, T. Dung, V. T. Han, M. L. Nanyang Technol Univ Sch Mech & Aerosp Engn 50 Nanyang Ave Singapore 639798 Singapore ARTC Singapore 637143 Singapore

ISBN: (纸本)9781467391078

A two-step fast non-uniform knot placement algorithm applicable for noisy data is presented in this paper. The algorithm is started by evaluating the second derivative of the sampled data and, subsequently, by using the half-split approach, the best piecewise linear function is fitted to the computed derivative. In the second step, the fitted functions are adjusted to define the final knot for the B-spline fitting. The proposed method is subsequently validated on an experiment data with a known nominal surface. It is demonstrated that the proposed method offers a fast computational time that allow for online surface estimation.

关键词： splines (mathematics) Experimental data Knots spline fitting placement algorithm Data sampling noisy data Fasting MACHINE SHOP PRACTICE Knot Theory Nautical mile per hour knots placement

来源：评论

学校读者我要写书评

暂无评论

Redundant Virtual Machine placement for Fault-tolerant Consolidated Server Clusters

Redundant Virtual Machine Placement for Fault-tolerant Conso...

引用

2010 IEEE-IFIP Network Operations and Management Symposium

作者： Machida, Fumio Kawato, Masahiro Maeno, Yoshiharu NEC Corp Ltd Serv Platforms Res Labs Nakahara Ku Kanagawa 2118666 Japan

ISBN: (纸本)9781424453672

Consolidated server systems using server virtualization involves serious risks of host server failures that induce unexpected downs of all hosted virtual machines and applications. To protect applications requiring high-availability from unpredictable host server failures, redundant configuration using virtual machines can be an effective countermeasure. This paper presents a virtual machine placement method for establishing a redundant configuration against host server failures with less host servers. The proposed method estimates the requisite minimum number of virtual machines according to the performance requirements of application services and decides an optimum virtual machine placement so that minimum configurations survive at any k host server failures. The evaluation results clarify that the proposed method achieves requested fault-tolerance level with less number of hosting servers compared to the conventional N+M redundant configuration approach.

关键词： Virtual Machine Fault-tolerant Redundant Configuration placement algorithm

来源：评论

学校读者我要写书评

暂无评论

Signaling Storm Mitigation by Geographically Distributed C-plane NF placement and Routing 10

Signaling Storm Mitigation by Geographically Distributed C-p...

引用

10th International Conference on Network Softwarization (NetSoft)

作者： Kurata, Masayuki Ikami, Akio Itahara, Sohei Suzuki, Masaki KDDI Res Inc Fujimino Japan

ISBN: (纸本)9798350369588;9798350369595

In mobile networks, network performance can be severely degraded by a signaling storm, a phenomenon characterized by control plane (C-plane) congestion due to excessive signaling messages. This paper identifies congestion of inter-site links and overload of a specific NF instance as factors leading to a signaling storm. To address these problems, we propose a combined placement and routing algorithm approach. Firstly, our joint placement and routing algorithms perform geographically distributed deployment of C-plane NF instances according to the fluctuating mobility patterns of each user equipment (UE). Secondly, our routing algorithm identifies an appropriate C-plane NF instance to manage each UE, considering both the utilization rate and the number of contexts possessed by each NF instance. Extensive simulation evaluations demonstrate that our proposed methods significantly reduce inter-site signaling messages compared to existing placement scenarios. Furthermore, the dispersion of C-plane NF instances' utilization rate is reduced, enhancing network performance and efficiency.

关键词： Signaling storm Mobile computing Distributed computing placement algorithm Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：