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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是51-60 订阅

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

详细简洁

排序：

A parallel refined Jacobi-Davidson method for quadratic eigenvalue problems

A parallel refined Jacobi-Davidson method for quadratic eige...

引用

international symposium on parallel architectures, algorithms, and programming

作者： Wang, Shunxu College of Science Huaihai Institute of Technology Lianyungang Jiangsu 222005 China

ISBN: (纸本)9780769543123

This paper presents a parallel refined Jacobi- Davidson method for computing extreme eigenpairs of quadratic eigenvalue problems. The method directly computes the refined Ritz pairs in the projection subspace, and expands the subspace by the solution of the correction equation. Combining with the restarting scheme, the method can solve several eigenpairs of quadratic eigenvalue problems. The numerical experiments on a parallel computer show that the parallel refined Jacobi-Davidson method for computing quadratic eigenvalue problems is very effective. © 2010 IEEE.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

AnyQ: An Evaluation Framework for Massively-parallel Queue algorithms 37

AnyQ: An Evaluation Framework for Massively-Parallel Queue A...

引用

37th IEEE international parallel and Distributed Processing symposium (IPDPS)

作者： Kenzel, Michael Lemme, Stefan Membarth, Richard Kurtenacker, Matthias Devillerst, Hugo Steinberger, Markus Slusallek, Philipp Deutsch Forschungszentrum Kfinstliche Intelligenz Saarland Informat Campus Kaiserslautern Germany Tech Hsch Ingolstadt THI Res Inst Almot Bavaria Ingolstadt Germany Univ Saarland Saarland Informat Campus Saarbrucken Germany Graz Univ Technol Graz Austria

ISBN: (纸本)9798350337662

Concurrent queue algorithms have been subject to extensive research. However, the target hardware and evaluation methodology on which the published results for any two given concurrent queue algorithms are based often share only minimal overlap. A meaningful comparison is, thus, exceedingly difficult. With the continuing trend towards more and more heterogeneous systems, it is becoming more and more important to not only evaluate and compare novel and existing queue algorithms across a wider range of target architectures, but to also be able to continuously re-evaluate queue algorithms in light of novel architectures and capabilities. To address this need, we present AnyQ, an evaluation framework for concurrent queue algorithms. We design a set of programming abstractions that enable the mapping of concurrent queue algorithms and benchmarks to a wide variety of target architectures. We demonstrate the effectiveness of these abstractions by showing that a queue algorithm expressed in a portable, high-level manner can achieve performance comparable to handcrafted implementations. We design a system for testing and benchmarking queue algorithms. Using the developed framework, we investigate concurrent queue algorithm performance across a range of both CPU as well as GPU architectures. In hopes that it may serve the community as a starting point for building a common repository of concurrent queue algorithms as well as a base for future research, all code and data is made available as open source software at https://***/anyq.

关键词： Massively parallel Concurrent Queue GPU

来源：评论

学校读者我要写书评

暂无评论

Theory and practice of programming applied to membrane systems (Invited talk)

Theory and practice of programming applied to membrane syste...

引用

7th international symposium on Symbolic and Numeric algorithms for Scientific Computing

作者： Ciobanu, G Res Inst eAustria Timisoara Romania

ISBN: (纸本)0769524532

Following the knowledge provided by the theory of programming, we present an abstract syntax of the membrane systems, and their semantics. We define an appropriate notion of configurations, and sets of inference rules corresponding to the three stages of an evolution step in membrane systems. A notion of bisimulation is defined;bisimulation relations allow to compare the evolution behaviour of two membrane systems. On the other hand, the practice of programming related to membrane systems is given by the presentation of some sequential and parallel software simulators, emphasizing their specific features.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Proxy placement in coordinated en-route transcoding caching for tree networks

Proxy placement in coordinated en-route transcoding caching ...

引用

7th international symposium on parallel architectures, algorithms and Networks (I-SPAN 2004)

作者： Li, KQ Shen, H Japan Adv Inst Sci & Technol Grad Sch Informat Sci Tatsunokuchi Ishikawa 9231292 Japan

ISBN: (纸本)0769521355

This paper addresses the problem of transcoding proxy placement for coordinated en-route web caching for tree networks. We propose a model for this problem by considering all the nodes among the network in a coordinated way and formulate this problem as an optimization problem. We implement our dynamic programming-based algorithm and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our model outperforms the placement model for linear topology.

关键词： transcoding proxy placement dynamic programming optimization problem World Wide Web tree networks

来源：评论

学校读者我要写书评

暂无评论

A new type of parallel computing architecture and its parallel computer based on N+1 programs

A new type of parallel computing architecture and its parall...

引用

international symposium on parallel architectures, algorithms, and programming

作者： Xu, Zhaochang Zhang, Ning Xu, Haoyuan Shanghai Cell-computer Lab. Shanghai China Yokohama National University Yokohama Japan

ISBN: (纸本)9780769543123

This paper introduces a new type of parallel computer based on N+1 programs (hereinafter, N+1 computer), as well as its features. A new concept of parallel computing architecture based on N+1 programs is also presented at same time. We studied the essential problems and inherent laws on parallel systems, and analyzed the operateability, the computability, and the compilability of the system, as well as its generality of this new parallel computing architecture. Finally, an N+1 computer prototype machine was trialed which could be considered to be a new general type of platform on parallel processing studies. © 2010 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of High Performance Traffic Processing based on Intel DPDK 9

Research and Implementation of High Performance Traffic Proc...

引用

9th international Conference on parallel architectures, algorithms and programming (PAAP)

作者： Zhu, Wenjun Li, Peng Luo, Baozhou Xu, He Zhang, Yujie Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing 210003 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Sch Comp Sci Jiangsu High Technol Res Key Lab Wireless Sensor Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9781538694039

With the rapid development of Internet and the continuous rise of network users, the network traffic in various regions is increasing rapidly. In the face of a large number of high speed and high throughput of the network environment, traditional packet capture methods and processing capabilities cannot reach the corresponding speed, which results in severe packet loss. This paper focuses on a high-performance packet acquisition and distribution method to break through the performance bottleneck of universal servers and network cards. This paper studies a packet capture method based on DPDK platform, and uses the processing of hash value in RSS to improve the efficiency of data packet distribution, which realizes the process from performance acquisition to efficiently multi-core parallel processing. This method can effectively reduce packet loss and improve the data packet processing rate. It can also reduce resource waste and network overhead for traffic capture and distribution. Preliminary experiments show that DPDK-based traffic processing has obvious advantages over PF-RING and Netmap in data processing speed.

关键词： DPDK Traffic Processing Distribution Multi-core parallel Processing

来源：评论

学校读者我要写书评

暂无评论

INSPIRE The Insieme parallel Intermediate Representation

INSPIRE The Insieme Parallel Intermediate Representation

引用

22nd international Conference on parallel architectures and Compilation Techniques (PACT)

作者： Jordan, Herbert Pellegrini, Simone Thoman, Peter Kofler, Klaus Fahringer, Thomas Univ Innsbruck Inst Comp Sci A-6020 Innsbruck Austria

ISBN: (纸本)9781479910212

programming standards like OpenMP, OpenCL and MPI are frequently considered programming languages for developing parallel applications for their respective kind of architecture. Nevertheless, compilers treat them like ordinary APIs utilized by an otherwise sequential host language. Their parallel control flow remains hidden within opaque runtime library calls which are embedded within a sequential intermediate representation lacking the concepts of parallelism. Consequently, the tuning and coordination of parallelism is clearly beyond the scope of conventional optimizing compilers and hence left to the programmer or the runtime system. The main objective of the Insieme compiler is to overcome this limitation by utilizing INSPIRE, a unified, parallel, high-level intermediate representation. Instead of mapping parallel constructs and APIs to external routines, their behavior is modeled explicitly using a unified and fixed set of parallel language constructs. Making the parallel control flow accessible to the compiler lays the foundation for the development of reusable, static and dynamic analyses and transformations bridging the gap between a variety of parallel paradigms. Within this paper we describe the structure of INSPIRE and elaborate the considerations which influenced its design. Furthermore, we demonstrate its expressiveness by illustrating the encoding of a variety of parallel language constructs and we evaluate its ability to preserve performance relevant aspects of input codes.

关键词： Compiler Intermediate Representation parallel Computation High-level Program Analysis

来源：评论

学校读者我要写书评

暂无评论

YAPPA: a Compiler-Based parallelization Framework for Irregular Applications on MPSoCs

YAPPA: a Compiler-Based Parallelization Framework for Irregu...

引用

international symposium on Rapid System Prototyping / Embedded Systems Week

作者： Lovergine, Silvia Tumeo, Antonino Villa, Oreste Ferrandi, Fabrizio Pacific NW Natl Lab Richland WA 99352 USA Politecn Milan DEIB Milan Italy

ISBN: (纸本)9781479924097

Modern embedded systems include hundreds of cores. Because of the difficulty in providing a fast, coherent memory architecture, these systems usually rely on non-coherent, non-uniform memory architectures with private memories for each core. However, programming these systems poses significant challenges. The developer must extract large amounts of parallelism, while orchestrating communication among cores to optimize application performance. These issues become even more significant with irregular applications, which present data sets difficult to partition, unpredictable memory accesses, unbalanced control flow and fine grained communication. Hand-optimizing every single aspect is hard and time-consuming, and it often does not lead to the expected performance. There is a growing gap between such complex and highly-parallel architectures and the high level languages used to describe the specification, which were designed for simpler systems and do not consider these new issues. In this paper we introduce YAPPA (Yet Another parallel programming Approach), a compilation framework for the automatic parallelization of irregular applications on modern MPSoCs based on LLVM. We start by considering an efficient parallel programming approach for irregular applications on distributed memory systems. We then propose a set of transformations that can reduce the development and optimization effort. The results of our initial prototype confirm the correctness of the proposed approach.

关键词： Irregular Applications Compilers parallel Code Generation Embedded Systems HPC

来源：评论

学校读者我要写书评

暂无评论

High-performance Graph Analytics on Manycore Processors 29

High-performance Graph Analytics on Manycore Processors

引用

29th IEEE international parallel and Distributed Processing symposium (IPDPS)

作者： Slota, George M. Rajamanickam, Sivasankaran Madduri, Kamesh Penn State Univ Comp Sci & Engn University Pk PA 16802 USA Sandia Natl Labs Scalable Algorithms Dept Albuquerque NM 87185 USA

ISBN: (纸本)9781479986484

The divergence in the computer architecture landscape has resulted in different architectures being considered mainstream at the same time. For application and algorithm developers, a dilemma arises when one must focus on using underlying architectural features to extract the best performance on each of these architectures, while writing portable code at the same time. We focus on this problem with graph analytics as our target application domain. In this paper, we present an abstraction-based methodology for performance-portable graph algorithm design on manycore architectures. We demonstrate our approach by systematically optimizing algorithms for the problems of breadth-first search, color propagation, and strongly connected components. We use Kokkos, a manycore library and programming model, for prototyping our algorithms. Our portable implementation of the strongly connected components algorithm on the NVIDIA Tesla K40M is up to 3.25x faster than a state-of-the-art parallel CPU implementation on a dual-socket Sandy Bridge compute node.

关键词： graph computations BFS color propagation GPU parallel performance portability

来源：评论

学校读者我要写书评

暂无评论

Approximate string matching using Markovian distance

Approximate string matching using Markovian distance

引用

international symposium on parallel architectures, algorithms, and programming

作者： Katsumata, Akifumi Miura, Takao Shioya, Isamu Dept.of Elect. and Elect. Engineering HOSEI University Kajinocho 3-7-2 Koganei Tokyo Japan Dept. of Managament and Informatics SANNO University Kamikasuya 1672 Isehara kanagawa Japan

ISBN: (纸本)9780769543123

In this work we examine a new technique for approximate string matching using Markovian distance. Here we assume each character appears in a probabilistic way. By means of this idea, we introduce a notion of dissimilarity using text corpus. Then we propose our sophisticated algorithm based on dynamic programming. vVe show some experimental results to see how the approach works well. © 2010 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：