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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

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

共 3536 条记录，以下是3221-3230 订阅

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

详细简洁

排序：

A methodology for the performance prediction of massively parallel applications

A methodology for the performance prediction of massively pa...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： D. Menasce S.H. Noh S.K. Tripathi Department of Computer Science George Mason University Fairfax VA USA Department of Stat. C&IS George Washington University Washington D.C. DC USA Department of Computer Science University of Maryland College Park MD USA

this paper presents a methodology to predict the execution time of massively parallel applications before any significant implementation actions are taken. this methodology captures the problem decomposition into tasks and their precedence relationship, along with the computational and communication demands placed by the application on the underlying architecture. An example shows how the methodology may be used to study the effects of various data placement strategies, problem size, and number of processors for an LU factorization algorithm. the model predictions were validated with published experimental results on a Touchstone Delta machine.< >

关键词： Partitioning algorithms Application software parallel algorithms Computer science Iterative algorithms Iterative methods Educational institutions Computer architecture Predictive models parallel processing

来源：评论

学校读者我要写书评

暂无评论

A parallel implementation of a hidden Markov model with duration modeling for speech recognition

A parallel implementation of a hidden Markov model with dura...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： C.D. Mitchell R.A. Helzerman L.H. Jamieson M.P. Harper School of Electrical Engineering Purdue University West Lafayette IN USA

this paper describes a parallel implementation of a Hidden Markov Model (HMM) for spoken language recognition on the MasPar MP-1. By exploiting the massive parallelism of explicit duration HMMs, we can develop more complex models for real-time speech recognition. Implementational issues such as choice of data structures, method of communication, and utilization of parallel functions are explored. the results of our experiments show that the parallelism in HMMs can be effectively exploited by the MP-1. Training that use to take nearly a week can now be completed in about an hour. the system can recognize the phones of a test utterance in a fraction of a second.< >

关键词： Hidden Markov models Speech recognition Costs parallel processing Computational efficiency Natural languages Data structures System testing Automatic speech recognition Neodymium

来源：评论

学校读者我要写书评

暂无评论

parallel dynamic storage allocation algorithms

Parallel dynamic storage allocation algorithms

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Iyengar Hewlett Packard Company Chelmsford MA USA

A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. this paper examines parallel dynamic storage allocation algorithms. three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. the performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested.< >

关键词： Heuristic algorithms Performance evaluation Testing Computer languages Programming profession System performance parallel machines Aging Concurrency control Memory management

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for geometric problems on networks of processors

Parallel algorithms for geometric problems on networks of pr...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： J.-J. Tsay Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan

In this paper, we present algorithms for solving several basic geometric problems of size n in a network of p processors each with O(n/p) local memory. Our algorithms achieve the best possible (up to a constant factor) time bound in hypercubic parallel architectures such as hypercube, shuffle exchange and cube connected cycles, provided that n /spl les/ p/sup 1/+/spl epsi/ for some positive constant /spl epsi/. Our algorithms use only sorting and parallel prefixes that involve interprocessor communications, and can be easily implemented in commercially available parallel computers. Experimentation on nCUBE parallel computers show that our algorithms run efficiently.< >

关键词： parallel algorithms Concurrent computing Sorting Hypercubes parallel architectures Nearest neighbor searches Partitioning algorithms Computer science Electronic mail Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Task assignment on distributed-memory systems with adaptive wormhole routing

Task assignment on distributed-memory systems with adaptive ...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： V.A. Dixit-Radiya D.K. Panda Department of Computer and Information Science Ohio State Uinversity Columbus OH USA

Assignment of tasks of a parallel program onto processors of a distributed-memory system is critical to obtain minimal program completion time by minimizing communication overhead. the paper presents task assignment heuristics for wormhole-routed systems. A Temporal Communication Graph is used to model task graphs and to identify spatial and temporal link contention. the interplay between degree of routing adaptivity, topology, application characteristics, and task assignment is studied by evaluating random task graphs using an event-driven simulator. the study indicates that even for systems supporting fully-adaptive routing, efficient task assignment is necessary to reduce program completion time, especially for communication-bound applications.< >

关键词： Adaptive systems Routing distributed computing Topology Concurrent computing Information science Electronic mail Discrete event simulation Tail throughput

来源：评论

学校读者我要写书评

暂无评论

Barrier synchronization in distributed-memory multiprocessors using rendezvous primitives 7

Barrier synchronization in distributed-memory multiprocessor...

引用

7th International parallel processing symposium, IPPS 1993

作者： Gupta, S.K.S. Panda, D.K. Dept. of Comput. and Inf. Sci. Ohio State Univ. ColumbusOH43210 United States

ISBN: (纸本)0818634421

this paper deals with barrier synchronization in wormhole routed distributed-memory multiprocessors. New rendezvous and multirendezvous synchronization primitives are proposed to implement a barrier between two and multiple processors, respectively. these primitives reduce the number of communication steps required to implement a barrier;thus, significantly reducing the synchronization overhead for networks with high communication start-up cost. Two algorithms for barrier synchronization on k-ary n-cube networks are presented. the rendezvous primitive allows one to synchronize all processors in nlog2(k) steps. the multirendezvous primitive allows one to synchronize an arbitrary subset of processors in optimal number of communication steps depending on the ratio of the communication start-up (ts) to the link-propagation (tp) cost. © 1993 ieee.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Becoming a better host through origami: A mesh can be more than rows and columns

Becoming a better host through origami: A mesh can be more t...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： D.S. Greenberg J.K. Park E.J. Schwabe Sandia National Laboratories Albuquerque NM USA Department of EECS Northwestern University Evanston IL USA

Endowing a communication network with the ability to realize arbitrary communication patterns is an expensive proposition, both in hardware and in system software. One might instead ask whether a system can be built that performs well for a given application program. In this paper we look at the question of when a set of communication patterns is suitable for fast realization on a given network. In particular we look at which patterns are realizable quickly on a mesh. Contrary to common wisdom, transpose is efficiently realizable on a mesh. However, some other important patterns, such as perfect shuffle, are not.< >

关键词： Hardware Costs Hypercubes Wire Concurrent computing Communication networks System software Application software parallel processing Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A parallel lattice basis reduction for mesh-connected processor arrays and parallel complexity

A parallel lattice basis reduction for mesh-connected proces...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： C. Heckler L. thiele Universität des Saarlandes Lehrstuhl für Mikroelektronik Saarbruecken Germany Universittä des SaarlandesLehrstuhl für Mikroelektronik Saarbruecken Germany

Lattice basis reduction has important applications in the areas of computer algebra, cryptography and combinatorial optimization. Several efficient sequential algorithms are known. Recently, parallel algorithms have been developed but until now a formal proof for the efficiency of parallel algorithms with n/sup 2/ processors has been omitted, where n denotes the dimension of the lattice. In this paper, a variant of the well-known basis reduction algorithms is presented that is well suited for the computation with fast floating point arithmetic and for the implementation on a mesh-connected array of n/sup 2/ processors. In addition, an error analysis and a proof of the parallel efficiency is provided.< >

关键词： Lattices Concurrent computing Error analysis Floating-point arithmetic Application software Algebra parallel algorithms Polynomials Cryptography Computational geometry

来源：评论

学校读者我要写书评

暂无评论

An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing

An optimal distributed ear decomposition algorithm with appl...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： A. Kazmierczak S. Radhakrishnan School of Computer Science University of Oklahama Norman OK USA

We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bi-directional network containing n-nodes and m-links using O(m) messages and O(n) time. Using the ear decomposition we obtain the following results: 1. the distributed ear decomposition algorithm can be used to test biconnectivity, determine biconnected components, find outpoints and bridges using O(m) messages in O(n) time. 2. the distributed ear decomposition algorithm can be used to test if a network is outerplanar using O(n) messages in O(n) time and if the network is outerplanar the embedding is also given using the same message and time complexity.< >

关键词： Ear Testing Tree graphs Application software Bridges Computer science distributed algorithms Bidirectional control Algorithm design and analysis Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

parallel garbage collection and graph reducer

Parallel garbage collection and graph reducer

引用

International symposium on parallel and distributed processing (IPDPS)

作者： W.-Y. Kuo S.-Y. Kuo Department of Computer Science Fu-Jen University Taipei Taiwan Department of Electrical Engineering National Taiwan University Taipei Taiwan

We investigate the problem of parallel evaluation of functional programs. We have developed a novel approach to deal with sharing in graph reduction. Share nodes are introduced to explicitly handle sharing. By using share nodes, we have a garbage collection method that is on-the-fly (real time), parallel, distributed, and incremental. In our parallel graph reducer, copying can be done in parallel to make an exponential growth of program tree nodes. Since each node represents a simple operation, the growth of program trees is a natural distribution of computation work. Load balancing becomes very easy and can be done automatically. A simulator is implemented to simulate a tree structured parallel computer to run our graph reducer. Examples such as parallel matrix addition and multiplication are tested.< >

关键词： Tree graphs Load management Computational modeling distributed computing Functional programming Programming profession Computer science Testing Councils Computer architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 319 320 321 322 323 324 325 326 327 328 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：