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

Optimization consensus analysis for group decision making in view of non-transferable and transferable allocation schemes

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2024年第7期75卷 1325-1342页

作者： Meng, Fanyong Zhao, Dengyu Tan, Chunqiao Nanjing Univ Informat Sci & Technol Nanjing Peoples R China Nanjing Audit Univ 219 Ningliu Rd Nanjing 2410044 Jiangsu Peoples R China

Most practical decision-making problems commonly contain several alternatives evaluated by more than one decision maker (DM) according to the built criteria system. It is known as multi-criteria group decision making problems. The decision-making results should be based on highly similar individual opinions to derive the most suitable choice. Nevertheless, the divergence of individual judgments is usually significant due to various subjective and objective reasons. In this case, some DMs need to modify their judgments to derive final results, the consensus adjustment in group decision making. Like supply chain management, the centralized consensus process can minimize individual adjustments under the set consensus condition. Based on the hypothesis of rational humans that individuals always pursue maximum benefits, this paper proposes an iterative consensus process in a centralized environment. According to non-consensus adjustments, the iterative procedure contains non-transferable and transferable two parts. When the non-transferable consensus adjustment procedure is completed, the transferable consensus adjustment procedure is activated using an asymmetrical Nash bargaining game allocation mechanism. Additionally, a case study is provided to demonstrate the efficaciousness and practicality of the new method. Meanwhile, sensitivity and comparison analyses are done.

关键词： Group decision making non-transferable and transferable consensus adjustment programming model asymmetrical Nash bargaining game

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Self-Adaptation for Application Execution on Heterogeneous Parallel Architectures

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING

引用

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2020年第1期5卷 81-94页

作者： Kavanagh, Richard Djemame, Karim Ejarque, Jorge Badia, Rosa M. Garcia-Perez, David Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England Barcelona Supercomp Ctr BSC Barcelona 08034 Spain Spanish Natl Res Council IIIA CSIC Artificial Intelligence Res Inst Bellaterra 08193 Spain Atos Madrid 28037 Spain

Hardware in High Performance Computing environments in recent years have increasingly become more heterogeneous in order to improve computational performance. An additional aspect of such systems is the management of power and energy consumption. The increase in heterogeneity requires middleware and programming model abstractions to eliminate additional complexities that it brings, while also offering opportunities such as improved power management. In this paper, we explore application level self-adaptation including aspects such as automated configuration and deployment of applications to different heterogeneous infrastructure and for their redeployment. This therefore not only mitigates complexities associated with heterogeneous devices but aims to take advantage of the heterogeneity. The overall result of this paper is a self-adaptive framework that manages application Quality of Service (QoS) at runtime, which includes the automatic migration of applications between different accelerated infrastructures. Discussion covers when this migration is appropriate and quantifies the likely benefits.

关键词： Task analysis Runtime Computer architecture Quality of service Hardware Monitoring Power demand Self-adaptation energy modelling programming model heterogeneous hardware architectures application deployment

来源：评论

学校读者我要写书评

暂无评论

legaSCi: Legacy SystemC model Integration into Parallel Simulators

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2014年第5-Sup期13卷 1-24页

作者： Schumacher, Christoph Weinstock, Jan Henrik Leupers, Rainer Ascheid, Gerd Tosoratto, Laura Lonardo, Alessandro Petras, Dietmar Hoffmann, Andreas Rhein Westfal TH Aachen Inst Commun Technol & Embedded Syst Aachen Germany Ist Nazl Fis Nucl Sez Roma Rome Italy Synopsys GmbH Herzogenrath Germany

Architects and developers use virtual prototypes of computer systems to receive early feedback on hardware design decisions as well as to develop and debug system software. This is facilitated by the comprehensive inspection capabilities virtual prototypes offer. For virtual prototypes, execution speed is crucial to support the users' productivity. Parallel simulation techniques are employed to offset the speed impact of the increasing number of cores that need to be simulated in virtual prototypes of parallel and embedded systems. SystemC is the de facto industry standard library for virtual platform modeling. Since currently no parallel SystemC library is commonly available, typical SystemC models are coded for execution in sequential simulation environments. Simply putting such models into parallel simulators may lead to thread-safety issues and may additionally cause nondeterministic simulator behavior. This article proposes a methodology to support simulation creators to face the challenge of integrating such legacy models into parallel SystemC environments. The feasibility of the proposed method is evaluated by parallelizing the latest instance of the EU FP7 project EURETILE embedded platform simulator. Using legaSCi, on four host processor cores a speedup of 2.13x is demonstrated, without having to change the individual models of the simulator.

关键词： Performance Design Experimentation Parallel simulation SystemC legacy code integration programming model thread safety determinism

来源：评论

学校读者我要写书评

暂无评论

An Executable Specification of Map-Join-Reduce Using Haskell

引用

IEEE ACCESS 2019年 7卷 10892-10904页

作者： Ren, Junqi Liu, Lei Liu, Feng Zhou, Wenbo Lu, Shuai Jilin Univ Coll Comp Sci & Technol Changchun 130012 Jilin Peoples R China Jilin Univ Minist Educ Key Lab Symbol Computat & Knowledge Engn Changchun 130012 Jilin Peoples R China

The Map-Join-Reduce programming model effectively supports the join operation among different heterogeneous data sets by adding the Join module and processes the multiway joining directly. In this paper, we propose a rigorous description of the Map-Join-Reduce that performs as an executable specification. First, this paper briefly introduces the differences between the Map-Join-Reduce and the MapReduce. Then, we use Haskell to specify each module of the Map-Join-Reduce programming model and analyze the structure and function of each module. Finally, we test the specification by analyzing an example of the mall sales records. The executable specification contributes to helping the developers to unscramble the relationship between the MapReduce and the Map-Join-Reduce, which may serve as a basis for further development of the theory of related programming model design. Furthermore, the most important function of an executable specification is guaranteeing the target informal or semi-formal model with interesting properties. This paper is a forward step to prepare for verifying related properties and, even, providing verified prototypes.

关键词： Cloud computing executable specification programming model

来源：评论

学校读者我要写书评

暂无评论

Two-stage multi-sided matching dispatching models based on improved BPR function with probabilistic linguistic term sets

引用

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS 2021年第1期12卷 151-169页

作者： Li, Bo Xu, Zeshui Zhang, Yixin Sichuan Univ Inst Disaster Management & Reconstruct Chengdu 610207 Peoples R China Sichuan Univ Sch Business State Key Lab Hydraul & Mt River Engn Chengdu 610064 Sichuan Peoples R China Univ Manchester Dept Comp Sci Manchester M13 9PL Lancs England

Disaster has great destructiveness and a wide influence on urban and rural construction, and more than one place is affected by disaster. Thus, it needs to take multiple disaster points into account. In view of different rescue missions, both medical rescue teams and search rescue teams also need to be dispatched. That is the multi-sided matching among medical rescue teams, search rescue teams and disaster points. Firstly, we describe the matching process, including the related symbols used in the process, and define a concept called multi-sided matching. Then, we aim to solve two problems: determining the competency degree of rescuers and calculating the time reliability of rescue teams arriving at disaster points. For the first one, we invite experts to evaluate pending rescue teams in terms of professional ability and collaboration ability using probabilistic linguistic term sets (PLTSs) because PLTSs not only keep original linguistic information but also give distributed expressions. For the second one, we determine the arriving time and calculating the time reliability by using the improved Bureau of Public Road (BPR) function. After that, we construct the two-stage multi-sided matching programming models based on the improved BPR function and PLTSs. Finally, a case study is used to demonstrate the proposed matching process, some comparative analyses and discussions are also conducted to validate the proposed models.

关键词： Multi-sided matching Bureau of public road (BPR) programming model Probabilistic linguistic term set

来源：评论

学校读者我要写书评

暂无评论

Decision making with interval-valued intuitionistic fuzzy preference relations based on additive consistency analysis

引用

INFORMATION SCIENCES 2018年 467卷 115-134页

作者： Tang, Jie Meng, Fanyong Zhang, Yongliang Cent S Univ Sch Business 932 South Lushan Rd Changsha 410083 Hunan Peoples R China Nanjing Univ Informat Sci & Technol Sch Management & Econ Nanjing 210044 Jiangsu Peoples R China

This paper discusses the theory and application of interval-valued intuitionistic fuzzy preference relations (IVIFPRs). To do this, we first introduce an additive consistency concept for IVIFPRs that can address the issues in previous ones. Then, several additive consistency based programming models for judging the consistency of IVIFPRs and for determining missing values are constructed. Furthermore, an approach for calculating the interval valued intuitionistic fuzzy priority weight vector is offered. With respect to group decision making with IVIFPRs, a consensus index is offered, and an interactive algorithm for improving the consensus level is proposed that can ensure the additive consistency. After that, a consensus analysis-based programming model for determining the weights of decision makers is built. Furthermore, a consistency-and-consensus-based group decision making method that can address inconsistent and incomplete IVIFPRs is developed. Finally, a practical decision-making problem about evaluating talents in universities is offered to show the feasibility and efficiency of the new method. (C) 2018 Published by Elsevier Inc.

关键词： Decision procedure IVIFPR Additive consistency Consensus programming model

来源：评论

学校读者我要写书评

暂无评论

Rack-Scale Capabilities: Fine-Grained Protection for Large-Scale Memories

引用

COMPUTER 2019年第2期52卷 52-62页

作者： Bresniker, Kirk M. Faraboschi, Paolo Mendelson, Avi Milojicic, Dejan Roscoe, Timothy Watson, Robert N. M. Hewlett Packard Labs Syst Res Palo Alto CA 94304 USA Hewlett Packard Labs Palo Alto CA USA Technion Comp Sci & Elect Engn Haifa Israel Swiss Fed Inst Technol Comp Sci Zurich Switzerland Univ Cambridge Comp Lab Cambridge England

Rack-scale systems with large, shared, disaggregated, and persistent memory need solid protection and authorization techniques. Our solution uses a memory-side capability enforcement processor that gates memory accesses through extended capabilities, enables fine-grained access control beyond a single address space, and minimally disrupts the programming model.

关键词： Authorisation Storage Management Rack Scale Capabilities Fine Grained Protection Large Scale Memories Rack Scale Systems Authorization Techniques Memoryside Capability Enforcement Processor Gates Memory Accesses Persistent Memory Fine Grained Access Control programming model Random Access Memory Memory Management Hardware Nonvolatile Memory Registers Micromechanical Devices programming

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of the HPC challenge benchmark in the XcalableMP PGAS language

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2019年第1期33卷 110-123页

作者： Nakao, Masahiro Murai, Hitoshi Iwashita, Hidetoshi Boku, Taisuke Sato, Mitsuhisa RIKEN Adv Inst Computat Sci Programming Environm Res Team Kobe Hyogo Japan RIKEN Adv Inst Computat Sci Kobe Hyogo Japan Univ Tsukuba Ctr Computat Sci Tsukuba Ibaraki Japan

To improve productivity for developing parallel applications on high performance computing systems, the XcalableMP PGAS language has been proposed. XcalableMP supports both a typical parallelization under the "global-view memory model" which uses directives and a flexible parallelization under the "local-view memory model" which uses coarray features. The goal of the present paper is to clarify XcalableMP's productivity and performance. To do so, we implement and evaluate the high performance computing challenge benchmark, namely, EP STREAM Triad, High Performance Linpack, Global fast Fourier transform, and RandomAccess on the K computer using up to 16,384 compute nodes and a generic cluster system using up to 128 compute nodes. We found that we could more easily implement the benchmarks using XcalableMP rather than using MPI. Moreover, most of the performance results using XcalableMP were almost the same as those using MPI.

关键词： Parallel language partitioned global address space high performance computing programming model XcalableMP

来源：评论

学校读者我要写书评

暂无评论

FEADS: A framework for exploring the application design space on network processors

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 2007年第1期35卷 1-31页

作者： Pai, Rajani Govindarajan, R. Indian Inst Sci Dept Comp Sci & Automat Supercomp Educ & Res Ctr Bangalore 560012 Karnataka India

Network processors are designed to handle the inherently parallel nature of network processing applications. However, partitioning and scheduling of application tasks and data allocation to reduce memory contention remain as major challenges in realizing the full performance potential of a given network processor. The large variety of processor architectures in use and the increasing complexity of network applications further aggravate the problem. This work proposes a novel framework, called FEADS, for automating the task of application partitioning and scheduling for network processors. FEADS uses the simulated annealing approach to perform design space exploration of application mapping onto processor resources. Further, it uses cyclic and r-periodic scheduling to achieve higher throughput schedules. To evaluate dynamic performance metrics such as throughput and resource utilization under realistic workloads, FEADS automatically generates a Petri net (PN) which models the application, architectural resources, mapping and the constructed schedule and their interaction. The throughput obtained by schedules constructed by FEADS is comparable to that obtained by manual scheduling for linear task flow graphs;for more complicated task graphs, FEADS' schedules have a throughput which is upto 2.5 times higher compared to the manual schedules. Further, static scheduling of tasks results in an increase in throughput by upto 30% compared to an implementation of the same mapping without task scheduling.

关键词： cyclic scheduling design space exploration network processor programming model performance Evaluation petri Nets

来源：评论

学校读者我要写书评

暂无评论

Self-tuning serverless task farming using proactive elasticity control (vol 24, pg 799, 2021)

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2021年第4期24卷 3855-3855页

作者： Kehrer, Stefan Zietlow, Dominik Scheffold, Jochen Blochinger, Wolfgang Reutlingen Univ Parallel & Distributed Comp Grp Alteburgstr 150 D-72762 Reutlingen Germany Max Planck Inst Intelligent Syst Autonomous Learning Grp Max Planck Ring 4 D-72076 Tubingen Germany

The cloud evolved into an attractive execution environment for parallel applications, which make use of compute resources to speed up the computation of large problems in science and industry. Whereas Infrastructure as a Service (IaaS) offerings have been commonly employed, more recently, serverless computing emerged as a novel cloud computing paradigm with the goal of freeing developers from resource management issues. However, as of today, serverless computing platforms are mainly used to process computations triggered by events or user requests that can be executed independently of each other and benefit from on-demand and elastic compute resources as well as per-function billing. In this work, we discuss how to employ serverless computing platforms to operate parallel applications. We specifically focus on the class of parallel task farming applications and introduce a novel approach to free developers from both parallelism and resource management issues. Our approach includes a proactive elasticity controller that adapts the physical parallelism per application run according to user-defined goals. Specifically, we show how to consider a user-defined execution time limit after which the result of the computation needs to be present while minimizing the associated monetary costs. To evaluate our concepts, we present a prototypical elastic parallel system architecture for self-tuning serverless task farming and implement two applications based on our framework. Moreover, we report on performance measurements for both applications as well as the prediction accuracy of the proposed proactive elasticity control mechanism and discuss our key findings.

关键词： Cloud computing Parallel computing Function-as-a-service Parallel cloud programming Elasticity programming model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：