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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

143 篇 工学
- 133 篇 计算机科学与技术...
- 66 篇 软件工程
- 24 篇 信息与通信工程
- 13 篇 电气工程
- 10 篇 材料科学与工程（可...
- 8 篇 电子科学与技术（可...
- 8 篇 控制科学与工程
- 6 篇 机械工程
- 6 篇 网络空间安全
- 5 篇 农业工程
- 3 篇 力学（可授工学、理...
- 3 篇 建筑学
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 2 篇 土木工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 冶金工程
- 1 篇 化学工程与技术
57 篇 理学
- 50 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 生物学
- 2 篇 物理学
- 1 篇 化学
14 篇 管理学
- 11 篇 管理科学与工程(可...
- 6 篇 工商管理
- 3 篇 图书情报与档案管...
5 篇 农学
- 5 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学

主题

11 篇 parallel process...
8 篇 parallel process...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
6 篇 parallel archite...
6 篇 database systems
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance
4 篇 parallel program...
4 篇 computer network...
3 篇 computer systems...
3 篇 high performance...
3 篇 distributed comp...
2 篇 memory managemen...
2 篇 encoding (symbol...
2 篇 merging
2 篇 research and dev...
2 篇 graphics process...

机构

2 篇 hong kong polyte...
2 篇 school of comput...
2 篇 illinois institu...
2 篇 tohoku univ info...
2 篇 tohoku univ grad...
2 篇 department of co...
2 篇 ibm corporation ...
2 篇 louisiana state ...
2 篇 national laborat...
2 篇 department of co...
1 篇 department of el...
1 篇 department of in...
1 篇 school of inform...
1 篇 merit technology...
1 篇 pc2-paderborn ce...
1 篇 nanyang technol ...
1 篇 school of comput...
1 篇 acad sinica inst...
1 篇 computer science...
1 篇 univ politecn ca...

作者

4 篇 zheng wm
2 篇 chang zhi-ming
2 篇 wang cho-li
2 篇 lakshmivarahan s...
2 篇 wojcik zbigniew ...
2 篇 bernard t
2 篇 bui a
2 篇 cao jn
2 篇 shu jw
2 篇 wojcik barbara e...
2 篇 ghafoor arif
2 篇 wang tianqi
2 篇 raad peter e.
2 篇 lau francis c. m...
2 篇 olariu s.
2 篇 jiang yan-huang
2 篇 dhall s.k.
2 篇 yang xue-jun
2 篇 zheng s.q.
1 篇 deen sm

语言

165 篇 英文

检索条件"任意字段=2nd IEEE Symposium on Parallel and Distributed Processing, SPDP 1990"

共 165 条记录，以下是131-140 订阅

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

详细简洁

排序：

Locality optimizations for jacobi iteration on distributed parallel systems

引用

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

作者： Che, Yonggang Wang, Zhenghua Li, Xiaomei Yang, Laurence T. School of Computer National University of Defense Technology Changsha410073 China Institute of Equipment and Command Technology Beijing China Department of Computer Science St. Francis Xavier University P.O. Box 5000 AntigonishNSB2G 2W5 Canada

ISBN: (纸本)9783540241287

In this paper, we propose an inter-nest cache reuse optimization method for Jacobi codes. This method is easy to apply, but effective in that it enhances cache locality of the Jacobi codes while preserving their coarse grain parallelism. We compare our method to two previous locality enhancement techniques that can be used for Jacobi codes: time skewing and new tiling. We quantitatively calculate the main contributing factors to the runtime of different Jacobi codes. We also perform experiments on a PC cluster to verify our analysis. The results show that our method performs poorer than time skewing and new tiling for uniprocessor, but performs better for distributed parallel system. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A practical fast parallel routing architecture for Clos networks 06

A practical fast parallel routing architecture for Clos netw...

引用

2nd ACM/ieee symposium on Architectures for Networking and Communications Systems, ANCS 2006

作者： Zheng, S.Q. Gumaste, Ashwin Lu, Enyue Dept. of Computer Science University of Texas at Dallas Richardson TX 75083 United States School of Information Tech. Indian Institute of Technology Bombay India Dept. Math and CS Salisbury University Salisbury MD 21801 United States

ISBN: (纸本)1595935800

Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos networks, sequential routing algorithms are too slow, and all known parallel algorithms are not practical. We present the algorithm-hardware codesign of a unified fast parallel routing architecture called distributed pipeline routing (DPR) architecture for rearrangeable nonblocking and strictly nonblocking Clos networks. The DPR architecture uses a linear interconnection structure and processing elements that performs only shift and logic And operations. We show that a DPR architecture can route any permutation in rearrangeable nonblocking and strictly nonblocking Clos networks in O(N) time. The same architecture can be used to carry out control of any group of connection/disconnection requests for strictly nonblocking Clos networks in O(N) time. Several speeding-up techniques are also presented. This architecture is applicable to packet and circuit switches of practical sizes. Copyright 2006 ACM.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

2nd Workshop on Composable Systems (COMPSYS 2023)

2023 IEEE International Parallel and Distributed Processing ...

引用

2023 ieee International parallel and distributed processing symposium Workshops, IPDPSW 2023 2023年 939-940页

来源：评论

学校读者我要写书评

暂无评论

Optimizing I/O server placement for parallel I/O on switch-based irregular networks

引用

2nd International symposium on parallel and distributed processing and Applications (ISPA 2004)

作者： Lin, Yih-Fang Wang, Chien-Min Wu, Jan-Jan Acad Sinica Inst Informat Sci Taipei Taiwan Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10764 Taiwan

ISBN: (纸本)9783540241287

In this paper, we study I/O server placement for optimizing parallel I/O performance on switch-based clusters, which typically adopt irregular network topologies to allow construction of scalable systems with incremental expansion capability. Finding optimal solution to this problem is computationally intractable. We quantified the number of messages travelling through each network link by a workload function, and developed three heuristic algorithms to find good solutions based on the values of the workload function. The maximum-workload-based heuristic chooses the locations for I/O nodes in order to minimize the maximum value of the workload function. The distance-based heuristic aims to minimize the average distance between the compute nodes and I/O nodes, which is equivalent to minimizing average workload on the network links. The load-balance-based heuristic balances the workload on the links based on a recursive traversal of the routing tree for the network. Our simulation results demonstrate performance advantage of our algorithms over a number of algorithms commonly used in existing parallel systems. In particular, the load-balance-based algorithm is superior to the other algorithms in most cases, with improvement ratio of 10 to 95% in terms of parallel I/O throughput.

关键词： parallel I/O I/O server placement irregular networks

来源：评论

学校读者我要写书评

暂无评论

M-Guard: A new distributed deadlock detection algorithm based on mobile agent technology

引用

2nd International symposium on parallel and distributed processing and Applications (ISPA 2004)

作者： Zhou, JY Chen, XL Dai, H Cao, JN Chen, DX Nanjing Univ Dept Comp Sci & Technol Nanjing 210008 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Chuxiong Normal Univ Dept Comp Sci Chuxiong Peoples R China

ISBN: (纸本)3540241280

Deadlock detection and resolution are of the fundamental issues in distributed systems. Although many algorithms have been proposed. these message passing based traditional solutions can hardly meet the challenges of the prevailing Internet computing and mobile computing. In this paper, we present a novel algorithm, namely the M-Guard, for deadlock detection and resolution in distributed systems based on mobile agent technology. The proposed algorithm lies in the intersection of the centralized type algorithm and the distributed type algorithm. An agent is employed in our algorithm as a guard with dual-role: when roaming in the system according to a specified itinerary algorithm. the agent collects resource request/allocation information for detecting deadlock cycles as well as propagating the collected network and resource information among the nodes. Consequently, accurate and timely detections of deadlocks can be made without any network node being the performance bottleneck. Preliminary simulation results show that. compared with several other algorithms. the M-Guard algorithm achieves both shorter deadlock persisting time and smaller phantom deadlock ratio. Moreover. the overall network communication overhead can be decreased, too.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a grid computing architecture using realtime network monitoring

引用

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

作者： Jeong, Young-Sik Xu, Cheng-Zhong Department of Computer Engineering Wonkwang University 344-2 Shinyong-Dong IksanJeonbuk570-749 Korea Republic of Department of Electrical and Computer Engineering Wayne State University DetroitMI48202 United States

ISBN: (纸本)9783540241287

This paper integrates the concepts of realtime network monitoring and visualizations into a grid computing architecture on the Internet. We develop a Realtime Network Monitor(RNM) that performs realtime network monitoring in order to improve the performance of the grid computing framework. Through network monitoring, it is also found out that the network traffic has effects on the performance of processing for large scale applications. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

An architecture to support scalable distributed virtual environment systems on grid

An architecture to support scalable distributed virtual envi...

引用

2nd International symposium on parallel and distributed processing and Applications (ISPA 2004)

作者： Wang, Tianqi Wang, Cho-Li Lau, Francis C. M. Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

A distributed Virtual Environment (DVE) system offers a computer-generated virtual world in which individuals located at different places in the physical world can interact with one another. In order to achieve real-time response for a large user base, DVE systems need to have a scalable architecture. In this paper, we present the design of a grid-enabled service oriented framework for facilitating the construction of scalable DVE systems on computing grids. A service component called "gamelet" is proposed, whose distinctive mark is its high mobility for supporting dynamic load sharing. We propose a gamelet migration protocol which can ensure the transparency and efficiency of gamelet migration, and an adaptive gamelet load-balancing (AGLB) algorithm for making gamelet redistribution decisions at runtime. The algorithm considers both the synchronization costs of the DVE system and network latencies inherent in the grid nodes. The activities of the users and the heterogeneity of grid resources are also considered in order to carry out load sharing more effectively. We evaluate the performance of the proposed mechanisms through a multiplayer online game prototype implemented using the Globus toolkit. The results show that our approach can achieve faster response times and higher throughputs than some existing approaches.

关键词： gamelet distributed virtual environment adaptative load balancing service-oriented framework computer gaming grid

来源：评论

学校读者我要写书评

暂无评论

Meta-based distributed computing framework

引用

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

作者： Lai, Andy S. Y. Beaumont, A.J. Department of Information and Communications Technology Institute of Vocational Education Hong Kong Department of Computer Science Aston University Aston Triangle Birmingham United Kingdom

ISBN: (纸本)9783540241287

The explosive growth of distributed technologies requires frameworks to be adaptable. This paper uses design patterns as building blocks to develop an adaptive pattern-oriented framework for distributed computing applications. We describe our novel approach of combining a meta-architecture with a pattern-oriented framework, resulting in an adaptable framework which provides a mechanism to facilitate system evolution. We show how the meta-based framework can be used effectively to enable component integration and to separate system functionality from application functionality. The framework is based on modelling layers of the architecture to meet the challenges of customization, reusability, and extendibility in distributed computing technology. We also highlight how the meta-based framework will impose significant adaptability in system evolution through a simple example using a HTTP Server in conjunction with a thread pool. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Communication using a reconfigurable and reliable transport layer protocol

引用

2nd International symposium on parallel and distributed processing and Applications (ISPA 2004)

作者： Wang, T Singh, A Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)3540241280

Although TCP is known to be inefficient over networks such as wireless, satellite, and log-fat-pipes, it is still the most widely used transport layer protocol even on these networks. In this paper, we explore an alternative strategy for designing a reliable transport layer protocol that is much more suitable for today's mobile and other types of non-conventional networks. The objective here is to have a single protocol that is compatible with today's communication software and can be easily made to perform better over all types of network. The outcome of the research is a reconfigurable, user-level, reliable transport layer protocol, called RRTP (Reliable and Reconfigurable Transport Protocol) that is TCP-friendly, i.e. it asymptotically converges to fairness as in the case of LIMD (Linear Increase Multiplicative Decrease) algorithms. The protocol is implemented on top of UDP, but it can also easily be incorporated into OS kernels. The paper presents the RRTP algorithm and the key parameters that are necessary for its reconfiguration. We evaluate our protocol using the standard network simulation tool (ns2). Several representative network configurations are used to benchmark the performance of our protocol against TCP in terms of network throughput and congestion loss rate. It is observed that under normal operating conditions, our protocol has a performance advantage of 30% to 700% over TCP in lossy, wireless environments as well as high bandwidth, high latency networks.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

An improved distributed algorithm for connected dominating sets in wireless ad hoc networks

引用

2nd International symposium on parallel and distributed processing and Applications (ISPA 2004)

作者： Liu, H Pan, Y Cao, JN Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

ISBN: (纸本)3540241280

The idea of virtual backbone routing has been proposed for efficient routing among a set of mobile nodes in wireless ad hoc networks.. Virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is a NP-hard problem. We propose a distributed, 3-phase protocol for calculating the CDS in this paper. Our new protocol largely reduces the number of nodes in CDS compared with Wu and Li's method, while message and time complexities of our approach remain almost the same as those of Wu and Li's method. We conduct extensive simulations and show our protocol can consistently outperform Wu and Li's method. The correctness of our protocol is proved through theoretical analysis.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：