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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

835 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是471-480 订阅

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

详细简洁

排序：

Dynamic load-balancing in a data parallel object-oriented system

Dynamic load-balancing in a data parallel object-oriented sy...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Jie, W Cai, WT Turner, T Inst High Performance Comp Singapore Singapore

ISBN: (纸本)0769511538

In this paper, a parallel Object Collection (POC) model is introduced to support data parallelism in a parallel object-oriented system. this model is based on the idea of data partitioning and method replication. To achieve load-balancing, partition objects are dynamically migrated at runtime according to the system load situation. A threshold-based strategy is used in the dynamic load-balancing. To avoid over-convergence of load during partition object migration, a new destination node selection algorithm is proposed. the threshold values used in the algorithm are also adaptively adjusted to better reflect the fluctuation of the load during execution. To evaluate the performance of the dynamic load balancing algorithm, simulation experiments are conducted. the simulation results are reported and discussed in the paper.

关键词： parallel object-oriented system object replication data partitioning object migration dynamic load-balancing

来源：评论

学校读者我要写书评

暂无评论

An efficient implementation of Virtual Interface Architecture using adaptive transfer mechanism on Myrinet

An efficient implementation of Virtual Interface Architectur...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Yu, JL Lee, MS Maeng, SR Korea Adv Inst Sci & Technol Div Comp Sci Dept Elect Engn & Comp Sci Seoul South Korea

ISBN: (纸本)0769511538

the user-level communication is investigated by many researches, in order to resolve degradation of cluster systems due to inefficient communication protocols. It removes the kernel intervention from the critical communication path. Recently, Intel, Microsoft and Compaq introduce the Virtual Interface Architecture (VIA), a standard for user-level communication. However, the existing VIA implementation shows low performance in transferring small messages, because it uses a single mechanism to transfer messages without regard to their message size. In this paper, we implement a high performance VIA, KVIA (Kaist VIA). KVIA, based on descriptor and message size, dynamically selects a proper transfer (1)mechanism. this implementation effectively handles not only large messages but also small messages. thus, it can be better applied to the systems that frequently use small messages (e.g., lock protocols for software distributed shared memory). the performance of KVIA is reported using round-trip latency and one-way bandwidth. Our results show the round-trip latency of 40 micro-seconds and the maximum one-way bandwidth of 950 Mbits per second, which is about 74% of Myrinet link's peak bandwidth.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient bitonic sort on a distributed memory parallel computer

Communication-efficient bitonic sort on a distributed memory...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Kim, YC Jeon, M Kim, D Sohn, A Korea Univ Dept Elect Engn Seoul 136701 South Korea

ISBN: (纸本)0769511538

Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting call be parallelized, however, a great portion of execution time is consumed due to O(log(2)P) rime of data exchange of N/P keys where P, N are the number of processors and keys, respectively. this paper presents rut efficient way of data communication in bitonic sort to minimize the interprocessor communication and computation time. Before actual data movement, each pair processors exchange the minimum and maximum in its list of keys to determine what keys are to be sent to its partner. Very often no keys need to exchange, or only a fraction of them are exchanged At least 20% or greater of execution time could be reduced on T3E computer ill our experiments. We believe the scheme is a good way to shorten the communication time in similar applications.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallel loop transformation technique for efficient race detection

Parallel loop transformation technique for efficient race de...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Kim, JS Han, DS Yu, CS Elect & Telecommun Res Inst Comp & Software Technol Lab Yusong Gu Taejon 305350 South Korea

ISBN: (纸本)0769511538

Races might result in unintended nondeterministic execution of parallel programs and thus race detection is one of the critical issues to be resolved in debugging of shared-memory parallel programs. On-the-fly race detection techniques have been developed as one of approaches for the problem. However on-the-fly race detection techniques suffer from the huge run-time overhead because in which the whole execution behavior of the program being debugged must be monitored at run-time. In this paper we present a practical loop transform technique which can significantly reduce the monitoring overhead required for detecting races on-the-fly in parallel programs. Our technique achieves the improvement by minimizing the number of iteration counts to be monitored of each parallel loop by transforming the original fool, with the technique. An experimental performance measurement of our technique shows dramatic improvement on the monitoring overhead and it detects more races than those detected by traditional on-the-fly techniques.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed coloring and communication in rings with local knowledge 15

Distributed coloring and communication in rings with local k...

引用

15th International parallel and distributed processing symposium, IPDPS 2001

作者： Dessmark, A. Pelc, A. Department of Computer Science Lund University Box 118 LundS-22100 Sweden Département d'Informatique Université du Québec à Hull HullQCJ8X 3X7 Canada

ISBN: (纸本)0769509908

We consider two interrelated tasks in a synchronous n-node ring: distributed constant coloring and local communication. Every node knows the labels of nodes up to a distance r from it, called the knowledge radius. In distributed constant coloring every node has to assign itself one out of a constant number of colors, so that adjacent nodes get different colors. In local communication every node has to communicate a message to both of its neighbors. We study these problems in two popular communication models: the one-way model in which each node can only either transmit to one neighbor or receive from one neighbor, in any round, and the radio model in which simultaneous receiving from two neighbors results in interference noise. We show that distributed constant coloring and local communication are tightly related and one can be used to accomplish the other. Also in most situations the optimal time is the same for both of them, and it strongly depends on knowledge radius. © 2001 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fault diameter and fault tolerance of HCN(n,n)

Fault diameter and fault tolerance of <i>HCN(n,n)</i>

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Lee, HO Hur, JH Chung, HC Cho, CH

ISBN: (纸本)0769511538

In this paper, we will provide the way to make n+1 node disjoint parallel path between any two node of HCN(n,n) which is better network cost than hyper-cube, and will prove that the fault diameter of HCN(n,n) is dia(HCN(n,n))+4 by result. these parallel paths can reduce the time of transmitting messages between nodes, and they mean that if some nodes of HCN(n,n) would fail, there is still no communication delay time. Also, by analyzing the fault tolerance of interconnection network HCN(n,n), we will prove that there is maximally fault tolerance.

关键词： multiprocessor interconnection networks parallel architectures fault tolerant computing message passing fault diameter fault tolerance disjoint parallel path HCN(n,n) hypercube message passing communication delay multiprocessor interconnection network

来源：评论

学校读者我要写书评

暂无评论

Combinatorial properties of hierarchical cubic networks

Combinatorial properties of hierarchical cubic networks

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Fu, JS Chen, GH Duh, DR Takming Coll Taipei Taiwan

ISBN: (纸本)0769511538

An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2(n) n-dimensional hypercubes. the diameter of an HCN(n), which is equal to n+[(n+1)/3]+1, is about two-thirds the diameter of a comparable hyyercube, although it uses about half as many links per node. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of an HCN(n). their maximal length has an upper bound of n+[n/3]+4, which is nearly optimal. the (n+1)-wide diameter and n-fault diameter of an HCN(n) are shown to be n+ [n/3]+3 or n+[n/3]+4, which are about two-thirds those of a comparable hypercube. Our results reveal that an HCN(n) has shorter node-disjoint paths, wide diameter, and fault diameter than a comparable hyyercube.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Middleware of real-time object based fault-tolerant distributed computing systems: Issues and some approaches

Middleware of real-time object based fault-tolerant distribu...

引用

8th Pacific Rim International symposium on Dependable Computing (PRDC 2001)

作者： Kim, KH UCI DREAM Lab Irvine CA USA

ISBN: (纸本)0769514146

At this turn of the century the objectoriented (OO) distributed real-time (RT) programming movement is growing rapidly along with the networked embedded systems market. the motivations are reviewed and then a brief overview is given of the particular programming scheme which this author and his collaborators have been establishing. the scheme is called the time-triggered message triggered object (TMO) programming scheme and it is used to make specific illustrations of the issues and potentials of OO RT programming. Fault tolerance capabilities are required in many distributed RT computing applications. At this time the development of middleware which is capable of supporting reliable fault-tolerant execution of applicationlevel RT distributed objects is an important challenge to the research community. Some major issues that need to be resolved and some promising approaches are discussed. © 2001 ieee.

关键词： abort availability detection distributed computing fault network surveillance object real time recovery reliability replication transaction tolerance

来源：评论

学校读者我要写书评

暂无评论

Evaluation of emerging high speed networks on brazos software DSM system

Evaluation of emerging high speed networks on brazos softwar...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Matsunaga, AM Tsugawa, MO Kofuji, ST Univ Sao Paulo Dept Elect Engn BR-05508900 Sao Paulo Brazil

ISBN: (纸本)0769511538

One of the factors that can influence the performance of a DSM system is the efficiency of multipoint access on interconnection network. this work presents an evaluation of Brazos System, a software implemented distributed shared memory (DSM) system designed for x86 SMP nodes running Windows NT and that takes advantage of multicast communication, with regard to different configurations of communication network: broadcast Fast Ethernet, switched Fast Ethernet and LANE-ATM. In this evaluation, although the bandwidth of the ATM is larger than the Fast Ethernet, a low performance using LANE-ATM was observed, compared to the Brazos System performance using broadcast or switched Fast Ethernet. It shows the importance of the communication subsystem and the necessity of improvements on aspects like multipoint access, which has been not much explored on networks like ATM.

关键词： software distributed shared memory network multicast

来源：评论

学校读者我要写书评

暂无评论

parallel 2D Delaunay triangulations in HPP and MPI 15

Parallel 2D Delaunay triangulations in HPP and MPI

引用

15th International parallel and distributed processing symposium, IPDPS 2001

作者： Chen, Min-Bin Chuang, Tyng-Ruey Wu, Jan-Jau Institute of Information Science Academia Sinica Nankang Taipei115 Taiwan

ISBN: (纸本)0769509908

this paper reports on efficient parallel implementations of two-dimensional Delaunay triangulation in High Performance Fortran (HPF) and in Message Passing Interface (MPI). Our parallelization algorithm performs subblock triangulation and boundary merge independently at the same time. the sub-block triangulation is by a divide & conquer Delaunay algorithm known for its sequential efficiency, and the boundary triangulation is by an incremental construction algorithm with low overhead. Compared to prior work, our parallelization method is both simple and efficient. In the paper we also describe a solution to the collinear points problem that usually arises in large data sets for divide & conquer algorithm. Our experiences with the HPF implementation show that with careful control of the data distribution, we are able to parallelize the program using HPF's standard directives and extrinsic procedures. Experimental results on several parallel platforms, including an IBM SP2 and a DEC Alpha farm, show that a parallel efficiency of 31%-59% can be achieved for an 8-node distributed memory system. We also compare efficiency of the HPF implementation to that of a similarly hand-coded MPI implementation. © 2001 ieee.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 44 45 46 47 48 49 50 51 52 53 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：