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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,504 篇 会议
105 篇 期刊文献

馆藏范围

1,609 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,168 篇 工学
- 1,111 篇 计算机科学与技术...
- 557 篇 软件工程
- 118 篇 电气工程
- 75 篇 信息与通信工程
- 46 篇 控制科学与工程
- 37 篇 电子科学与技术（可...
- 13 篇 材料科学与工程（可...
- 13 篇 农业工程
- 11 篇 机械工程
- 11 篇 光学工程
- 8 篇 化学工程与技术
- 8 篇 生物工程
- 7 篇 建筑学
- 7 篇 生物医学工程（可授...
- 6 篇 动力工程及工程热...
- 5 篇 土木工程
- 3 篇 力学（可授工学、理...
579 篇 理学
- 557 篇 数学
- 55 篇 统计学（可授理学、...
- 16 篇 物理学
- 9 篇 生物学
- 9 篇 系统科学
- 8 篇 化学
73 篇 管理学
- 64 篇 管理科学与工程(可...
- 40 篇 工商管理
- 10 篇 图书情报与档案管...
16 篇 农学
- 16 篇 作物学
6 篇 经济学
- 6 篇 应用经济学
3 篇 法学
- 3 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 医学
1 篇 文学
1 篇 军事学

主题

237 篇 parallel algorit...
173 篇 parallel process...
80 篇 computer archite...
74 篇 parallel process...
57 篇 parallel program...
55 篇 algorithms
47 篇 parallel archite...
41 篇 hardware
30 篇 scheduling
27 篇 computer program...
21 篇 graph algorithms
20 篇 computer systems...
18 篇 approximation al...
18 篇 processor schedu...
18 篇 computational mo...
18 篇 field programmab...
17 篇 parallel computi...
16 篇 computer science
16 篇 performance
16 篇 delay

机构

32 篇 carnegie mellon ...
15 篇 swiss fed inst t...
15 篇 carnegie mellon ...
11 篇 univ maryland de...
11 篇 stanford univ st...
10 篇 univ maryland co...
10 篇 mit 77 massachus...
10 篇 univ calif berke...
8 篇 eth zurich
7 篇 georgetown univ ...
7 篇 mit cambridge ma...
7 篇 univ texas austi...
6 篇 penn state univ ...
6 篇 mit csail cambri...
5 篇 univ calif river...
5 篇 princeton univer...
5 篇 university of ma...
5 篇 microsoft res re...
5 篇 carnegie mellon ...
5 篇 harvard univ cam...

作者

38 篇 blelloch guy e.
20 篇 gu yan
18 篇 gibbons phillip ...
18 篇 shun julian
18 篇 goodrich michael...
16 篇 fineman jeremy t...
15 篇 sun yihan
14 篇 dhulipala laxman
13 篇 vishkin uzi
12 篇 agrawal kunal
11 篇 leiserson charle...
10 篇 ballard grey
10 篇 hoefler torsten
10 篇 anon
10 篇 miller gary l.
10 篇 harris david g.
9 篇 ghaffari mohsen
9 篇 tangwongsan kana...
9 篇 reif john h.
9 篇 demmel james

语言

1,569 篇 英文
40 篇 其他

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

共 1609 条记录，以下是381-390 订阅

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

详细简洁

排序：

Modeling communication in parallel algorithms. A fruitful interaction between theory and systems? 94

Modeling communication in parallel algorithms. A fruitful in...

引用

Proceedings of the 6th annual acm symposium on parallel algorithms and architectures

作者： Pal, Singh, Jaswinder Rothberg, Edward Gupta, Anoop Computer Systems Laboratory Stanford University Stanford CA Intel Supercomputer Systems 14924 NW Greenbrier Pkwy C06-09 Beaverton OR

ISBN: (纸本)9780897916714

Recently, several theoretical models of parallel architectures have been proposed to replace the PRAM as the model that is presented to an algorithm designer. A primary focus of the new models is to include the cost of interprocessor communication, which is increasingly important in modern parallel architectures. We argue that modeling the communication costs in the architecture or system is only one part of the problem. The other, and usually much more difficult, part is modeling the communication properties of the algorithm itself, which provides necessary inputs into the architectural model to determine overall complexity. In this context, we make three main points in this paper: (i) It is incomplete to describe communication without regard to its relationship with replication. We propose a description of the communication-replication relationship in terms of the working set hierarchy of an algorithm. (ii) Both inherent communication and the communication-replication relationship can be very difficult to model in irregular, dynamic computations that are crucial in many real-world applications. We present some examples that demonstrate this difficulty. (iii) We believe that substantial leverage can be obtained in this effort from the computer systems community, which can provide a hierarchy of simulation and profiling tools—from abstract to detailed—tailored to the needs of the algorithm designers. We propose an initial set of simulation tools, and we discuss possible future refinements to this set.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Conflict-Free Coloring for Rectangle Ranges Using O(n^.382) Colors 07

Conflict-Free Coloring for Rectangle Ranges Using <i>O</i>(<...

引用

19th annual symposium on parallelism in algorithms and architectures

作者： Ajwani, Deepak Elbassioni, Khaled Govindarajan, Sathish Ray, Saurabh Max Planck Inst Informat Saarbrucken Germany

ISBN: (纸本)9781595936677

Given a set of points P subset of R-2, a conflict free coloring of P w.r.t. rectangle ranges is an assignment of colors to points of P, such that each non-empty axis-parallel rectangle T in the plane contains a point whose color is distinct from all other points in P boolean AND T. This notion has been the subject of recent interest, and is motivated by frequency assignment in wireless cellular networks: one naturally would like to minimize the number of frequencies (colors) assigned to bases stations (points), such that within any range (for instance, rectangle), there is no interference. We show that any set of n points in R-2 can be conflict-free colored with (O) over tilde (n(beta+epsilon)) colors in expected polynomial time, for any arbitrarily small epsilon > 0 and beta = 3-root 5/2 < 0.382. This improves upon the previously known bound of O(root n log log n/ log n).

关键词： Frequency assignment in wireless networks conflict-free coloring axis-parallel rectangles dominating sets monotone sequences

来源：评论

学校读者我要写书评

暂无评论

parallel Longest Increasing Subsequence and van Emde Boas Trees 23

Parallel Longest Increasing Subsequence and van Emde Boas Tr...

引用

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

作者： Gu, Yan Men, Ziyang Shen, Zheqi Sun, Yihan Wan, Zijin UC Riverside Riverside CA 92521 USA

ISBN: (纸本)9781450395458

This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let.. be the input size and k be the LIS length of the input. Sequentially, LIS is a simple problem that can be solved using dynamic programming (DP) in O(n log n) work. However, parallelizing LIS is a long-standing challenge. We are unaware of any parallel LIS algorithm that has optimal O(n log n) work and non-trivial parallelism (i.e., (O) over tilde (k) or o(n) span). This paper proposes a parallel LIS algorithm that costs O(n log k) work, (O) over tilde (k) span, and O(n) space, and is much simpler than the previous parallel LIS algorithms. We also generalize the algorithm to a weighted version of LIS, which maximizes the weighted sum for all objects in an increasing subsequence. To achieve a better work bound for the weighted LIS algorithm, we designed parallel algorithms for the van Emde Boas (vEB) tree, which has the same structure as the sequential vEB tree, and supports work-efficient parallel batch insertion, deletion, and range queries. We also implemented our parallel LIS algorithms. Our implementation is light-weighted, efficient, and scalable. On input size 10(9), our LIS algorithm outperforms a highly-optimized sequential algorithm (with O(n log k) cost) on inputs with k <= 3 x 10(5). Our algorithm is also much faster than the best existing parallel implementation by Shen et al. (2022) on all input instances.

关键词： parallel algorithms longest increasing subsequence van Emde Boas tree dynamic programming parallel data structure

来源：评论

学校读者我要写书评

暂无评论

MODELS FOR USE IN THE DESIGN OF MACRO-PIPELINED parallel PROCESSORS.

MODELS FOR USE IN THE DESIGN OF MACRO-PIPELINED PARALLEL PRO...

引用

Conference Proceedings - 12th annual International symposium on Computer Architecture.

作者： Smith, Bradley Warren Siegel, Howard Jay Purdue Univ Sch of Electrical Engineering West Lafayette IN USA Purdue Univ Sch of Electrical Engineering West Lafayette IN USA

ISBN: (纸本)0818606347

An approach is proposed for modeling off-the-shelf hardware and for modeling parallel algorithms, along with a design methodology to use the information provided by these models, to design a class of macro-pipelined special-purpose architectures. Nine parameters to form a model of the characteristics of parallel/distributed algorithms and the environment in which they must execute are presented. In addition, a set of tuples to model the characteristics of computer architectures is presented. By combining the tuples with the parameters, the execution time of the algorithm modeled by the parameters on the hardware modeled by the tuples can be approximated. The combination of these models could be used as a basis for computer-aided tools used in the design of macro-pipelined parallel/distributed processors.

关键词： COMPUTER SYSTEMS, DIGITAL

来源：评论

学校读者我要写书评

暂无评论

High-Performance and Flexible parallel algorithms for Semisort and Related Problems 23

High-Performance and Flexible Parallel Algorithms for Semiso...

引用

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

作者： Dong, Xiaojun Wu, Yunshu Wang, Zhongqi Dhulipala, Laxman Gu, Yan Sun, Yihan Univ Calif Riverside Riverside CA 92521 USA Univ Maryland College Pk MD 20742 USA

ISBN: (纸本)9781450395458

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array of records and a function extracting a key per record, and reorders them so that records with equal keys are contiguous. Since many applications only require collecting equal values, but not fully sorting the input, semisort is broadly applicable, e.g., in string algorithms, graph analytics, and geometry processing, among many other domains. However, despite dozens of recent papers that use semisort in their theoretical analysis and the existence of an asymptotically optimal parallel semisort algorithm, most implementations of these parallel algorithms choose to implement semisort by using comparison or integer sorting in practice, due to potential performance issues in existing semisort implementations. In this paper, we revisit the semisort problem, with the goal of achieving a high-performance parallel semisort implementation with a flexible interface. Our approach can easily be extended to two related problems, histogram and collect-reduce. Our algorithms achieve strong speedups in practice, and importantly, outperform state-of-the-art parallel sorting and semisorting methods for almost all settings we tested, with varying input sizes, distribution, and key types. On average (geometric means), our semisort implementation is at least 1.27x faster the best of the tested baselines. We also test two important applications with real-world data, and show that our algorithms improve the performance (up to 2.13x) over existing approaches. We believe that many other parallel algorithm implementations can be accelerated using our results.

关键词： Semisort Collect-reduce Histogram Sorting Group-by parallel algorithms Shared-Memory parallelism

来源：评论

学校读者我要写书评

暂无评论

Novel architectures for P2P applications: The continuous-discrete approach 03

Novel architectures for P2P applications: The continuous-dis...

引用

Fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Naor, Moni Wieder, Udi Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9781581136616

We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to processors. We demonstrate the power of these design rules by suggesting two new architectures, one for DHT (Distributed Hash Table) and the other for dynamic expander networks. The DHT network, which we call Distance Halving allows logarithmic routing and load, while preserving constant degrees. It offers an optimal tradeoff between the degree and the dilation in the sense that degree d guarantees a dilation of O(logdn). Another advantage over previous constructions is its relative simplicity. A major new contribution of this construction is a dynamic caching technique that maintains low load and storage even under the occurrence of hot spots. Our second construction builds a network that is guaranteed to be an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. A small variation yields a DHT which is robust against random faults. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worst parameters. Therefore we expect that more distributed data structures could be designed and implemented in a dynamic environment.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

The Cilkview Scalability Analyzer 10

The Cilkview Scalability Analyzer

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： He, Yuxiong Leiserson, Charles E. Leiserson, William M. Microsoft Res Redmond WA USA

ISBN: (纸本)9781450300797

The Cilkview scalability analyzer is a software tool for profiling, estimating scalability, and benchmarking multithreaded Cilk++ applications Cilkview monitors logical parallelism during an instrumented execution of the Cilk++ application on a single processing core. As Cilkview executes, it analyzes logical dependencies within the computation to determine its work and span (critical-path length) These metrics allow Cilkview to estimate parallelism and predict how the application will scale with the number of processing cores. In addition, Cilkview analyzes scheduling overhead using the concept of a "burdened dag," which allows it to diagnose performance problems in the application due to an insufficient grain size of parallel subcomputations Cilkview employs the Pin dynamic-instrumentation framework to collect metrics during a serial execution of the application code It operates directly on the optimized code rather than on a debug version Metadata embedded by the Cilk++ compiler in the binary executable identifies the parallel control constructs in the executing application This approach introduces little or no overhead to the program binary in normal runs. Cilkview can perform real-time scalability benchmarking automatically, producing gnuplot-compatible output that allows developers to compare an application's performance with the tool's predictions. If the program performs beneath the range of expectation, the programmer can be confident in seeking a cause such as insufficient memory bandwidth, false sharing, or contention, rather than inadequate parallelism or insufficient exam size.

关键词： Burdened parallelism Cilk plus Cilkview dag model multicore programming multithreading parallelism parallel programming performance scalability software tools span speedup work

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel shortest-paths in digraphs with a separator decomposition 93

Efficient parallel shortest-paths in digraphs with a separat...

引用

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

作者： Cohen, Edith AT and T Bell Laboratories Murray HillNJ07974 United States

ISBN: (纸本)0897915992

We consider shortest paths and reachability problems on directed graphs with real-valued edge weights. For sparser graphs, the known AfC algorithms for these problems perform much more work than their sequential counterparts. In this paper we present efficient parallel algorithms for families of graphs, where a separator decomposition is either provided with the input or is easily obtainable. (A separator is a subset of the vertices that its removal splits the graph into connected components, where the number of vertices in each component is at most a fixed fraction of the size of the graph. A separator decomposition is a recursive decomposition of the graph using separators.) Let G = (V, E), where n = |V|, be a weighted directed graph with a fc"-separator decomposition (where subgraphs with k vertices have separators of size 0(k)). We present an MC algorithm that computes shortest paths from s sources to all other vertices using 0{n3,i + s(n + n21)) work. Reachability from s sources can be computed using 0(M(n'') log2 n + s(n + n2)) work, where M(k) = o(k237) is the best known work bound for Jfc x ife matrix multiplication. The above bounds, with fi = 0.5, are applicable to planar graphs, since a fc05-separator decomposition can be computed within these bounds. We obtain further improvements for graphs with planar embeddings where all vertices lie on a small number of faces. The algorithm is based on augmenting G with a set of 0{n2fl) edges such that in the augmented graph, all distances can be obtained by paths of size O(logn).

关键词： Separators

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Tight Memory-Independent parallel Matrix Multiplication Communication Lower Bounds 22

Brief Announcement: Tight Memory-Independent Parallel Matrix...

引用

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

作者： Al Daas, Hussam Ballard, Grey Grigori, Laura Kumar, Suraj Rouse, Kathryn Rutherford Appleton Lab Didcot Oxon England Wake Forest Univ Winston Salem NC USA Inria Paris Paris France Inmar Intelligence Winston Salem NC USA

ISBN: (纸本)9781450391467

Communication lower bounds have long been established for matrix multiplication algorithms. However, most methods of asymptotic analysis have either ignored constant factors or not obtained the tightest possible values. The main result of this work is establishing memory-independent communication lower bounds with tight constants for parallel matrix multiplication. Our constants improve on previous work in each of three cases that depend on the relative sizes of the matrix aspect ratios and the number of processors.

关键词： Rectangular matrix multiplication convex optimization

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Optimized GPU-accelerated Feature Extraction for ORB-SLAM Systems 23

Brief Announcement: Optimized GPU-accelerated Feature Extrac...

引用

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

作者： Muzzini, Filippo Capodieci, Nicola Cavicchioli, Roberto Rouxel, Benjamin Univ Modena & Reggio Emilia Modena Italy

ISBN: (纸本)9781450395458

Reducing the execution time of ORB-SLAM algorithm is a crucial aspect of autonomous vehicles since it is computationally intensive for embedded boards. We propose a parallel GPU-based implementation, able to run on embedded boards, of the Tracking part of the ORB-SLAM2/3 algorithm. Our implementation is not simply a GPU port of the tracking phase. Instead, we propose a novel method to accelerate image Pyramid construction on GPUs. Comparison against state-of-the-art CPU and GPU implementations, considering both computational time and trajectory errors shows improvement on execution time in well-known datasets, such as KITTI and EuRoC.

关键词： GPU ORB-SLAM CUDA parallel

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共161页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：