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

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

作者： Samuel H. Christie Munindar P. Singh Amit K. Chopra North Carolina State University Raleigh NC USA Lancaster University Lancaster United Kingdom

ISBN: (纸本)9781450394321

Realizing a multiagent system involves implementing member agents who interact based on a protocol while making decisions in a decentralized manner. Current programming models for agents offer poor abstractions for decision making and fail to adequately bridge an agent's internal decision logic with its public *** present Kiko, a protocol-based programming model for agents. To implement an agent, a programmer writes one or more decision makers, each of which chooses from among a set of valid decisions and makes mutually compatible decisions on what messages to send. By completely abstracting away the underlying communication service and by supporting practical decision-making patterns, Kiko enables agent developers to focus on business logic. We provide an operational semantics for Kiko and establish that Kiko agents are protocol compliant and able to realize any protocol enactment.

关键词： asynchrony decentralization causality decision making multiagent systems programming model

来源：评论

学校读者我要写书评

暂无评论

Colony: Parallel Functions as a Service on the Cloud-Edge Continuum 27th

Colony: Parallel Functions as a Service on the Cloud-Edge Co...

引用

27th International European Conference on Parallel and Distributed Computing (Euro-Par)

作者： Lordan, Francesc Lezzi, Daniele Badia, Rosa M. Barcelona Supercomp Ctr BSC Dept Comp Sci Barcelona Spain

ISBN: (纸本)9783030856656;9783030856649

Although smart devices markets are increasing their sales figures, their computing capabilities are not sufficient to provide good-enough-quality services. This paper proposes a solution to organize the devices within the Cloud-Edge Continuum in such a way that each one, as an autonomous individual -Agent-, processes events/data on its embedded compute resources while offering its computing capacity to the rest of the infrastructure in a Function-as-a-Service manner. Unlike other FaaS solutions, the described approach proposes to transparently convert the logic of such functions into task-based workflows backing on task-based programming models;thus, agents hosting the execution of the method generate the corresponding workflow and offloading part of the workload onto other agents to improve the overall service performance. On our prototype, the function-to-workflow transformation is performed by COMPSs;thus, developers can efficiently code applications of any of the three envisaged computing scenarios - sense-process-actuate, streaming and batch processing - throughout the whole Cloud-Edge Continuum without struggling with different frameworks specifically designed for each of them.

关键词： Edge Fog Cloud Compute Continuum Distributed systems programming model Runtime system Serverless Function-as-a-Service Stream-processing Task-based workflow

来源：评论

学校读者我要写书评

暂无评论

Efficient Processing of Streaming Data using Multiple Abstractions 14

Efficient Processing of Streaming Data using Multiple Abstra...

引用

IEEE 14th International Conference on Cloud Computing (CLOUD)

作者： Qadeer, Abdul Heidemann, John Univ Southern Calif Informat Sci Inst Los Angeles CA 90007 USA

ISBN: (纸本)9781665400602

Large websites and distributed systems employ sophisticated analytics to evaluate successes to celebrate and problems to be addressed. As analytics grow, different teams often require different frameworks, with dozens of packages supporting with streaming and batch processing, SQL and no-SQL. Bringing multiple frameworks to bear on a large, changing dataset often create challenges where data transitions-these impedance mismatches can create brittle glue logic and performance problems that consume developer time. We propose Plumb, a meta-framework that can bridge three different abstractions to meet the needs of a large class of applications in a common workflow. Large-block streaming (Block-Streaming) is suitable for single-pass applications that care about the temporal and spatial locality. Windowed-Streaming allows applications to process a group of data and many reductions. Stateful-Streaming enables applications to keep a long-term state and always-on behavior. We show that it is possible to bridge abstractions, with a common, high-level workflow specification, while the system transitions data batch processing and block- and record-level streaming as required. The challenge in bridging abstractions is to minimize latency while allowing applications to select between sequential and parallel operation, while handling out-of-order data delivery, component failures, and providing clear semantics in the face of missing data. We demonstrate these abstractions evaluating a 10-stage workflow of DNS analytics that has been in production use with Plumb for 2 years, comparing to a brittle hand-built system that has run for more than 3 years.

关键词： programming model abstraction big-data abstraction large-block streaming programmer productivity

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient Distributed programming model for Swarm Robot

Energy-efficient Distributed Programming Model for Swarm Rob...

引用

13th International Conference on Control, Automation and Systems (ICCAS)

作者： Huh, Sungju Hong, Seongsoo Lee, Joonghyun Seoul Natl Univ Dept Elect & Comp Engn Seoul 151744 South Korea Seoul Natl Univ Grad Sch Convergence Sci & Technol Dept Transdisciplinary Studies Seoul 443270 South Korea

ISBN: (纸本)9788993215052

A swarm robot system is a multi-robot system which consists of a large number of simple, lightweight and interoperating robots. Since it mimics the behaviors of social insects, it is critical to program artificial swarm intelligence in a versatile manner. Distributed, scalable and severely resource-limited nature of swarm robotics, however, makes it very difficult to write application programs. In this paper, we propose an easy-to-use and effective programming model that addresses such programming difficulties as well as the energy-efficient deployment and execution of swarm intelligence programs. Specifically, the proposed model lets programmers concentrate on writing a core swarm intelligence algorithm while abstracting the implementation issues such as communication, synchronization and parallel processing of the algorithms. In order to show the utility and viability of the proposed approach, we have demonstrated a 3D map building application and performed experiments. The results show that the proposed approach reduces data traffic up to 82% with an acceptable error.

关键词： Swarm robotics programming model Energy efficient modeling Data aggregation

来源：评论

学校读者我要写书评

暂无评论

Prodigy: Improving the Memory Latency of Data-Indirect Irregular Workloads Using Hardware-Software Co-Design 27

Prodigy: Improving the Memory Latency of Data-Indirect Irreg...

引用

27th IEEE International Symposium on High-Performance Computer Architecture (HPCA)

作者： Talati, Nishil May, Kyle Behroozi, Armand Yang, Yichen Kaszyk, Kuba Vasiladiotis, Christos Verma, Tarunesh Li, Lu Nguyen, Brandon Sun, Jiawen Morton, John Magnus Ahmadi, Agreen Austin, Todd O'Boyle, Michael Mahlke, Scott Mudge, Trevor Dreslinski, Ronald Univ Michigan Ann Arbor MI 48109 USA Univ Wisconsin Madison WI USA Univ Edinburgh Edinburgh Midlothian Scotland

ISBN: (纸本)9781665422352

Irregular workloads are typically bottlenecked by the memory system. These workloads often use sparse data representations, e.g., compressed sparse row/column (CSR/CSC), to conserve space at the cost of complicated, irregular traversals. Such traversals access large volumes of data and offer little locality for caches and conventional prefetchers to exploit. This paper presents Prodigy, a low-cost hardware-software co-design solution for intelligent prefetching to improve the memory latency of several important irregular workloads. Prodigy targets irregular workloads including graph analytics, sparse linear algebra, and fluid mechanics that exhibit two specific types of data-dependent memory access patterns. Prodigy adopts a "best of both worlds" approach by using static program information from software, and dynamic run-time information from hardware. The core of the system is the Data Indirection Graph (DIG)-a proposed compact representation used to express program semantics such as the layout and memory access patterns of key data structures. The DIG representation is agnostic to a particular data structure format and is demonstrated to work with several sparse formats including CSR and CSC. Program semantics are automatically captured with a compiler pass, encoded as a DIG, and inserted into the application binary. The DIG is then used to program a low-cost hardware prefetcher to fetch data according to an irregular algorithm's data structure traversal pattern. We equip the prefetcher with a flexible prefetching algorithm that maintains timeliness by dynamically adapting its prefetch distance to an application's execution pace. We evaluate the performance, energy consumption, and transistor cost of Prodigy using a variety of algorithms from the GAP, HPCG, and NAS benchmark suites. We compare the performance of Prodigy against a non-prefetching baseline as well as state-of-the-art prefetchers. We show that by using just 0.8KB of storage, Prodigy outperforms a non

关键词： DRAM stalls irregular workloads graph processing hardware-software co-design programming model programmer annotations compiler and hardware prefetching

来源：评论

学校读者我要写书评

暂无评论

Mandrake: Multiagent Systems as a Basis for programming Fault-Tolerant Decentralized Applications 23

Mandrake: Multiagent Systems as a Basis for Programming Faul...

引用

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

作者： Samuel H. Christie Munindar P. Singh Amit K. Chopra North Carolina State University Raleigh NC USA Lancaster University Lancaster United Kingdom

ISBN: (纸本)9781450394321

We define a decentralized software application as one that consists of autonomous agents that communicate through asynchronous messaging. Constructing a decentralized application involves designing agents as independent local computations that coordinate to realize the application's requirements. Moreover, a decentralized application is susceptible to faults manifested as message loss, delay, and *** contribute Mandrake, a programming model for decentralized applications that addresses these challenges. Specifically, we adopt the construct of an information protocol that specifies messaging between agents purely in causal terms and can be correctly enacted by agents in a shared-nothing environment over nothing more than unreliable, unordered transport. Mandrake facilitates: implementing protocol-compliant agents by introducing a programming model; transforming fragile protocols into fault-tolerant ones with simple annotations; and a declarative policy language that makes it easy to implement fault-tolerance in agents based on the capabilities in protocols. In obviating the reliance on reliability and ordering guarantees in the communication infrastructure, Mandrake achieves some of the goals of the founders of networked computing from the 1970s.

关键词： programming model communication protocols asynchrony

来源：评论

学校读者我要写书评

暂无评论

Interaction-Oriented programming: Intelligent, Meaning-Based Multiagent Systems 23

Interaction-Oriented Programming: Intelligent, Meaning-Based...

引用

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

作者： Amit K. Chopra Samuel H. Christie Munindar P. Singh Lancaster University Lancaster United Kingdom North Carolina State University Raleigh NC USA

ISBN: (纸本)9781450394321

Interaction-Oriented programming (IOP) is an approach for engineering decentralized multiagent systems based in the idea of modeling interaction meaning. modeling meaning enables agents to make flexible decentralized decisions. IOP addresses the key architectural elements of multiagent systems, from communication services for messaging to protocols and norms. In this demo, we showcase the tools developed over the last decade that enable specifying, verifying, and implementing meaning-based, decentralized multiagent systems.

关键词： protocols programming model norms business processes decentralization

来源：评论

学校读者我要写书评

暂无评论

Mint: An Accelerator for Mining Temporal Motifs 22

Mint: An Accelerator for Mining Temporal Motifs

引用

Proceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Nishil Talati Haojie Ye Sanketh Vedula Kuan-Yu Chen Yuhan Chen Daniel Liu Yichao Yuan David Blaauw Alex Bronstein Trevor Mudge Ronald Dreslinski Computer Science and Engineering University of Michigan Ann Arbor MI USA Computer Science Department Technion - Israel Institute of Technology Haifa Israel Electrical and Computer Engineering University of Michigan Ann Arbor MI USA

ISBN: (纸本)9781665462723

A variety of complex systems, including social and communication networks, financial markets, biology, and neuroscience are modeled using temporal graphs that contain a set of nodes and directed timestamped edges. Temporal motifs in temporal graphs are generalized from subgraph patterns in static graphs in that they also account for edge ordering and time duration, in addition to the graph structure. Mining temporal motifs is a fundamental problem used in several application domains. However, existing software frameworks offer sub-optimal performance due to high algorithmic complexity and irregular memory accesses of temporal motif *** paper presents Mint---a novel accelerator architecture and a programming model for mining temporal motifs efficiently. We first divide this workload into three fundamental tasks: search, book-keeping, and backtracking. Based on this, we propose a task-centric programming model that enables decoupled, asynchronous execution. This model unlocks massive opportunities for parallelism, and allows storing task context information on-chip. To best utilize the proposed programming model, we design a domain-specific hardware accelerator using its data path and memory subsystem design to cater to the unique workload characteristics of temporal motif mining. To further improve performance, we propose a novel optimization called search index memoization that significantly reduces memory traffic. We comprehensively compare the performance of Mint with state-of-the-art temporal motif mining software frameworks (both approximate and exact) running on both CPU and GPU, and show 9×--2576× benefit in performance.

关键词： hardware accelerator programming model temporal motif mining

来源：评论

学校读者我要写书评

暂无评论

A Systematic Evaluation for Paint Messages and Their Processing among C plus plus /CLI Controls

A Systematic Evaluation for Paint Messages and Their Process...

引用

International Symposium on Computer, Consumer and Control (IS3C)

作者： Chang, Gao-Wei Natl Taiwan Normal Univ Dept Mechatron Engn Taipei Taiwan

ISBN: (纸本)9781728193625

This paper is to propose a systematic evaluation for paint messages among C++/CLI controls, e.g., form, button, and picture box. Specifically, the occurrences of such messages and priorities of their processing are investigated to enhance the design of programming models for graphical user interface (GUI). To demonstrate the effectiveness of this approach, those models are progressively integrated with processing paint messages from various controls, in a graphically-demanding C++/CLI project.

关键词： C plus plus /CLI paint message programming model

来源：评论

学校读者我要写书评

暂无评论

Multi-attribute group decision-making using double hierarchy hesitant fuzzy linguistic preference information

引用

NEURAL COMPUTING & APPLICATIONS 2020年第17期32卷 14031-14045页

作者： Krishankumar, R. Ravichandran, K. S. Shyam, V. Sneha, S. V. Kar, Samarjit Garg, Harish SASTRA Univ Sch Comp Thanjavur 613401 Tamil Nadu India Natl Inst Technol Dept Math Durgapur W Bengal India Thapar Inst Engn & Technol Deemed Univ Sch Math Patiala 147004 Punjab India

Double hierarchy hesitant fuzzy linguistic term set (DHHFLTS) is one of the successful extensions of the hesitant fuzzy linguistic term set used for describing the uncertain information in a more prominent manner for solving the group decision-making problems. In DHHFLTS, the membership functions are represented in terms of linguistic membership degrees which are a flexible structure for preference elicitation and enrich the ability for rational decision-making with complex linguistic expressions. Driven by the flexibility of DHHFLTS, in this paper, a new decision framework is developed for solving decision-making problems, which provides scientific and rational decisions based on the preference information. For it, initially, a new aggregation operator is proposed for aggregating decision-makers' preferences. Later, the importance of the attribute weights in the problems is determined by formulating a mathematical model and the COPRAS method is extended to the DHHFLTS context for prioritizing alternatives. The applicability of the presented approach is demonstrated through a numeric example related to green supplier selection. A comparative analysis with existing studies is also administered to test the effectiveness and verify the method.

关键词： COPRAS method Double hierarchy Group decision-making Maclaurin symmetric mean programming model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：