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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

550 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

544 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 566 条记录，以下是341-350 订阅

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

详细简洁

排序：

D3G2A: the dynamic distributed double guided genetic algorithm for the K-Graph partitioning problem

D3G2A: The dynamic distributed double guided genetic algorit...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Derbali, Lotfi Bouamama, Sadok Hammami, Moez Khaled, Ghédira SOIE University of Tunis B. 204 Departement of computer science 41 rue de la liberté 2000 cité bouchoucha Tunisia

ISBN: (纸本)9780889867048

Graph Partitioning has several important applications in Computer Science, including VLSI circuit layout, image processing, and distributing workloads for parallel computation. It is known to be NP-hard. In this paper we present in detail the K-Graph Partitioning Problem and the Dynamic distributed Double Guided Genetic Algorithm. this algorithm consists of agents dynamically created and cooperated in order to solve the problem. Each agent performs its own genetic algorithm, guided by the min-conflict-heuristic. the paper also presents the results of application the algorithm for the $K$-Graph Partitioning Problem using a multilevel paradigm.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

parallel double Divide and Conquer and its evaluation on a super computer

Parallel double Divide and Conquer and its evaluation on a s...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Konda, Taro Nakamura, Yoshimasa Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University Yoshida-Honmachi Sakyo-ku Kyoto Japan SORST JST Japan

ISBN: (纸本)9780889867048

this paper presents comprehensive evaluations of parallel double Divide and Conquer for singular value decomposition on a super computer, HPC2500. For bidiagonal SVD, double Divide and Conquer was proposed. It first computes singular values by a compact version of Divide and Conquer. the corresponding singular vectors are then computed by twisted factorization. the speed and accuracy of double Divide and Conquer are as good or even better than standard algorithms such as QR and the original Divide and Conquer. Moreover, it shows high scalability even on a PC cluster, distributed memory architecture. parallel algorithm of dDC and numerical results in some architectural options, matrix sizes and types on HPC2500, SMP cluster is shown.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Locality behavior of parallel and sequential algorithms for irregular graph problems

Locality behavior of parallel and sequential algorithms for ...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Cong, Guojing Wen, Tong IBM T.J. Watson Research Center Yorktown Heights NY 10598 United States

ISBN: (纸本)9780889867048

Large-scale graph problems are becoming increasingly important in science and engineering. the irregular, sparse instances are especially challenging to solve on cache-based architectures as they are known to incur erratic memory access patterns. Yet many of the algorithms also exhibit some degree of regularity with memory accesses. It is important to characterize the locality behavior in order to bridge the gap between algorithm and architecture. In our study we quantify the locality of several fundamental graph algorithms, both sequential and parallel, and correlate our observations with the algorithmic design. Our study of locality behavior brings insight into the impact of different cache architectures on the performance of both sequential and parallel graph algorithms.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

A new scalable and efficient parallel algorithm (PRACAL) for clustering large datasets

A new scalable and efficient parallel algorithm (PRACAL) for...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Salem, Sameh A. Nandi, Asoke K. Signal Processing and Communications Group Department of Electrical Engineering and Electronics University of Liverpool Brownlow Hill Liverpool L69 3GJ United Kingdom

ISBN: (纸本)9780889867048

Data clustering is a common technique for data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. Due to the continuous increase of datasets size and the intensive computation of clustering algorithms when used for analyzing large datasets, developing of efficient clustering algorithms is needed for processing time reduction. this paper describes the design and implementation of a recently developed clustering algorithm RACAL [1], which is a RAdius based Clustering ALgorithm. the proposed parallel algorithm (PRACAL) has the ability to cluster large datasets of high dimensions in a reasonable time, which leads to a higher performance computing.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A user-level extension scheme for a task-parallel script language

A user-level extension scheme for a task-parallel script lan...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Sakaguchi, Yusuke Ohno, Kazuhiko Sasaki, Takahiro Kondo, Toshio Nakashima, Hiroshi Department of Information Engineering Mie University 1577 Kurimamachiya-cho Tsu Mie 514-8507 Japan Academic Center for Computing and Media Studies Kyoto University Yoshida-Honmachi Sakyo-ku Kyoto 606-8501 Japan

ISBN: (纸本)9780889867048

We are developing a task parallel script language named MegaScript for mega-scale parallel processing. MegaScript regards sequential/parallel programs as tasks, and controls them for massively parallel execution. Although MegaScript programs require optimizations and extensions specific to the application and the computing environment, modifying the runtime system or task programs greatly reduces portability and reusability. To satisfy these conflicting requirements, we propose a user-level dynamic extension scheme named Adapter. In this scheme, the user defines a customization code and hooks to it a specific event. the runtime system calls back the code for the event locally, enabling it to extend or optimize system behavior without modifying the runtime or task programs. the results of our evaluation of the scheme show that the overhead and programming cost are both small enough for practical use.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive speculative locking protocol for distributed real-time database systems

Adaptive speculative locking protocol for distributed real-t...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Haque, Waqar Stokes, Paul R. University of Northern British Columbia 3333 University Way Prince George BC V2N 4Z9 Canada

ISBN: (纸本)9780889867048

Speculative Locking protocol (SL) is a concurrency control protocol that allows for parallel execution of conflicting transactions through a method of multilevel lending and versioning. the SL protocol shows performance improvements over the standard two-phase locking (2PL) protocol, but relies on several assumptions that would make it unsuitable in real-world scenarios. In this paper, we have proposed an adaptive speculative locking (ASL) protocol that improves performance of real-time distributed database systems by augmenting the SL protocol with four features: distributed real-time database system support;simultaneous multi-threading or page execution;control of transaction execution through transaction queue management;and restricting system memory through the use of virtual memory. the simulation results demonstrate the superiority of the ASL protocol over the SL protocols through the reduction of data contention caused by finite memory and the overall increase in transaction throughput.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

An improvement for the dynamic distributed double guided genetic algorithm for MAX-CSPs

An improvement for the dynamic distributed double guided gen...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Nisrine, Zaier Sadok, Bouamama Khaled, Ghedira SOIE Laboratory University of TUNIS Tunisia

ISBN: (纸本)9780889867048

this paper propose a new approach to improve the Dynamic distributed Double Guided Genetic Algorithm (D3G2A) dealing with Maximal Constraint Satisfaction Problems. Inspired by the NEO-DARWINISM theory and the nature laws, D3G2A consists in creating agents cooperating together to solve problems. In D3G2A, It was proved that the spent CPU time could be improved. the new approach Inspired by the D 3G2A for CSOP and ΣCSPs, will redistribute the load of species agents more equally in order to better the CPU time. this improvement allows not only reduction in species agent's number but also decrease communications agents cost. thus, a sub-population is composed of chromosomes violating a number of constraints in the same interval. In the present paper, the new approach is first described and then compared with the old one. Results of experimentations are analyzed and discussed.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

the impact of error in user-provided bandwidth estimates on multi-site parallel job scheduling performance

The impact of error in user-provided bandwidth estimates on ...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Jones, William M. Electrical and Computer Engineering Department United States Naval Academy Mail Stop 14B 105 Maryland Avenue Annapolis MD 21402-5025 United States

ISBN: (纸本)9780889867048

Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully mapping jobs across potentially many clusters, jobs that would otherwise wait in the queue for local cluster resources can begin execution much earlier;thereby improving system utilization and reducing average queue waiting time. Recent research in this area leverages user-provided estimates of job communication characteristics to effectively partition the job across cluster boundaries. In this paper, we address the impact of inaccuracies in these estimates on overall system performance. Furthermore, we demonstrate that multi-site job scheduling techniques benefit from these estimates, even in the presence of considerable inaccuracy.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Measuring causal propagation of overhead of inefficiencies in parallel applications

Measuring causal propagation of overhead of inefficiencies i...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Jafri, Hassan M. National Center for Supercomputing Applications University of Illinois Urbana-Champaign United States

ISBN: (纸本)9780889867048

parallel applications are notorious for their intractability to performance debugging. Automatic performance analysis techniques, such as those used by Kojak and KappaPI, are promising in alleviating the difficulty of discovering performance inefficiencies in parallel applications. However, as we show in this paper, the results produced by these tool can be potentially misleading and sometimes, outright incorrect. the reason is that the overhead due to performance inefficiencies originating at a certain point in the program can causally propagate and manifest itself at other points. Current techniques perform a flat analysis, i.e., they do not account for causal propagation. In this paper, we present a method of causal analysis that current analysis techniques can be retrofitted with to account for causal propagation of overhead to arrive at a more accurate description of performance bottlenecks. We also show various advantages rendered by this technique to improving the effectiveness of automatic performance analysis. In this paper, we only tackle overhead related to communication operations in MPI parallel application. In general, however, our technique can be used for non-communication related overhead for any parallel programming paradigm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Processor partitioning: An experimental performance analysis of parallel applications on SMP cluster systems

Processor partitioning: An experimental performance analysis...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Wu, Xingfu Taylor, Valerie Department of Computer Science Texas A and M University College Station TX 77843 United States

ISBN: (纸本)9780889867048

Currently, clusters of shared memory symmetric multiprocessors (SMPs) are one of the most common parallel computing systems, for which some existing environments have between 8 to 32 processors per node. Examples of such environments include some supercomputers: DataStar p655 (P655 and P655m) and P690 at the San Diego Supercomputing Center, and Seaborg and Bassi at the DOE National Energy Research Scientific computing Center. In this paper, we quantify the performance gap resulting from using different number of processors per node for application execution (for which we use the term processor partitioning), and conduct detailed performance experiments to identify the major application characteristics that affect processor partitioning. We use the STREAM memory benchmarks and Intel's MPI benchmarks to explore the performance impact of different application characteristics. the results are then utilized to explain the performance results of processor partitioning using three NAS parallel Application benchmarks. the experimental results indicate that processor partitioning can have a significant impact on performance of a parallel scientific application as determined by its communication and memory requirements.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：