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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

31 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

26 篇 工学
- 25 篇 计算机科学与技术...
- 19 篇 软件工程
- 2 篇 机械工程
- 2 篇 控制科学与工程
- 2 篇 生物医学工程（可授...
- 1 篇 光学工程
- 1 篇 信息与通信工程
- 1 篇 纺织科学与工程
- 1 篇 生物工程
6 篇 理学
- 2 篇 数学
- 2 篇 生物学
- 2 篇 系统科学
- 1 篇 化学
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

8 篇 parallel program...
3 篇 data mining
2 篇 object oriented ...
2 篇 message passing
2 篇 dynamic programm...
1 篇 computer science
1 篇 openshmem
1 篇 telco capability
1 篇 compilers
1 篇 reliability
1 篇 parallel process...
1 篇 hierarchical lin...
1 篇 orchestration
1 篇 shared-memory pr...
1 篇 long-running tra...
1 篇 composite servic...
1 篇 mpi
1 篇 it-based interfa...
1 篇 concurrent compu...
1 篇 programming

机构

1 篇 providence univ ...
1 篇 faculty of infor...
1 篇 pacific nw natl ...
1 篇 department of co...
1 篇 school of mathem...
1 篇 department of ps...
1 篇 jülich supercomp...
1 篇 imperial college...
1 篇 riken advanced i...
1 篇 rwth aachen lehr...
1 篇 c. and o. vogt i...
1 篇 clearspeed techn...
1 篇 university of er...
1 篇 univ houston dep...
1 篇 hpc usability re...
1 篇 lri cnrs univ. p...
1 篇 76131 karlsruhe
1 篇 department of ma...
1 篇 univ amsterdam i...
1 篇 simulation labor...

作者

2 篇 hamidouche khale...
1 篇 gaster benedict ...
1 篇 kyu-baek hwang
1 篇 yan shoumeng
1 篇 shafarenko alex
1 篇 renaux thierry
1 篇 lippert thomas
1 篇 chen hu
1 篇 maresca massimo
1 篇 scholz sven-bodo
1 篇 deumens erik
1 篇 weng tien-hsiung
1 篇 luo sai
1 篇 tichy walter f.
1 篇 ponton mark
1 篇 roback joseph a.
1 篇 jenista james c.
1 篇 nather ruediger
1 篇 lin jian
1 篇 xiaoli zou

语言

34 篇 英文

检索条件"任意字段=2nd Workshop on Parallel Programming Patterns, ParaPLoP 2010"

共 34 条记录，以下是1-10 订阅

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

详细简洁

排序：

Futures for Dynamic Dependencies - parallelizing the H-LU Factorization 2nd

Futures for Dynamic Dependencies - Parallelizing the H-LU Fa...

引用

2nd International workshop on Asynchronous Many-Task Systems and Applications (WAMTA)

作者： Nather, Ruediger Fohry, Claudia Univ Kassel Dept Elect Engn & Comp Sci Kassel Hessen Germany

ISBN: (纸本)9783031617621;9783031617638

The LU factorization of hierarchical matrices (H-matrices) is a challenging problem for efficient parallelization, due to complex dependency patterns. Previous research suggested the usage of tasks, but existing task-based algorithms still need a preprocessing step to prepare information about the matrix structure. In consequence, this structure must not change afterwards. This paper proposes a novel algorithm that eliminates the need for preprocessing. Its core idea is usage of the future construct. A particularly expressive type of future is needed that is not yet supported by current AMT runtime systems. This paper defines the type and shows that it promotes a clear and concise way to program parallel H-LU factorization.

关键词： Futures Task-parallel programming Dynamic Task-level Dependencies Hierarchical Linear Algebra LU Factorization

来源：评论

学校读者我要写书评

暂无评论

Workflows for ultra-high resolution 3D models of the human brain on massively parallel supercomputers 1

引用

2nd International workshop on Brain-Inspired Computing, BrainComp 2015

作者： Mohlberg, Hartmut Tweddell, Bastian Lippert, Thomas Amunts, Katrin Research Centre Juelich and JARA-Brain Jülich52428 Germany IAS and JARA-HPC Research Centre Juelich Jülich52428 Germany C. and O. Vogt Institute of Brain Research Heinrich-Heine University Düsseldorf40225 Germany

ISBN: (数字)9783319508627

ISBN: (纸本)9783319508610

Human brain atlases [1] are indispensable tools to achieve a better understanding of the multilevel organization of the brain through integrating and analyzing data from different brains, sources, and modalities while considering the functionally relevant topography of the brain [4]. The spatial resolution of most of these electronic atlases is in the range of millimeters, which does not allow the integration of the information at the level of cortical layers, columns, microcircuits or cells. Therefore, we introduced in 2013 the first BigBrain data set with a resolution of 20 μm isotropic. This data set allows to specify morphometric parameters of human brain organization, which serve as a "gold standard" for neuroimaging data obtained at a lower spatial resolution. It provides, in addition, an essential basis for realistic brain models concerning structural analysis and simulation [2]. For the generation of other, even higherresolution data sets of the human brain, we developed an improved and more efficient data processing workflow employing high performance computing to 3D reconstruct histological data sets. To facilitate the analysis of intersubject variability on a microscopic level, the new processing framework was applied for reconstructing a second BigBrain data set with 7676 sections. Efficient data processing of a large amount of data sets with a complex nested reconstruction workflow using large number of compute nodes required optimized distributed processing workflows as well as parallel programming. A detailed documentation of the processing steps and the complex inter-dependencies of the data sets at each level of the multistep reconstruction workflow was essential to enable transformations to images of the same histological sections obtained with even higher spatial *** have addressed these challenges, and achieved efficient high throughput processing of thousands of images of histological sections in combination with sufficient flexibility

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

An empirical study on parallelism in modern open-source projects 2015

An empirical study on parallelism in modern open-source proj...

引用

2nd International workshop on Software Engineering for parallel Systems, SEPS 2015

作者： Kiefer, Marc Warzel, Daniel Tichy, Walter F. Karlsruhe Institute of Technology Germany

ISBN: (纸本)9781450339100

Writing parallel programs is hard, especially for inexperienced programmers. parallel language features are still being added on a regular basis to most modern object-oriented languages and this trend is likely to continue. Being able to support developers with tools for writing and optimizing parallel programs requires a deep understanding of how programmers approach and implement parallelism. We present an empirical study of 135 parallel opensource projects in Java, C# and C++ ranging from small (2M lines of code) codebases. We examine the projects to find out how language features, synchronization mechanisms, parallel data structures and libraries are used by developers to express parallelism. We also determine which common parallel patterns are used and how the implemented solutions compare to typical textbook advice. The results show that similar parallel constructs are used equally often across languages, but usage also heavily depends on how easy to use a certain language feature is. patterns that do not map well to a language are much rarer compared to other languages. Bad practices are prevalent in hobby projects but also occur in larger projects. © 2015 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Including gap junctions into distributed neuronal network simulations 1

引用

2nd International workshop on Brain-Inspired Computing, BrainComp 2015

作者： Hahne, Jan Helias, Moritz Kunkel, Susanne Igarashi, Jun Kitayama, Itaru Wylie, Brian Bolten, Matthias Frommer, Andreas Diesmann, Markus School of Mathematics and Natural Sciences University of Wuppertal Wuppertal Germany and JARA BRAIN Institute I Jülich Research Centre Jülich Germany RIKEN Advanced Institute for Computational Science Programming Environment Research Team Kobe Japan Department of Computational Science and Technology School of Computer Science and Communication KTH Royal Institute of Technology Stockholm Sweden Simulation Laboratory Neuroscience Bernstein Facility for Simulation and Database Technology Institute for Advanced Simulation Jülich Aachen Research Alliance Jülich Research Centre Jülich Germany Okinawa Institute of Science and Technology Neural Computation Unit Okinawa Japan Laboratory for Neural Circuit Theory RIKEN Brain Science Institute Wako Japan HPC Usability Research Team RIKEN Advanced Institute for Computational Science Kobe Japan Jülich Supercomputing Centre Jülich Research Centre Jülich Germany Institut für Mathematik Universität Kassel Kassel Germany Department of Psychiatry Psychotherapy and Psychosomatics Medical Faculty RWTH Aachen University Aachen Germany Department of Physics Faculty 1 RWTH Aachen University Aachen Germany

ISBN: (数字)9783319508627

ISBN: (纸本)9783319508610

Contemporary simulation technology for neuronal networks enables the simulation of brain-scale networks using neuron models with a single or a few compartments. However, distributed simulations at full cell density are still lacking the electrical coupling between cells via so called gap junctions. This is due to the absence of efficient algorithms to simulate gap junctions on large parallel computers. The difficulty is that gap junctions require an instantaneous interaction between the coupled neurons, whereas the efficiency of simulation codes for spiking neurons relies on delayed communication. In a recent paper [15] we describe a technology to overcome this obstacle. Here, we give an overview of the challenges to include gap junctions into a distributed simulation scheme for neuronal networks and present an implementation of the new technology available in the NEural Simulation Tool (NEST 2.10.0). Subsequently we introduce the usage of gap junctions in model scripts as well as benchmarks assessing the performance and overhead of the technology on the supercomputers JUQUEEN and K computer. © Springer International Publishing AG 2016.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Compiled Plans for In-Memory Path-Counting Queries 2

Compiled Plans for In-Memory Path-Counting Queries

引用

2nd International workshop on In Memory Data Management and Analysis (IMDM)

作者： Myers, Brandon Hyrkas, Jeremy Halperin, Daniel Howe, Bill Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)9783319139609;9783319139593

Dissatisfaction with relational databases for large-scale graph processing has motivated a new class of graph databases that offer fast graph processing but sacrifice the ability to express basic relational idioms. However, we hypothesize that the performance benefits amount to implementation details, not a fundamental limitation of the relational model. To evaluate this hypothesis, we are exploring code-generation to produce fast in-memory algorithms and data structures for graph patterns that are inaccessible to conventional relational optimizers. In this paper, we present preliminary results for this approach on path-counting queries, which includes triangle counting as a special case. We compile Datalog queries into main-memory pipelined hash-join plans in C++, and show that the resulting programs easily outperform Post-greSQL on real graphs with different degrees of skew. We then produce analogous parallel programs for Grappa, a runtime system for distributed memory architectures. Grappa is a good target for building a parallel query system as its shared memory programming model and communication mechanisms provide productivity and performance when building communication-intensive applications. Our experiments suggest that Grappa programs using hash joins have competitive performance with queries executed on a commercial parallel database. We find preliminary evidence that a code generation approach simplifies the design of a query engine for graph analysis and improves performance over conventional relational databases.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Accelerating k-NN Algorithm with Hybrid MPI and OpenSHMEM 2nd

Accelerating <i>k</i>-NN Algorithm with Hybrid MPI and OpenS...

引用

2nd workshop OpenSHMEM and Related Technologies

作者： Lin, Jian Hamidouche, Khaled Zhang, Jie Lu, Xiaoyi Vishnu, Abhinav Panda, Dhabaleswar Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Pacific NW Natl Lab Richland WA 99352 USA

ISBN: (纸本)9783319264288;9783319264271

Machine learning algorithms are benefiting from the continuous improvement of programming models, including MPI, MapReduce and PGAS. k-Nearest Neighbors (k-NN) algorithm is a widely used machine learning algorithm, applied to supervised learning tasks such as classification. Several parallel implementations of k-NN have been proposed in the literature and practice. However, on high-performance computing systems with high-speed interconnects, it is important to further accelerate existing designs of the k-NN algorithm through taking advantage of scalable programming models. To improve the performance of k-NN on large-scale environment with InfiniBand network, this paper proposes several alternative hybrid MPI+OpenSHMEM designs and performs a systemic evaluation and analysis on typical workloads. The hybrid designs leverage the one-sided memory access to better overlap communication with computation than the existing pureMPI design, and propose better schemes for efficient buffer management. The implementation based on k-NN program from MaTEx toolkit with MVAPICH2-X (Unified MPI+ PGAS Communication Runtime over InfiniBand) shows up to 9.0% time reduction for training KDD Cup 2010 workload over 512 cores, and 27.6% time reduction for small workload with balanced communication and computation. Experiments of running with varied number of cores show that our design can maintain good scalability.

关键词： MPI OpenSHMEM Hybrid programming model Algorithm acceleration

来源：评论

学校读者我要写书评

暂无评论

paraplop 2010 - 2nd workshop on parallel programming patterns, Proceedings

ParaPLoP 2010 - 2nd Workshop on Parallel Programming Pattern...

引用

2nd workshop on parallel programming patterns, paraplop 2010

ISBN: (纸本)9781605588735

The proceedings contain 15 papers. The topics discussed include: follow the data: concurrent execution pattern;patterns for cache optimizations on multi-processor machines;a pattern for efficient parallel computation on multicore processors with scalar operand networks;ghost cell pattern;three layer cake for shared-memory programming;patterns of optimized loops;concurrent evaluation of a directed acylic graph;the task graph pattern;a design pattern language for engineering (parallel) software: merging the PLPP and OPL projects;parallel sorting pattern;mechanisms that separate algorithms from implementations for parallel patterns;towards using and improving the NAS parallel benchmarks: a parallel patterns approach;a pattern language for parallelizing irregular algorithms;and monte carlo methods: a computational pattern for our pattern language.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Direct out-of-memory distributed parallel frequent pattern mining

Direct out-of-memory distributed parallel frequent pattern m...

引用

2nd Int. workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, programming Models and Applications, BigMine 2013 - Held in Conj. with SIGKDD 2013 Conf.

作者： Rong, Zheyi De Knijf, Jeroen Department of Math. and Computer Science TU Eindhoven Netherlands

ISBN: (纸本)9781450323246

Frequent itemset mining is a well studied and important problem in the datamining community. An abundance of different mining algorithms exists, all with different flavor and characteristics, but almost all suffer from two major shortcomings. First, in general frequent itemset mining algorithms perform exhaustive search over a huge pattern space. Second, most algorithms assume that the input data fits into main memory. The first problem was recently tackled in the work of [2], by direct sampling the required number of patterns over the pattern space. This paper extends the direct sampling approach by casting the algorithm into the MapReduce framework, effectively ceasing the memory requirements that the data should fit into main memory. The results show that the algorithm scales well for large data sets, while the memory requirements are solely dependent on the required number of patterns in the output.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Proceedings of 2nd International workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, programming Models and Applications, BigMine 2013 - Held in Conjunction with SIGKDD 2013 Conference

Proceedings of 2nd International Workshop on Big Data, Strea...

引用

2nd Int. workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, programming Models and Applications, BigMine 2013 - Held in Conj. with SIGKDD 2013 Conf.

ISBN: (纸本)9781450323246

The proceedings contain 14 papers. The topics discussed include: soft-CsGDT: soft cost-sensitive Gaussian decision tree for cost-sensitive classification of data streams;searching time series with Hadoop in an electric power company;long-memory time series ensembles for concept shift detection;estimating building simulation parameters via Bayesian structure learning;solving combinatorial optimization problems using relaxed linear programming: a high performance computing perspective;CAPRI: a tool for mining complex line patterns in large log data;direct out-of-memory distributed parallel frequent pattern mining;TV predictor: personalized program recommendations to be displayed on SmartTVs;data-driven study of urban infrastructure to enable city-wide ubiquitous computing;pushing constraints into data streams;forecasting building occupancy using sensor network data;maintaining connected components for infinite graph streams;and an architecture for detecting events in real-time using massive heterogeneous data sources.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel gesture recognition with soft real-time guarantees

Parallel gesture recognition with soft real-time guarantees

引用

2012 2nd ACM workshop on programming Systems, Languages and Applications Based on Actors, Agents, and Decentralized Control Abstractions, AGERE 2012

作者： Renaux, Thierry Hoste, Lode Marr, Stefan De Meuter, Wolfgang Software Languages Lab Vrije Universiteit Brussel Belgium

ISBN: (纸本)9781450316309

Applying imperative programming techniques to process event streams, like those generated by multi-touch devices and 3D cameras, has significant engineering drawbacks. Declarative approaches solve these problems but have not been able to scale on multicore systems while providing guaranteed response times. We propose PARTE, a parallel scalable complex event processing engine which allows a declarative definition of event patterns and provides soft real-time guarantees for their recognition. It extends the state-saving Rete algorithm and maps the event matching onto a graph of actor nodes. Using a tiered event matching model, PARTE provides upper bounds on the detection latency. Based on the domainspecific constraints, PARTE's design relies on a combination of 1) lock-free data structures;2) safe memory management techniques;and 3) message passing between Rete nodes. In our benchmarks, we measured scalability up to 8 cores, outperforming highly optimized sequential implementations. Copyright © 2012 by the Association for Computing Machinery, Inc.

关键词： Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：