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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,544 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是331-340 订阅

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

详细简洁

排序：

A parallel Framework for Handling Non-determinism with Expressive Description Logics 28

A Parallel Framework for Handling Non-determinism with Expre...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Faddoul, Jocelyne MacCaull, Wendy St Francis Xavier Univ Ctr Log & Informat Antigonish NS Canada

ISBN: (纸本)9781479941162

Multicore processors are nowadays widespread across desktop, laptop, server, and even smartphone and tablets devices. The rise of such powerful execution environments calls for new parallel and distributed Description Logics (DLs) reasoning algorithms. Many sophisticated optimizations have been explored and have considerably enhanced DL reasoning with light ontologies. Non-determinism remains a main source of complexity for implemented systems handling ontologies relying on more expressive logics. In this work, we explore handling non-determinism with DL languages enabling qualified cardinality restrictions. We implement a fork/join parallel framework into our hybrid algebraic reasoner, which handles qualified cardinality restrictions and nominals using in-equation solving. Preliminary evaluation shows encouraging results.

关键词： Description Logics Non-determinism parallel Programming

来源：评论

学校读者我要写书评

暂无评论

ExCovery - A Framework for distributed System Experiments and a Case Study of Service Discovery 28

<i>ExCovery</i> - A Framework for Distributed System Experim...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Dittrich, Andreas Wanja, Stefan Malek, Miroslaw Univ Svizzera Italiana Adv Learning & Res Inst Lugano Switzerland DSPECIALISTS Digitale Audio & Messsyst GmbH Berlin Germany

ISBN: (纸本)9781479941162

Experiments are a fundamental part of science. They are needed when the system under evaluation is too complex to be analytically described and they serve to empirically validate hypotheses. This work presents the experimentation framework ExCovery for dependability analysis of distributed processes. It provides concepts that cover the description, execution, measurement and storage of experiments. These concepts foster transparency and repeatability of experiments for further sharing and comparison. ExCovery has been tried and refined in a manifold of dependability related experiments during the last two years. A case study is provided to describe service discovery (SD) as experiment process (EP). A working prototype for IP networks runs on the distributed Embedded System (DES) wireless testbed at the Freie Universitat Berlin.

关键词： distributed Systems Experiment Experiment Framework Tool Description

来源：评论

学校读者我要写书评

暂无评论

SupMR: Circumventing Disk and Memory Bandwidth Bottlenecks for Scale-up MapReduce 28

SupMR: Circumventing Disk and Memory Bandwidth Bottlenecks f...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Sevilla, Michael Nassi, Ike Ioannidou, Kleoni Brandt, Scott Maltzahn, Carlos Univ Calif Santa Cruz Comp Sci Dept Santa Cruz CA 95060 USA

ISBN: (纸本)9781479941162

Reading input from primary storage (i.e. the ingest phase) and aggregating results (i.e. the merge phase) are important pre- and post-processing steps in large batch computations. Unfortunately, today's data sets are so large that the ingest and merge job phases are now performance bottlenecks. In this paper, we mitigate the ingest and merge bottlenecks by leveraging the scale-up MapReduce model. We introduce an ingest chunk pipeline and a merge optimization that increases CPU utilization (50 - 100%) and job phase speedups (1.16x - 3.13x) for the ingest and merge phases. Our techniques are based on well-known algorithms and scale-out MapReduce optimizations, but applying them to a scale-up computation framework to mitigate the ingest and merge bottlenecks is novel.

关键词： Applications Architectures distributed applications distributed systems Performance measurements

来源：评论

学校读者我要写书评

暂无评论

A Portable Cluster for Each Student 28

A Portable Cluster for Each Student

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Toth, David Univ Mary Washington Comp Sci Dept Fredericksburg VA 22401 USA

ISBN: (纸本)9781479941162

Although some colleges and universities have access to parallel computing hardware, none that we are aware of can provide dedicated parallel computing hardware to each student. Instead, institutions often provide shared parallel computing equipment for the students, if they can afford to provide any. It is difficult for students to really get an understanding of the performance of their programs and how they scale when they are using shared equipment that is not dedicated to them and where other students or other users may interfere with their work. The current emphasis on network security at some institutions also prevents some shared resources that students could use from being easily accessible or sometimes accessible at all. We provide a parts list, information, and microSD card images to make a small, affordable compute cluster that each student in a parallel computing course can purchase in lieu of a textbook so each student has their own private compute cluster.

关键词： parallel Computing Education Compute Cluster

来源：评论

学校读者我要写书评

暂无评论

EA: Research-infused teaching of parallel programming concepts for undergraduate Software Engineering students 28

EA: Research-infused teaching of parallel programming concep...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Giacaman, Nasser Sinnen, Oliver Univ Auckland Dept Elect & Comp Engn Auckland New Zealand

ISBN: (纸本)9781479941162

This paper presents experience using a research-infused teaching approach towards an undergraduate parallel programming course. The research-teaching nexus is applied at various levels, first by using research-led teaching of core parallel programming concepts, as well as teaching the latest developments from the affiliated research group. The bulk of the course, however, focuses more on the student-driven research-based and research-tutored teaching approaches, where students actively participate in groups on research projects;students are fully immersed in the learning activity of their respective project, while at the same time participating in discussions of wider parallel programming topics across other groups. This intimate affiliation between the undergraduate course and the research group results in a wide range of benefits for all those involved.

关键词： Learning parallel programming Research teaching nexus Teaching

来源：评论

学校读者我要写书评

暂无评论

CyGraph: A Reconfigurable Architecture for parallel Breadth-First Search 28

CyGraph: A Reconfigurable Architecture for Parallel Breadth-...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Attia, Osama G. Johnson, Tyler Townsend, Kevin Jones, Philip Zambreno, Joseph Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781479941162

Large-scale graph structures are considered as a keystone for many emerging high-performance computing applications in which Breadth-First Search (BFS) is an important building block. For such graph structures, BFS operations tends to be memory-bound rather than compute-bound. In this paper, we present an efficient reconfigurable architecture for parallel BFS that adopts new optimizations for utilizing memory bandwidth. Our architecture adopts a custom graph representation based on compressed-sparse raw format (CSR), as well as a restructuring of the conventional BFS algorithm. By taking maximum advantage of available memory bandwidth, our architecture continuously keeps our processing elements active. Using a commercial high-performance reconfigurable computing system (the Convey HC-2), our results demonstrate a 5x speedup over previously published FPGA-based implementations.

关键词： Reconfigurable Computing Breadth-First Search Graphs FPGA Convey HC-2

来源：评论

学校读者我要写书评

暂无评论

A distributed Algorithm for a Reconfigurable Modular Surface 28

A Distributed Algorithm for a Reconfigurable Modular Surface

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： El-Baz, Didier Piranda, Benoit Bourgeois, Julien CNRS LAAS 7 Av Colonel Roche F-31400 Toulouse France Univ Toulouse LAAS F-31400 Toulouse France Univ Franche Comte FEMTO ST Inst CNRS UMR 6174 F-25200 Montbeliard France

ISBN: (纸本)9781479941162

A distributed algorithm is proposed in order to control block motion of a reconfigurable micro-electro-mechanical modular surface. The modular surface is designed to convey fragile and tiny micro-parts. The distributed algorithm solves a discrete trajectory optimization problem. In particular, the algorithm computes the shortest path between two points of the modular surface using a strategy based on minimum hop count. The proposed method based on distributed asynchronous iterative elections is scalable.

关键词： optimization distributed computing self-reconfigurable system self-organizing system MEMS Smart Blocks smart conveyor

来源：评论

学校读者我要写书评

暂无评论

A Novel Computational Model for GPUs with Application to I/O Optimal Sorting Algorithms 28

A Novel Computational Model for GPUs with Application to I/O...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Koike, Atsushi Sadakane, Kunihiko Natl Inst Informat Principles Informat Res Div Tokyo Japan Grad Univ Adv Studies Dept Informat Tokyo Japan

ISBN: (纸本)9781479941162

We propose a novel computational model for GPU. Known parallel computational models such as the PRAM model are not appropriate for evaluating GPU algorithms. Our model, called AGPU, abstracts the essence of current GPU architectures such as global and shared memory, memory coalescing and bank conflicts. We can therefore evaluate asymptotic behavior of GPU algorithms more accurately than known models and we can develop algorithms that are efficient on many real architectures. As a showcase, we first analyze known comparison-based sorting algorithms using the AGPU model and show that they are not I/O optimal, that is, the number of global memory accesses is more than necessary. Then we propose a new algorithm which uses an asymptotically optimal number of global memory accesses and whose time complexity is also nearly optimal.

关键词： GPU GPGPU parallel computational models sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel Large Neighborhood Search-based Heuristic for the Disjunctively Constrained Knapsack Problem 28

A Parallel Large Neighborhood Search-based Heuristic for the...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Hifi, Mhand Negre, Stephane Saadi, Toufik Saleh, Sagvan Wu, Lei Univ Picardie Jules Verne EPROAD EA 4669 7 Rue Moulin Neuf F-80039 Amiens France

ISBN: (纸本)9781479941162

This paper proposes a parallel large neighborhood search-based heuristic for solving the Disjunctively Constrained Knapsack Problem (DCKP), which has an important impact on the transportation issues. The proposed approach is designed using Message Passing Interface (MPI). The effectiveness of MPI's allows us to build a flexible message passing model of parallel programming. Meanwhile, large neighborhood search heuristic is introduced in the model in order to propose an efficient resolution method yielding high quality solutions. The results provided by the proposed method are compared to those reached by the Cplex solver and to those obtained by one of the best methods of the literature. As shown from the experimental results, the proposed model is able to provide high quality solutions with fast runtime on most cases of the benchmark literature.

关键词： Heuristic knapsack parallel algorithms large neighborhood

来源：评论

学校读者我要写书评

暂无评论

DisSLib:CC: A Library for distributed Search with a Central Common Search State 28

DisSLib:CC: A Library for Distributed Search with a Central ...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Kendon, Tyson Denzinger, Joerg Univ Calgary Dept Comp Sci Calgary AB Canada

ISBN: (纸本)9781479941162

distributed search is important for finding solutions to hard problems in artificial intelligence. Building distributed search systems can be difficult because the steps required to solve these problems are interdependent. Fortunately, aspects of search systems exhibit commonalities that allow them to be distributed using several different paradigms. These paradigms can be used as the basis for libraries to make implementing new systems, or distributing existing systems, easier. DisSLib:CC is such a library. DisSLib:CC implements the distributed search paradigm search with a central common search state. In this paradigm, agents collaborate to update a central search state. Systems built with DisSLib:CC require very little extra code to implement compared to the standalone versions. These systems can also show improvements in wall-clock run-times, which can be improved by varying the meta-parameters of the distribution paradigm. One such parameter is the number of steps, transitions, that the agents execute before consulting the common search state and in this paper we show how varying this meta-parameter improves the efficiency of the systems.

关键词： distributed Search Systems Knowledge Based Search

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：