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

A Goal-Oriented programming Framework for Grid Sensor Networks with Reconfigurable Embedded Nodes

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2012年第4期11卷 79-79页

作者： Subramanian, Varun Gilberti, Michael Doboli, Alex Pescaru, Dan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA Politehnica Univ Dept Comp Sci Timisoara Romania

Cyber-physical systems (CPS) are large, distributed embedded systems integrated with various sensors and actuators. CPS are rapidly emerging as an important computing paradigm in many modern applications. Developing CPS applications is currently challenging due to the sheer complexity of the related functionality as well as the broad set of constraints and unknowns that must be tackled during operation. This article presents a novel high-level programming model and the supporting optimization and middleware routines for executing applications on physically-distributed networks of reconfigurable embedded systems. The proposed model describes the optimization goals, sensing inputs, actuation outputs, events, and constraints of an application, while leaving to the compiler and execution environment the task of optimally implementing the derived functionality. Experimental results discuss the additional performance optimizations enabled by the proposed model, and the timing and power consumption of the middleware routines, and present a temperature monitoring application implemented on a network of reconfigurable, embedded processors.

关键词： Design Algorithms Performance Cyber-physical systems networked embedded nodes programming model optimized implementation reconfiguration

来源：评论

学校读者我要写书评

暂无评论

A consensus model under framework of prospect theory with acceptable adjustment and endo-confidence

引用

INFORMATION FUSION 2023年第1期97卷

作者： Tian, Xiaoli Li, Wanqing Li, Lanhao Kou, Gang Ye, Chen Southwestern Univ Finance & Econ Fac Business Adm Sch Business Adm Chengdu 611130 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China Southwest Minzu Univ Sch Econ Chengdu 611130 Peoples R China

Consensus is an important issue in group decision making to make a reliable and scientific decision, and it has become a hot topic recently. Due to the complexity and uncertainty of decision-making problems, several aspects of alternatives should be considered in decision-making process. Also, the bounded rational characteristics of decision makers (DMs) may significantly affect the decision results. This paper proposes a multi-criteria consensus model based on prospect theory (PT) to consider the unsymmetrical risk attitudes of DM for gain or loss and on endo-confidence (confidence which is derived by DMs' evaluation information) levels of DMs to determine their weights. First, the reference point in PT is selected and how to measure the prospect consensus degree is presented. Then, the way to identify the expert who need to modify his/her evaluation is given and two programming models are proposed to obtain the updated evaluation. Subsequently, both the overall difference and the endo-confidence level of the DM are used to determine the weights of DMs. Finally, an illustrative example and the comparative analysis are used to demonstrate the feasibility of the proposed model.

关键词： Consensus programming model Prospect theory Reference point Endo -confidence level

来源：评论

学校读者我要写书评

暂无评论

A Data-Centric Approach to Synchronization

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2012年第1期34卷 4-4页

作者： Dolby, Julian Hammer, Christian Marino, Daniel Tip, Frank Vaziri, Mandana Vitek, Jan IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA Univ Saarland Cyber Secur Lab D-66123 Saarbrucken Germany Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Symantec Res Labs Culver City CA 90230 USA

Concurrency-related errors, such as data races, are frustratingly difficult to track down and eliminate in large object-oriented programs. Traditional approaches to preventing data races rely on protecting instruction sequences with synchronization operations. Such control-centric approaches are inherently brittle, as the burden is on the programmer to ensure that all concurrently accessed memory locations are consistently protected. Data-centric synchronization is an alternative approach that offloads some of the work on the language implementation. Data-centric synchronization groups fields of objects into atomic sets to indicate that these fields must always be updated atomically. Each atomic set has associated units of work, that is, code fragments that preserve the consistency of that atomic set. Synchronization operations are added automatically by the compiler. We present an extension to the Java programming language that integrates annotations for data-centric concurrency control. The resulting language, called AJ, relies on a type system that enables separate compilation and supports atomic sets that span multiple objects and that also supports full encapsulation for more efficient code generation. We evaluate our proposal by refactoring classes from standard libraries, as well as a number of multithreaded benchmarks, to use atomic sets. Our results suggest that data-centric synchronization is easy to use and enjoys low annotation overhead, while successfully preventing data races. Moreover, experiments on the SPECjbb benchmark suggest that acceptable performance can be achieved with a modest amount of tuning.

关键词： Concurrent object-oriented programming data races serializability programming model

来源：评论

学校读者我要写书评

暂无评论

Optimal allocation of shared parking slots considering parking unpunctuality under a platform-based management approach

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2020年 142卷 102062-102062页

作者： Jiang, Bowen Fan, Zhi-Ping Dalian Maritime Univ Sch Maritime Econ & Management Dalian 116026 Peoples R China Northeastern Univ Sch Business Adm Dept Management & Decis Sci Shenyang 110169 Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Peoples R China

An effective way to solve the parking difficulty is to utilize idle private parking slots as temporary parking supplies under the shared parking mode. A platform-based management approach can make reasonable use of parking slots by gathering the parking time windows of owners and consumers in advance. However, the actual parking time is difficult to be consistent with that registered on the platform. Owners and consumers may be unpunctual when arriving and departing. The parking unpunctuality is a stochastic factor and affects the allocation of parking slots. This paper focuses on how to model and optimize the parking unpunctuality in the shared parking slot allocation problem. We formulate the parking probability function of consumers and owners in different time slots and transform the stochastic programming model into an expectation model. It is found that in a certain time slot, the optimal number of idle parking slot reserved is related to the probability of unpunctuality, as well as the number of cars registered to arrive and depart in the neighboring time slots. The numerical experiments indicate that when considering the parking unpunctuality, the allocation is less compact;the satisfaction of consumers is decreased, especially when the supply is limited or the consumer demands are excessive. In the middle and later periods throughout the daytime, parking slots are more likely to be overloaded.

关键词： Sharing economy Parking slot allocation Uncertainty programming model

来源：评论

学校读者我要写书评

暂无评论

COOPERATIVE SHARED-MEMORY - SOFTWARE AND HARDWARE FOR SCALABLE MULTIPROCESSORS

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 1993年第4期11卷 300-318页

作者： HILL, MD LARUS, JR REINHARDT, SK WOOD, DA University of Wisconsin

We believe the paucity of massively parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware designers which cases are common (so they can build simple hardware to optimize them). Cooperative shared memory, our approach to shared-memory design, addresses this problem. Our initial implementation of cooperative shared memory uses a simple programming model, called Check-ln/Check-Out (CICO), in conjunction with even simpler hardware, called Dir(1)SW. In CICO, programs bracket uses of shared data with a check_out directive marking the expected first use and a check_in directive terminating the expected use of the data. A cooperative prefetch directive helps hide communication latency. Dir(1)SW is a minimal directory protocol that adds little complexity to message-passing hardware, but efficiently supports programs written within the CICO model.

关键词： DESIGN EXPERIMENTATION MEASUREMENT PERFORMANCE CACHE COHERENCE DIRECTORY PROTOCOLS MEMORY SYSTEMS programming model SHARED-MEMORY MULTIPROCESSORS

来源：评论

学校读者我要写书评

暂无评论

τ C: C with Process Network Extensions for Embedded Manycores

引用

Procedia Computer Science 2014年 29卷 1100-1112页

作者： Thierry Goubier Damien Couroussé Selma Azaiez CEA LIST DACLE/Lastre 91191 Gif-sur-Yvette CEDEX France CEA LIST DACLE/LIALP Grenoble France

Current and future embedded manycore systems bring complex and heterogeneous architectures with a large number of processing cores, making both parallel programming at this scale and understanding the architecture itself a daunting task. Process Networks and other dataflow based models of Computation (MoC) are a good base to present a universal model of the underlying manycore architectures to the programmer. If a language exposes a simple to grasp MoC in a consistent way across architectures, the programmer can concentrate the efforts on optimizing the expression of parallelism in the application instead of porting code to a given system. In this paper, we present a process network extension to C called τ C and its mapping to both a POSIX target and the P2012/STHORM platform, and show how the language offers an architecture independent solution of this problem.

关键词： manycore programming model process networks compiler toolchain

来源：评论

学校读者我要写书评

暂无评论

A State-Machine model for Reliability Eliciting over Wireless Sensor and Actuator Networks

引用

Procedia Computer Science 2012年 10卷 422-431页

作者： José Cecílio Pedro Furtado University of Coimbra Coimbra Portugal

Advances in communications and embedded systems have led to the proliferation of wireless sensor and actuator networks (WSANs) in a wide variety of application domains. One important key of many such WSAN applications is the needed to meet non-functional requirements (e.g., lifetime, reliability, time guarantees) as well as functional ones (e.g. monitoring, actuation). Some application domains even require that sensor nodes be deployed in harsh environments (e.g., refineries), where they can fail due to communication interference, power problems or other issues. Unfortunately, the node failures can be catastrophic for critical or safety related systems. State machines can offer a promising approach to separate the two concerns – functional and non-functional – bringing forth reliability exception conditions handling, by means of fault handling states. We develop an approach that allows users to define and program typical applications using their platform language, but also adds state machine logic to design, view and handle explicitly other concerns such as reliability. The experimental section shows a working deployment of this concept in an industrial refinery setting

关键词： WSN programming model State-Machine Industrial applications

来源：评论

学校读者我要写书评

暂无评论

SUPPORTING RUNTIME RECONFIGURATION ON NETWORK PROCESSORS

引用

Journal of Interconnection Networks 2006年第4期7卷 475-492页

作者： KEVIN LEE GEOFFREY COULSON Computing Department InfoLab21 Lancaster University Lancaster LA1 4WA UK

Network Processors (NPs) are set to play a key role in the next generation of networking technology. They have the performance of ASIC-based routers whilst offering a high degree of programmability. However, the programmability potential of NPs can only be realised with appropriate software. In this paper we argue that specialised software to support runtime reconfiguration is needed to fully exploit the potential of NPs. We first justify supporting runtime reconfiguration on NPs by offering real-world scenarios and discussing the issues associated with these. We then demonstrate how runtime reconfiguration can be achieved in practice through a case study of our component-based programming approach on the Intel IXP2400 NP.

关键词： Network Processor Component Runtime Reconfiguration programming model

来源：评论

学校读者我要写书评

暂无评论

modelling and analysis of offshore energy hubs

引用

ENERGY 2022年第PartA期261卷

作者： Zhang, Hongyu Tomasgard, Asgeir Knudsen, Brage Rugstad Svendsen, Harald G. Bakker, Steffen J. Grossmann, Ignacio E. Norwegian Univ Sci & Technol Dept Ind Econ & Technol Management Hogskoleringen 1 N-7491 Trondheim Norway SINTEF Energy Res Kolbjorn Hejes Vei 1B N-7491 Trondheim Norway Carnegie Mellon Univ Dept Chem Engn 5000 Forbes Ave Pittsburgh PA 15213 USA

Clean offshore energy hubs may become pivotal for efficient offshore wind power generation and distribution. In addition, offshore energy hubs may provide decarbonised energy supply for maritime transport, oil and gas recovery, and offshore farming, while also enabling conversion and storage of liquefied decarbonised energy carriers for export. In this paper, the role of offshore energy hubs is investigated in the transition of an offshore energy system towards zero-emission energy supply. A mixed-integer linear programming model is developed for investment planning and operational optimisation to achieve decarbonisation at minimum cost. We consider offshore wind, solar, energy hubs and subsea cables. A sensitivity analysis is conducted on CO2 tax, CO2 budget and the capacity of power from shore. The results show that: (a) a hard carbon cap is necessary for stimulating a zero-emission offshore energy system, (b) offshore wind integration and power from shore can more than halve current emissions, but offshore energy hubs with storage may be necessary for zero-emission production, and (c) at certain CO2 tax levels, the system with offshore energy hubs can potentially reduce CO2 emissions by 49% and energy losses by 10%, compared to a system with only offshore renewables, gas turbines and power from shore.

关键词： Clean offshore energy hub Sensitivity analysis Deterministic mixed-integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Using interoperability mode in SYCL 2020 22

Using interoperability mode in SYCL 2020

引用

International Workshop on OpenCL

作者： Aksel Alpay Thomas Applencourt Gordon Brown Ronan Keryell Gregory Lueck Heidelberg University Germany Argonne National Laboratory United States Codeplay United Kingdom AMD United States Intel United States

ISBN: (纸本)9781450396585

SYCL is a programming standard targeting hardware platforms with a host connected to various heterogeneous accelerators. Both the host and accelerator parts of the computation are expressed in a single-source modern C++ program. While the previous versions of the SYCL standard were based only on top of the OpenCL standard to control the accelerators, starting with SYCL 2020, the standard is independent from OpenCL and can target different API, described with the concept of backend. Some SYCL implementations can thus target today various lower-level API, like OpenCL, CUDA, Level0, HIP, XRT, Vulkan, etc. with possibly different backends used at the same time in the same application. Even if the SYCL standard thrive to abstract the generic principles used in heterogeneous programming with C++ classes and functions, real applications require often to use specific details of a given architecture to benefit fully from an accelerator or need to be into integrated into a wider framework, including parts implemented in other languages and other API for heterogeneous computing. This is possible in SYCL with a less-know but powerful concept of interoperability, which is introduced at different levels. On one hand, by accessing some native backend objects from SYCL objects, it is possible to use in a SYCL program the native API, for example by calling some existing optimized libraries like mathematical libraries, machine learning, video CODEC, etc. to simplify the application development and reach the maximum performance. In that case it is for example possible to get from a sycl::queue a native queue from the backend to be used to enqueue a library function. On the other hand, it is possible to use a part of the application written in SYCL from another part of the application using another API by using SYCL interoperability functions to constructs SYCL objects like sycl::device or sycl::queue from native equivalent objects from the lower-level API backend used in the main part

关键词： interoperability programming model heterogeneous computing SYCL

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：