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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是201-210 订阅

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

详细简洁

排序：

Adaptive Diagnosis in the Locally Twisted Cube

Adaptive Diagnosis in the Locally Twisted Cube

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Han, Yuejuan Fan, Jianxi You, Lantao Cheng, Baolei Wang, Yan Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China

ISBN: (纸本)9780769548982;9781467345668

Adaptive diagnosis in the locally twisted cube is studied in this paper. Let LTQ(n) denote the n-dimensional locally twisted cube. We prove that for any integer n >= 3, LTQ(n) can be adaptively diagnosed using at most 4 parallel testing rounds, with at most n faulty nodes, where each node participates in at most one test in each round. The proof and algorithm of adaptive diagnosis in LTQ(n) have been proposed in this paper.

关键词： interconnection networks the locally twisted cube adaptive diagnosis parallel computing

来源：评论

学校读者我要写书评

暂无评论

A bridging model for branch-and-bound algorithms on multi-core architectures

A bridging model for branch-and-bound algorithms on multi-co...

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Savadi, Abdorreza Deldari, Hossein Ferdowsi Univ Mashhad Dept Comp Engn Mashhad Iran Islamic Azad Univ Mashhad Branch IAUM Dept Comp Engn Mashhad Iran

ISBN: (纸本)9780769548982;9781467345668

Nowadays, the evolution of multi-core architectures goes towards increasing the number of cores and levels of cache. Meanwhile, current typical parallel programming languages are unable to exploit the potential of these processors efficiently. In order to achieve desired performance on these hardwares we need to understand architectural parameters appropriately and also apply them in algorithm design. Computational models such as Multi-BSP, illustrate these parameters and explain adequate methods for designing algorithms on multi-cores. One of applicable categories of problems is Branch-and-Bound (BaB) that needs to be adapted by such model for implementing on these systems. In this paper, we have attempted to make a mapping between BaB run-time tree and the Memory Hierarchy Tree (MT) of multi-core processor. Multi-BSP model inspired us to introduce Multi-BaB model. Analogous to Multi-BSP analysis, bounds for communication and synchronization costs have been presented in the paper respecting BaB algorithms. This work is a step towards making multi-core programming efficient and tries to obtain correct analysis of BaB algorithm behavior on multi-core architectures.

关键词： Multi-BSP Branch-and-Bound(BaB) parallel Model Multi-core architectures Cache Memory Hierarchy

来源：评论

学校读者我要写书评

暂无评论

PAAG: A Polymorphic Array Architecture for Graphics and Image Processing

PAAG: A Polymorphic Array Architecture for Graphics and Imag...

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Li, Tao Xiao, Lingzhi Huang, Hucai Han, Jungang XiAn Univ Posts & Telecom Res Ctr Telecom ASIC Design Xian Peoples R China XiAn Univ Posts & Telecom Sch Comp Sci Xian Peoples R China

ISBN: (纸本)9780769548982;9781467345668

A novel, polymorphic array architecture is proposed in this paper. This architecture is capable of supporting a dynamic mixture of data parallel computation (DLP), thread level parallel computation (TLP), and operation level parallel computation (OLP). We aim at designing a programmable architecture that can approach ASIC performance. This is accomplished through new architectural features and implementation level innovations. The architecture and its implementation are presented in the paper to demonstrate its feasibility and capabilities.

关键词： parallel computation polymorphic architecture data parallelism thread level parallelism operation level parallelism thread scheduling message routin.g

来源：评论

学校读者我要写书评

暂无评论

parallel Monte Carlo search for imperfect information game Daihinmin

Parallel Monte Carlo search for imperfect information game D...

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Nishino, Junji Nishino, Tetsuro Univ Electrocommun Grad Sch Informat & Engn Dept Informat Chofu Tokyo 182 Japan

ISBN: (纸本)9780769548982;9781467345668

Computer games, such as chess, have recently become an important research topic in the field of computation intelligence. Monto Carlo massive searching is very successful in the game of GO as it has a huge intractable search space and no good partial evaluation heuristics. Imperfect information games also have intractable properties, such as large scale search space, less heuristics, and unknown state information. Monte Carlo search is therefore effective to make computer players for the imperfect information game. There is always a time limit for using computational intelligence in actual applications. Such constraints require parallel processing to be speed up the Monte Carlo simulations. We introduce a parallel Monte Carlo searching method for imperfect information card game Daihinmin, a familiar card game in Japan. Computer Daihinmin competitions have been held since 2006. We present two kinds of parallelization algorithms for Monte Carlo computer Daihinmin players.

关键词： Monte Carlo search Imperfect information game Multiplayer game parallel processing Tree search

来源：评论

学校读者我要写书评

暂无评论

Restricted duplication based MILP formulation for scheduling task graphs on unrelated parallel machines

Restricted duplication based MILP formulation for scheduling...

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Singh, Jagpreet Mangipudi, Bhargav Betha, Sandeep Auluck, Nitin Indian Inst Technol Ropar Dept Comp Sci & Engn Rupnagar 140001 India

ISBN: (纸本)9780769548982;9781467345668

Duplication has proved to be a vital technique for scheduling task graphs on a network of unrelated parallel machines. Few attempts have been made to model duplication in a Mixed Integer Linear Program (MILP) to reduce schedule length. Other known optimal MILPs duplicate a job on all the available processing elements and this increases their complexities. This paper proposes a new REStricted Duplication (RESDMILP) approach to model duplication in a MILP. The complexity of this model increases with the increase in the amount of duplication. Experiments conducted have revealed that RESDMILP achieves better runtimes when the problem instance is solved optimally and provides better lower bound and percentage gap if it is run for a fixed amount of time. The percentage gap is defined as, (UB-LB)/UB where UB and LB are the upper and lower bounds achieved by the MILPs respectively.

关键词： MILP Scheduling Heterogeneous Duplication Multiprocessors

来源：评论

学校读者我要写书评

暂无评论

Scheduling parallel Data Retrievals for Non-consecutive Broadcast in MIMO Wireless Networks

Scheduling Parallel Data Retrievals for Non-consecutive Broa...

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： He, Ping Shen, Hong Tian, Hui Beijing Jiaotong Univ Sch Comp & Informat Technol Beijing Peoples R China Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9780769548982;9781467345668

Wireless data broadcast is usually used to disseminate the public information to considerable clients in wireless environment. Based on the development of mobile device, some mobile devices can simultaneously use multiple antennae to process some operations. In this paper, we commit to study data retriveal schdeuling problem in wireless data broadcast, which mobile device has multiple antennae and the data items are non-consecutivly broadcasted in mutiple parallel channels. In order to improve the performance of downloading requested data items, we propose a scheme of scheduling parallel data retrievals for non-consecutive broadcast to decrease access latency and energy consumption. In this scheme, we utilize a weight of channel through two balancing factors to choose the suitable channel for data retrieval. We analyze the performance of propsed scheme and the other schemes. Evaluation results prove that the proposed scheme has the better performance.

关键词： parallel data retrieval wireless networks non-consecutive broadcast

来源：评论

学校读者我要写书评

暂无评论

parallel Clustering Based on Partitions of Local Minimal-Spanning-Trees

Parallel Clustering Based on Partitions of Local Minimal-Spa...

引用

5th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Tsui, Shiau-Rung Wang, Wei-Jen Chen, Shi-Shan Chen, Lee Shu-Teng Wang, Chilung Natl Cent Univ Dept Comp Sci & Informat Engn Jhongli Taiwan Ind Technol Res Inst Clouding Comp Ctr Mobile Applicat Hsinchu Taiwan Natl Cent Univ Software Res Ctr Taoyuan Taiwan

ISBN: (纸本)9780769548982;9781467345668

Many traditional clustering algorithms have the scalability problem while dealing with large data sets. One common strategy to handle the problem is to parallelize the algorithms and execute them along with the input data on high-performance computers. However, many graph-based clustering algorithms are hard to be parallelized since they need to calculate the similarity of all-pairs of all data nodes. In this paper, we propose a new parallel clustering algorithm, called the Para-CPLM (parallel Clustering based on Partitions of Local Minimal-spanning-trees), which is based on three strategies - graph-based clustering, granular computing, and partition-and-merge. The Para-CPLM partitions the data domain into several regions for parallel execution, and then establishes a local minimal spanning tree in each region. After being established, the Para-CPLM combines those local minimal spanning trees and applies a method, namely the GBC method, to determine the best number of clusters. After the first phase of clustering, it repeatedly finds better pairs (edges) of the inter-clusters to reform the merged tree structure, such that the tree becomes closer to a global minimal spanning tree. Consequently, it uses the GBC method again to find the best number of clusters. From our experimental results, the Para-CPLM achieves significantly shorter execution time and better scalability while compared with the sequential GBC method. In addition, the clustering results are almost identical to those produced by the sequential GBC method.

关键词： clustering parallel computing graph-based clustering

来源：评论

学校读者我要写书评

暂无评论

On the Feasibility of a Distributed Runtime for the Chemical programming Model

On the Feasibility of a Distributed Runtime for the Chemical...

引用

26th IEEE international parallel and Distributed Processing symposium (IPDPS)

作者： Obrovac, Marko Tedeschi, Cedric Univ Rennes 1 INRIA IRISA F-35014 Rennes France

ISBN: (纸本)9780769546766

Chemical computing was initially proposed as an intuitive paradigm to capture the essence of parallel computing. Within such a model, a program is a solution of information-carrying molecules, that, at run time, collide non-deterministically to produce new data. Such a paradigm allowed the programmers to focus on the logic of the problem to be solved in parallel, without having to worry about implementation's considerations. Throughout the years, the model has been enriched with various features related to program structure, control and practicability. More importantly, the model was raised to the higher order, increasing again its expressiveness. With the rise of service-oriented computing, such models have recently regained a lot of interest. They have been shown to provide adequate abstractions to enhance service-oriented architectures with autonomic properties such as self-adaptation, self-healing, or self-organisation. However, the deployment of chemical programs over large scale distributed platforms is still a widely open problem, hindering the model to be leveraged in practice. This paper studies the possibility of building a distributed execution environment for chemical programs. A generic peer-to-peer-based runtime model and distributed algorithms for large scale chemical computing are discussed. To complete this study, a software prototype was developed and experimented over the Grid'5000 test-bed. Experimental performance results are detailed, allowing for a discussion of the feasibility and performance of such a runtime, thus lifting a barrier towards the enactment of the chemical programming model.

关键词： Runtime Software prototyping chemical compounds Service-oriented architecture distributed algorithms Computer personnel programming parallel PROCESSING (COMPUTERS) Worry Distribute Essences Formal logic

来源：评论

学校读者我要写书评

暂无评论

A CMOS architecture allowing parallel DNA comparison for on-chip assembly

A CMOS architecture allowing parallel DNA comparison for on-...

引用

IEEE international symposium on Circuits and Systems

作者： Hu, Yuanqi Liu, Yan Toumazou, Christofer Georgiou, Pantelis Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn Ctr Bioinspired Technol Inst Biomed Engn London SW7 2AZ England

ISBN: (纸本)9781467302197

This paper introduces a CMOS based system that has been designed to allow parallel comparison of fragmented DNA sequences for on-chip assembly. The compatibility of different existing PC-based algorithms for implementation in CMOS is compared and the overlaplayout-consensus approach is found to be the most suitable one. The designed system comprises a scalable processing array capable of parallel computation, which allows identification of overlaps in DNA fragments in addition to error tolerance through dynamic programming. Analysis shows that there is a "pixel area vs computation time" trade-off when implementing such a parallel architecture. Results from a hypothetical assembly confirm good overlap detection and error tolerance, with up to 94% similarity in the detected overlaps, when the error is as much as 10%.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix-Vector Multiplication Based on Network-on-Chip: On Data Mapping

Sparse Matrix-Vector Multiplication Based on Network-on-Chip...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Ahmad Mansour Jürgen Götze Information Processing Laboratory Dortmund University Dortmund Germany

Sparse Matrix-Vector Multiplication (SMVM) on parallel hardware is a very sophisticated problem because of the irregular data communication requirements. The communication volume in the parallel hardware is determined by how data is distributed among the processing elements. In this paper we introduce two methods of data mapping for SMVM based on Network-on-Chip (NoC) in order to spread the load among its components. Later, we introduce the effect of reordering of the sparse matrix on those mapping methods. Simulations are performed using an OMNeT++ based NoC simulator.

关键词： parallel architectures programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：