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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

1,711 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
86 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,674 篇 英文
33 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1711 条记录，以下是721-730 订阅

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

详细简洁

排序：

HierKNEM: An Adaptive Framework for Kernel-Assisted and Topology-Aware Collective Communications on Many-core Clusters

HierKNEM: An Adaptive Framework for Kernel-Assisted and Topo...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Teng Ma George Bosilca Aurelien Bouteiller Jack Dongarra EECS University of Tennessee Knoxville TN USA University of Manchester Institute of Science and Technology Manchester UK Oak Ridge National Laboratory University of Tennessee Oak Ridge TN USA

Multicore Clusters, which have become the most prominent form of High Performance Computing (HPC) systems, challenge the performance of MPI applications with non uniform memory accesses and shared cache hierarchies. Recent advances in MPI collective communications have alleviated the performance issue exposed by deep memory hierarchies by carefully considering the mapping between the collective topology and the core distance, as well as the use of single-copy kernel assisted mechanisms. However, on distributed environments, a single level approach cannot encompass the extreme variations not only in bandwidth and latency capabilities, but also in the aptitude to support duplex communications or operate multiple concurrent copies simultaneously. This calls for a collaborative approach between multiple layers of collective algorithms, dedicating to extracting the maximum degree of parallelism from the collective algorithm by consolidating the intra- and inter-node communications. In this work, we present Hier KNEM a kernel-assisted topology-aware collective framework, and how this framework orchestrates the collaboration between multiple layers of collective algorithms. The resulting scheme enables perfect overlap of intra- and inter-node communications. We demonstrated experimentally, by considering three of the most used collective operations (Broadcast, All gather and Reduction), that 1) this approach is immune to modifications of the underlying process-core binding, 2) it outperforms state-of-art MPI libraries (Open MPI, MPICH2 and MVAPICH2) demonstrating up to a 30x speedup for synthetic benchmarks, and up to a 3x acceleration for a parallel graph application (ASP), 3) it furthermore demonstrates a linear speedup with the increase of the number of cores per node, a paramount requirement for scalability on future many-core hardware.

关键词： Clustering algorithms Multicore processing Bandwidth Lead Topology Hardware Libraries

来源：评论

学校读者我要写书评

暂无评论

Low-Cost parallel Algorithms for 2:1 Octree Balance

Low-Cost Parallel Algorithms for 2:1 Octree Balance

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Tobin Isaac Carsten Burstedde Omar Ghattas Institute for Computational Engineering and Sciences (ICES) University of Texas Austin USA Institut für Numerische Simulation (INS) Rheinische Friedrich-Wilhelms-Universität Germany Institute for Computational Engineering and Sciences (ICES) Jackson School of Geosciences Department of Mechanical Engineering University of Texas Austin USA

The logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. The 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2:1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the opensource “p4est” software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 × 10 11 octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.

关键词： Octrees Partitioning algorithms Arrays Vegetation Insulation Educational institutions USA Councils

来源：评论

学校读者我要写书评

暂无评论

Miss-Correlation Folding: Encoding Per-Block Miss Correlations in Compressed DRAM for Data Prefetching

Miss-Correlation Folding: Encoding Per-Block Miss Correlatio...

引用

IEEE international parallel & distributed processing symposium

作者： Gang Liu Jih-Kwon Peir Victor Lee Department of Computer & Information Science & Eng University of Florida Gainesville FL USA Parallel Computing Lab Intel Labs Intel Corporation Santa Clara CA USA

ISBN: (纸本)9781467309752

Cache misses frequently exhibit repeated streaming behavior, i.e. a sequence of cache misses has a high tendency of being repeated. Correlation-based prefetchers record the missing streams in a history table for accurate prefetching. Saving a large miss history in off-chip DRAM is a practical implementation, but incurs access latency and consumes memory bandwidth which leads to performance degradation. In this paper, we investigate a new data prefetching mechanism based on per-block miss correlation where a miss is correlated with an earlier miss when the two misses are closely encountered both in time and space. The miss correlations are captured dynamically and saved along with the content of the data block using a simple data compression technique. As a result of this novel combination, our scheme provides unbounded correlation history and its prefetch metadata can be fetched together with demand data without incurring additional latency nor consuming any memory bandwidth. Performance evaluations using data-parallel applications demonstrate that prefetchers based on per-block miss correlations can improve IPC by 42-139% with an average of 88% compared to the IPC without prefetching. In comparison with regular stream prefetcher, sampled temporal streaming prefetcher and spatial-temporal memory streaming prefetcher, up to 115%, 99% and 98% IPC improvement can be obtained with an average about 36%, 26% and 27% respectively.

关键词： prefetch data parallel miss correlation compress cache temporal spatial

来源：评论

学校读者我要写书评

暂无评论

Detecting and using document structure in scientific text 12

Detecting and using document structure in scientific text

引用

Proceedings of the 2nd ACM SIGHIT international Health Informatics symposium

作者： Anita de Waard Sophia Ananiadou Maryann Martone Ágnes Sándor Hagit Shatkay Elsevier Labs Burlington VT USA University of Manchester Manchester United Kingdom University of California at San Diego San Diego CA USA Xerox Europe Grenoble France University of Delaware Newark DE USA

ISBN: (纸本)9781450307819

The detection of discourse structure of scientific documents is important for a number of tasks, including biocuration efforts, text summarisation, and the creation of improved formats for scientific publishing. Currently, many parallel efforts exist to detect a range of discourse elements at different levels of granularity, and for different purposes, including extraction of information from complex documents, alignment of parallel corpora across languages, and support for document summarization (particularly multi-document summarization). Another interesting class of applications comes from "bibliometrics" and "scientometrics". For example, for analysis of argument structure in full text articles from the scientific literature, it may be important to know where a particular reference is cited or where a particular statement is made (Background, Discussion, etc.). Another application might include tracking over time where (in what sections) an entity or concept is mentioned, to determine whether the mentions migrate from research claims into the "Background" or eventually to the "Methods" sections of articles, as the concept moves from "foreground" (subject of the research) to "background". In this panel we would like to, explore compare, contrast and evaluate different scientific discourse annotation schemes and tools, in order to answer questions such as: What motivates a certain level, method, viewpoint for annotating scientific text?What is the annotation level for a unit of argumentation: an event, a sentence, a segment? What are advantages and disadvantages of all three?How easily can different schemes to be applied to texts? Are they easily trainable?Which schemes are most portable? Can they be applied to both full papers and abstracts? Can they be applied to texts in different domains?How granular should annotation schemes be? What are the advantages/disadvantages of fine and coarse grained annotation categories?What correlations occur among document struct

关键词： natural language processing document structure scientific discourse annotation

来源：评论

学校读者我要写书评

暂无评论

MapReduce'11 - Proceedings of the 2nd international Workshop on MapReduce and Its applications

MapReduce'11 - Proceedings of the 2nd International Workshop...

引用

2nd international Workshop on MapReduce and Its applications, MapReduce'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed Computing, HPDC 2011

ISBN: (纸本)9781450307000

The proceedings contain 9 papers. The topics discussed include: Otus: resource attribution in data-intensive clusters;Phoenix++: modular MapReduce for shared-memory systems;static type checking of hadoop MapReduce programs;exploring MapReduce efficiency with highly-distributed data;parallelizing large-scale data processing applications with data skew: a case study in product-offer matching;tall and skinny QR factorizations in MapReduce architectures;rapid parallel genome indexing with MapReduce;full-text indexing for optimizing selection operations in large-scale data analytics;MapReducing a genomic sequencing workflow;and future of MapReduce for scientific computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallelizing large-scale data processing applications with data skew: A case study in product-offer matching

Parallelizing large-scale data processing applications with ...

引用

2nd international Workshop on MapReduce and Its applications, MapReduce'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed Computing, HPDC 2011

作者： Gonina, Ekaterina Kannan, Anitha Shafer, John Budiu, Mihai University of California Berkeley Berkeley CA United States Microsoft Research Mountain View CA United States

ISBN: (纸本)9781450307000

The last decade has seen a surge of interest in large-scale data-parallel processing engines. While these engines share many features in common with parallel databases, they make a set of different trade-offs. In consequence many of the lessons learned for programming parallel databases have to be re-learned in the new environment. In this paper we show a case study of parallelizing an example large-scale application (offer matching, a core part of online shopping) on an example MapReduce-based distributed computation engine (DryadLINQ). We focus on the challenges raised by the nature of large data sets and data skew and show how they can be addressed effectively within this computation framework by optimizing the computation to adapt to the nature of the data. In particular we describe three different strategies for performing distributed joins and show how the platform language allows us to implement optimization strategies at the application level, without system support. We show that this flexibility in the programming model allows for a highly effective system, providing a measured speedup of more than 100 on 64 machines (256 cores), and an estimated speedup of 200 on 1280 machines (5120 cores)of matching 4 million offers. © 2011 ACM.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Adaptive rate stream processing for smart grid applications on clouds

Adaptive rate stream processing for smart grid applications ...

引用

2nd international Workshop on Scientific Cloud Computing, ScienceCloud'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed Computing, HPDC 2011

作者： Simmhan, Yogesh Cao, Baohua Giakkoupis, Michail Prasanna, Viktor K. University of Southern California Los Angeles CA 90089 United States

ISBN: (纸本)9781450306997

Pervasive smart meters that continuously measure power usage by consumers within a smart (power) grid are providing utilities and power systems researchers with unprecedented volumes of information through streams that need to be processed and analyzed in near realtime. We introduce the use of Cloud platforms to perform scalable, latency sensitive stream processing for eEngineering applications in the smart grid domain. One unique aspect of our work is the use of adaptive rate control to throttle the rate of generation of power events by smart meters, which meets accuracy requirements of smart grid applications while consuming 50% lesser bandwidth resources in the Cloud. © 2011 ACM.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

ScienceCloud'11 - Proceedings of the 2nd international Workshop on Scientific Cloud Computing

ScienceCloud'11 - Proceedings of the 2nd International Works...

引用

2nd international Workshop on Scientific Cloud Computing, ScienceCloud'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed Computing, HPDC 2011

ISBN: (纸本)9781450306997

The proceedings contain 8 papers. The topics discussed include: the case for being lazy: how to leverage lazy evaluation in MapReduce;cloud resource usage - extreme distributions invalidating traditional capacity planning models;experiences using cloud computing for a scientific workflow application;adaptive rate stream processing for smart grid applications on clouds;an automated approach to cloud storage service selection;Neptune: a domain specific language for deploying HPC software on cloud platforms;Magellan: experiences from a science cloud;and Cumulus: an open source storage cloud for science.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring MapReduce efficiency with highly-distributed data

Exploring MapReduce efficiency with highly-distributed data

引用

2nd international Workshop on MapReduce and Its applications, MapReduce'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed Computing, HPDC 2011

作者： Cardosa, Michael Wang, Chenyu Nangia, Anshuman Chandra, Abhishek Weissman, Jon University of Minnesota Minneapolis MN United States

ISBN: (纸本)9781450307000

MapReduce is a highly-popular paradigm for high-performance computing over large data sets in large-scale platforms. However, when the source data is widely distributed and the computing platform is also distributed, e.g. data is collected in separate data center locations, the most efficient architecture for running Hadoop jobs over the entire data set becomes non-trivial. In this paper, we show the traditional single-cluster MapReduce setup may not be suitable for situations when data and compute resources are widely distributed. Further, we provide recommendations for alternative (and even hierarchical) distributed MapReduce setup configurations, depending on the workload and data set. © 2011 ACM.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

ECMLS'11 - Proceedings of the 2nd international Workshop on Emerging Computational Methods for the Life Sciences

ECMLS'11 - Proceedings of the 2nd International Workshop on ...

引用

2nd international Workshop on Emerging Computational Methods for the Life Sciences, ECMLS'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed Computing, HPDC 2011

ISBN: (纸本)9781450307024

The proceedings contain 5 papers. The topics discussed include: a parallel random forest classifier for R;adapting bioinformatics applications for heterogeneous systems: a case study;a hierarchical framework for cross-domain MapReduce execution;characterizing deep sequencing analytics using BFAST: towards a scalable distributed architecture for next-generation sequencing data;and high-throughput virtual molecular docking: hadoop implementation of autodock4 on a private cloud.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：