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

26th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

作者： Zhang, Mengchi Alawneh, Ahmad Rogers, Timothy G. Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450383172

Programmable accelerators aim to provide the flexibility of traditional CPUs with significantly improved performance. A wellknown impediment to the widespread adoption of programmable accelerators, like CPUs, is the software engineering overhead involved in porting the code. Existing support for C+ + on GPUs allows programmers to port polymorphic code with little effort. However, the overhead from the virtual functions introduced by polymorphic code has not been well studied or mitigated on CPUs. To alleviate the performance cost of virtual functions, we propose two novel techniques that determine an object's type based only on the object's address, without accessing the object's embedded virtual table pointer. The first technique, Coordinated Object Allocation and function Lookup (COAL), is a software-only solution that allocates objects by type and uses the compiler and runtime to find the object's vTable without accessing an embedded pointer. COAL improves performance by 80%, 47%, and 6% over contemporary CUDA, prior research, and our newly-proposed type-based allocator, respectively. The second solution, TypePointer, introduces a hardware modification that allows unused bits in the object pointer to encode the object's type, improving performance by 90%, 56%, and 12% over CUDA, prior work, and our new allocator. TypePointer can also be used with the default CUDA allocator to achieve an 18% performance improvement without modifying object allocation.

关键词： GPU virtual functions Object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Orchestrating virtual Network functions in Wireless-Powered IoT Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第17期9卷 15874-15885页

作者： Ren, Honglin Chin, Kwan-Wu He, Tengjiao Univ Wollongong Sch Elect Comp & Telecommun Engn Wollongong NSW 2522 Australia Jinan Univ Coll Informat Sci & Technol Guangzhou 510640 Peoples R China

virtualization of devices operating in Internet of Things (IoT) networks allows them to host functions or tasks from different users;these devices can thus execute multiple on demand sensing and data processing services concurrently. Devices, however, have limited energy and operational lifetime. To this end, this article considers supporting virtual network functions (VNFs) in a radio-frequency (RF)-charging network with a hybrid access point (HAP). Our aim is to minimize the energy used by the HAP to power devices in order to support deployed VNFs. It outlines a mixed-integer linear program (MILP) to jointly optimize VNFs placement, routing and link scheduling, and also the HAP's charging duration. Furthermore, it proposes a heuristic, called decoupled greedy algorithm (DGA), that first assigns VNFs onto devices with the highest energy level before optimizing the HAP's charging, routing, and link schedule. Our results show that DGA has a probability higher than 0.95 to successfully serve a service request. Furthermore, DGA consumes up to 36.43% less energy than competing methods.

关键词： Wireless sensor networks Routing Wireless communication Task analysis Internet of Things Sensors Radio frequency Energy multihop communications optimization virtual functions

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Estimating Parameters of Battery Electric Vehicles

引用

INTELLIGENT SYSTEMS WITH APPLICATIONS 2022年 15卷

作者： Adedeji, Bukola Peter Univ Regina Dept Ind Syst Engn Regina SK S4S 0A2 Canada

In this study, an artificial neural network was employed to calculate and simulate the inverse functions of battery electric vehicle parameters. One of the objectives of this work is to develop a model that can accurately estimate up to nine parameters at once, given nine variables. Datasets from manufacturers of battery electric cars were employed in this study to generate direct functions using an artificial neural network. In this case, a direct function model was developed. The output of the direct function model was now combined with virtual or dummy functions to form the input variables for the inverse function model. In this case, an inverse function model was developed. Nine variables were calculated and simulated as the outputs by the inverse function model at the same time. The procedure was completed for the nine cases where each of the augmented input variables of the inverse function model was the output of the direct function model. The results of the inverse function model with virtual functions were compared with those of the model without virtual functions. For all the nine cases considered, the inverse function model with virtual functions had greater or better accuracy than the model without dummy functions. Accuracy was 145.7 times higher in terms of mean square error when electrical charge consumption and virtual functions were employed as input variables into the inverse function model. This implies that the proposed approach, which involves the augmentation of the input of the inverse function model, is more efficient and accurate than the one without virtual functions. Augmentation with virtual functions improved the simulating capability of the inverse function model.

关键词： Battery Electric Vehicles Estimations Parameters Model Inverse Function Model virtual functions

来源：评论

学校读者我要写书评

暂无评论

Managing Chains of Application functions Over Multi-Technology Edge Networks

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2021年第1期18卷 511-525页

作者： Akhtar, Nabeel Matta, Ibrahim Raza, Ali Goratti, Leonardo Braun, Torsten Esposito, Flavio Boston Univ Dept Comp Sci 111 Cummington St Boston MA 02215 USA Akamai Technol Inc Dept Network Control Cambridge MA 02142 USA FBK CREATE NET I-38123 Trento Italy Safran Passenger Innovat GmbH Wessling Germany Univ Bern Dept Comp Sci CH-3012 Bern Switzerland St Louis Univ Dept Comp Sci St Louis MO 63103 USA

Next-generation networks are expected to provide higher data rates and ultra-low latency in support of demanding applications, such as virtual and augmented reality, robots and drones, etc. To meet these stringent requirements of applications, edge computing constitutes a central piece of the solution architecture wherein functional components of an application can be deployed over the edge network to reduce bandwidth demand over the core network while providing ultra-low latency communication to users. In this article, we provide solutions to resource orchestration and management for applications over a virtualized client-edge-server infrastructure. We investigate the problem of optimal placement of pipelines of application functions (virtual service chains) and the steering of traffic through them, over a multi-technology edge network model consisting of both wired and wireless millimeter-wave (mmWave) links. This problem is NP-hard. We provide a comprehensive "microscopic" binary integer program to model the system, along with a heuristic that is one order of magnitude faster than optimally solving the problem. Extensive evaluations demonstrate the benefits of orchestrating virtual service chains (by distributing them over the edge network) compared to a baseline "middlebox" approach in terms of overall admissible virtual capacity. Moreover, we observe significant gains when deploying a small number of mmWave links that complement the Wire physical infrastructure in high node density networks.

关键词： Application decomposition computer network management network optimization software-defined networking softwarized networks virtual functions

来源：评论

学校读者我要写书评

暂无评论

An empirical examination of the prevalence of inhibitors to the parallelizability of open source software systems

引用

EMPIRICAL SOFTWARE ENGINEERING 2016年第3期21卷 1272-1301页

作者： Alnaeli, Saleh M. Maletic, Jonathan I. Collard, Michael L. Kent State Univ Kent OH 44240 USA Univ Akron Akron OH 44325 USA

An empirical study is presented that examines the potential to parallelize general-purpose software systems. The study is conducted on 13 open source systems comprising over 14 MLOC. Each for-loop is statically analyzed to determine if it can be parallelized or not. A for-loop that can be parallelized is termed a free-loop. Free-loops can be easily parallelized using tools such as OpenMP. For the loops that cannot be parallelized, the various inhibitors to parallelization are determined and tabulated. The data shows that the most prevalent inhibitor by far, is functions called within for-loops that have side effects. This single inhibitor poses the greatest challenge in adapting and re-engineering systems to better utilize modern multi-core architectures. This fact is somewhat contradictory to the literature, which is primarily focused on the removal of data dependencies within loops. Results of this paper also show that function calls via function pointers and virtual methods have very little impact on the for-loop parallelization process. Historical data over a 10-year period of inhibitor counts for the set of systems studied is also presented. It shows that there is little change in the potential for parallelization of loops over time.

关键词： Parallelization inhibitors Data dependency Function calls Function pointers virtual functions Empirical study

来源：评论

学校读者我要写书评

暂无评论

A Gateway based Fog Computing Architecture for Wireless Sensors and Actuator Networks 18

A Gateway based Fog Computing Architecture for Wireless Sens...

引用

18th International Conference on Advanced Communication Technology (ICACT)

作者： Lee, Wangbong Nam, Kidong Roh, Hak-Gyun Kim, Sang-Ha ETRI Smart Network Comp Grp Daejeon South Korea Chungnam Natl Univ Dept Comp Engn Daejeon South Korea

ISBN: (纸本)9788996865063

The technologies of Internet of Things have been wide used in many areas such as intelligent building, logistics, security, and health. One of the key elements of the Internet of Things is Wireless Sensors and Actuators Networks(WSANs). Fog computing, the new concept of the cloud at the edge of the network, is considered the appropriate platform for many Internet of Things services and applications. In this paper we present a gateway based fog computing architecture for WSANs and argue that the key requirements of this architecture. This architecture mainly consists of master nodes and slave nodes, and manages virtual gateway functions, flows, and resources.

关键词： Internet of Things Fog Computing Wireless Sensors and Actuators Networks Gateways virtual functions

来源：评论

学校读者我要写书评

暂无评论

Borland :: Borland C++ :: Borland C++ Version 2.0 Getting Started 1991

引用

2016年

Borland :: Borland C++ :: Borland C++ Version 2.0 Getting Started 1991 by published by

关键词： base class borland chapter class class point constructor data data members default derived class function functions getting installing borland int member member function member functions overloaded operators source file started version virtual functions

来源：评论

学校读者我要写书评

暂无评论

Dec :: Tech Reports :: Wrl-93-4

引用

2016年

Dec :: Tech Reports :: Wrl-93-4 by published by

关键词： code fortran fortran programs object module procedures program programming programming style programs report reports system libraries technical technical note unreachable unreachable code unreachable procedures virtual function virtual functions wrl wrl technical wrl-93-4

来源：评论

学校读者我要写书评

暂无评论

virtual Program Counter (VPC) Prediction: Very Low Cost Indirect Branch Prediction Using Conditional Branch Prediction Hardware

引用

IEEE TRANSACTIONS ON COMPUTERS 2009年第9期58卷 1153-1170页

作者： Kim, Hyesoon Joao, Jose A. Mutlu, Onur Lee, Chang Joo Patt, Yale N. Cohn, Robert Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Intel Corp Hudson MA 01749 USA

Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtual-machine-based runtime systems. Unfortunately, the prediction accuracy of indirect branches has not improved as much as that of conditional branches. Furthermore, previously proposed indirect branch predictors usually require a significant amount of extra hardware storage and complexity, which makes them less attractive to implement. This paper proposes a new technique for handling indirect branches, called virtual Program Counter (VPC) prediction. The key idea of VPC prediction is to use the existing conditional branch prediction hardware to predict indirect branch targets, avoiding the need for a separate storage structure. Our comprehensive evaluation shows that VPC prediction improves average performance by 26.7 percent and reduces average energy consumption by 19 percent compared to a commonly used branch target buffer based predictor on 12 indirect branch intensive C/C++ applications. Moreover, VPC prediction improves the average performance of the full set of object-oriented Java DaCapo applications by 21.9 percent, while reducing their average energy consumption by 22 percent. We show that VPC prediction can be used with any existing conditional branch prediction mechanism and that the accuracy of VPC prediction improves when a more accurate conditional branch predictor is used.

关键词： Indirect branch prediction virtual functions devirtualization object-oriented languages Java

来源：评论

学校读者我要写书评

暂无评论

Improving the performance of object-oriented languages with dynamic predication of indirect jumps

引用

ACM SIGPLAN NOTICES 2008年第3期43卷 80-90页

作者： Joao, Jose A. Mutlu, Onur Kim, Hyesoon Agarwal, Rishi Patt, Yale N. Univ Texas Austin ECE Dept Austin TX 78712 USA Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

Indirect jump instructions are used to implement increasingly-common programming constructs such as virtual function calls, switch-case statements, jump tables, and interface calls. The performance impact of indirect jumps is likely to increase because indirect jumps with multiple targets are difficult to predict even with specialized hardware. This paper proposes a new way of handling hard-to-predict indirect jumps: dynamically predicating them. The compiler (static or dynamic) identifies indirect jumps that are suitable for predication along with their control-flow merge (CFM) points. The hardware predicates the instructions between different targets of the jump and its CFM point if the jump turns out to be hard-to-predict at run time. If the jump would actually have been mispredicted, its dynamic predication eliminates a pipeline flush, thereby improving performance. Our evaluations show that Dynamic Indirect jump Predication (DIP) improves the performance of a set of object-oriented applications including the Java DaCapo benchmark suite by 37.8% compared to a commonly-used branch target buffer based predictor, while also reducing energy consumption by 24.8%. We compare DIP to three previously proposed indirect jump predictors and find that it provides the best performance and energy-efficiency.

关键词： design performance dynamic predication indirect jumps virtual functions object-oriented languages predicated execution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：