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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,527 篇 英文
20 篇 其他
1 篇 中文

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

共 3548 条记录，以下是1101-1110 订阅

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

详细简洁

排序：

Communication patterns [message-passing patterns]

Communication patterns [message-passing patterns]

引用

International symposium on parallel and distributed processing (IPDPS)

作者： R. Riesen Sandia National Laboratories Albuquerque NM USA

parallel applications have message-passing patterns that are important to understand. Network topology, routing decisions, and connection and buffer management need to match the communication patterns of an application for it to run efficiently and scale well. These patterns are not easily discerned from the source code of an application, and even when the data is available it is not easy to categorize it appropriately such that meaningful knowledge emerges. We describe a novel system to gather the information we need to discover an application's communication pattern. We create five categories that help us analyze that data and explain how information from each category can be useful in the design of networking hardware and software. We use the NAS parallel benchmarks as examples on how to apply our techniques

关键词： Application software Benchmark testing Discrete event simulation Laboratories Network topology Hardware parallel machines Size measurement Routing Pattern matching

来源：评论

学校读者我要写书评

暂无评论

A performance model for fine-grain accesses in UPC 06

A performance model for fine-grain accesses in UPC

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Zhang Zhang S.R. Seidel Department of Computer Science Michigan Technological University Houghton MI USA

ISBN: (纸本)9781424400546

UPC's implicit communication and fine-grain programming style make application performance modeling a challenging task. The correspondence between remote references and communication events depends on the internals of the compiler and runtime system. This correspondence is often hidden from application developers. Aggressive optimizations allowed by the relaxed memory consistency model further blur this correspondence by transforming code structure. A modeling approach based on UPC platform benchmarking and code analysis is proposed. This approach abstracts a UPC platform according to its potential to apply a few common optimizations, then divides remote references in the application code into groups, based on a dependence analysis, that are amenable to each optimization. Each group is associated with a cost, obtained via benchmarking each potential optimization. The aggregated cost of these groups is the predicted cost of the application. Three simple UPC applications modeled using this approach usually yielded performance predictions within 15 percent of actual running times

关键词： Electronics packaging Application software parallel programming Computer science Abstracts Cost function Predictive models Productivity parallel processing Equations

来源：评论

学校读者我要写书评

暂无评论

Evaluating a clock synchronization for dependable sensor networks

Evaluating a clock synchronization for dependable sensor net...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S. Trikaliotis G. Lukas Institute for Distributed Systems University of Magdeburg Magdeburg Germany

A synchronized clock is an important prerequisite for many distributed algorithms. This clock is used to give an "occured before" relationship, as well as for synchronizing distributed actions. There are many clock synchronization algorithms with varying precisions and assumptions on the underlying network topology. In this paper, a synchronization protocol is presented which achieves a high precision in the order of 20 mus to 30 mus in a one-hop wireless environment, and a multiple of this value for multi-hop wireless networks, such as sensor networks. The protocol works reliably even if message losses occur, which is very likely in wireless networks. For this, it utilizes redundancy in the sent time information. This protocol is implemented and evaluated on standard PC hardware running RT-Linux/Free, and an outline of the extension for multi-hop scenarios is given

关键词： Clocks Synchronization Wireless sensor networks Access protocols Wireless application protocol Computer networks Broadcasting distributed computing Master-slave distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Effective out-of-core parallel Delaunay mesh refinement using off-the-shelf software 06

Effective out-of-core parallel Delaunay mesh refinement usin...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Kot A. Chernikov N. Chrisochoides Department of Computer Science The College of William and Mary Williamsburg VA USA

ISBN: (纸本)9781424400546

We present two cost-effective and high-performance out-of-core parallel mesh generation algorithms and their implementation on cluster of workstations (CoWs). The total wall-clock time including wait-in-queue delays for the out-of-core methods on a small cluster (16 processors) is three times shorter than the total wall-clock time for the in-core generation of the same size mesh (about a billion elements) using 121 processors. Our best out-of-core method, for mesh sizes that fit completely in the core of the CoWs, is about 5% slower than its in-core parallel counterpart method. This is a modest performance penalty for savings of many hours in response time. Both the in-core and out-of-core methods use the best publicly available off-the-shelf sequential in-core Delaunay mesh generator

关键词： Mesh generation Cows Concurrent computing Educational institutions Software algorithms Delay effects Geometry Software libraries Time sharing computer systems Computer science

来源：评论

学校读者我要写书评

暂无评论

Application-oriented adaptive MPI/spl ***/Bcast for grids

引用

International symposium on parallel and distributed processing (IPDPS)

作者： R. Gupta S. Vadhiyar Supercomputer Education and Research Centre Indian Institute of Science Bangalore India

Due to the importance of collective communications in scientific parallel applications, many strategies have been devised for optimizing collective communications for different kinds of parallel environments. There has been an increasing interest to evolve efficient broadcast algorithms for computational grids. In this paper, we present application-oriented adaptive techniques that take into account resource characteristics as well as the application's usage of broadcasts for deriving efficient broadcast trees. In particular, we consider two broadcast parameters used in the application, namely, the broadcast message sizes and the time interval between the broadcasts. The results indicate that our adaptive strategies can provide 20% average improvement in performance over the popular MPICH-G2's MPI/spl ***/Bcast implementation for loaded network conditions.

关键词： Broadcasting Grid computing Local area networks Network topology Computational modeling Simulated annealing Supercomputers parallel processing Measurement Libraries

来源：评论

学校读者我要写书评

暂无评论

Effecting parallel graph eigensolvers through library composition 06

Effecting parallel graph eigensolvers through library compos...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Breuer P. Gottschling D. Gregor A. Lumsdaine Open Systems Laboratory Indiana University Bloomington IN USA

ISBN: (纸本)9781424400546

Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality linear algebra and graph libraries, one might expect that one could merely use a graph data structure within a eigensolver. However, conventional libraries are rigidly constructed, requiring conversion to library-specific data structures or using heavyweight abstraction methods that prevent efficient composition. The generic programming methodology addresses the problems of reusability and composability by careful factorization of a domain into efficient library abstractions. We describe the composition process that makes the data structures from a library supporting one domain usable with the algorithms of another library for a disjoint domain without conversion or heavyweight abstractions. To illustrate the process, we compose two separately-developed libraries, one for solving eigenproblems sequentially and the other for solving graph problems in parallel, effecting an efficient, scalable parallel graph eigensolver

关键词： Libraries Containers Linear algebra Sparse matrices Data structures Eigenvalues and eigenfunctions Graph theory Laplace equations Open systems Laboratories

来源：评论

学校读者我要写书评

暂无评论

Relationships between communication models in networks using atomic registers 06

Relationships between communication models in networks using...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： L. Higham C. Johnen Computer Science Department University of Calgary Calgary AB Canada LRI-CNRS Universite de Paris Sud Orsay France

ISBN: (纸本)9781424400546

A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In shared-registers versions of this general description, neighbouring processors communicate by reading or writing shared registers, where each read or write is one atomic step. Variants of shared register models occur in the literature. This paper defined two models of shared registers determined by selecting the register locations. In the atomic-state model each processor has a register; in the atomic-link model, each communication link has a register. We determine under what conditions and with what robustness and/or failure-tolerance guarantees it is possible to transform a solution under the atomic-state model into a solution under the atomic-link model. The fault-tolerant models considered in this paper are wait-freedom and self-stabilization. These questions are addressed by first establishing a framework for defining correct transformations, which may be useful for similar studies of the relationship between various models of distributed computation

关键词： Intelligent networks Registers Writing Robustness distributed computing distributed algorithms Computer science Fault tolerance Computational modeling Communication standards

来源：评论

学校读者我要写书评

暂无评论

Speeding up NGB with distributed file streaming framework 06

Speeding up NGB with distributed file streaming framework

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Bingchen Li Kang Chen Zhiteng Huang H.L. Rajic R.H. Kuhn Intel China Research Center Limited Beijing China Software Products Division Intel KSL Urbana-Champaign IL USA

ISBN: (纸本)9781424400546

Grid computing provides a very rich environment for scientific calculations. In addition to the challenges it provides, it also offers new opportunities for optimization. In this paper we have utilized DFS (distributed file streaming) framework to speed up NAS grid benchmark workflows. By studying I/O patterns of NGB codes we have identified program locations where it is possible to overlap computation and data workflow phases. By integrating DFS into NGB, we demonstrate a useful method of improving overall workflow efficiency by streaming the output of the current process to make an input of the following stage, reducing a workflow to a series of distributed producer consumer stages. DFS framework eliminates file transfers and in the process makes process scheduling more efficient, leading to overall performance improvements in the turnaround time for HC (helical chain) data flow graph under Globus grid environment with the embedded DFS over the original version of the benchmark

关键词： Flow graphs Data flow computing Grid computing Computational fluid dynamics distributed computing Encapsulation Processor scheduling Bandwidth Application software Hardware

来源：评论

学校读者我要写书评

暂无评论

Fast barrier synchronization for InfiniBand/spl trade/

Fast barrier synchronization for InfiniBand/spl trade/

引用

International symposium on parallel and distributed processing (IPDPS)

作者： T. Hoefler T. Mehlan F. Mietke W. Rehm Department of Computer Science Chemnitz University of Technology Chemnitz Germany

The MPI_Barrier() call can be crucial for several applications and has been target of different optimizations since several decades. The best solution to the barrier problem scales with O(log 2 N) and uses the dissemination principle. A new method using an enhanced dissemination principle and inherent network parallelism is demonstrated in this paper. The new approach was able to speedup the barrier performance by 40% in relation to the best published algorithm. It is shown that it is possible to leverage the inherent hardware parallelism inside the InfiniBandtrade network to lower the latency of the MPI-Barrier() operation without additional costs. The principle of sending multiple messages in (pseudo-) parallel can be implemented into a well known algorithm to decrease the number of rounds and speed the overall operation up

关键词： Hardware Delay Clustering algorithms parallel processing Chemical technology Computer science Application software Costs Bandwidth Counting circuits

来源：评论

学校读者我要写书评

暂无评论

Exploiting dynamic proxies in middleware for distributed, parallel, and mobile Java applications 06

Exploiting dynamic proxies in middleware for distributed, pa...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： W. van Heiningen T. Brecht S. MacDonald Integrative Biology Hospital for Sick Children Toronto ONT Canada David R. Cheriton School of Computer Science University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781424400546

Babylon v2.0 is a collection of tools and services that provide a 100% Java compatible environment for developing, running and managing parallel, distributed and mobile Java applications. It incorporates features like object migration, asynchronous method invocation and remote class loading while providing an easy-to-use interface. The implementation of Babylon v2.0 exploits dynamic proxies, a feature added to Java 1.3 that allows runtime creation of proxy objects. This paper shows how Babylon v2.0 exploits dynamic proxies to implement several key features without the need for special language or virtual machine extensions, preprocessors, or compilers. The resulting Babylon programs are portable across all Java virtual machines, and the development process is simplified by removing the extra steps needed to invoke external stub compilers and incorporate the generated code into an application. This simplification also allows remote objects to be created for any class that supports an interface to its methods, even if source code is not available

关键词： Middleware Java Virtual machining Application software Runtime Dynamic programming distributed computing Biology Computer science Hospitals

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 107 108 109 110 111 112 113 114 115 116 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：