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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

319 篇 会议
20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

280 篇 工学
- 275 篇 计算机科学与技术...
- 170 篇 软件工程
- 24 篇 信息与通信工程
- 18 篇 控制科学与工程
- 14 篇 电气工程
- 10 篇 电子科学与技术（可...
- 3 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
- 1 篇 安全科学与工程
154 篇 理学
- 152 篇 数学
- 21 篇 统计学（可授理学、...
- 4 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
14 篇 管理学
- 11 篇 管理科学与工程(可...
- 10 篇 工商管理
- 2 篇 图书情报与档案管...
4 篇 农学
- 4 篇 作物学
- 2 篇 农业资源与环境
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

82 篇 parallel process...
72 篇 parallel algorit...
20 篇 parallel archite...
12 篇 computer archite...
10 篇 concurrent compu...
10 篇 parallel program...
9 篇 computer science
7 篇 parallel process...
6 篇 algorithm design...
6 篇 scheduling
5 篇 approximation al...
5 篇 hypercubes
5 篇 multiprocessor i...
5 篇 hardware
4 篇 graph algorithms
4 篇 sorting
4 篇 educational inst...
4 篇 program processo...
4 篇 costs
4 篇 parallel computi...

机构

4 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 massachusetts in...
3 篇 univ of californ...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ calif davis...
2 篇 at and t bell la...
2 篇 univ nevada dept...
2 篇 new jersey inst ...
2 篇 univ of californ...
2 篇 intel res pittsb...
2 篇 department of ma...
2 篇 digital systems ...
2 篇 t.j. watson rese...
2 篇 max planck inst ...
2 篇 univ of maryland...

作者

8 篇 gibbons phillip ...
6 篇 reif john h.
5 篇 matias yossi
4 篇 rao satish
4 篇 ramachandran vij...
4 篇 blelloch guy e.
4 篇 muthukrishnan s.
4 篇 sarkar vivek
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 taniar d
3 篇 sohn andrew
3 篇 leighton tom
3 篇 vitter jeffrey s...
3 篇 sudborough ih
3 篇 miller gary l.
3 篇 gu yan
3 篇 meyer auf der he...
3 篇 biswas rupak
2 篇 lang kevin

语言

323 篇 英文
16 篇 其他

检索条件"任意字段=Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures"

共 339 条记录，以下是51-60 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning 24

Brief Announcement: Distributed Unconstrained Local Search f...

引用

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

作者： Sanders, Peter Seemaier, Daniel Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9798400704161

Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While shared-memory parallel partitioners have recently matured to achieve the same quality as widely used sequential partitioners, there is still a pronounced quality gap between distributed partitioners and their sequential counterparts. In this work, we shrink this gap considerably by describing the engineering of an unconstrained local search algorithm suitable for distributed partitioners. We integrate the proposed algorithm in a distributed multilevel partitioner. Our extensive experiments show that the resulting algorithm scales to thousands of PEs while computing cuts that are, on average, only 3.5% larger than those of a state-of-the-art high-quality shared-memory partitioner. Compared to previous distributed partitioners, we obtain on average 6.8% smaller cuts than the best-performing competitor while being more than 9 times faster.

关键词： graph partitioning distributed algorithms parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Deterministic and Low-Span Work-Efficient parallel Batch-Dynamic Trees 24

Deterministic and Low-Span Work-Efficient Parallel Batch-Dyn...

引用

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

作者： Anderson, Daniel Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9798400704161

Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. the problem is to maintain a tree subject to online edge insertions and deletions while answering queries about the tree, such as the heaviest weight on a path, etc. In the parallel batch-dynamic setting, the goal is to process batches of edge updates work efficiently in low (polylog n) span. Two work-efficient algorithms are known: batch-parallel Euler Tour Trees by Tseng et al. [ALENEX'19, (2019), pp. 92-106] and parallel Rake-Compress (RC) Trees by Acar et al. [ESA'20, (2020), pp. 2:1-2:23]. Both however are randomized and work efficient in expectation. Several downstream results that use these data structures (and indeed to the best of our knowledge, all known workefficient parallel batch-dynamic graph algorithms) are therefore also randomized. In this work, we give the first deterministic work-efficient solution to the problem. Our algorithm maintains a parallel RC-Tree on n vertices subject to batches of k edge updates deterministically in worst-case O(k log(1 + n/k)) work and O(log n log log k) span on the Common-CRCW PRAM. We also show how to improve the span of the randomized algorithm from O(log n log* n) to O(log n). Lastly, as a result of our new deterministic algorithm, we also derandomize several downstream results that make use of parallel batch-dynamic dynamic trees, previously for which the only efficient solutions were randomized.

关键词： dynamic trees parallel graph algorithms batch-dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

Polynomial root-finding. Analysis and computational investigation of a parallel algorithm

Polynomial root-finding. Analysis and computational investig...

引用

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

作者： Narendran, B. Tiwari, Prasoon Univ of Wisconsin-Madison Madison United States

ISBN: (纸本)089791483X

Using the ideas from the NC algorithm of Ben-Or and Tiwari [Journal of Complexity 6, 417-442, 1990], we develop a practical parallel algorithm that approximates the roots of a polynomial whose roots are all real. A new elementary proof of correctness is provided and the complexity of the algorithm is analyzed. A particular implementation of the algorithm that performs well in practice is described and its run-time behaviour is compared with the analytical predictions. Its performance is also compared with that of the root-finding algorithm in the PARI package.

关键词： Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analysis of gang scheduling for multiprogrammed parallel computing environments

Analysis of gang scheduling for multiprogrammed parallel com...

引用

proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures

作者： Squillante, Mark S. Wang, Fang Papaefthymiou, Marios T.J. Watson Research Cent Yorktown Heights NY United States

Gang scheduling is a resource management scheme for parallel and distributed systems that combines time-sharing with space-sharing to ensure short response times for interactive tasks and high overall system throughput. In this paper, we present and analyze a queueing theoretic model for a general gang scheduling scheme that forms the basis of a multiprogramming environment currently being developed for IBM's SP2 parallel system and for clusters of workstations. Our model and analysis can be used to tune our scheduler in order to maximize its performance on each hardware platform.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Quantitative comparison of parallel computation models

Quantitative comparison of parallel computation models

引用

proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures

作者： Juurlink, Ben H.H. Wijshoff, Harry A.G. Leiden Univ Leiden Netherlands

this paper experimentally validates performance related issues for parallel computation models on several parallel platforms (a MasPar MP-1 with 1024 processors, a 64-node GCel and a CM-5 of 64 processors). Our work consists of three parts. First, there is an evaluation part in which we investigate whether the models correctly predict the execution time of an algorithm implementation. Unlike previous work, which mostly demonstrated a close match between the measured and predicted running times, this paper shows that there are situations in which the models do not precisely predict the actual execution time of an algorithm implementation. Second, there is a comparison part in which the models are contrasted with each other in order to determine which model induces the fastest algorithms. Finally, there is an efficiency validation part in which the performance of the model derived algorithms are compared with the performance of highly optimized library routines to show the effectiveness of deriving fast algorithms through the formalisms of the models.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

On multiprocessor system scheduling 96

On multiprocessor system scheduling

引用

proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures

作者： Deng, Xiaotie Dymond, Patrick York Univ North York Ont Canada

ISBN: (纸本)9780897918091

the issue of effectiveness of private caches for processors were studied. Since time for all processors to access the shared memory simultaneously is usually much longer than the time for a processor to access its own private cache, scheduling with private caches falls into the distributed memory model where the lower bound applies. the effectiveness of private caches were shown by proving that a version of Dynamic Equi-partition Scheduling Policy (DEQ) achieves a mean response time with five times the optimal mean response time in the cache clock time for a large class of parallel jobs well accepted in the parallel scheduling community. this shows an improvement of system performance by using private caches over that of purely shared memory.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共34页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：