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

American Control Conference

作者： Haoyuan Sun David Grimsman Jason R. Marden Department of Electrical and Computer Engineering University of California Santa Barbara CA California Institute of Technology (Caltech) Pasadena CA

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy algorithm which guarantees approximation at least 1/2 of the optimal solution. This greedy algorithm can be implemented with a set of agents, each making a decision sequentially based on the choices of all prior agents. In this paper, we consider a generalization of the greedy algorithm in which agents can make decisions in parallel, rather than strictly in sequence. In particular, we are interested in partitioning the agents, where a set of agents in the partition all make a decision simultaneously based on the choices of prior agents, so that the algorithm terminates in limited iterations. We provide bounds on the performance of this parallelized version of the greedy algorithm and show that dividing the agents evenly among the sets in the partition yields an optimal structure. It is shown that such optimal structures holds even under very relaxed information constraints. We additionally show that this optimal structure is still near-optimal, even when additional information (i.e., total curvature) is known about the objective function.

关键词： greedy algorithm Agents Objective function parallel execution Total curvature partitions set partitioning CURING AGENT

来源：评论

学校读者我要写书评

暂无评论

A dynamic parameter tuning method for SpMM parallel execution

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2023年第17期35卷

作者： Qi, Bin Komatsu, Kazuhiko Sato, Masayuki Kobayashi, Hiroaki Tohoku Univ Grad Sch Informat Sci Sendai Miyagi Japan Tohoku Univ Cybersci Ctr Sendai Miyagi Japan

Sparse matrix-matrix multiplication (SpMM) is a basic kernel that is used by many algorithms. Several researches focus on various optimizations for SpMM parallel execution. However, a division of a task for parallelization is not well considered yet. Generally, a matrix is equally divided into blocks for processes even though the sparsities of input matrices are different. The parameter that divides a task into multiple processes for parallelization is fixed. As a result, load imbalance among the processes occurs. To balance the loads among the processes, this article proposes a dynamic parameter tuning method by analyzing the sparsities of input matrices. The experimental results show that the proposed method improves the performance of SpMM for examined matrices by up to 39.5% on a single vector engine and 3.49 x on a single CPU.

关键词： parallel execution parameter tuning sparse matrix-matrix multiplication

来源：评论

学校读者我要写书评

暂无评论

Web mining and its SQL based parallel execution 01

Web mining and its SQL based parallel execution

引用

Workshop on Information Technology for Virtual Enterprises

作者： Masaru Kitsuregawa Takahiko Shintani Iko Pramudiono The University of Tokyo 7-22-1 Roppongi Minato-ku Tokyo 106 Japan

ISBN: (纸本)0769509606

Web mining can be classified into two categories, Web access log mining and Web structure mining. We performed association rule mining and sequence pattern mining against the access log which was accumulated at NTT Software Mobile Info Search portal site. Detail web log mining process and the rules we derived are reported in this paper. The parallel association rule mining is explored on large scale PC cluster system. parallelism is key to improve the performance. We achieved substantial speed up through parallel SQL execution.

关键词： web mining SQL parallel execution mining Association rules

来源：评论

学校读者我要写书评

暂无评论

A parallel execution Model for Permissioned Blockchain Systems 22

A Parallel Execution Model for Permissioned Blockchain Syste...

引用

Proceedings of the 2022 5th International Conference on Blockchain Technology and Applications

作者： Tianjing Xu Yiming Zhang National University of Defense Technology China Xiamen University China

ISBN: (纸本)9781450397575

At present, academics have researched the directions that may become performance bottlenecks in blockchain systems, such as consensus protocols, encryption algorithms and contract execution. For example, in recent years, many improvements to consensus protocols have greatly improved the throughput of blockchain systems. However, the bottleneck of blockchain smart contract execution has not been well solved. Currently, the miner-validator architecture based on serial contract execution limits the throughput of smart contract execution to a great extent. This paper proposes a new smart contract parallel execution architecture, which migrates the concurrency control methods used in mature databases to the blockchain. The test of Ethereum data and a benchmark specifically for blockchain show that its throughput is greatly improved compared with the traditional serial execution mode.

关键词： parallel execution Smart contract Schedule Blockchain

来源：评论

学校读者我要写书评

暂无评论

PERCOLATION OF CODE TO ENHANCE parallel DISPATCHING AND execution

引用

IEEE TRANSACTIONS ON COMPUTERS 1972年第12期C 21卷 1411-1415页

作者： FOSTER, CC RISEMAN, EM UNIV MASSACHUSETTS DEPT COMP & INFORMATION SCIAMHERSTMA 01002

This note investigates the increase in parallel execution rate as a function of the size of an instruction dispatch stack with lookahead hardware. Under the constraint that instructions are not dispatched until all preceding conditional branches are resolved, stack sizes as small as 2 or 4 achieve most of the parallelism that a hypothetically infinite stack would.

关键词： Dispatch Stack Lookahead Hardware parallel execution parallelism Percolation Of Code Software Lookahead

来源：评论

学校读者我要写书评

暂无评论

parallel program execution support in the JGrid system

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2009年第3期4卷 213-220页

作者： Pota, S. Sipos, G. Juhasz, Z. Kacsuk, P. Univ Pannonia Fac Informat Technol Dept Informat Syst Veszprem Hungary MTA SZTAKI Comp & Automat Res Inst Budapest Hungary

Service-oriented grid systems will need to support a wide variety of sequential and parallel applications relying on interactive or batch execution in a dynamic environment. In this paper we describe the execution sup... 详细信息

关键词： service-oriented grid Java Jini parallel execution JGrid

来源：评论

学校读者我要写书评

暂无评论

Synchronization Techniques for parallel Redundant execution of Applications

Synchronization Techniques for Parallel Redundant Execution ...

引用

ARCS Workshop 2019;32nd International Conference on Architecture of Computing Systems

作者： Christian Nagengast Lukas Osinski Juergen Mottok Laboratory for Safe and Secure Systems - LaS~3 Technical University of Applied Sciences Regensburg

ISBN: (纸本)9783800749577

In fault tolerant systems, applications are replicated and executed to enable error detection and recovery. If one replica application fails, another is able to take its place and provide the correct results. This concept can benefit from parallel execution on separate execution units. The rise of multicore platforms supports the development of parallel software, by providing the adequate hardware. However, this raises challenges regarding the synchronization of the redundant strings of execution. Replica determinism means that given the same input, identical programs provide the same output. To ensure replica determinism, requirements regarding the synchronization can be split in two domains: data and time. This paper examines the state of the art of synchronization techniques for parallel replicated execution in the context of fault tolerant systems. We analyze the requirements regarding synchronization within the time and data domain and compare different concepts of hardware (multicore, multiprocessor and multi-PCB) and software (processes, threads).

关键词： Fault tolerance Synchronization Replica determinism Multicore parallel computing Multi-core processors Fault tolerance parallel PROCESSING (COMPUTERS) Fault tolerant systems Legal executions state of the art parallel programming active redundancy parallel execution Error detection and recovery

来源：评论

学校读者我要写书评

暂无评论

parallel and Asynchronous Smart Contract execution

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2022年第5期33卷 1097-1108页

作者： Liu, Jian Li, Peilun Cheng, Raymond Asokan, N. Song, Dawn Zhejiang Univ Hangzhou 310027 Peoples R China Tsinghua Univ Beijing 100084 Peoples R China Univ San Francisco San Francisco CA 94117 USA Univ Waterloo Waterloo ON N2L 3G1 Canada Univ Calif Berkeley Berkeley CA 94720 USA

Today's blockchains suffer from low throughput and high latency, which impedes their widespread adoption of more complex applications like smart contracts. In this article, we propose a novel paradigm for smart contract execution. It distinguishes between consensus nodes and execution nodes: different groups of execution nodes can execute transactions in parallel;meanwhile, consensus nodes can asynchronously order transactions and process execution results. Moreover, it requires no coordination among execution nodes and can effectively prevent livelocks. We show two ways of applying this paradigm to blockchains. First, we show how we can make Ethereum support parallel and asynchronous contract execution without hard-forks. Then, we propose a new public, permissionless blockchain. Our benchmark shows that, with a fast consensus layer, it can provide a high throughput even for complex transactions like Cryptokitties gene mixing. It can also protect simple transactions from being starved by complex transactions.

关键词： Blockchain Smart contracts Servers Cryptography Protocols Throughput Bitcoin Blockchain smart contract parallel execution asynchronous execution

来源：评论

学校读者我要写书评

暂无评论

Using reverse circuit execution for efficient parallel simulation of logic circuits

Using reverse circuit execution for efficient parallel simul...

引用

Conference on Mathematics of Data/Image Coding, Compression and Encryption V, with Applications

作者： Perumalla, K Fujimoto, R Georgia Tech Coll Comp Atlanta GA 30332 USA

ISBN: (纸本)0819445606

A novel technique called reverse circuit execution is presented as an efficient approach towards integrated parallel execution of multiple sequential circuit simulators. The unique aspect of this approach is that it does not require Source code modifications to either simulation engines or circuit models, and hence holds appeal in situations where parallelism is desirable but without access to simulator and/or model source code (as in the case, of commercial simulators with proprietary code concerns). First, algorithms and methodology are presented for transforming an input circuit into another equivalent circuit that is capable of both forward and reverse execution. Following that, it is shown how the transformed circuit can be used towards optimistic synchronization of multiple circuit simulators. As an end result of using Our approach, it will be possible to efficiently co-simulate logic circuits partitioned across multiple commercial simulators, by synchronizing their execution using optimistic concurrency protocols.

关键词： circuit simulation parallel execution reverse execution

来源：评论

学校读者我要写书评

暂无评论

parallel SMT Solving and Concurrent Symbolic execution 14

Parallel SMT Solving and Concurrent Symbolic Execution

引用

13th IEEE International Symposium on parallel and Distributed Processing with Applications

作者： Rakadjiev, Emil Shimosawa, Taku Mine, Hiroshi Oshima, Satoshi Hitachi Ltd Yokohama Res Lab Kanagawa 2440817 Japan

ISBN: (纸本)9781467379526

Satisfiability Modulo Theories (SMT) solving is a fundamental tool in numerous areas of computer science, where problems are expressed as logical formulas whose satisfiability has to be decided. State-of-the-art solvers can handle many real-world problems efficiently, however, SMT solving is an NP-hard problem, and the strong reliance on the solvers typically makes them the dominating performance hot spot of the systems utilizing them. Symbolic execution is a software analysis method used for automated high-coverage test generation, among others. It relies heavily on SMT solving and spends substantial amount of its run time, commonly more than 90%, in solver activities. In this paper, we investigate how symbolic execution can benefit from the use of general-purpose, parallel SMT solving. We present design, prototypical implementation, and evaluation of a linearly scalable SMT solver cluster and an extension of the KLEE symbolic execution engine, offering concurrent execution and asynchronous constraint solving. We show that, depending on the characteristics of the program being analyzed, KLEE's performance is improved by up to 7.6x with the help of our approach.

关键词： Asynchronous SMT Solving Concurrent Symbolic execution Distributed SMT Solving parallel SMT Solving SMT Solving Symbolic execution Surface mount technology Legal executions computer science Solvers computability parallel execution Nondeterministic polynomial-time hard

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：