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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Efficient parallel Block-Max WAND Algorithm

Efficient Parallel Block-Max WAND Algorithm

引用

19th international conference on Euro-Par

作者： Rojas, Oscar Gil-Costa, Veronica Marin, Mauricio Univ Santiago DIINF Santiago Chile Yahoo Labs Santiago Chile Univ San Luis CONICET San Luis Argentina

ISBN: (纸本)9783642400476

Large Web search engines are complex systems that solve thousands of user queries per second on clusters of dedicated distributed memory processors. Processing each query involves executing a number of operations to get the answer presented to the user. the most expensive operation in running time is the calculation of the top-k documents that best match each query. In this paper we propose the parallelization of a state of the art document ranking algorithm called Block-Max WAND. We propose a 2-steps parallelization of the WAND algorithm in order to reduce inter-processor communication and running time cost. Multi-threading tailored to Block-MaxWAND is also proposed to exploit multi-core parallelism in each processor. the experimental results show that the proposed parallelization reduces execution time significantly as compared against current approaches used in search engines.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

A Scalable Barotropic Mode Solver for the parallel Ocean Program

A Scalable Barotropic Mode Solver for the Parallel Ocean Pro...

引用

19th international conference on Euro-Par

作者： Hu, Yong Huang, Xiaomeng Wang, Xiaoge Fu, Haohuan Xu, Shizhen Ruan, Huabin Xue, Wei Yang, Guangwen Tsinghua Univ Ctr Earth Syst Sci Minist Educ Key Lab Earth Syst Modeling Beijing 100084 Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing Peoples R China

ISBN: (纸本)9783642400476

this paper represents a novel strategy to improve the scalability of the barotropic mode in the parallel Ocean Program (POP), by theoretically analyzing the barotropic communications bottleneck. POP discretizes the elliptic equations of the barotropic mode into a linear system Ax = b and solves it using the Preconditioned Conjugate Gradient (PCG) method. PCG scales poorly on distributed systems because of the time-consuming global reductions needed by the inner products in each iteration. A performance model is developed to quantify the scaling bottleneck of PCG. Based on this model, the classical Stiefel iteration (CSI), which was originally supposed to be less efficient than PCG, is identified as being promising for massive parallelism. In contrast to PCG, the recurrence parameters of CSI are determined by the spectrum of the coefficient matrix A instead of the inner product of the residuals in previous iterations. the Lanczos method is used to resolve the difficulty of estimating the eigenvalues of the large-scale matrix A. It constructs a small-scale tridiagonal matrix that has eigenvalues close to A. By replacing PCG with CSI, global reductions and their inherent poor scalability are eliminated in the barotropic mode. the implementation of CSI in POP with a 0.1 degree resolution can accerlate one barotropic step by five times, from 1.23s to 0.26s, on 15,000 cores.

关键词： Massive parallelism Preconditioned Conjugate Gradient Classical Stiefel Iteration parallel Ocean Program Barotropic Mode

来源：评论

学校读者我要写书评

暂无评论

Dynamic Agent Platform Discovery for Real-Time Resource Selection

Dynamic Agent Platform Discovery for Real-Time Resource Sele...

引用

IEEE international conference on Intelligent Engineering systems

作者： Z. Balogh E. Gatial L. Hluchy Institute of Informatics Slovak Academy of Sciences/Department of Parallel and Distributed Computing

ISBN: (纸本)9781479908271

In this paper we present a dynamic agent platform discovery system which is used for real-time resource selection during crisis situations. We present a motivating use case and we describe the implementation and design details of the proposed system. Comparison of invocation mechanisms of agents as a direct result of AP discovery is discussed. We also present a scenario on which the discovery mechanism was evaluated.

关键词： Agents systems comparison Platform CALLING(PROGRAMMING)

来源：评论

学校读者我要写书评

暂无评论

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

Proceedings of the 19th IASTED International Conference on P...

引用

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

the proceedings contain 84 papers. the topics discussed include: impact of NUMA effects on high-speed networking with multi-opteron machines;an ensemble method using hybrid real-coded genetic algorithm with pruning (HRGA/P R);P2P video broadcast based on per-peer transcoding and its evaluation on planetlab;dynamic modification of wireless multihop transmission route in message-by-message manner for shorter transmission delay;an efficient partitioning and scheduling algorithm for streaming applications on FPGA with resource constraint;associativity-based adaptive weighted clustering for large-scale mobile ad hoc networks;directional node-disjoint multipath routing in wireless ad hoc network;toward more parallel frequent itemset mining algorithms;schedulability of aperiodic tasks in hybrid process model;GRID-enabled ensemble subsurface modeling;and parallel double divide and conquer and its evaluation on a super computer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Load-sharing Architecture for High Performance Optimistic Simulations on Multi-core Machines

A Load-sharing Architecture for High Performance Optimistic ...

引用

19th international conference on High Performance computing (HiPC)

作者： Vitali, Roberto Pellegrini, Alessandro Quaglia, Francesco Univ Rome DIIAG Rome Italy

ISBN: (纸本)9781467323703;9781467323727

In parallel Discrete Event Simulation (PDES), the simulation model is partitioned into a set of distinct Logical Processes (LPs) which are allowed to concurrently execute simulation events. In this work we present an innovative approach to load-sharing on multi-core/multiprocessor machines, targeted at the optimistic PDES paradigm, where LPs are speculatively allowed to process simulation events with no preventive verification of causal consistency, and actual consistency violations (if any) are recovered via rollback techniques. In our approach, each simulation kernel instance, in charge of hosting and executing a specific set of LPs, runs a set of worker threads, which can be dynamically activated/deactivated on the basis of a distributed algorithm. the latter relies in turn on an analytical model that provides indications on how to reassign processor/core usage across the kernels in order to handle the simulation workload as efficiently as possible. We also present a real implementation of our load-sharing architecture within the ROme OpTimistic Simulator (ROOT-Sim), namely an open-source C-based simulation platform implemented according to the PDES paradigm and the optimistic synchronization approach. Experimental results for an assessment of the validity of our proposal are presented as well.

关键词： discrete event simulation distributed algorithms multiprocessing systems parallel architectures performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Towards Scalable Optimal Sequence Homology Detection

Towards Scalable Optimal Sequence Homology Detection

引用

19th international conference on High Performance computing (HiPC)

作者： Daily, Jeff Krishnamoorthy, Sriram Kalyanaraman, Ananth Pacific NW Natl Lab Richland WA 99352 USA

ISBN: (纸本)9781467323703;9781467323727

the field of bioinformatics and computational biology is experiencing a data revolution - experimental techniques to procure data have increased in throughput, improved in accuracy and reduced in costs. this has spurred an array of high profile sequencing and data generation projects. While the data repositories represent untapped reservoirs of rich information critical for scientific breakthroughs, the analytical software tools that are needed to analyze large volumes of such sequence data have significantly lagged behind in their capacity to scale. In this paper, we address homology detection, which is a fundamental problem in large-scale sequence analysis with numerous applications. We present a scalable framework to conduct large-scale optimal homology detection on massively parallel super-computing platforms. Our approach employs distributed memory work stealing to effectively parallelize optimal pairwise alignment computation tasks. Results on 120,000 cores of the Hopper Cray XE6 supercomputer demonstrate strong scaling and up to 2.42 x 10(7) optimal pairwise sequence alignments computed per second (PSAPS), the highest reported in the literature.

关键词： Cray computers DNA bioinformatics distributed memory systems mainframes parallel machines pattern recognition

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Scalable Performance of ScaleGraph for Large Scale Graph Analysis

Scalable Performance of ScaleGraph for Large Scale Graph Ana...

引用

19th international conference on High Performance computing (HiPC)

作者： Dayarathna, Miyuru Houngkaew, Charuwat Ogata, Hidefumi Suzumura, Toyotaro Tokyo Inst Technol Dept Comp Sci Tokyo Japan IBM Res Tokyo Japan

ISBN: (纸本)9781467323703;9781467323727

Scalable analysis of massive graphs has become a challenging issue in high performance computing environments. ScaleGraph is an X10 library aimed for large scale graph analysis scenarios. this paper evaluates scalability of ScaleGraph library for degree distribution calculation, betweeness centrality, and spectral clustering algorithms. We make scalability evaluation by analyzing a synthetic Kronecker graph with 40.3 million edges (for all the three algorithms), and a real social network with 69 million edges (for degree distribution calculation) on Tsubame 2.0 distributed memory environment.

关键词： X10 PGAS HPCS large graph analytics reusable libraries programming techniques distributed computing

来源：评论

学校读者我要写书评

暂无评论

Campaign Scheduling

Campaign Scheduling

引用

19th international conference on High Performance computing (HiPC)

作者： Pinheiro, Vinicius Rzadca, Krzysztof Trystram, Denis Univ Sao Paulo Lab Parallel & Distributed Comp BR-05508 Sao Paulo Brazil Univ Warsaw Inst Informat Warsaw Poland Inst Univ France Grenoble Inst Technol Paris France

ISBN: (纸本)9781467323703;9781467323727

We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. these submissions contain one or more jobs;the set of submissions are organized in successive campaigns. Jobs belonging to a single campaign are sequential and independent, but any job from a campaign cannot start until all the jobs from the previous campaign are completed. Each user's goal is to minimize the sum of flow times of his campaigns. We define a theoretical model for Campaign Scheduling and show that, in the general case, it is NP-hard. For the single-user case, we show that an rho-approximation scheduling algorithm for the (classic) parallel job scheduling problem is also an rho-approximation for the Campaign Scheduling problem. For the general case with k users, we establish a fairness criterion inspired by time sharing. We propose FAIRCAMP, a scheduling algorithm which uses campaign deadlines to achieve fairness among users between consecutive campaigns. We prove that FAIRCAMP increases the flow time of each user by a factor of at most k rho compared with a machine dedicated to the user. We also prove that FAIRCAMP is a rho-approximation algorithm for the maximum stretch. By simulation, we compare FAIRCAMP to the First-Come-First-Served (FCFS). We show that, compared with FCFS, FAIRCAMP reduces the maximum stretch by up to 3 : 4 times. the difference is significant in systems used by many (k > 5) users. Our results show that, rather than just individual, independent jobs, campaigns of jobs can be handled by the scheduler efficiently and fairly.

关键词： approximation theory computational complexity parallel processing scheduling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：