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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Accelerating Reconfiguration for Degradable Mesh-Connected Processor Arrays

Accelerating Reconfiguration for Degradable Mesh-Connected P...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Jing Wang Wu Jigang Yuanrui Zhang Dakun Zhang School of Computer Science & Software Engineering Tianjin Professional University Tianjin China

This paper proposes a fast reconfiguration algorithm for the two-dimensional degradable mesh-connected processor arrays. The proposed algorithm simplifies a dynamic programming approach to construct logical columns. For each processing element lying in the logical columns, the calculation is reduced from five operations (one assignment, two additions and two comparisons) that are taken in the state-of-the-art to single assignment operation in most cases, or three operations (one assignment, one comparison and one addition) in worst case. Simulation results based on same benchmarks utilized in the state-of-the-art show that, the simplified algorithm runs faster by 28%, without loss of harvest. Moreover, the increase of the total interconnection length of the target array is acceptable.

关键词： Very large scale integration Switches Runtime Heuristic algorithms parallel processing Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

A Distributed Dynamic parallel Algorithm for SIFT Feature Extraction

A Distributed Dynamic Parallel Algorithm for SIFT Feature Ex...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Guiyuan Jiang Guiling Zhang Dakun Zhang School of Computer Science & Software Engineering Tianjin Professional University Tianjin China

This paper deals with the issue of developing efficient algorithms for accelerating SIFT (Scale Invariant Feature Transform) features extraction under distributed environment. The proposed distributed dynamic parallel algorithm (DDP-SIFT) using a special data parallel approach that divides the Gauss Scale Space by octave aimed at acquiring large image blocks which is of great importance in some application. To make this approach effective, steps of building Gauss Scale Space are changed, and only the prerequisite part which is only 1/13 of the whole pyramid will be produced before tasks allocation, and Allocation Data Quantity (ADQ) is decreased by 13 times. Data blocks are assembled as tasks maintained in task lists, and dynamically allocated to Computing Nodes. A refined-blocking approach is proposed to further improve load balance. Our investigations show that the proposed algorithm has remarkable performance on accelerating SIFT features extraction while pursuing large data blocks.

关键词： Feature extraction Heuristic algorithms Resource management Acceleration parallel algorithms Hardware Buildings

来源：评论

学校读者我要写书评

暂无评论

Information Diffusion with SIRP and SEIRP in Social Networks

Information Diffusion with SIRP and SEIRP in Social Networks

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Peihuang Huang Xi Chen Bingna Wu College of Mathematics and Data Science Minjiang University Fuzhou 350108 P.R. China

ISBN: (纸本)9781665452199

Aiming to improve the traditional SIR and SEIR models for their applications in information diffusion in social networks, this paper introduces public propagation nodes into these two models and consequently proposes an information propagation algorithm. Firstly, through the simulation analysis of the two models SIRP and SEIRP, we explore the factors that affect information dissemination in social networks; secondly, respecting the factors analyzed we propose a greedy algorithm for maximum information dissemination breadth under the assumption of second-degree dissemination. The simulation results show that our information propagation algorithm deserves a practical performance close to that of the optimal propagation algorithm based on the exhaustive method such as enumeration, and nonetheless achieves a better time complexity. To sum up, our information dissemination algorithm has practical value in the information dissemination applications of social networks.

关键词： Greedy algorithms Analytical models Social networking (online) Simulation programming parallel architectures Time complexity

来源：评论

学校读者我要写书评

暂无评论

A scalable unified model for dynamic data structures in message passing (clusters) and shared memory (multicore CPUs) computing environments 18

A scalable unified model for dynamic data structures in mess...

引用

18th IEEE/ACM international symposium on Cluster, Cloud and Grid Computing (CCGrid)

作者： Laccetti, Giuliano Lapegna, Marco Montella, Raffaele Univ Napoli Federico II Dept Math & Applicat Naples Italy Univ Napoli Parthenope Dept Sci & Technol Naples Italy

ISBN: (纸本)9781538658154

Concurrent data structures are widely used in many software stack levels, ranging from high level parallel scientific applications to low level operating systems. The key issue of these objects is their concurrent use by several computing units (threads or process) so that the design of these structures is much more difficult compared to their sequential counterpart, because of their extremely dynamic nature requiring protocols to ensure data consistency, with a significant cost overhead. At this regard, several studies emphasize a tension between the needs of sequential correctness of the concurrent data structures and scalability of the algorithms, and in many cases it is evident the need to rethink the data structure design, using approaches based on randomization and/or redistribution techniques in order to fully exploit the computational power of the recent computing environments. The problem is grown in importance with the new generation High Performance Computing systems aimed to achieve extreme performance. It is easy to observe that such systems are based on heterogeneous architectures integrating several independent nodes in the form of clusters or MPP systems, where each node is composed by powerful computing elements (CPU core, GPUs or other acceleration devices) sharing resources in a single node. These systems therefore make massive use of communication libraries to exchange data among the nodes, as well as other tools for the management of the shared resources inside a single node. For such a reason, the development of algorithms and scientific software for dynamic data structures on these heterogeneous systems implies a suitable combination of several methodologies and tools to deal with the different kinds of parallelism corresponding to each specific device, so that to be aware of the underlying platform. The present work is aimed to introduce a scalable model to manage a special class of dynamic data structure known as heap based priority queue (o

关键词： HPC heterogeneous systems concurrent data structures programming models

来源：评论

学校读者我要写书评

暂无评论

Balinda C++: run-time support for concurrent object-oriented language

Balinda C++: run-time support for concurrent object-oriented...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： H.C. Wang C.K. Yuen M.D. Feng School of Computing National University Singapore

Run-time systems are critical to the implementation of concurrent object oriented programming languages. The paper describes a concurrent object oriented programming language, Balinda C++, running on a distributed memory system and its run-time implementation. The run-time system is built on the top of the Nexus communication library. The tuplespace is the key to Balinda C++. A distributed tuplespace model is presented to improve data locality. Some experiments have been done to verify our model. The results indicate that our model is effective at improving system performance.

关键词： Object oriented modeling parallel programming Concurrent computing Yarn Object oriented programming programming profession Runtime library System performance Workstations High performance computing

来源：评论

学校读者我要写书评

暂无评论

A parallel Computing Procedure for the Lower and Upper Bounds on the Functionals of Solutions to PDE: Application to the J-Integral in Functionally Graded Materials

A Parallel Computing Procedure for the Lower and Upper Bound...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Z.C. Xuan Department of Computer Science Tianjin University of Technology and Education Tianjin China

A parallel computing procedure for computing the bounds on the J-integral in functionally graded materials is presented based on a Neumann element a-posteriori error bound. The finite element solution of J-integral is first obtained on a coarser finite element mesh, then a-posteriori bounding procedure based on the finite element error estimate is used to compute the lower and upper bounds on the J-integral. The computation of the error estimate is performed by solving independent elemental Neumann sub problems decomposed from the finite element model, thus the computing procedure is parallel and potential to solve large scale structural problems. An example is given in the end of paper to compute the lower and upper bounds on the J-integral of functionally graded materials.

关键词： Finite element methods Mathematical model Equations Stress Upper bound Elasticity

来源：评论

学校读者我要写书评

暂无评论

programming with transactions and chemical abstract machine

Programming with transactions and chemical abstract machine

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Wanli Ma C.W. Johnson R.P. Brent Computer Science Lab Australian National University Canberra ACT Australia Department of Computer Science Australian National University Canberra ACT Australia

The coordination style programming language T-Cham extends chemical abstract machine (Cham) with transactions. The Cham is an interactive computational model based on chemical reaction metaphor, where a computation proceeds as a succession of chemical reactions. A transaction is a piece of sequentially executed codes and could be written in any language, such as C, Pascal, or Fortran etc., as long as it satisfies its pre-condition and post-condition. Every transaction begins its execution whenever its execution condition is satisfied. A T-Cham program can be executed in a parallel, distributed, or sequential manner based on the available computer resources.

关键词： Computer languages Concurrent computing Yarn Computational modeling Chemical elements Distributed computing Communication system control Australia parallel programming programming profession

来源：评论

学校读者我要写书评

暂无评论

The Design and Implementation of OMPit: An OpenMP Compiler Characterized by Logs for parallel and Work-Sharing

The Design and Implementation of OMPit: An OpenMP Compiler C...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Qiuming Luo Ye Cai Chengjian Liu Chang Kong National High Performance Computing Center (NHPCC) College of Computer Science and Software Engineering Shenzhen University China

There are many tools for OpenMP benchmarking which measure the various aspects of the performance, such as the overheads of OpenMP directives and the characteristics of the whole system. But we lack some tools to show us the worksharing details when the OpenMP program finished running. The OMPit (OMPi for tutoring) is designed to provide the worksharing information during the running, which can be used for tutoring and might help debugging or tuning. The work-sharing logging includes the work assignment and the timestamps for three different work-sharing behaviors. The logging information can be output as a text files or visualized figures. The designing of OMPit is provided and the details of how to inserting the logging code into the OMPi compiler is discussed too.

关键词： Debugging programming Program processors Runtime Benchmark testing Upper bound Kernel

来源：评论

学校读者我要写书评

暂无评论

Proceedings international parallel and Distributed Processing symposium

Proceedings International Parallel and Distributed Processin...

引用

international symposium on parallel and Distributed Processing (IPDPS)

The following topics are dealt with: Grid and distributed computing; scheduling task systems; shared-memory multiprocessors; imaging and visualization; testing and debugging; performance analysis and real-time systems; scheduling for heterogeneous resources; networking; peer-to-peer and mobile computing; compiler technology and run-time systems; load balancing; network routing; parallel programming models; parallel algorithms; scheduling and storage; parallel and distributed performance; software for high performance clusters; decentralized algorithms; multithreading and VLIW; parallel and distributed real-time systems; high-level parallel programming models and supportive environments; Java for parallel and distributed computing; nature inspired distributed computing; high performance computational biology; advances in parallel and distributed computational models; reconfigurable architectures; communication architecture for clusters; next generation systems; fault-tolerant parallel and distributed systems; wireless, mobile and ad hoc networks; parallel and distributed image processing, video processing, and multimedia; formal methods for parallel programming; Internet computing and e-commerce; parallel and distributed scientific and engineering computing with applications; massively parallel processing; performance modeling, evaluation, and optimization of parallel and distributed systems; and parallel and distributed systems: testing and debugging.

关键词： Processor scheduling Shared memory systems Software debugging Software testing Real time systems Program compilers Resource management parallel programming parallel algorithms Memory management parallel architectures Biomedical computing Reconfigurable architectures Computer fault tolerance Video signal processing Image processing Software requirements and specifications Multimedia computing Internet

来源：评论

学校读者我要写书评

暂无评论

Improving parallel FDTD Method Performance Using SSE Instructions

Improving Parallel FDTD Method Performance Using SSE Instruc...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Lihong Zhang Wenhua Yu School of Information Engineering Communication University of China Beijing China Fundamentals Department Chinese People's Armed Police Force Academy Langfang Hebei China Pennslyvania State University University Park PA USA

Electromagnetic researchers are often faced with long execution time and therefore algorithmic and implementation-level optimization can dramatically increase the overall performance of electromagnetism simulation using FDTD method. In this paper, we focus on acceleration implementation of 3D parallel FDTD method by taking advantage of the extended instruction sets found in modern processors, in particular the SSE instruction set. We present a SSE version of 3D parallel FDTD Method that results in a considerable 3x speedup.

关键词： Finite difference methods Time domain analysis Three dimensional displays Computational modeling Mathematical model Educational institutions Acceleration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：