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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,699 篇 会议
48 册 图书
23 篇 期刊文献

馆藏范围

1,770 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,364 篇 工学
- 1,234 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

108 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
61 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
10 篇 bogdanov alexand...
10 篇 shen hong
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,704 篇 英文
40 篇 其他
18 篇 中文
9 篇 俄文

检索条件"任意字段=9th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1770 条记录，以下是1611-1620 订阅

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

详细简洁

排序：

A scalable broadcast algorithm for multiport meshes with minimum communication steps 9

A scalable broadcast algorithm for multiport meshes with min...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Al-Dubai, AY Ould-Khaoua, M Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland

ISBN: (纸本)0769517609

Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this study proposes a new adaptive broadcast algorithm for the mesh. the unique feature of our algorithm is that it handles broadcast operations with a fixed number of message-passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in [1]. Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

关键词： Algorithm design and analysis Broadcasting Concurrent computing Delay distributed computing Large-scale systems Partitioning algorithms Performance analysis Routing Scalability

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of software RAID vs. hardware RAID for parallel virtual file system 9

Performance evaluation of software RAID vs. hardware RAID fo...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Hsieh, J Stanton, C Ali, R Dell Comp Corp Round Rock TX 78682 USA

ISBN: (纸本)0769517609

Linux clusters of commodity computer systems and interconnects have become the fastest growing choice for building cost-effective high-performance parallel computing systems. the parallel Virtual File System (PVFS) could potentially fulfill the requirements of large I/O-intensive parallel applications. It provides a high-performance parallel file system by striping file data across multiple cluster nodes, called I/O nodes. therefore, the choice of storage devices on I/O nodes is crucial to PVFS. In this paper we study the impact of software RAIDs and hardware RAIDs on the performance of PVFS when they are used on I/O node's. We first establish a baseline performance of both RAIDs in a stand-alone configuration. We then present the performance of PVFS for a workload comprising concurrent reads and writes using ROMIO MPI-IO, andfor the BTIO benchmark with a noncontiguous access pattern. We found that software RAIDs have a comparable performance to hardware RAIDs, except for write ope I rations that require file synchronization.

关键词： performance evaluation software RAID hardware RAID cluster computing parallel I/O parallel Virtual File System benchmarking

来源：评论

学校读者我要写书评

暂无评论

A parallel implementation of GESPP on a cluster of silicon graphics workstations 9

A parallel implementation of GESPP on a cluster of silicon g...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Al-Towaiq, M Al-Aamri, H Sultan Qaboos Univ Dept Comp Sci POB 36 Al Khoud 123 Oman

ISBN: (纸本)0769517609

In this paper, we develop and evaluate a parallel algorithm for GESPP on a cluster of Silicon Graphics workstations using PVM as a parallel programming environment. the proposed algorithm reduces the computation time to O(n(3) / p) and the communication time to O(n) including scaling, searching for the pivot element, row interchanging, and pivot row and multipliers column broadcasting. the numerical experiments show that the proposed parallel algorithm offers a high speedup and efficiency for the test problems.

关键词： linear systems parallel computing algorithms

来源：评论

学校读者我要写书评

暂无评论

Normality versus system mobility 9

Normality versus system mobility

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Gradinariu, M Univ Rennes 1 IRISA F-35042 Rennes France

ISBN: (纸本)0769517609

Normality, consitancy criteria stronger than sequentiality and equivalant to linearizability for the unary operations case, has the main advantage that it avoids the use of the "global real-time ordering". this work presents the first algorithm that implements normality without using strong communication primitives (i.e. atomic broadcast or global clock syncronization). Moreover, our implementation allows the dynamic changes of the system configuration, handles replication and refers the general case of multi-object operations. Although the use of terms as client or server our algorithm is entirely based on a peer-to-peer approach.

关键词： Broadcasting Clocks distributed algorithms distributed databases Network servers Network topology Peer to peer computing Real time systems Routing protocols Scalability

来源：评论

学校读者我要写书评

暂无评论

A multi-locking mechanism on shared object DSM 9

A multi-locking mechanism on shared object DSM

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Wong, AKL Zhu, WP Univ Queensland Sch Info Tech & Elec Eng St Lucia Qld 4072 Australia

ISBN: (纸本)0769517609

Shared object distributed Shared Memory (DSM) minimizes the problem of false sharing by allowing programmer to control the sharing size. this shared object approach for distributed parallel programming works well in task parallelism but not in data parallelism. When the data of a shared object is being modified, a lock on that object must be enforced to exclude any concurrent access on that same object. If the shared data within an object is large, internal false sharing would become a problem. We present a multi-locking mechanism for shared object DSM which allows multiple locks be applied to the different data sets of a shared object and thus enhances its concurrency power.

关键词： Australia Computer science Concurrent computing Force control Hardware parallel processing parallel programming Programming profession Scattering Size control

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of distributed computing paradigms in mobile ad hoc sensor networks 9

Performance evaluation of distributed computing paradigms in...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Xu, YY Qi, HR Univ Tennessee Dept Elect & Comp Engn Knoxville TN 37996 USA

ISBN: (纸本)0769517609

the emergence of mobile ad hoc sensor networks has brought new challenges to traditional network design. this paper compares the performance of two distributed computing paradigms, the client/server-based paradigm and the mobile-agent-based paradigm, through mathematical modeling and simulation. Previous works have shown that the mobile-agent-based paradigm is more appropriate to handle computations in ad hoc sensor networks. However no simulation;work has been done to quantitatively measure the performance. this paper first describes how computing is accomplished in the mobile-agent-based paradigm. It then presents a modified mathematical model and uses the execution time as a metric to measure the Performance. Eight experiments are designed to show the effect of different parameters to the performance of the paradigms. Experimental results show that in the context of mobile ad hoc sensor networks with hundreds or Eden thousands of nodes, unreliable communication links, and reduced bandwidth, the mobile-agent-based computing provides solutions to low network latency and reliable data processing.

关键词： Bandwidth Computational modeling Computer networks Context Delay distributed computing Mathematical model Mobile communication Mobile computing Time measurement

来源：评论

学校读者我要写书评

暂无评论

Communication pattern based methodology for performance analysis of termination detection schemes 9

Communication pattern based methodology for performance anal...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Tseng, YL DeMara, RF Florida A&M Univ Dept Comp Informat Sci Tallahassee FL 32307 USA

ISBN: (纸本)0769517609

Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing systems. Even though relatively efficient termination detection techniques have been proposed for certain environments, no effective performance analysis methodology has been introduced to determine application attributes that favor the use of a particular termination detection technique. this fact has hindered the adoption and development of termination detection schemes. this paper addresses this problem by developing a communication pattern based methodology to improve the precision of the theoretical performance of termination detection techniques in lieu of laborious experiments or potentially subjective benchmarking studies. By measuring message complexity from the idle period respect, it provides a simple and effective way to evaluate existing termination detection techniques or design new termination detection algorithms.

关键词： Algorithm design and analysis Communication channels Computer architecture Detection algorithms distributed computing IP networks Multiprocessing systems parallel processing Performance analysis throughput

来源：评论

学校读者我要写书评

暂无评论

9th international conference on High Performance computing, HiPC 2002

引用

9th international conference on High Performance computing, HiPC 2002

ISBN: (纸本)3540003037

the proceedings contain 70 papers. the special focus in this conference is on High Performance computing. the topics include: High-performance computing and visualization;2-d wavelet transform enhancement on general-purpose microprocessors;a general data layout for distributed consistency in data parallel applications;duplication-based scheduling algorithm for interconnection-constrained distributed memory machines;evaluating arithmetic expressions using tree contraction;a mechanism to reduce i-cache power consumption in high performance microprocessors;exploiting web document structure to improve storage management in proxy caches;high performance multiprocessor architecture design methodology for application-specific embedded systems;a low latency messaging infrastructure for Linux clusters;low-power high-performance adaptive computing architectures for multimedia processing;a technique to construct high performance CORBA applications;automatic search for performance problems in parallel and distributed programs by using multi-experiment analysis;an adaptive value-based scheduler and its RT-Linux implementation;effective selection of partition sizes for moldable scheduling of parallel jobs;runtime support for multigrain and multiparadigm parallelism;a fully compliant openMP implementation on software distributed shared memory;a fast connection-time redirection mechanism for internet application scalability;an efficient resource sharing scheme for dependable real-time communication in multihop networks;improving web server performance by network aware data buffering and caching;wraps scheduling and its efficient implementation on network processors;performance comparison of pipelined hash joins on workstation clusters and iterative algorithms on heterogeneous network computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Achieving high efficient Byzantine agreement with dual components failure mode on a multicasting network 9

Achieving high efficient Byzantine agreement with dual compo...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Wang, SC Yan, KQ Cheng, CF Chaoyang Univ Technol Dept Informat Management Taichung Taiwan

ISBN: (纸本)0769517609

Under many circumstances, reaching a common agreement in the presence of faulty components is the central issue of fault tolerant distributed computing. So Byzantine Agreement (BA) problem has become more and more important in the distributed system. Traditionally, the BA problem was visited in a Fully Connected Network (FCN), BroadCasting Network (BCN) and Generalize Connected Network (GCN). Subsequently, the malicious fault assumption with processors or communication media was extended to hybrid fault model on both processors and communication media. However, the network structures (topologies) of FCN, BCN and GCN are not practical in nowadays. In this study, we lighten restrictions of the network structure to revisit BA problem with MultiCasting Network (MCN). the proposed protocol uses the minimum number of rounds of message exchange and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement in an MCN.

关键词： Broadcasting Business communication Chaotic communication Clocks distributed computing Fault tolerance Fault tolerant systems Information management Network topology Protocols

来源：评论

学校读者我要写书评

暂无评论

An agent-based approach to enforcing fairness in peer-to-peer distributed file systems 9

An agent-based approach to enforcing fairness in peer-to-pee...

引用

9th international conference on parallel and distributed Systems (ICPADS 2002)

作者： Gelfand, B Esfahanian, AH Mutka, M Michigan State Univ E Lansing MI 48824 USA

ISBN: (纸本)0769517609

Peer-to-peer file systems are typically vulnerable to denial-of-service or free-loader problems. those that address these issues employ approaches are either simplistic or require a centralized authority. In this paper we explore how a zero-sum trading system can provide strong quotas to a peer-to-peer distributed file system without any centralized authority. We will treat each member of such a peer-to-peer system as an autonomous agent, interested in preserving its own disk storage. We develop a model-for these agents, and present experimental simulation and external emulation results from a multi-agent reinforcement learning model demonstrating the validity of this approach.

关键词： Autonomous agents Broadcasting Emulation Fault tolerant systems File systems Internet Learning Load management Peer to peer computing Security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 158 159 160 161 162 163 164 165 166 167 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：