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

Iranian Conference on Electrical Engineering

作者： Zahra Rezazadeh Dadmehr Rahbari Mohsen Nickray Department of Computer Engineering and Information Technology University of Qom Qom Iran

Internet of Things (IoT) devices are growing rapidly, which itself produces a lot of data and someone must receive online responses. A typical program of the IoT consists of a set of modules that work together and interconnect. These modules typically run on cloud data centers. Fog computing designed to run these modules near the devices to minimize the response time and also to prevent large and in some eases unnecessary data transfers to the cloud. One of the significant challenges in resource management techniques is determined which modules should be placed on the fog device of the analytics applications to minimize latency and maximize efficiency. This research has focused on module placement, using simulated annealing algorithm, to find the appropriate device for the modules in a fog computing. The results show%75 cost reduction,%50 reduction of delay, and up to%10 energy conception improvement.

关键词： Fog computing Resource management Simulated annealing Health care module placement

来源：评论

学校读者我要写书评

暂无评论

Comparative study of meta-heuristic 3D floorplanning algorithms

引用

NEUROCOMPUTING 2015年第PartA期150卷 67-81页

作者： Cuesta-Infante, Alfredo Colmenar, J. Manuel Bankovic, Zorana Risco-Martin, Jose L. Zapater, Marina Hidalgo, J. Ignacio Ayala, Jose L. Moya, Jose M. CES Felipe II Madrid Spain Univ Complutense Madrid E-28040 Madrid Spain Univ Politecn Madrid E-28040 Madrid Spain

Constant necessity of improving performance has brought the invention of 3D chips. The improvement is achieved due to the reduction of wire length, which results in decreased interconnection delay. However, 3D stacks have less heat dissipation due to the inner layers, which leads to increased temperature and the appearance of hot spots. This problem can be mitigated through appropriate floorplanning. For this reason, in this work we present and compare five different solutions for floorplanning of 3D chips. Each solution uses a different representation, and all are based on meta-heuristic algorithms, namely three of them are based on simulated annealing, while two other are based on evolutionary algorithms. The results show great capability of all the solutions in optimizing temperature and wire length, as they all exhibit significant improvements comparing to the benchmark floorplans. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Floorplan module placement Meta-heuristic search

来源：评论

学校读者我要写书评

暂无评论

Task offloading in mobile fog computing by classification and regression tree

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2020年第1期13卷 104-122页

作者： Rahbari, Dadmehr Nickray, Mohsen Univ Qom Dept Comp Engn & Informat Technol Alghadir Ave Qom Iran

Fog computing (FC) as an extension of cloud computing provides a lot of smart devices at the network edge, which can store and process data near end users. Because FC reduces latency and power consumption, it is suitable for the Internet of Things (IoT) applications as healthcare, vehicles, and smart cities. In FC, the mobile devices (MDs) can offload their heavy tasks to fog devices (FDs). The selection of best FD for offloading has serious challenges in the time and energy. In this paper, we present a module placement method by Classification and regression tree Algorithm (MPCA). We select the best FDs for modules by MPCA. Initially, the power consumption of MDs are checked, if this value is greater than Wi-Fi's power consumption, then offloading will be done. The MPCA's decision parameters for selecting the best FD include authentication, confidentiality, integrity, availability, capacity, speed, and cost. To optimize MPCA, we analyze and apply the probability of network's resource utilization in the module offloading. This method is called by (MPMCP). To evaluate our proposed approach, we simulate MPCA and MPMCP algorithms and compare them with First Fit (FF) and local mobile processing methods in Cloud, FDs, and MDs. The results include the power consumption, response time and performance show that the proposed methods are superior to other compared methods.

关键词： Mobile fog computing module placement Task offloading Classification and regression tree Markov chain process

来源：评论

学校读者我要写书评

暂无评论

Design of Latency-Aware IoT modules in Heterogeneous Fog-Cloud Computing Networks

引用

Computers, Materials & Continua 2022年第3期70卷 6057-6072页

作者： Syed Rizwan Hassan Ishtiaq Ahmad Jamel Nebhen Ateeq Ur Rehman Muhammad Shafiq Jin-Ghoo Choi Department of Electrical Engineering The University of LahoreLahore54000Pakistan College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz UniversityAlkharj11942Saudi Arabia Department of Electrical Engineering Government College UniversityLahore54000Pakistan Department of Information and Communication Engineering Yeungnam UniversityGyeongsan38541Korea

The modern paradigm of the Internet of Things(IoT)has led to a significant increase in demand for latency-sensitive applications in Fog-based cloud ***,such applications cannot meet strict quality of service(QoS)*** large-scale deployment of IoT requires more effective use of network infrastructure to ensure QoS when processing big ***,cloud-centric IoT application deployment involves different modules running on terminal devices and cloud *** devices with different computing capabilities must process the data generated by the end device,so deploying latency-sensitive applications in a heterogeneous fog computing environment is a difficult *** addition,when there is an inconsistent connection delay between the fog and the terminal device,the deployment of such applications becomes more *** this article,we propose an algorithm that can effectively place application modules on network nodes while considering connection delay,processing power,and sensing data *** with traditional cloud computing deployment,we conducted simulations in iFogSim to confirm the effectiveness of the *** simulation results verify the effectiveness of the proposed algorithm in terms of end-to-end delay and network ***,latency and execution time is insensitive to the number of sensors.

关键词： IoT fog-cloud computing architecture module placement latency sensitive application resource aware placement

来源：评论

学校读者我要写书评

暂无评论

Optimal free-space management and routing-conscious dynamic placement for reconfigurable devices

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第5期56卷 673-680页

作者： Ahmadinia, Ali Bobda, Christophe Fekete, Sandor P. Teich, Juergen van der Veen, Jan C. Univ Edinburgh Sch Engn & Elect Edinburgh EH9 3JL Midlothian Scotland Kaiserslautern Univ Technol Dept Comp Sci Self Organizing Embedded Syst Grp D-67663 Kaiserslautern Germany Braunschweig Univ Technol Dept Math Optimizat D-38106 Braunschweig Germany Univ Erlangen Nurnberg Dept Comp Sci 12 D-91058 Erlangen Germany

We describe algorithmic results on two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of computational geometry, we derive a method that allows correct maintenance of free and occupied space of a set of n rectangular modules in time O(n log n);previous approaches needed a time of O(n(2)) for correct results and O(n) for heuristic results. We also show a matching lower bound of Omega(n log n), so our approach is optimal. We also show that finding an optimal feasible communication-conscious placement (which minimizes the total weighted Manhattan distance between the new module and existing demand points) can be computed with Theta(n log n). Both resulting algorithms are practically easy to implement and show convincing experimental behavior.

关键词： reconfigurable hardware field-programmable gate array ( FPGA) module placement free-space manager routing-conscious placement geometric optimization line-sweep technique optimal runtime lower bounds

来源：评论

学校读者我要写书评

暂无评论

ORIENTED ALIGNED RECTANGLE PACKING PROBLEM

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1992年第2期62卷 210-220页

作者： AGARWAL, PK SHING, MT NYU COURANT INST MATH SCINEW YORKNY 10012 USN POSTGRAD SCHDEPT COMP SCIMONTEREYCA 93943

Given a collection R of n (= M X N) rectangles, we wish to pack it into M rows and N columns as the elements of an M X N matrix. The height of a row is defined to be the height of the tallest rectangle in that row, and the width of a column is defined to be the width of the widest rectangle in that column. The cost of a packing is the sum of the heights of the M rows plus the sum of the widths of the N columns. The oriented aligned rectangle packing problem is to find a packing with the minimum cost. In this paper we present an O(n) time algorithm and an O(n2) time algorithm for two non-trivial special cases. We also show how to extend the algorithms to handle other cost functions.

关键词： DYNAMIC PROGRAMMING 2-DIMENSIONAL BIN-PACKING module placement

来源：评论

学校读者我要写书评

暂无评论

Integrated Droplet Routing and Defect Tolerance in the Synthesis of Digital Microfluidic Biochips

引用

ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS 2008年第3期4卷 1–24页

作者： Xu, Tao Chakrabarty, Krishnendu Duke Univ Dept Elect & Comp Engn Durham NC 27708 USA

Microfluidic biochips are revolutionizing high-throughput DNA sequencing, immunoassays, and clinical diagnostics. As high-throughput bioassays are mapped to digital microfluidic platforms, the need for design automation techniques is being increasingly felt. Moreover, as most applications of biochips are safety-critical in nature, defect tolerance is an essential system attribute. Several synthesis tools have recently been proposed for the automated design of biochips from the specifications of laboratory protocols. However, only a few of these tools address the problem of defect tolerance. In addition, most of these methods do not consider the problem of droplet routing in microfluidic arrays. These methods typically rely on postsynthesis droplet routing to implement biochemical protocols. Such an approach is not only time consuming, but also imposes an undue burden on the chip user. Postsynthesis droplet routing does not guarantee that feasible droplet pathways can be found for area-constrained biochip layouts;nonroutable fabricated biochips must be discarded. We present a synthesis tool that integrates defect tolerance and droplet routing in the design flow. Droplet routability, defined as the ease with which droplet pathways can be determined, is estimated and integrated in the synthesis procedure. Presynthesis and postsynthesis defect-tolerance methods are also presented. We use a large-scale protein assay as a case study to evaluate the proposed synthesis method.

关键词： Physical design automation module placement microfluidics biochips

来源：评论

学校读者我要写书评

暂无评论

Studying and developing a resource allocation algorithm in Fog computing

Studying and developing a resource allocation algorithm in F...

引用

International Conference on Advanced Computing and Applications (ACOMP)

作者： Nguyen Quang-Hung Truong Pham Thanh An Ho Chi Minh City Univ Technol VNU HCM Ho Chi Minh City Vietnam

ISBN: (纸本)9781538691861

Internet of Things (IoT) is becoming popular. Many IoT devices will bring huge data moving within a network infrastructure. Cloud has become so widespread that almost many business or end users are using private and/or public cloud. Cloud servers will be responsible for processing incoming data and sending them back after processing. As a result, the amount of data moving will be extremely large and processing of Big Data will gradually appear. Many enterprise companies included Cisco, Dell, Microsoft, Intel has pioneered Fog computing since 2015. In Fog computing, data will be scattered instead of concentrating data like the traditional Cloud computing. The main goal of this study is to propose a resource allocation algorithm to distribute modules of an IoT application to the entire network in Fog computing environment. This proposed algorithm must run successfully on a simulator. With different environments, the algorithm will allocate different modules depending on the configuration of each device. To evaluate the algorithm, this study uses the iFogSim toolkit, which extends from the CloudSim toolkit, for modeling and simulation of Fog computing environment. Current version of iFogSim is sufficient to be able to implement some criteria necessary for this study.

关键词： fog computing cloud computing module placement first fit algorithm

来源：评论

学校读者我要写书评

暂无评论

placement with symmetry constraints for analog layout design using TCG-S 05

Placement with symmetry constraints for analog layout design...

引用

10th Asia and South Pacific Design Automation Conference

作者： Lin, Jai-Ming Wu, Guang-Ming Chang, Yao-Wen Chuang, Jen-Hui Realtek Semicond Corp Hsinchu Taiwan

ISBN: (纸本)0780387368

In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization.

关键词： analogue circuits graph theory symmetry constraints analog layout design TCG-S device matching module placement transitive closure graph-sequence symmetry modules polynomial-time packing algorithm area utilization

来源：评论

学校读者我要写书评

暂无评论

IoT application modules placement in heterogeneous fog–cloud infrastructure

引用

International Journal of Information Technology (Singapore) 2021年第5期13卷 1975-1982页

作者： Arora, Upma Singh, Nipur Department of Computer Science Gurukul Kangri Vishwavidhyalaya Haridwar UK India

Due to the increasing demands of minimizing the delay for Internet of things (IoT) applications, cloud computing researchers are now moving towards the research in fog computing and edge computing area. Fog computing serves the purpose of bringing devices closer to the proximity of data centre by performing some specific possible tasks nearest to the vicinity of devices requiring the services and ultimately reduces the delay. Thus the complete infrastructure becomes combined fog–cloud in itself. Furthermore, Fog computing serves the need of running the IoT applications by placing the application modules on to the devices available in the said fog–cloud infrastructure. For this purpose, various module placement and scheduling approaches have been developed, but considering the heterogeneous and dynamic nature in the environment is the primary concern of our work. The purpose of this paper is to present the Heterogeneous Shortest module First (HSMF) Algorithm for placement of the modules of an application in the heterogeneous fog–cloud computing environment. Using this algorithm, we place heterogeneous modules on to the different Fog devices available in the network. The proposed approach is then compared to the available cloud-only and edge-ward application module placement approach. The results obtained from our presented framework clearly state improvement in the total execution time and total network usage. © 2021, Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： Fog–cloud computing Heterogeneous IoT application modules module placement Resource allocation Task scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：