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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是121-130 订阅

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

详细简洁

排序：

Framework for simple sorting algorithms on parallel disk systems

Framework for simple sorting algorithms on parallel disk sys...

引用

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

作者： Rajasekaran, S. Univ of Florida Gainesville United States

In this paper we present a simple parallel sorting algorithm and illustrate two applications. the algorithm (called the (l, m)-merge sort (LMM)) is an extension of the bitonic and odd-even merge sorts. Literature on parallel sorting is abundant. Many of the algorithms proposed, though being theoretically important, may not perform satisfactorily in practice owing to large constants in their time bounds. the algorithm to be presented in this paper, due partly to its simplicity, results in small constants. We present an implementation for the parallel disk sorting problem. the algorithm is asymptotically optimal (assuming that N is a polynomial in M, where N is the number of records to be sorted and M is the internal memory size). the underlying constant is very small. this algorithm has a better performance than the disk-striped mergesort (DSM) algorithm when the number of disks is large. Our implementation is as simple as that of DSM (requiring no fancy data structures or prefetch techniques). As a second application, we prove that we can get a sparse enumeration sort on the hypercube that is simpler than that of the classical algorithm of Nassimi and Sahni. We also show that Leighton's columnsort algorithm is a special case of LMM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

New graph decompositions and fast emulations in hypercubes and butterflies 93

New graph decompositions and fast emulations in hypercubes a...

引用

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

作者： Kaklamanis, Christos Krizanc, Danny Rao, Satish DIMACS Center Rutgers University Piscataway 08855 NJ United States School of Computer Science Carleton University Ottawa KIS 5B6 ON Canada NEC Research Institute 4 Independence Way Princeton 08540 NJ United States

ISBN: (纸本)0897915992

In this paper, we present a new type of graph decomposition called a cut-cover that combines the notions of graph separators and t-neighborhood covers. We show that graphs with good cut-covers can be emulated in hypercubes and butterflies and we show that planar and certain minor-excluded graphs have good cut-covers. In particular, we show how to emulate any iV-node bounded degree planar network or any iV-node bounded degree graph that excludes KicgO(i) N as a minor with constant slowdown on hypercube networks. We also show how to emulate any iV-node bounded degree planar network or any iV-node bounded degree graph that excludes K0{i) as a minor with 0(logJV) slowdown on butterfly networks. © 1993 acm.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

SPAA'07: proceedings of the Nineteenth annual symposium on parallelism in algorithms and architectures

SPAA'07: Proceedings of the Nineteenth Annual Symposium on P...

引用

SPAA'07: 19th annual symposium on parallelism in algorithms and architectures

ISBN: (纸本)159593667X

the proceedings contain 37 papers. the topics discussed include: on triangulation of simple networks;strong-diameter decompositions of minor free graphs;approximation algorithms for multiprocessor scheduling under uncertainty;scheduling DAGs on asynchronous processors;scheduling to minimize gaps and power consumption;cache-oblivious streaming B-trees;an experimental comparison of cache-oblivious and cache-conscious programs;scheduling threads for constructive cache sharing on CMPs;proximity-aware directory-based coherence for multi-core processor architectures;a parallel dynamic programming algorithm on a multi-core architecture;tight bounds for distributed selection;local MST computation with short advice;distributed approximation of capacitated dominating sets;packing to angles and sectors;and the notion of a timed register and its application to indulgent synchronization.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A parallel Dynamic Programming Algorithm on a Multi-core Architecture 07

A Parallel Dynamic Programming Algorithm on a Multi-core Arc...

引用

19th annual symposium on parallelism in algorithms and architectures

作者： Tan, Guangming Sun, Ninghui Gao, Guang R. Chinese Acad Sci Key Lab Comp Syst & Architecture Beijing Peoples R China

ISBN: (纸本)9781595936677

Dynamic programming is an efficient technique to solve combinatorial search and optimization problem. there have been many parallel dynamic programming algorithms. the purpose of this paper is to study a family of dynamic programming algorithm where data dependence appear between non-consecutive stages, in other words, the data dependence is non-uniform. this kind of dynamic programming is typically called nonserial polyadic dynamic programming. Owing to the: non-uniform data dependence;it is harder to optimize this problem for parallelism and locality on parallel architectures. In this paper, we address the chanllenge of exploiting fine grain parallelism and locality of nonserial polyadic dynamic programming on a multi-core architecture. We present a programming and execution model for multi-core architectures with memory hierarchy. In the framework of the new model, the parallelism and locality benifit from a data dependence transformation. We propose a parallel pipelined algorithm for filling the dynamic programming matrix by decomposing the computation operators. the new parallel algorithm tolerates the memory access latency using multi-thread and is easily improved with the technique. We formulate and analytically solve the optimization problem determing the the size that minimizes the total execution time. the experiments on a simulator give a validation of the proposed model and show that the fine grain parallel algorithm achieves sub-linear speedup and that a potential high scalability on multi-core arichitecture.

关键词： Dynamic Programming Data Dependence Multicore Memory Hierarchy Scalabilitiy

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for the single function coarsest partition problem 93

An efficient parallel algorithm for the single function coar...

引用

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

作者： JáJá, Joseph F. Ryu, Kwan Woo Department of Electrical Engineering Institute for Systems Research Korea Republic of Department of Computer Engineering Kyungpook National University Daegu Korea Republic of Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

ISBN: (纸本)0897915992

We describe an efficient parallel algorithm to solve the single function coarsest partition problem. the algorithm runs in O(logn) time using 0(n log log n) operations on the Arbitrary CRCW PRAM. the previous best known algorithm runs in 0(log2 n) time using 0(n log2 n) operations on the CREW PRAM. Another algorithm developed independently of ours runs in O(logn) time using 0(n log n) operations on the Arbitrary CRCW PRAM. Our solution is based on efficient algorithms for solving several subproblems that are of independent interest. In particular, we present efficient parallel algorithms to find a minimal starting point of a circular string with respect to lexicographic ordering and to sort lexicographically a list of strings of different lengths. © 1993 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Packet scheduling for deep packet inspection on multi-core architectures 10

Packet scheduling for deep packet inspection on multi-core a...

引用

proceedings of the 6th acm/IEEE symposium on architectures for Networking and Communications Systems

作者： Nelms, Terry Ahamad, Mustaque Georgia Institute of Technology United States

ISBN: (纸本)9781450303798

Multi-core architectures are commonly used for network applications because the workload is highly parallelizable. Packet scheduling is a critical performance component of these applications and significantly impacts how well they scale. Deep packet inspection (DPI) applications are more complex than most network applications. this makes packet scheduling more difficult, but it can have a larger impact on performance. Also, packet latency and ordering requirements differ depending on whether the DPI application is deployed inline. therefore, different packet scheduling tradeoffs can be made based on the deployment. In this paper, we evaluate three packet scheduling algorithms with the Protocol Analysis Module (PAM) as our DPI application using network traces acquired from production networks where intrusion prevention systems (IPS) are deployed. One of the packet scheduling algorithms we evaluate is commonly used in production applications;thus, it is useful for comparison. the other two are of our own design. Our results show that packet scheduling based on cache affinity is more important than trying to balance packets. More specifically, for the three network traces we tested, our cache affinity packet scheduler outperformed the other two schedulers increasing throughput by as much as 38%. © 2010 acm.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

annual acm symposium on parallelism in algorithms and architectures

Annual ACM Symposium on Parallelism in Algorithms and Archit...

引用

25th acm symposium on parallelism in algorithms and architectures, SPAA 2013

the proceedings contain 39 papers. the topics discussed include: Fast greedy algorithms in MapReduce and streaming;reduced hardware transactions: a new approach to hybrid transactional memory;recursive design of hardware priority queues;drop the anchor: lightweight memory management for non-blocking data structures;scalable statistics counters;storage and search in dynamic peer-to-peer networks;expected sum and maximum of displacement of random sensors for coverage of a domain;on dynamics in selfish network creation;brief announcement: truly parallel burrows-wheeler compression and decompression;brief announcement: locality in wireless scheduling;brief announcement: universally truthful secondary spectrum auctions;and brief announcement: online batch scheduling for flow objectives.

关键词：

来源：评论

学校读者我要写书评

暂无评论

annual acm symposium on parallelism in algorithms and architectures

Annual ACM Symposium on Parallelism in Algorithms and Archit...

引用

28th acm symposium on parallelism in algorithms and architectures, SPAA 2016

ISBN: (纸本)9781450342100

the proceedings contain 52 papers. the topics discussed include: randomized approximate nearest neighbor search with limited adaptivity;encoding short ranges in TCAM without expansion: efficient algorithm and applications;extending the nested parallel model to the nested dataflow model with provably efficient schedulers;latency-hiding work stealing: scheduling interacting parallel computations with work stealing;provably good and practically efficient parallel race detection for fork-join programs;dynamic determinacy race detection for task parallelism with futures;RUBIC: online parallelism tuning for co-located transactional memory applications;investigating the performance of hardware transactions on a multi-socket machine;parallel algorithms for asymmetric read-write costs;general profit scheduling and the power of migration on heterogeneous machines;the power of migration in online machine minimization;fair online scheduling for selfish jobs on heterogeneous machines;scheduling parallelizable jobs online to minimize the maximum flow time;clairvoyant dynamic bin packing for job scheduling with minimum server usage time;parallel equivalence class sorting: algorithms, lower bounds, and distribution-based analysis;and parallel approaches to the string matching problem on the GPU.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Issues and directions in scalable parallel computing 93

Issues and directions in scalable parallel computing

引用

proceedings of the 12th annual acm symposium on Principles of Distributed Computing

作者： Snir, Marc T.J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897916131

the design and use of scalable parallel computers is discussed. Much of the knowledge gained in the study of distributd systems is relevant, although it needs to be used in new manners. the author argues that the challenge is to achieve maximum reuse of existing technologies, microprocessor architectures, I/O systems, programming languages, operating systems, application codes, without compromising too much parallel performance and scalability. Such skillful compromises are essential to the success of the parallel processing industry, and pose even more intellectual challenges than the 'start from scratch' approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient wiring of reconfigurable parallel processors 93

Efficient wiring of reconfigurable parallel processors

引用

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

作者： Greenberg, David S. Sandia National Laboratories Mail Stop 1423 P.O. Box 5800 AlbuquerqueNM87185-5800 United States

ISBN: (纸本)0897915992

Chips (or chip sets) which include one or more CPUs, some local memory, and rudimentary communications and routing hardware are becoming common (eg. transputers, SRCs HNet, the nodes of most MIMD machines). these chips provide the possibility of tailoring the topology of a machine to a particular problem. Rather than asking the standard question of how to best coerce one's algorithm to fit an existing topology, one can ask what would be the best topology for the algorithm. this paper defines the efficiency of a topology for an algorithm and gives upper and lower bounds on the best efficiency achievable (as a function of the number of different communication patterns used by the algorithm). this approach is then applied to algorithms which use stencil patterned communications. the result is the definition of topologies which are significantly more efficient than the naive topology. © 1993 acm.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共34页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：