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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

352 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 256 篇 计算机科学与技术...
- 173 篇 软件工程
- 25 篇 电气工程
- 25 篇 信息与通信工程
- 19 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
154 篇 理学
- 151 篇 数学
- 25 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
15 篇 管理学
- 12 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

82 篇 parallel algorit...
71 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
9 篇 scheduling
8 篇 computer archite...
7 篇 pram
6 篇 computer systems...
5 篇 graph algorithms
4 篇 performance
4 篇 parallel archite...
4 篇 sorting
4 篇 multithreading
4 篇 transactional me...
4 篇 work stealing
3 篇 parallel process...
3 篇 parallelism
3 篇 approximation al...
3 篇 cilk
3 篇 chip multiproces...

机构

10 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...
2 篇 digital systems ...
2 篇 t.j. watson rese...
2 篇 max planck inst ...
2 篇 bell laboratorie...

作者

12 篇 gibbons phillip ...
11 篇 blelloch guy e.
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 cormen thomas h.
4 篇 ramachandran vij...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 meyer auf der he...
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 monien burkhard
3 篇 sohn andrew
3 篇 leighton tom
3 篇 simhadri harsha ...

语言

357 篇 英文
13 篇 其他

检索条件"任意字段=Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures"

共 370 条记录，以下是161-170 订阅

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

详细简洁

排序：

parallel algorithms for generating random permutations on a shared memory machine 90

Parallel algorithms for generating random permutations on a ...

引用

SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

作者： Anderson, Richard J. Univ of Washington WA United States

ISBN: (纸本)0897913701

In this paper we consider the problem of generating random permutations on small parallel machines. The machines that we have in mind are shared memory machines with a constant number of processors such as the Sequent Symmetry. We describe a parallel implementation of the 'shuffling' algorithm for generating a random permutation. If the hardware operates in a fair manner, this algorithm generates a fully random permutation. However, if the machine resolves contention in a malicious manner, then the algorithm does not generate permutations uniformly. We give almost tight bounds on the degree that an adversary can reduce the randomness. We also discuss the cost of locking data in the algorithm and present a method of generating random permutations with substantially reduced locking cost.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Fast and reliable parallel hashing 91

Fast and reliable parallel hashing

引用

3rd annual acm symposium on parallel algorithms and architectures - SPAA'91

作者： Bast, H. Saarlands, U. Hagerup, T. Fachbereich Informatik Universität des Saarlandes W-6600 Saarbrücken Germany Max-Planck-Institut für Informatik W-6600 Saarbrücken Germany

ISBN: (纸本)0897914384

A perfect hash function for a (multi)set X of n integers is an infective function h : X → {1,., s}, where s = O(n), that can be stored in O(n) space and evaluated in constant time by a single processor. We show that a perfect hash function for a given multiset of n integers can be constructed optimally in O(log∗n) time using O(n/log∗n) processors. Our algorithm is faster than all previously published methods. More significantly, it is highly reliable: Whereas analyses of previous fast parallel hashing schemes provided bounds on the expected resource requirements only, our algorithm is guaranteed to stay within the bounds given with overwhelming probability. © 1991 acm.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Can a shared-memory model serve as a bridging model for parallel computation?

Can a shared-memory model serve as a bridging model for para...

引用

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

作者： Gibbons, Phillip B. Matias, Yossi Ramachandran, Vijaya Lucent Technologies Murray Hill United States

We consider the question of whether a shared-memory model can serve as an effective bridging model for parallel computation along the lines of a distributed-memory model such as the BSP. As a candidate for a shared-memory bridging model, we introduce the Queuing Shared Memory (QSM) model, which accounts for limited communication bandwidth while still providing a simple shared-memory abstraction. We substantiate the ability of the QSM to serve as a bridging model by providing a simple work-preserving emulation of the QSM on both the BSP, and on a related model, the (d,x)-BSP. We present evidence that the features of the QSM are essential to its effectiveness as a bridging model. In addition, we describe scenarios in which the high-level QSM is more suited for analyzing algorithms on certain machines than the more detailed BSP and LogP models. Finally, we present algorithmic results for the QSM, as well as general strategies for mapping algorithms designed for the BSP or PRAM models onto the QSM model. Our main conclusion is that shared-memory models can potentially serve as viable alternatives to existing message-passing, distributed-memory bridging models.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

More time-work tradeoffs for parallel graph algorithms 91

More time-work tradeoffs for parallel graph algorithms

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Spencer, Thomas H. Computer Science Department Rensselaer Polytechnic Institute United States

ISBN: (纸本)0897914384

Some parallel algorithms have the property that, as they are allowed to take more time, the total work that they do is reduced. This paper describes three such algorithms that find the strongly connected components of a directed graph. Two of these algorithms are Las Vegas algorithms that run in Õ(t) time and do Õ(n3/t2 + m) and Õ(mn/t + n3/t3) work, respectively. The third is a Monte Carlo algorithm that also runs in O(t) time, but does O (mn + n3/t5) work. The Õ notation means to ignore logarithmic factors. It is also possible to solve the single source shortest path problem with edge lengths between 1 and L in O((n/ρ) log n log(ρL)) time while doing O(nρ 2 log ρ log(ρL)) + Õ(m + n log L) work. Finally, the problem of finding an ear decomposition of a strongly connected directed graph can be reduced to the problem of finding a spanning tree with a. specified root. © 1991 acm.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Speed Scaling on parallel Processors 07

Speed Scaling on Parallel Processors

引用

19th annual symposium on parallelism in algorithms and architectures

作者： Albers, Susanne Mueller, Fabian Schmelzer, Swen Univ Freiburg Dept Comp Sci D-79110 Freiburg Germany

ISBN: (纸本)9781595936677

In this paper we investigate algorithmic instruments leading to low power consumption in computing devices. While previous work on energy-efficient algorithms has mostly focused on single processor environments, in this paper we investigate multi-processor settings. We study the basic problem of scheduling a set of jobs, each specified by a release time, a deadline and a processing volume, on variable speed processors so as to minimize the total energy consumption. We first settle the complexity of speed scaling with unit size jobs. More specifically, we devise a polynomial time algorithm for agreeable deadlines and prove NP-hardness results for arbitrary release dates and deadlines. For the latter setting we also develop a polynomial time algorithm achieving a constant factor approximation guarantee that is independent of the number of processors. Additionally, we study speed scaling of jobs with arbitrary processing requirements and, again, develop constant factor approximation algorithms. We finally transform our offline algorithms into constant competitive online strategies.

关键词： multiprocessor scheduling energy efficiency approximation algorithms online algorithms NP-completeness

来源：评论

学校读者我要写书评

暂无评论

SPAA 2024 - proceedings of the 36th acm symposium on parallelism in algorithms and architectures

SPAA 2024 - Proceedings of the 36th ACM Symposium on Paralle...

引用

36th acm symposium on parallelism in algorithms and architectures, SPAA 2024

ISBN: (纸本)9798400704161

The proceedings contain 54 papers. The topics discussed include: expediting hazard pointers with bounded RCU critical sections;Alock: asymmetric lock primitive for RDMA systems;when is parallelism fearless and zero-cost with rust?;efficient parallel reinforcement learning framework using the reactor model;parallel best arm identification in heterogeneous environments;brief announcement: lock-free learned search data structure;brief announcement: LIT: lookup interlocked table for range queries;brief announcement: a fast scalable detectable unrolled lock-based linked list;scheduling out-trees online to optimize maximum flow;optimizing dynamic data center provisioning through speed scaling: a primal-dual perspective;scheduling jobs with work-inefficient parallel solutions;and multi bucket queues: efficient concurrent priority scheduling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Conflict-free access of arrays in a parallel processor 89

Conflict-free access of arrays in a parallel processor

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Lee, D.-L. Wang, Y.H. Department of Computer Science York University North YorkONM3J1P3 Canada

ISBN: (纸本)089791323X

Let T be a collection of data templates of an N × N matrix, T = {row, column, forward diagonal, backward diagonal}. In the context of parallel processing, the question of whether it is possible or not for a parallel processor with N processing elements, N memory modules, and an interconnection network to allow parallel, conflict-free access to any instance of any data templates in T for N = 2n and any n > 1 has been open for a long time. The problem essentially concerns whether there exists any valid skewing scheme that can be realized in terms of interconnection networks. In this paper we will answer this open question by presenting a valid skewing scheme and a simple interconnection network that efficiently implements the skewing scheme in question. © 1989 acm.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers 97

Using tadpoles to reduce memory and communication requiremen...

引用

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

作者： Cooperman, Gene Tselman, Michael Northeastern Univ Boston MA United States

ISBN: (纸本)9780897918909

A parallel variant of breadth-first search for distributed computing is presented. The variant allows exhaustive enumeration of elements of a search space (implicitly defined graph) in which the representation of all graph nodes would otherwise require more than the total available memory. This algorithm requires the use of a tadpole data structure to partition the search space into connected subgraphs, with each subgraph stored within the memory of a single processor. Thus, the graph of the nodes are stored in a way that adds greater spatial locality, thereby reducing communication among processors. The algorithm enumerates the tadpoles in a breadth-first manner while executing depth-first search within each tadpole. The search within each tadpole is reduced to tree search. A parameter is defined that allows a linear tradeoff in which memory and communication are each reduced linearly as CPU time grows. The result appears to fill a gap in the literature, which has concentrated on parallel depth-first search, but has been relatively sparse in the case of parallel breadth-first search.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Bounds on the efficiency of message-passing protocols for parallel computers 93

Bounds on the efficiency of message-passing protocols for pa...

引用

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

作者： Cypher, Robert Konstantinidou, Smaragda IBM Almaden Research Center San Jose CA

ISBN: (纸本)0897915992

This paper considers the problem of creating message-passing protocols for parallel computers. It is assumed that the processors are connected by a network that provides guaranteed delivery of every message, provided that each message delivered by the network is removed by the receiving processor unconditionally and in finite time. Two models of message-passing are considered, namely a selective model in which the receiver specifies the source of the message, and a nonselective model in which the receiver accepts messages from all sources. We consider only space-efficient protocols in which each processor has storage for a constant number of messages and message headers. We present three main results. First, we give a protocol for the selective model that performs a constant amount of communication per send or receive posted by the application. Second, we prove that no such efficient protocol exists for the nonselective model. Third, we present a protocol for the nonselective model that performs a logarithmic amount of communication per send or receive posted by the application. © 1993 acm.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

parallel searching in generalized monge arrays with applications 90

Parallel searching in generalized monge arrays with applicat...

引用

SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

作者： Aggarwal, Alok Kravets, Dina Park, James K. Sen, Sandeep T. J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897913701

This paper investigates the parallel time and processor complexities of several searching problems involving Monge and Monge-composite arrays. We present array-searching algorithms for concurrent-read-concurrent-write (CRCW) PRAMs, concurrent-read-exclusive-write (CREW) PRAMs, hypercubes, cube-connected-cycles, and shuffle-exchange networks. All these algorithms run in optimal time, and their processor-time products are all within an O(lg n) factor of the worst-case sequential bounds. Several applications of these algorithms are also given. Two applications improve previous results substantially, and the others provide novel parallel algorithms for problems not previously considered.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：