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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是101-110 订阅

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

详细简洁

排序：

MCCF: A distributed grid job workflow execution framework

引用

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

作者： Feng, YH Cai, WT Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)3540241280

With the explosion of scientific data, distributed scientific applications present great challenges to the existing job workflow execution models over the Grid. Based on the idea of having executable codes as part of Grid resources, a Mobile Code Collaboration Framework (MCCF) utilizing light-weight mobile agent and dynamic services for distributed job workflow execution is proposed in this paper. Instead of the existing light-weight mobile agents, agent core (AC), which is an XML file specifying the functional descriptions of sub-jobs, is used to adapt job workflow execution to the dynamic characteristics of the Grid and to reduce the security risks. In addition, dynamic service mechanism is also introduced to facilitate the multidisplinary scientific cooperation and application integration over the Grid. As a proof-of-concept, a prototype of MCCF is implemented.

关键词： grid computing job work-flow programming model mobile agent code mobility dynamic service

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for helix mapping between 3D and 1D protein structure using the length constraints

引用

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

作者： He, J Lu, YG Pontelli, E New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA

ISBN: (纸本)3540241280

Determining 3-dimensional (3D) structures of proteins is still a challenging problem. Certain experimental techniques can produce partial information about protein structures, yet not enough to solve the structure. In this paper, we investigate the problem of relating such partial information to its protein sequence. We developed an algorithm of building a library to map helices in a 3D structure to its 1-dimensional (1D) structure using the length constraints of helices, obtained from such partial information. We present a parallel algorithm for building a mapping tree using dynamic distributed scheduling for load balancing. The algorithm shows near linear speedup for up to 20 processors tested. If the protein secondary structure prediction is good, the library contains a mapping that correctly assigns the majority of the helices in the protein.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

引用

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

作者： Gao, B Ma, HY Yang, YH Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)3540241280

In this paper, we present a new distributed approximation algorithm that constructs a minimum connected dominating set (MCDS) for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm each node only requires the knowledge of its one-hop neighbors and there is only one shortest path connecting two dominators that are at most three hops away. Compared with other MCDS approximation algorithms, our algorithm shows better efficiency and performance than them.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Hierarchical parallel processing of large scale data clustering on a PC cluster with GPU co-processing

Hierarchical parallel processing of large scale data cluster...

引用

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

作者： Takizawa, Hiroyuki Kobayashi, Hiroaki Tohoku Univ Grad Sch Informat Sci Aoba Ku Sendai Miyagi 9808578 Japan Tohoku Univ Informat Synergy Ctr Aoba Ku Sendai Miyagi 9808578 Japan

This paper presents an effective scheme for clustering a huge data set using a PC cluster system, in which each PC is equipped with a commodity programmable graphics processing unit (GPU). The proposed scheme is devised to achieve three-level hierarchical parallel processing of massive data clustering. The divide-and-conquer approach to parallel data clustering is employed to perform the coarse-grain parallel processing by multiple PCs with a message passing mechanism. By taking advantage of the GPU's parallel processing capability, moreover, the proposed scheme can exploit two types of the fine-grain data parallelism at the different levels in the nearest neighbor search, which is the most computationally-intensive part of the data-clustering process. The performance of our scheme is discussed in comparison with that of the implementation entirely running on CPU. Experimental results clearly show that the proposed hierarchial parallel processing can remarkably accelerate the data clustering task. Especially, GPU co-processing is quite effective to improve the computational efficiency of parallel data clustering on a PC cluster. Although data-transfer from GPU to CPU is generally costly, acceleration by GPU co-processing is significant to save the total execution time of data-clustering.

关键词： programmable graphics processing unit (GPU) general-purpose computation on GPU (GPGPU) k-means data clustering PC cluster the divide-and-conquer approach

来源：评论

学校读者我要写书评

暂无评论

HPGraph: A High parallel Graph processing System Based on Flash Array

HPGraph: A High Parallel Graph Processing System Based on Fl...

引用

18th ieee International Conference on High Performance Computing and Communications, 14th ieee International Conference on Smart City and 2nd ieee International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2016

作者： Xing, Yuxuan Feng, Ya Yu, Songping Chen, Zhengguo Liu, Fang Xiao, Nong State Key Lab. of High Performance Comput. Nat. Univ. of Defense Technol. Changsha China School of Data and Computer Science Sun Yat-sun University Guangzhou China

ISBN: (纸本)9781509042968

Large graphs analytics has been an important aspect of many big data applications, such as web search, social networks and recommendation systems. Many research focuses on processing large scale graphs using distributed system over past few years. And numbers of studies turn to construct graph processing system on a single server-class machine in consideration of cost, usability and maintainability. HPGraph is a high parallel graph processing system which adopts the edge-centric model, our contributions are as follows: (1) designing an efficient data allocation and access strategy for NUMA machine, and providing tasks scheduling to keep load balance, (2) raising a fine-grained edge-block filtering mechanism to avoid accessing unnecessary edge data, (3) constructing a high-speed flash array as the second storage. We made a detailed evaluation on a 16-core machine using asset of popular real word and synthetic data sets, and the results show that HPGraph always outperforms the state-of-the-art single machine graph processing systems-GridGraph. And HPGraph can achieve 1.27X faster than GridGraph for specific application. Our source code is available at https://***/xinghuan1990/HPGraph. © 2016 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Resource management for distributed parallel systems 2

Resource management for distributed parallel systems

引用

2nd International symposium on High Performance distributed Computing, HPDC 1993

作者： Neuman, B.C. Rao, S. Inf. Sci. Inst. Univ. of Southern California Los AngelesCA United States

ISBN: (纸本)0818639008

Multiprocessor systems should exist in the larger context of distributed systems, allowing multiprocessor resources to be shared by those that need them. Unfortunately, typical multiprocessor resource management techniques do not scale to large networks. The Prospero Resource Manager (PRM) is a scalable resource allocation system that supports the allocation of processing resources in large networks and multiprocessor systems. To manage resources in such distributed parallel systems, PRM employs three types of managers: system managers, job managers, and node managers. There exist multiple independent instances of each type of manager, reducing bottlenecks. The complexity of each manager is further reduced because each is designed to utilize information at an appropriate level of abstraction. © 1993 ieee.

关键词： Managers

来源：评论

学校读者我要写书评

暂无评论

Multi-grain parallel processing of data-clustering on programmable graphics hardware

引用

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

作者： Takizawa, H Kobayashi, H Tohoku Univ Grad Sch Informat Sci Aoba Ku Sendai Miyagi 9808578 Japan Tohoku Univ Informat Synergy Ctr Aoba Ku Sendai Miyagi 9808578 Japan

ISBN: (纸本)3540241280

This paper presents an effective scheme for clustering a huge data set using a commodity programmable graphics processing unit (GPU). Due to GPU's application-specific architecture, one of the current research issues is how to bind the rendering pipeline with the data-clustering process. By taking advantage of GPU's parallel processing capability, our implementation scheme is devised to exploit the multigrain single-instruction multiple-data (SIMD) parallelism of the nearest neighbor search, which is the most computationally-intensive part of the data-clustering process. The performance of our scheme is discussed in comparison with that of the implementation entirely running on CPU. Experimental results clearly show that the parallelism of the nearest neighbor search allows our scheme to efficiently execute the data-clustering process. Although data-transfer from GPU to CPU is generally costly, acceleration by CPU is significant to save the total execution time of data-clustering.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed ranking and sorting schemes for a Coterie

Efficient distributed ranking and sorting schemes for a Cote...

引用

Proceedings of the 1996 2nd International symposium on parallel Architectures, Algorithms, and Networks, I-SPAN

作者： Cheng, Zixue Wei, David S.L. Univ of Aizu Aizu-Wakamatsu Japan

We consider the problems of distributed ranking and sorting on a Coterie, a communication structure which has proven to be a good candidate as underlying interconnection network for distributed processing. Ranking and sorting problems are harder than a consensus one, a vital and well studied problem in distributed processing, in that the later one computes for only one function (e.g. summation), while the former one actually performs n functions, as ranking is to rank the key in each of n sites. The currently best known decentralized consensus protocols on a coterie uses O(n√n) messages, and requires two rounds of message exchange. In this paper we show that both ranking and sorting can be done on a coterie with the same message complexity although the problems we investigate are much harder. We first present a two-round ranking algorithm which requires only O(n√n) messages. Then using this ranking algorithm, we obtain a sorting algorithm which also uses only O(n√n) messages, but requires two more rounds of message exchange. Our schemes are optimal in the sense that the lower bound of messages needed for achieving a consensus is Ω(n√n) (a trivial lower bound shown in [7]).

关键词： Interconnection networks

来源：评论

学校读者我要写书评

暂无评论

Probabilistic inference strategy in distributed intrusion detection systems

引用

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

作者： Ding, JG Xu, SH Krämer, B Bai, YC Chen, HS Zhang, J Shanghai Jiao Tong Univ Shanghai 200030 Peoples R China Fern Univ Hagen D-58084 Hagen Germany

ISBN: (纸本)3540241280

The level of seriousness and sophistication of recent. cyber-attacks has risen dramatically over the past decade. This brings great challenges for network protection and the automatic security management. Quick and exact localization of intruder by an efficient intrusion detection system (IDS) will be great helpful to network manager. In this paper, Bayesian networks (BNs) are proposed to model the distributed intrusion detection based on the characteristic of intruders' behaviors. An inference strategy based on BNs are developed, which can be used to track the strongest causes (attack source) and trace the strongest dependency routes among the behavior sequences of intruders. This proposed algorithm can be the foundation for further intelligent decision in distributed intrusion detection.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant memory design for HW/SW co-reliability in massively parallel computing systems 2

Fault tolerant memory design for HW/SW co-reliability in mas...

引用

2nd ieee International symposium on Network Computing and Applications

作者： Choi, M Park, NJ George, KM Jin, B Park, N Kim, YB Lombardi, F Univ Missouri Dept Elect & Comp Engn Rolla MO 65409 USA

ISBN: (纸本)0769519385

A highly dependable embedded fault-tolerant memory architecture for high performance massively parallel computing applications and its dependability assurance techniques are proposed and discussed in this paper. The proposed fault tolerant memory provides two distinctive repair mechanisms: the permanent laser redundancy reconfiguration during the wafer probe stage in the factory to enhance its manufacturing yield and the dynamic BIST/BISD/BISR (built-in-self-test-diagnosis-repair)-based reconfiguration of the redundant resources in field to maintain high field reliability. The system reliability which is mainly determined by hardware configuration demanded by software and field reconfiguration/repair utilizing unused processor and memory modules is referred to as HW/SW Co-reliability. Various system configuration options in terms of parallel processing unit size and processor/memory intensity are also introduced and their HW/SW Co-reliability characteristics are discussed. A modeling and assurance technique for HW/SW Co-reliability with emphasis on the dependability assurance techniques based on combinatorial modeling suitable for the proposed memory design is developed and validated by extensive parametric simulations. Thereby, design and implementation of memory-reliability-optimized and highly reliable fault-tolerant field reconfigurable massively parallel computing systems can be achieved.

关键词： high performance computing massively parallel computing fault-tolerant memory built-in-self-repair (BISR) yield reliability field reconfiguration modular redundancy HW/SW co-reliability reliability assurance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：