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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

564 篇 电子文献
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.

语言

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

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

共 564 条记录，以下是231-240 订阅

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

详细简洁

排序：

Migration algorithms for automated load balancing

Migration algorithms for automated load balancing

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Widell, Niklas Department of Communication Systems Lund University Box 118 SE-221 00 Lund Sweden

As distributed systems continue to evolve, automatic resource management is becoming more and more important. the resource management system must be able to dynamically handle large heterogeneous systems in a way that gives good performance and resource utilization. In the performance context, allocating software modules to nodes in an efficient way is of high interest. this paper considers the problem of allocating software modules to processing nodes in an automatic dynamic manner using module migration algorithms. the module allocation problem is NP-complete and many heuristics have been proposed. However, in systems where the workload changes over time, it may be infeasible to update module allocation often enough to handle changes in workload. this paper presents the Match-maker algorithm that performs load balancing by pairing overloaded nodes with under-loaded ones, initiating module migration within the pair. the paper presents a load balancing optimization problem, and uses the benchmark problem to evaluate the algorithm. In addition, the Match-maker algorithm is compared with other previously described algorithms for module migration. the Matchmaker algorithm is found to be fast and efficient in reducing load imbalance in distributed systems, especially for large systems.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Performance Prediction of distributed Applications Using Block Benchmarking Methods

Performance Prediction of Distributed Applications Using Blo...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Cornea, Bogdan Florin Bourgeois, Julien Univ Franche Comte LIFC 1 Cours Leprince Ringuet F-25201 Montbeliard France

ISBN: (纸本)9780769543284

An ongoing work is presented for accurately predicting the performance of distributed applications in heterogeneous systems. We are developing dPerf, a tool built using the Rose framework for performing static analysis and an automatic instrumentation on the input source code of programs written in C, C++ or Fortran. the accuracy in predicting program computation time resides in using hardware counters, as well as in applying two block benchmarking techniques that we propose in this paper. the current work makes use of a network simulator in order to calculate the communication time used in our approach. Afterwards, the computation and communication times are being summed up obtaining an estimation of the distributed application execution time. the approach is proven experimentally using NAS Integer Sort benchmark, the communications being simulated with SimGrid.

关键词： dPerf performance prediction block benchmarking static analysis trace-based simulation heterogeneous systems MPI P2PSAP

来源：评论

学校读者我要写书评

暂无评论

Visualization of Network Data Provenance

Visualization of Network Data Provenance

引用

19th international conference on High Performance computing (HiPC)

作者： Chen, Peng Plale, Beth Cheah, You-Wei Ghoshal, Devarshi Jensen, Scott Luo, Yuan Indiana Univ Sch Informat & Comp Bloomington IN 47405 USA

ISBN: (纸本)9781467323703;9781467323727

Visualization facilitates the understanding of scientific data both through exploration and explanation of the visualized data. Provenance also contributes to the understanding of data by containing the contributing factors behind a result. the visualization of provenance, although supported in existing workflow management systems, generally focuses on small (medium) sized provenance data, lacking techniques to deal with big data with high complexity. this paper discusses visualization techniques developed for exploration and explanation of provenance, including layout algorithm, visual style, graph abstraction techniques, and graph matching algorithm, to deal with the high complexity. We demonstrate through application to two extensively analyzed case studies that involved provenance capture and use over three year projects, the first involving provenance of a satellite imagery ingest processing pipeline and the other of provenance in a large-scale computer network testbed.

关键词： data visualisation distributed processing

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of a generic memetic algorithm for the edge bi-connectivity augmentation problem

Parallel implementation of a generic memetic algorithm for t...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Xhafa, Fatos Dept. LSI Univ. Politecnica de Catalunya Jordi Girona 1-3 08034 Barcelona Spain

In this paper we present an implementation of a generic memetic algorithm (MA) for the edge bi-connectivity augmentation problem (E2AUG). this problem is known for its applications to communication network design and in VLSI floor planning. Our starting point is a standard template for MA. We use a generic programming approach to obtain a C++ implementation of the MA template and instantiate it for the E2AUG problem. the implementation separates issues related to the memetic algorithm from those related to the E2AUG problem making thus possible (he reuse of the implementation for other problems. Moreover, the generic approach enabled us to easily implement the algorithm in parallel setting. We use known benchmarks in the literature for the problem to experimentally evaluate the implementation.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient determination of block size NB for parallel linpack test

Efficient determination of block size NB for parallel linpac...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Wenli, Zhang Jianping, Fan Mingyu, Chen Natl. Res. Ctr. Intelligent Comp. S. Institute of Computing Technology Chinese Academy of Sciences Graduate School Chinese Academy of Sciences NCIC P.O. Box 2704 Beijing China

HPL is a Linpack benchmark package widely used in massive cluster system performance test. Based on indepth analysis of the blocked parallel solution algorithm of linear algebra equations and HPL implementation mechanics, the restriction factors of the HPL peak performance are probed. the influence of main parameters P×Q and NB on computing performance in LU factorization process is discussed especially. theory analysis and experiment results indicate that, the efficiency factor, defined as the ratio of the matrix operation time and the amount of operations, is relevant to the matrix block size to a great extent, yet little correlate to the matrix size itself. According to this law, the author proposes to determine the block size NB of massively parallel test through scanning the operation efficiency of proper small-scale matrix. thus it improves the status getting NB through trial-and-error experiment without definite aim. the author's idea has been verified by the real test results, as well as been applicable to the matrix parallel operations of other courses.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for disjoint paths in star networks

A distributed algorithm for disjoint paths in star networks

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Hamad, Ahmad Karaata, Mehmet Hakan Department of Computer Engineering Kuwait University P.O. Box 5969 Safat 13060 Kuwait

ISBN: (纸本)9780889867741

A stabilizing system guarantees that, regardless of the current configuration, the system reaches a legal configuration in a bounded number of steps and the system configuration remains legal thereafter. Whereas, a stabilizing system that maintains no explicit variables in the processes of the system is referred to as an inherently stabilizing system, and hence all system states are legal by construction. Due to this attribute, inherently stabilizing systems are immune to transient faults and do not experience any delay due arbitrary system initialization. We view a fault that perturbs the system configuration but not the program as transient fault. Due to these features, inherently stabilizing distributed protocols for peer-to-peer, sensor and mobile networks are desirable. Hypercube, star networks and their variations that provide an increased degree of scalability have been initially design for parallel networks. However, their scalability and the presence of multiple disjoint paths in these topologies make them viable alternatives to existing peer-to-peer and sensor networks topologies. In this paper, we proposed an inherently stabilizing algorithm for delivering messages over all node-disjoint paths from a process to another in star networks. the proposed algorithm has numerous applications including VLSI layout, reliable networks routing, secure message transmission, and network survivability. the proposed routing algorithm is optimal with respect to its state space and lengths of the node-disjoint paths.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

NR-MPI: a Non-stop and Fault Resilient MPI

NR-MPI: a Non-stop and Fault Resilient MPI<...

引用

19th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Suo, Guang Lu, Yutong Liao, Xiangke Xie, Min Cao, Hongjia Natl Univ Def Technol State Key Lab High Performance Comp Changsha Hunan Peoples R China Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781479920815

Fault resilience has became a major issue for HPC systems, in particular in the perspective of future E-scale systems, which will consist of millions of CPU cores and other components. Fault tolerant MPI was proposed to offer support of software level fault tolerance approaches. However, the widely used MPI implementations, such as MPICH and Mvapich2, provide limited support for fault tolerance. this paper proposes NR-MPI, a Non-stop and Fault Resilient MPI. NR-MPI implements the semantics of FT-MPI based on MPICH. Specifically, this paper focuses on failure detection in MPI library, online failure recovery of communicators for multiple failures, friendly programming interface extending for NR-MPI. Furthermore, to support failure recovery of applications, NR-MPI implements data backup and restore interfaces based on double in-memory checkpoint/restart. We conduct experiments with NPB benchmarks on th-1A supercomputer. Experimental results show that NR-MPI based fault tolerant programs can recover from failures online without restarting, and the overhead is small even for applications with tens of thousands of cores.

关键词： message passing interface fault tolerant MPI NR-MPI Application-level Checkpoint/Restart

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerant parallel Data-Intensive Algorithms

Fault Tolerant Parallel Data-Intensive Algorithms

引用

19th international conference on High Performance computing (HiPC)

作者： Kutlu, Mucahid Agrawal, Gagan Kurt, Oguz Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Ohio State Univ Dept Math Columbus OH 43210 USA

ISBN: (纸本)9781467323703;9781467323727

Fault-tolerance is rapidly becoming a crucial issue in high-end and distributed computing, as increasing number of cores are decreasing the mean-time to failure of the systems. While checkpointing, including checkpointing of parallel programs like MPI applications, provides a general solution, the overhead of this approach is becoming increasingly unacceptable. thus, algorithm-based fault-tolerance provides a nice practical alternative, though it is less general. Although this approach has been studied for many applications, there is no existing work for algorithm-based fault-tolerance for the growing class of data-intensive parallel applications. In this paper, we present an algorithm-based fault tolerance solution that handles fail-stop failures for a class of data intensive algorithms. We divide the dataset into smaller data blocks and in replication step, we distribute the replicated blocks with the aim of keeping the maximum data intersection between any two processors minimum. this allows us to have minimum data loss when multiple failures occur. In addition, our approach enables better load balance after failure, and decreases the amount of re-processing of the lost data. We have evaluated our approach by using two popular parallel data mining algorithms, which are k-means and apriori. We show that our approach has negligible overhead when there are no failures, and allows us to gracefully handle different number of failures, and failures at different points of processing. We also provide the comparison of our approach with the MapReduce based solution for fault tolerance, and show that we outperform Hadoop both in absence and presence of failures.

关键词： checkpointing data mining message passing parallel processing software fault tolerance

来源：评论

学校读者我要写书评

暂无评论

HERA: A reconfigurable and mixed-mode parallel computing engine on platform FPGAs

HERA: A reconfigurable and mixed-mode parallel computing eng...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Wang, Xiaofang Ziavras, Sotirios G. Department of Electrical Engineering New Jersey Institute of Technology Newark NJ 07102 United States

the high price, long design and development cycles, programming difficulty and high maintenance cost of supercomputers limit their range of potential applications. Recent advances in Field-Programmable Gate Arrays (FPGAs) have made feasible the development of high-performance and programmable parallel systems on a programmable chip (PSOPC). PSOPC's yield high-performance at low cost for many parallel applications. We present in this paper the design and implementation of our HERA (HEterogeneous Reconfigurable Architecture) machine that employs FPGAs to allow the simultaneous execution of a variety of parallel processing modes, including SIMD (Single-Instruction, Multiple-Data), MIMD (Multiple-Instruction, Multiple-Data) and M-SIMD (Multiple-SIMD). the processing element is centered on a single-precision IEEE 754 floating-point unit (FPU) and employs a 7-stage pipeline. To demonstrate the robustness and viability of our approach, we propose a data partitioning scheme and employ mixed-mode scheduling for Cannon's matrix-matrix multiplication algorithm with matrices of arbitrary size and shape. Performance results on our 64-PE machine that employs a dual-FPGA system are better than the optimized performance on a dual-Xeon PC.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling in distributed heterogeneous systems with dependent tasks & imprecise execution time estimates

Dynamic scheduling in distributed heterogeneous systems with...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Boyer, Wayne F. Hura, Gurdeep S. Idaho Natl. Eng. and Environ. Lab. 2525 N. Freemont Idaho Falls ID 83415-5224 Comp. Sci. and Computer Engineering University of Idaho Idaho Falls ID 83402

Two new algorithms are proposed for scheduling tasks in heterogeneous distributed systems where tasks may have arbitrary dependencies and estimates of execution time are imperfect. A new Dynamic Adaptive Random Scheduler (DARS) algorithm is proposed. DARS uses a randomized ordering technique to search for a near optimum schedule while monitoring the status of each previously dispatched task such that tasks are migrated according to the current estimates of task execution time. A proposed new Load Balancing (LB) algorithm distributes tasks initially by a heuristic that accounts for heterogeneity and dependencies, and while tasks are executing it migrates tasks to rebalance the load whenever a host becomes idle such that the number of migrations is minimized and each migration accounts for dependencies. the algorithms were evaluated by simulation of various scenarios and for various levels of uncertainty in execution time estimated values. the best algorithm is highly dependent on the nature of the load and the level of uncertainty in the execution time estimates.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：