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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

480 篇 会议
44 篇 期刊文献
1 册 图书

馆藏范围

525 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

415 篇 工学
- 408 篇 计算机科学与技术...
- 260 篇 软件工程
- 55 篇 信息与通信工程
- 25 篇 电气工程
- 23 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 6 篇 农业工程
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 2 篇 机械工程
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 环境科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
254 篇 理学
- 248 篇 数学
- 29 篇 统计学（可授理学、...
- 4 篇 物理学
- 4 篇 系统科学
- 2 篇 化学
- 1 篇 生物学
36 篇 管理学
- 31 篇 管理科学与工程(可...
- 25 篇 工商管理
- 6 篇 图书情报与档案管...
9 篇 农学
- 9 篇 作物学
- 3 篇 农业资源与环境
4 篇 经济学
- 4 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

150 篇 parallel process...
86 篇 parallel algorit...
32 篇 parallel archite...
20 篇 parallel process...
19 篇 computer archite...
18 篇 parallel program...
13 篇 computer science
12 篇 concurrent compu...
12 篇 scheduling
10 篇 hardware
9 篇 approximation al...
8 篇 scalability
8 篇 network topology
7 篇 sorting
7 篇 multiprocessor i...
7 篇 parallel computi...
7 篇 distributed comp...
6 篇 routing
6 篇 hypercubes
6 篇 computer network...

机构

8 篇 carnegie mellon ...
5 篇 carnegie mellon ...
4 篇 univ calif berke...
4 篇 univ of paderbor...
3 篇 uc berkeley unit...
3 篇 paderborn univ p...
3 篇 carnegie mellon ...
3 篇 univ calif berke...
3 篇 georgetown unive...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ calif davis...
2 篇 int comp sci ins...
2 篇 washington state...
2 篇 massachusetts in...
2 篇 at and t bell la...
2 篇 university of ma...
2 篇 duke univ dept c...
2 篇 univ of central ...
2 篇 univ maryland de...

作者

11 篇 blelloch guy e.
9 篇 gibbons phillip ...
7 篇 reif john h.
6 篇 vishkin uzi
5 篇 gu yan
5 篇 leiserson charle...
5 篇 matias yossi
4 篇 karp richard m.
4 篇 snir marc
4 篇 ramachandran vij...
4 篇 tangwongsan kana...
4 篇 sun yihan
4 篇 leighton tom
4 篇 schwartz oded
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 miller gary l.
4 篇 demmel james
3 篇 ballard grey
3 篇 vitter js

语言

506 篇 英文
19 篇 其他

检索条件"任意字段=8th Annual ACM Symposium on Parallel Algorithms and Architectures"

共 525 条记录，以下是101-110 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Efficient parallel Reinforcement Learning Framework Using the Reactor Model 24

Efficient Parallel Reinforcement Learning Framework Using th...

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Kwok, Jacky Lohstroh, Marten Lee, Edward A. Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9798400704161

parallel Reinforcement Learning (RL) frameworks are essential for mapping RL workloads to multiple computational resources, allowing for faster generation of samples, estimation of values, and policy improvement. these computational paradigms require a seamless integration of training, serving, and simulation workloads. Existing frameworks, such as Ray, are not managing this orchestration efficiently, especially in RL tasks that demand intensive input/output and synchronization between actors on a single node. In this study, we have proposed a solution implementing the reactor model, which enforces a set of actors to have a fixed communication pattern. this allows the scheduler to eliminate work needed for synchronization, such as acquiring and releasing locks for each actor or sending and processing coordination-related messages. Our framework, Lingua Franca (LF), a coordination language based on the reactor model, also supports true parallelism in Python and provides a unified interface that allows users to automatically generate dataflow graphs for RL tasks. In comparison to Ray on a single-node multi-core compute platform, LF achieves 1.21x and 11.62x higher simulation throughput in OpenAI Gym and Atari environments, reduces the average training time of synchronized parallel Q-learning by 31.2%, and accelerates multi-agent RL inference by 5.12x.

关键词： parallel Computing Reinforcement Learning Programming Languages Machine Learning Model of Computation

来源：评论

学校读者我要写书评

暂无评论

A Framework for parallelizing Approximate Gaussian Elimination 24

A Framework for Parallelizing Approximate Gaussian Eliminati...

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Baumann, Yves Kyng, Rasmus Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9798400704161

In a breakthrough result, Spielman and Teng (2004) developed a nearly-linear time solver for Laplacian linear equations, i.e. equations where the coefficient matrix is symmetric with non-negative diagonals and zero rowsums. Since the development of the Spielman-Teng solver, there has been substantial progress, simplifying and improving their result, but obtaining a fast practical, parallel Laplacian solver remains an open problem. We present a framework for obtaining extremely simple, parallel Laplacian linear equation solvers with nearly-linear work and sub-linear depth. Our framework allows us to parallelize any Laplacian solver based on repeated single-vertex approximate Gaussian elimination. We demonstrate this by parallelizing both the algorithm of Kyng and Sachdeva (2016) and the practical variant by Gao, Kyng, and Spielman (2023). Our framework is work-efficient in the sense of matching the sequential work of these algorithms. Our parallelization framework is very simple: We sample a subset of the current low-degree vertices (sparse columns), and in parallel we eliminate all vertices that are isolated in the resulting induced subgraph. this approach can be combined with any parallelizable approximate single-vertex elimination subroutine with sparse output. Given the simplicity of the approach, we believe that using it to parallelize the solver of Gao, Kyng, and Spielman (2023) is the most promising direction for obtaining practical parallel Laplacian solvers. If we additionally use a parallel spectral sparsification routine, our approach can be modified to work in polylogarithmic depth and nearly-linear work.

关键词： Approximate Gaussian Elimination Laplacian Linear System Solver parallel algorithms Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

An implementation of the e-relaxation algorithm on the CM-5 5

An implementation of the e-relaxation algorithm on the CM-5

引用

5th annual acm symposium on parallel algorithms and architectures, SPAA 1993

作者： Narendran, B. De Leone, Renato Tiwari, Prasoon Computer Sciences Department University of Wisconsin-Madison MadisonWI53706 United States

ISBN: (纸本)0897915992

this paper discusses a parallel implementation of the e-relaxation algorithm for the min-cost flow problem on the CM-5. there is considerable loss in efficiency in going from one processor sequential implementation to one processor parallel implementation. While a naive parallelization is shown to have very low parallelism, we investigate the effectiveness of a set of algorithmic augmentations. these augmentations work by either eliminating non-parallel iterations or increasing the parallelism of the remaining iterations. Although the size of memory on the machine limits the size of problems used in our experiments, experimental scalability data shows that the parallel implementation may be able to beat the best sequential implementation on large enough problems. © 1993 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems

Pursuit and evasion on a ring: An infinite hierarchy for par...

引用

13th annual symposium on parallel algorithms and architectures (SPAA 2001)

作者： Bruda, S.D. Akl, S.G. Dept. of Computing and Info. Science Queen's University Kingston Ont. K7L 3N6 Canada

A parallel real-time complexity theory was presented to study infinity hierarchy for parallel real-time systems. Set of timed ω-languages was closed under intersection, union, complement, concatenation and Kleene closure. the proposed real-time algorithm consisted of an input tape containing timed ω-word and an output tape containing symbols from alphabet δ in finite control. the analysis suggested that the hierarchy of real-time algorithms with respect to number of processors was infinite.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Directed Transmission Method, a Fully Asynchronous Approach to Solve Sparse Linear Systems in parallel 08

Directed Transmission Method, a Fully Asynchronous Approach ...

引用

20th acm symposium on parallelism in algorithms and architectures

作者： Wei, Fei Yang, Huazhong Tsinghua Univ Dept Elect Engn Beijing Peoples R China

ISBN: (纸本)9781595939739

there are many algorithms to solve large sparse linear systems in parallel;however, most of them acquire synchronization and thus are lack of scalability. In this paper, we propose a new distributed numerical algorithm, called Directed Transmission Method (DTM). DTM is a fully asynchronous, scalable and continuous-time iterative algorithm to solve the arbitrarily-large sparse linear system whose coefficient matrix is symmetric-positive-definite (SPD). DTM is able to be freely running on the heterogeneous parallel computer with arbitrary number of processors, which might be manycore microprocessors, clusters, grids, clouds, and the Internet. We proved that DTM is convergent by making use of the final value theorem of Laplacian Transformation. Numerical experiments show that DTM is efficient.

关键词： Asynchronous Algorithm Convergence theory Directed Transmission Method (DTM) Distributed Algorithm Sparse Linear System Virtual Transmission Method (VTM)

来源：评论

学校读者我要写书评

暂无评论

Analyses of load stealing models based on differential equations 98

Analyses of load stealing models based on differential equat...

引用

Proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Mitzenmacher, M. Digital Systems Research Cent Palo Alto CA United States

ISBN: (纸本)9780897919890

In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the number of processors grows to infinity using differential equations. the advantages of this approach include the ability to model a large variety of systems and to provide accurate numerical approximations of system behavior even when the number of processors is relatively small. We show how this approach can yield significant intuition about the behavior of work stealing algorithms in realistic settings.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Scan grammars: parallel attribute evaluation via data-parallelism 93

Scan grammars: Parallel attribute evaluation via data-parall...

引用

5th annual acm symposium on parallel algorithms and architectures, SPAA 1993

作者： Reps, thomas University of Wisconsin United States

ISBN: (纸本)0897915992

this paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntax-directed analysis and translation. In particular, we address the problem of how to exploit parallelism during the evaluation of the attributes of a derivation tree of a non-circular attribute grammar. What distinguishes the ideas presented in this paper from earlier work on parallel attribute evaluation is the use of a data-parallel model: We define a new variant of attribute grammars, called scan grammars, that incorporates a data-parallel attribution construct. © 1993 acm.

关键词： Context sensitive grammars

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm 97

Implementation and evaluation of an efficient parallel Delau...

引用

Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Hardwick, Jonathan C. Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897918909

this paper describes the derivation of an empirically efficient parallel two-dimensional Delaunay triangulation program from a theoretically efficient CREW PRAM algorithm. Compared to previous work, the resulting implementation is not limited to datasets with a uniform distribution of points, achieves significantly better speedups over good serial code, and is widely portable due to its use of MPI as a communication mechanism. Results are presented for a loosely-coupled cluster of workstations, a distributed-memory multicomputer, and a shared-memory multiprocessor. the Machiavelli toolkit used to transform the nested data parallelism inherent in the divide-and-conquer algorithm into achievable task and data parallelism is also described and compared to previous techniques.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Supereffective slow-down of parallel computations 92

Supereffective slow-down of parallel computations

引用

4th annual acm symposium on parallel algorithms and architectures - SPAA '92

作者： Pan, Victor Y. Preparata, Franco P. Lehman Coll Bronx NY United States

ISBN: (纸本)089791483X

Brent's scheduling principle provides a general simulation scheme when fewer processors are available than specified by the fastest parallel algorithm. Such a scheme preserves the actual number of executed operations, and when applicable, it provides a processor balancing technique that significantly reduces the work, expressed as the number of executable operators. In this paper we discuss a new technique, called supereffective slow-down, that yields quite fast an algorithm with work significantly smaller than that of the fastest algorithm for the same problem. this technique can be viewed as a work-preserving acceleration of an existing recursive sequential algorithm for the considered problem. the presented examples include the computation of path algebras in graphs and digraphs and various computations in linear albegra. Some of the new algorithms may have practical value;for instance, we substantially improve the performance of the known parallel algorithms for triangular linear systems of equations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Modeling parallel bandwidth: Local vs. global restrictions

Modeling parallel bandwidth: Local vs. global restrictions

引用

Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Adler, Micah Gibbons, Phillip B. Matias, Yossi Ramachandran, Vijaya Heinz Nixdorf Inst Paderborn Germany

Recently there has been an increasing interest in models of parallel computation that account for the bandwidth limitations in communication networks. Some models (e.g., BSP and LOGP) account for bandwidth limitations using a per-processor parameter g>1, such that each processor can send/receive at most h messages in g&middoth time. Other models (e.g., PRAM(m)) account for bandwidth limitations as an aggregate parameter mΩ(√lg p) separation known previously.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共53页 << < 7 8 9 10 11 12 13 14 15 16 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：