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

Supporting concurrent memory access in TCF processor architectures

MICROPROCESSORS AND MICROSYSTEMS 2018年 63卷 226-236页

作者： Forsell, Martti Roivainen, Jussi Leppanen, Ville Traeff, Jesper Larsson VTT Efficient Comp & Commun Espoo Finland Univ Turku Dept Future Technol Turku Finland Vienna Univ Technol Fac Informat Vienna Austria

The Thick Control Flow (TCF) model simplifies parallel programming by bundling computations with the same control flow into single flows of variable thickness, and has the prospect of alleviating redundant usage of software and hardware resources. While architectures that can support the TCF model have been proposed, current proposals cannot support concurrent memory accesses that can both simplify programming and speed up many parallel algorithms by a logarithmic factor. In this paper, we extend current TCF architectures to efficiently support concurrent read as well as write memory accesses. The solution is based on bounded size step-caches, and exploit the two-part, hybrid, frontend-backend structure of current TCF processors, and synchronization properties of the TCF model itself. According to our simulation-based evaluation, a concurrent memory access TCF processor with B backends can execute algorithms with substantial concurrent memory accesses up to B times faster than a baseline TCF processor not supporting concurrent memory access. The hardware overhead of the solution is estimated to be modest. We include parallel program code to illustrate the gains by supporting concurrent memory accesses. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Parallel computing Processor architecture programming model TCF Concurrent memory access

来源：评论

学校读者我要写书评

暂无评论

OpenMPC: extended OpenMP for efficient programming and tuning on GPUs

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2013年第1期8卷 4-20页

作者： Lee, Seyong Eigenmann, Rudolf Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

General-purpose graphics processing units (GPGPUs) provide inexpensive, high performance platforms for compute-intensive applications. However, their programming complexity poses a significant challenge to developers. Even though the compute unified device architecture (CUDA) programming model offers better abstraction, developing efficient GPGPU code is still complex and error-prone. This paper proposes a directive-based, high-level programming model, called OpenMPC, which addresses both programmability and tunability issues on GPGPUs. We have developed a fully automatic compilation and user-assisted tuning system supporting OpenMPC. In addition to a range of compiler transformations and optimisations, the system includes tuning capabilities for generating, pruning, and navigating the search space of compilation variants. Evaluation using 14 applications shows that our system achieves 75% of the performance of the hand-coded CUDA programmes (92% if excluding one exceptional case).

关键词： OpenMP graphics processing unit GPU compute unified device architecture CUDA OpenMPC programming model directives automatic translation compiler transformation performance tuning code generation optimisations

来源：评论

学校读者我要写书评

暂无评论

Comprehensive survey of the IoT open-source OSs

引用

IET WIRELESS SENSOR SYSTEMS 2018年第6期8卷 323-339页

作者： Qutqut, Mahmoud H. Al-Sakran, Aya Almasalha, Fadi Hassanein, Hossam S. Appl Sci Private Univ Fac Informat Technol Amman 11931 Jordan Queens Univ Sch Comp Telecommun Res Lab Kingston ON K7L 2N8 Canada

The Internet of things ( IoT) has attracted a great deal of research and industry attention recently and is envisaged to support diverse emerging domains including smart cities, health informatics, and smart sensory platforms. Operating system (OS) support for IoT plays a pivotal role in developing scalable and interoperable applications that are reliable and efficient. IoT is implemented by both high-end and low-end devices that require OSs. Recently, the authors have witnessed a diversity of OSs emerging into the IoT environment to facilitate IoT deployments and developments. In this study, they present a comprehensive overview of the common and existing open-source OSs for IoT. Each OS is described in detail based on a set of designing and developmental aspects that they established. These aspects include architecture and kernel, programming model, scheduling, memory management, networking protocols support, simulator support, security, power consumption, and support for multimedia. They present a taxonomy of the current IoT open-source OSs. The objective of this survey is to provide a well structured guide to developers and researchers to determine the most appropriate OS for each specific IoT devices/applications based on their functional and non-functional requirements. They remark that this is the first such tutorial style paper on IoT OSs.

关键词： operating systems (computers) Internet of Things public domain software smart cities smart sensory platforms operating system support low-end devices IoT environment simulator support specific IoT devices IoT open-source OSs Internet of Things health informatics high-end devices programming model memory management scheduling multimedia nonfunctional requirements functional requirements networking protocol support power consumption

来源：评论

学校读者我要写书评

暂无评论

The JavaSeal mobile agent kernel

引用

AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2001年第4期4卷 359-384页

作者： Bryce, C Vitek, J Univ Geneva Object Syst Grp CH-1211 Geneva 4 Switzerland Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

Mobile agents show promise as a new distributed programming paradigm in which locality plays a central role-programs that are able to move closer to their data can overcome limitations of connectivity, latency or bandwidth. Mobility also enables distributed systems to evolve;for instance, the deployment of a new service over a network can be programmed as part of the service itself. Of course, moving programs introduces new challenges. One of these is related to program structure: How much of a computation should be moved? Where are the boundaries between mobile and immobile entities drawn? A second challenge is to provide security guarantees: How can the actions of mobile agent be controlled? And what kinds of security properties can we realistically expect to enforce? We answer these questions within the framework of the JavaSeal mobile agent system kernel. JavaSeal provides several abstractions for constructing agent systems in Java. Our basic building block is the seal which is a nested encapsulated computation fragment with sharply delineated boundaries. Strands are sequential threads of computation bound to a seal. Capsules transfer passive seals and objects over communication channels;Traffic over channels is regulated by portals. We argue that these abstractions are sufficient to program secure mobile agent systems. An electronic commerce application built over our kernel is used as a demonstrator.

关键词： agent platform kernel security programming model

来源：评论

学校读者我要写书评

暂无评论

Untangling Modern Parallel programming models 22

Untangling Modern Parallel Programming Models

引用

International Workshop on OpenCL

作者： Michael Kinsner Ben Ashbaugh James Brodman Greg Lueck John Pennycook Roland Schulz Intel Corporation Canada Intel Corporation United States

ISBN: (纸本)9781450396585

Modern hardware is increasingly rich in diversity, including CPUs, GPUs, FPGAs and more, with new and novel architectures constantly emerging. To provide differentiation between these devices, each is typically built around architectures optimized for some classes of application or some patterns of parallelism. Numerous computational cores, varying levels of hardware vectorization, and other degrees of architectural freedom exist across the many hardware options. The need to efficiently utilize diverse hardware has led to emergence of a wide variety of programming models, execution models, and languages, and has simultaneously led to a complex landscape of confused and often conflicting terminology and abstractions. This reality makes it challenging for developers to comprehend and then choose a programming model that fits with their applications and mental model, particularly when more than one target architecture or vendor is of interest. This talk strives to untangle the landscape of modern parallel programming models, to help developers understand how the models and options relate to each other, and to frame how to think about their specific algorithms when expressing them in code. Although experienced developers typically understand much of the terminology and the relationships between models, a holistic presentation of the material is of strong value, as evidenced by feedback from parallel programming experts that have seen previews of this presentation. To begin, a brief overview will be presented to frame parallel programming and offload compute programming models, followed by characterization of the Single Program Multiple Data (SPMD) abstract model and the power it exhibits when mapping to multiple classes of architecture. We will discuss how fundamental design decisions within a compiler impact the mapping from source code to an underlying programming model, highlighting that the same code can be lowered to multiple models. This is particularly relevant i

关键词： SIMD SPMD programming model OpenCL SYCL CUDA

来源：评论

学校读者我要写书评

暂无评论

A Group Decision Making Method with Interval-Valued Intuitionistic Fuzzy Preference Relations and Its Application in the Selection of Cloud Computing Vendors for SMEs

引用

INFORMATICA 2021年第1期32卷 163-193页

作者： Zhang, Shaolin Tang, Jie Meng, Fanyong Yuan, Ruiping Cent South Univ Sch Business Changsha 410083 Peoples R China Beijing Wuzi Univ Sch Informat Beijing 101149 Peoples R China

To solve the problem of choosing the appropriate cloud computing vendors in small and medium-sized enterprises (SMEs), this paper boils it down to a group decision making (GDM) problem. To facilitate the judgment, this paper uses preference relation as the decision making technology. Considering the situation where uncertain positive and negative judgments exist simultaneously, interval-valued intuitionistic fuzzy preference relations (IVIFPRs) are employed to express the decision makers' judgments. In view of the multiplicative consistency and consensus analysis, a new GDM algorithm with IVIFPRs is offered. To accomplish this goal, a new multiplicative consistency is first defined, which can avoid the limitations of the previous ones. Then, a programming model is built to check the consistency of IVIFPRs. To deal with incomplete IVIFPRs, two programming models are constructed to determine the missing values with the goal of maximizing the level of multiplicative consistency and minimizing the total uncertainty. To achieve the minimum adjustment of original preference information, a programming model is established to repair inconsistent IVIFPRs. In addition, programming models for getting the decision makers (DMs)' weights and improving the consensus degree are offered. Finally, a practical decision making example is given to illustrate the effectiveness of the proposed method and to compare it with previous methods.

关键词： group decision making IVIFPR multiplicative consistency programming model consensus

来源：评论

学校读者我要写书评

暂无评论

A new method for deriving priority from dual hesitant fuzzy preference relations

引用

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2021年第11期36卷 6613-6644页

作者： Tang, Jie Meng, Fanyong Pedrycz, Witold Fujita, Hamido Nanjing Univ Informat Sci & Technol Sch Management Sci & Engn 219 Ningliu Rd Nanjing 210044 Jiangsu Peoples R China Cent South Univ Sch Business Changsha Hunan Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB Canada Ho Chi Minh City Univ Technol HUTECH Fac Informat Technol Ho Chi Minh City Vietnam Univ Granada Andalusian Res Inst Data Sci & Computat Intellige Granada Spain Iwate Prefectural Univ Fac Software & Informat Sci Takizawa Iwate Japan

Dual hesitant fuzzy elements (DHFEs) are suitable to express hesitant possible preferred and nonpreferred judgments of decision makers. Preference relation is an important tool in decision making that only needs the decision makers to compare a pair of objects at one time. This study focuses on decision making with dual hesitant fuzzy preference relations (DHFPRs). Considering the consistency, an additive consistency concept is defined. Meanwhile, the property of the new concept is studied. Using this consistency concept, a method for assessing the additive consistency of DHFPRs is offered. To extend the application of DHFPRs, a programming model to determine the missing DHFEs in incomplete DHFPRs is built, which have the highest additive consistency level for the known ones. Two equivalent methods to calculate the priority vector are offered. One method obtains the probabilistic dual hesitant fuzzy priority vector, and the other derives the intuitionistic fuzzy priority vector. Furthermore, a consensus index is defined to measure the consensus of individual opinions in group decision making (GDM), and an interactive method for increasing the consensus level is offered. On the basis of the additive consistency and consensus, an algorithm to GDM with DHFPRs is offered that can address inconsistent and incomplete cases. Finally, a practical example about evaluating color TV is provided to demonstrate the usefulness of the new procedure.

关键词： additive consistency consensus analysis DHFPR group decision making programming model

来源：评论

学校读者我要写书评

暂无评论

Stacked gate mid-channel injection flash EEPROM cell - Part II: Analysis of gate current and modeling of programming characteristics

引用

IEEE TRANSACTIONS ON ELECTRON DEVICES 1998年第8期45卷 1703-1709页

作者： Kim, DM Cho, MK Kwon, WH Pohang Univ Sci & Technol Dept Elect Engn Kyungbuk 790784 South Korea Samsung Elect Co LTD Memory Div Semicond Business Kyungki Do 449900 South Korea

The programming characteristics of the stacked gate mid-channel injection (SMCI) flash memory cell is quantitatively analyzed vis a vis the stacked gate device. In the present model, the hot electrons in the high field channel region are described by the elevated temperature model. The programming speed and efficiency depend, among other factors, on the carrier lifetime, which is limited by both the recombination process and the carrier dwell time in the channel. The gate currents from the reference devices are quantitatively analyzed and specified empirically via the applied voltages and the device parameters. These results are applied to modeling the shift in time of the threshold voltage and the simulated values are shown to fit the data with a fair degree of accuracy.

关键词： flash EEPROM gate current hot carrier midchannel injection programming model

来源：评论

学校读者我要写书评

暂无评论

Multiplicative consistency analysis for interval fuzzy preference relations: A comparative study

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2017年 68卷 17-38页

作者： Meng, Fanyong Tan, Chunqiao Chen, Xiaohong Nanjing Audit Univ Sch Int Audit Nanjing 2111815 Jiangsu Peoples R China Cent S Univ Sch Business 932 South Lushan Rd Changsha 410083 Hunan Peoples R China Hunan Univ Commerce Sch Accounting Changsha 410205 Hunan Peoples R China

To examine the multiplicative consistency of interval fuzzy preference relations (IFPRs), this paper first analyzes the limitations associated with the previous consistency concepts. Accordingly, a new consistency concept is defined that is an extension of the crisp case and overcomes limitations in the previous concepts. Next, a linear programming model to judge the consistency of IFPRs is constructed, and an approach to derive multiplicative consistent IFPRs is introduced. Furthermore, goal-programming models to determine missing values in an incomplete IFPR are constructed that have the highest consistent level with respect to known values. Moreover, a multiplicative consistency and consensus based method for group decision making with IFPRs is developed that can address incomplete and inconsistent cases. Finally, two practical decision-making problems are offered to demonstrate the feasibility and efficiency of the new method, and an analysis of a numerical and theoretical comparison with several related methods is performed. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Decision analysis Interval fuzzy preference relation Multiplicative consistency programming model Consensus

来源：评论

学校读者我要写书评

暂无评论

OpenMP-oriented applications for distributed shared memory architectures

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2004年第4期16卷 371-384页

作者： Marowka, A Liu, ZY Chapman, B Univ Houston Dept Comp Sci Houston TX 77204 USA

The rapid rise of OpenMP as the preferred parallel programming paradigm for small-to-medium scale parallelism could slow unless OpenMP can show capabilities for becoming the model-of-choice for large scale high-performance parallel computing in the coming decade. The main stumbling block for the adaptation of OpenMP to distributed shared memory (DSM) machines, which are based on architectures like cc-NUMA, stems from the lack of capabilities for data placement among processors and threads for achieving data locality. The absence of such a mechanism causes remote memory accesses and inefficient cache memory use, both of which lead to poor performance. This paper presents a simple software programming approach called copy-inside-copy-back (CC) that exploits the data privatization mechanism of OpenMP for data placement and replacement. This technique enables one to distribute data manually without taking away control and flexibility from the programmer and is thus an alternative to the automat and implicit approaches. Moreover, the CC approach improves on the OpenMP-SPMD style of programming that makes the development process of an OpenMP application more structured and simpler. The CC technique was tested and analyzed using the NAS Parallel Benchmarks on SGI Origin 2000 multiprocessor machines. This study shows that OpenMP improves performance of coarse-grained parallelism, although a fast copy mechanism is essential. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： OpenMP data locality NAS parallel benchmarks programming model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：