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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

291 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

224 篇 工学
- 216 篇 计算机科学与技术...
- 149 篇 软件工程
- 58 篇 信息与通信工程
- 12 篇 电气工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 控制科学与工程
- 1 篇 安全科学与工程
27 篇 理学
- 18 篇 数学
- 8 篇 生物学
- 3 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 系统科学
15 篇 管理学
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
- 3 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学

主题

33 篇 cloud computing
16 篇 parallel computi...
11 篇 parallel process...
11 篇 distributed comp...
11 篇 distributed comp...
9 篇 computer archite...
9 篇 computational mo...
8 篇 parallel program...
8 篇 resource managem...
8 篇 distributed syst...
7 篇 peer to peer com...
7 篇 optimization
7 篇 high performance...
6 篇 fault tolerance
6 篇 educational inst...
6 篇 servers
6 篇 real-time system...
6 篇 protocols
6 篇 performance eval...
6 篇 gpu

机构

3 篇 a*star institute...
3 篇 topic committee ...
2 篇 univ adelaide sc...
2 篇 univ texas dept ...
2 篇 washington univ ...
2 篇 school of comput...
2 篇 laria laboratoir...
2 篇 guizhou universi...
2 篇 guizhou universi...
2 篇 beihang univ sta...
2 篇 graduate school ...
2 篇 los alamos natl ...
2 篇 tsinghua univers...
2 篇 univ calif san d...
2 篇 department of co...
2 篇 scripps res inst...
2 篇 kth royal inst t...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 kent state univ ...

作者

5 篇 li xiaorong
3 篇 xiaorong li
2 篇 seme david
2 篇 kanagasabai raja...
2 篇 cong guojing
2 篇 riccardo loti
2 篇 le duy ngan
2 篇 putchong uthayop...
2 篇 dongarra jack
2 篇 motomura shinich...
2 篇 taufer m
2 篇 ta nguyen binh d...
2 篇 kawamura takao
2 篇 vlassov vladimir
2 篇 kerbyson dj
2 篇 bader david a.
2 篇 tziritas nikos
2 篇 wu weigang
2 篇 liu jie
2 篇 coddington pd

语言

303 篇 英文

检索条件"任意字段=18th International Conference on Parallel and Distributed Computing Systems, PDCS 2005"

共 303 条记录，以下是31-40 订阅

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

详细简洁

排序：

An Empirical Analysis of parallel Random Permutation Algorithms on SMPs 18

An Empirical Analysis of Parallel Random Permutation Algorit...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Cong, Guojing Bader, David A. T.J. Watson Research Center IBM Yorktown HeightsNY10598 United States College of Computing Georgia Institute of Technology AtlantaGA30332 United States

ISBN: (纸本)9781604234565

We compare parallel algorithms for random permutation generation on symmetric multiprocessors (SMPs). Algorithms considered are the sorting-based algorithm, Anderson’s shuffling algorithm, the dart-throwing algorithm, and Sanders’ algorithm. We investigate the impact of synchronization method, memory access pattern, cost of generating random numbers and other parameters on the performance of the algorithms. Within the range of inputs used and processors employed, Anderson’s algorithm is preferable due to its simplicity when random number generation is relatively costly, while Sanders’ algorithm has superior performance due to good cache performance when a fast random number generator is available. there is no definite winner across all settings. In fact we predict our new dart-throwing algorithm performs best when synchronization among processors becomes costly and memory access is relatively fast. We also compare the performance of our parallel implementations with the sequential implementation. It is unclear without extensive experimental studies whether fast parallel algorithms beat efficient sequential algorithms due to mismatch between model and architecture. Our implementations achieve speedups up to 6 with 12 processors on the Sun E4500. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A Cache-Aware parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic 18

A Cache-Aware Parallel Implementation of the Push-Relabel Ne...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Bader, David A. Sachdeva, Vipin College of Computing Georgia Institute of Technology AtlantaGA30332 United States Electrical and Computer Engineering Department University of New Mexico AlbuquerqueNM87106 United States

ISBN: (纸本)9781604234565

the maximum flow problem is a combinatorial problem of significant importance in a wide variety of research and commercial applications. It has been extensively studied and implemented over the past 40 years. the push-relabel method has been shown to be superior to other methods, both in theoretical bounds and in experimental implementations. Our study discusses the implementation of the push-relabel network flow algorithm on present-day symmetric multiprocessors (SMP’s) with large shared memories. the maximum flow problem is an irregular graph problem and requires frequent fine-grained locking of edges and vertices. Over a decade ago, Anderson and Setubal implemented Goldberg’s push-relabel algorithm for shared memory parallel computers;however, modern systems differ significantly from those targeted by their implementation in that SMP’s today have deep memory hierarchies and different performance costs for synchronization and fine-grained locking. Besides our new cache-aware implementation of Goldberg’s parallel algorithm for modern shared-memory parallel computers, our main new contribution is the first parallel implementation and analysis of the gap relabeling heuristic that runs from 2.1 to 4.3 times faster for sparse graphs. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

FAST parallel MAXIMUM LIKELIHOOD-BASED PROTEIN PHYLOGENY 18

FAST PARALLEL MAXIMUM LIKELIHOOD-BASED PROTEIN PHYLOGENY

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Blouin, C. Butt, D. Hickey, G. Rau-Chaplin, A. Faculty of Computer Science Dalhousie University HalifaxB3H 5W1 Canada Dept. of Biochemistry and Molecular Biology Faculty of Medicine Dalhousie University HalifaxB3H 5X1 Canada Genome Atlantic Canada

ISBN: (纸本)9781604234565

Inferring phylogenetic relationships between sequences is a difficult and interesting problem. Assuming that there is enough phylogenetic signal in a biological sequence to resolve every tree bifurcation, the resulting tree is a representation of the vertical descent history of a gene. A popular method to evaluate a candidate phylogenetic tree uses the likelihood of the data, given an empirical model of character substitution. the computational cost of search for the maximum-likelihood tree is, however, very large. In this paper, we present a parallel algorithm for protein phylogeny using a maximum likelihood framework. A key design goal, which differentiates our method from others, is that it determines a range (confidence set) of statistically equivalent trees, instead of only a single solution. We also present a number of sequential algorithmic enhancements and both sequential and parallel performance results. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Maximum likelihood

来源：评论

学校读者我要写书评

暂无评论

Operation Liveness and Gossip Management in a Dynamic distributed Atomic Data Service 18

Operation Liveness and Gossip Management in a Dynamic Distri...

引用

18th international conference on parallel and distributed computing systems, pdcs 2005

作者： Gramoli, Vincent C. Musial, Peter M. Shvartsman, Alexander A. IRISA Campus de Beaulieu Rennes Cedex35042 France Dep. of Comp. Sci. and Engi. University of Connecticut StorrsCT06269 United States CSAIL Massachusetts Institute of Technology CambridgeMA02139 United States

ISBN: (纸本)9781604234565

this paper presents performance-oriented refinements and distributed implementation of a reconfigurable linearizable data service for read/write atomic objects. this service is based on the work of Lynch and Shvartsman, and it guarantees consistency under dynamic conditions involving asynchrony, message loss, and node arrivals, departures, and failures. To achieve fault tolerance and availability the service replicates objects at several dynamically, changeable network nodes, to which we refer as owners. All-to-all gossip protocol is used to keep replicas up to date and to maintain the list of the owners. However, when gossip is unconstrained and communication bandwidth is limited, network congestion may degrade system’s performance. Moreover, we identify a problem where under certain scenarios read/write operations may become delayed or blocked. this paper introduces a more practical algorithm that introduces two refinements. First, we reduce communication cost by restricting the all-to-all gossip pattern to replica owners, based on the local decisions of the participating nodes. In this setting we analyze the latency of read/write operations. Second, we present a solution that allows blocked (or delayed) operations to resume processing and complete successfully. We restate the conditional analysis accordingly. Finally, we engineered a complete distributed system implementing this service and we present empirical results that illustrate the advantages of our approach. © 2005 18th ISCA international conference on parallel and distributed computing systems 2005, pdcs 2005. All rights reserved.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Co-operation of processes in parallel simulated annealing

Co-operation of processes in parallel simulated annealing

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Czech, Zbigniew J. Silesia Univ Technol Gliwice Poland

ISBN: (纸本)9780889866386

the co-operation of parallel simulated annealing processes to solve the vehicle routing problem with time windows (VRPTW) is considered. the objective is to investigate how the number of parallel processes and the frequency of processes co-operation influence the accuracy of solutions to the VRPTW. the accuracy of solutions is measured by their proximity to the best known solution.

关键词： parallel simulated annealing bicriterion optimization vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Probabilistic load balancing method for parallel mining of all frequent itemsets

Probabilistic load balancing method for parallel mining of a...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Kessl, Robert Tvrdik, Pavel Czech Tech Univ Fac Elect Engn Dept Comp Sci & Engn CR-16635 Prague Czech Republic

ISBN: (纸本)9780889866386

In this paper, we present a new method of static load balancing for parallel mining of all frequent itemsets on a distributed-memory (DM) parallel machine. the method partitions the space of all frequent itemsets into subspaces of approximately the same size. Hence, it allows to balance the computational load for an arbitrary frequent itemset mining algorithm.

关键词： parallel algorithms and architectures data mining frequent itemset mining load balancing

来源：评论

学校读者我要写书评

暂无评论

BPA-A parallel shortest path algorithm for cluster-router

BPA-A parallel shortest path algorithm for cluster-router

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Zhang, Xiaoping Wu, Jianping Zhang, Ning Zhao, Youjian Tsinghua Univ 4-104 FIT Bldg Beijing 100084 Peoples R China

ISBN: (纸本)9780889866386

To keep up with the pace of fast development of Internet, cluster architecture has been proposed for next generation core routers. In a cluster router, parallel computation is expected. computing shortest path tree (SPT) is a fundamental problem implementing OSPF, which is one of the most popular routing protocols. this paper presents a parallel algorithm BPA (Branching parallel Algorithm) for computing SPT, analyzes the performance of BPA, and finally validates the BPA performance by experiments

关键词： cluster router shortest path shortest path tree parallel algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Cluster-based parallelization of multi-scale active shape description process

Cluster-based parallelization of multi-scale active shape de...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Kadam, Sanjay S. Ctr Dev Adv Comp Pune Maharashtra India

ISBN: (纸本)9780889866386

In this paper, we discuss parallelization of a high-level computer vision application in medical imaging, namely, multi-scale active shape description of MR (magnetic resonance) brain images of epileptic patients using active contour models, on a cluster of workstations. the paper gives a comparative study and analysis of three different approaches of parallel implementation using corresponding parallel computing patterns such as Temporal Multiplexing, Pipeline, and Composite Pipeline. the outcome of the cluster-based parallel implementations has shown encouraging results.

关键词： cluster computing pipeline processing parallel computer vision temporal multiplexing medical Imaging

来源：评论

学校读者我要写书评

暂无评论

DisUnit: Enable automated distributed testing for distributed systems

DisUnit: Enable automated distributed testing for distribute...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Qu, Runtao Hirano, Satoshi Ohkawa, Takeshi Kubota, Takaya Nicolescu, Radu AIST Natl Inst Adv Ind Sci & Technol Informat Technol Res Inst AIST Tsukuba Cent 2 Tsukuba Ibaraki 3058568 Japan Univ Auckland Dept Comp Sci Auckland New Zealand

ISBN: (纸本)9780889866386

distributed testing is often hard to implement. this is due to difficulties in handling heterogeneous environments, complex configurations, synchronization, error probing, result maintenance and automation in distributed testing. this paper describes a practical testing framework that permits automated distributed testing of distributed systems and applications. the framework extends the capability of JUnit to support test execution over heterogeneous environments and complex configurations.

关键词： JUnit distributed application distributed testing

来源：评论

学校读者我要写书评

暂无评论

An evaluation of parallel algorithms on current memory consistency models

An evaluation of parallel algorithms on current memory consi...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Cong, Guojing IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)9780889866386

Memory consistency model is crucial to the performance of shared-memory multiprocessors, and in current architectures several different models are adopted. In this paper, using graph algorithms for illustrative purposes, we consider the impact of memory model on the implementation and performance of parallel algorithms on shared-memory multiprocessors. We show that the implementation of PRAM algorithm's is largely "oblivious" of the underlying memory model, and has good performance on relaxed models. More importantly, we show that different memory models can favor drastically different algorithm designs.

关键词： consistency models parallel algorithms shared memory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：