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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

952 篇 会议
20 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

653 篇 工学
- 595 篇 计算机科学与技术...
- 238 篇 软件工程
- 190 篇 电气工程
- 76 篇 电子科学与技术（可...
- 61 篇 信息与通信工程
- 31 篇 控制科学与工程
- 23 篇 动力工程及工程热...
- 11 篇 机械工程
- 11 篇 仪器科学与技术
- 8 篇 生物医学工程（可授...
- 7 篇 力学（可授工学、理...
- 7 篇 环境科学与工程（可...
- 6 篇 安全科学与工程
- 5 篇 材料科学与工程（可...
- 5 篇 建筑学
- 5 篇 交通运输工程
- 5 篇 生物工程
- 5 篇 网络空间安全
91 篇 理学
- 53 篇 数学
- 27 篇 系统科学
- 18 篇 物理学
- 8 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 化学
88 篇 管理学
- 76 篇 管理科学与工程(可...
- 31 篇 工商管理
- 14 篇 图书情报与档案管...
10 篇 经济学
- 10 篇 应用经济学
8 篇 法学
- 7 篇 社会学
6 篇 医学
4 篇 教育学
- 4 篇 教育学
3 篇 文学
2 篇 农学
2 篇 军事学

主题

75 篇 computer archite...
62 篇 hardware
60 篇 parallel process...
55 篇 multicore proces...
48 篇 computational mo...
37 篇 concurrent compu...
36 篇 high performance...
34 篇 instruction sets
34 篇 multi-core
33 篇 graphics process...
31 篇 scalability
31 篇 cloud computing
30 篇 parallel program...
29 篇 programming
29 篇 program processo...
29 篇 graphics process...
27 篇 kernel
25 篇 embedded systems
24 篇 conferences
24 篇 resource managem...

机构

9 篇 ohio state univ ...
5 篇 saitama univ gra...
4 篇 ohio state univ ...
3 篇 saitama universi...
3 篇 vienna universit...
3 篇 oak ridge natl l...
3 篇 graduate school ...
3 篇 fraunhofer igd t...
3 篇 center for compu...
3 篇 karlsruhe instit...
3 篇 oak ridge natl l...
3 篇 beihang univ sch...
2 篇 penn state univ ...
2 篇 uppsala univ upp...
2 篇 seoul natl univ ...
2 篇 coll william & m...
2 篇 china university...
2 篇 waseda univ dept...
2 篇 tsinghua univers...
2 篇 national univers...

作者

6 篇 takuya azumi
6 篇 panda d. k.
6 篇 azumi takuya
5 篇 subramoni hari
5 篇 shingo igarashi
5 篇 benini luca
4 篇 tatsuya horiguch...
4 篇 tasuku ishigooka
4 篇 petiton serge
4 篇 el-ghazawi tarek
4 篇 sato mitsuhisa
4 篇 amano hideharu
3 篇 liu bo
3 篇 klasky scott
3 篇 dongarra jack
3 篇 varbanescu ana l...
3 篇 qian depei
3 篇 sriram krishnamo...
3 篇 weichslgartner a...
3 篇 alam sadaf r.

语言

969 篇 英文
4 篇 其他
1 篇 中文

检索条件"任意字段=IEEE International Workshop on Multi-/Many-core Computing Systems"

共 974 条记录，以下是861-870 订阅

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

详细简洁

排序：

Optimized Distributed Data Sharing Substrate in multi-core Commodity Clusters: A Comprehensive Study with Applications 08

Optimized Distributed Data Sharing Substrate in Multi-Core C...

引用

8th ieee international Symposium on Cluster computing and the Grid

作者： Vaidyanathan, K. Lai, P. Narravula, S. Panda, D. K. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781424442379

Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed simpler abstractions to hide these complexities. However, many of the proposed techniques use messaging protocols which incur high overhead and are not very scalable. To address these limitations, in our previous work [20], we proposed an efficient Distributed Data Sharing Substrate (DDSS) using the features of high-speed networks. In this paper we propose several design optimizations for DDSS in multi-core systems such as the combination of shared memory and message queues for inter-process communication, dedicated thread for communication progress and for onloading DDSS operations such as get and put. Our micro-benchmark results not only show a very low latency in DDSS operations but also demonstrate the scalability of DDSS with increasing number of processes. Application evaluations with R-Tree and B-Tree query processing and distributed STORM shows an improvement of up to 56%, 45% and 44%, respectively, as compared to traditional implementations. Evaluations with application checkpointing using DDSS demonstrate the scalability with increasing number of checkpointing applications. Further in our evaluations, we demonstrate the portability of DDSS across multiple modem interconnects including InfiniBand and iWARP-capable 10-Gigabit Ethernet networks (applicable for both LAN/WAN environments).

关键词： High-Performance Networks multi-core Data-Centers Distributed Shared State

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of Molecular Dynamics Simulations on multi-core systems

引用

15th international Conference on High Performance computing (HiPC 2008)

作者： Alam, Sadaf R. Agarwal, Pratul K. Hampton, Scott S. Ong, Hong Oak Ridge Natl Lab Div Math & Comp Sci Oak Ridge TN USA

ISBN: (纸本)9783540898931

multi-core processors introduce many challenges both at the system and application levels that need to be addressed in order to attain the best performance. In this paper, we study the impact of the multi-core technologies in the context of two scalable, production-level molecular dynamics simulation frameworks. Experimental analysis and observations in this paper provide for a better understanding of the interactions between the application and the underlying system features such as memory bandwidth, architectural optimization. and communication library implementation. In particular, we observe that parallel efficiencies could be as low as 50% on quad-core systems while a set of dual-core processors connected with a high speed interconnect can easily outperform the same number of cores on a socket or in a package. This indicates that certain modifications to the software stack and application implementations are necessary in order to fully exploit the performance of multi-core based systems.

关键词： multicore Performance Molecular Dynamics Simulation HPC

来源：评论

学校读者我要写书评

暂无评论

Adding TBB contents to the multi-core related curriculums

Adding TBB contents to the multi-core related curriculums

引用

1st international Conference on Intelligent Networks and Intelligent systems, ICINIS 2008

作者： Yang, Jianfeng Zheng, Hong Xie, Yinbo Wang, Jolly Bao, Nick School of Electronic Information Wuhan University Wuhan Hubei China PRC Education Intel China Ltd. Shanghai China

ISBN: (纸本)9780769533919

With the progress of semiconductor technologies and then the advent of multi-core processors, the age of Serial computing is over and parallel computing technology is now emerging as mainstream. Parallel programming models are needed to change and the education is need to help sequential programmers adapt to the requirements of this new technology and architecture. Now multi-core related contents have been adopted into curricula syllabus of more than 100 universities in China and about 20,000 undergraduate students will benefit from that each year, those contents be taught are similar among universities. Threading Building Blocks(TBB), a new and will be the best solution for parallel computing on the many-core processors in the future, is a C++ template library for parallelism that extents C++ template by abstracting away thread management and mapping tasks to threads automatically. TBB represents a higher-level parallelism for performance and scalability. This paper aim at adopting the TBB contents into university curriculums by introducing the important role of TBB in teaching multi-core related contents. The paper also presents how to integrate TBB with some other program tools such as OpenMP or MPI in the curricula "multi-core Architecture and multi-threaded Programming Technologies" of Wuhan University. © 2008 ieee.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Scaling alltoall collective on multi-core systems

Scaling alltoall collective on multi-core systems

引用

10th workshop on Advances in Parallel and Distributed Computational Models/22nd ieee international Parallel and Distributed Processing Symposium

作者： Kumar, Rahul Mamidala, Amith Panda, D. K. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781424416936

MPI_Alltoall is one of the most communication intense collective operation used in many parallel applications. Recently, the supercomputing arena has witnessed phenomenal growth of commodity clusters built using InfiniBand and multi-core systems. In this context, it is important to optimize this operation for these emerging clusters to allow for good application scaling. However optimizing MPI_Alltoall on these emerging systems is not a trivial task. InfiniBand architecture allowsfor varying implementations of the network protocol stack. For example, the protocol can be totally on-loaded to a host processing core or it can be off-loaded onto the NIC or can use any combination of the two. Understanding the characteristics of these different implementations is critical in optimizing a communication intense operation such as MPI_Alltoall. In this paper, we systematically study these different architectures and propose new schemes for MPI_Alltoall tailored to these architectures. Specifically, we demonstrate that we cannot use one common scheme which performs optimally on each of these varying architectures. For example, on-loaded implementations can exploit multiple cores to achieve better network utilization, and in offload interfaces aggregation can be used to avoid congestion on multi-core systems. We employ shared memory aggregation techniques in these schemes and elucidate the impact of these schemes on multi-core systems. The proposed design achieves a reduction in MPI_Alltoall time by 55% for 512Byte messages and speeds up the CPMD application by 33%.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

MAPS: multi-Algorithm Parallel circuit Simulation

MAPS: Multi-Algorithm Parallel circuit Simulation

引用

2008 international Conference on Computer-Aided Design, ICCAD

作者： Ye, Xiaoji Dong, Wei Li, Peng Nassif, Sani Department of ECE Texas A and M University College Station TX 77843 United States IBM Austin Research Laboratory Austin TX 78758 United States

ISBN: (纸本)9781424428205

The emergence of multi-core and many-core processors has introduced new opportunities and challenges to EDA research and development. While the availability of increasing parallel computing power holds new promise to address many computing challenges in CAD, the leverage of hardware parallelism can only be possible with a new generation of parallel CAD applications. In this paper, we propose a novel multi-Algorithm Parallel circuit Simulation approach (MAPS) and its multi-core implementation to expedite one of the most fundamental CAD applications: transistor-level transient circuit simulation. MAPS starts multiple simulation algorithms in parallel for a given simulation task. By properly synchronizing these algorithms on-the-fly, we exploit the diversity in simulation algorithms to achieve possibly superlinear overall speedup in transient simulation. In addition, our unique multi-algorithm framework allows unique safe exploration of simulation methods that are conventionally discarded due to convergence concerns. As a coarse grained parallel simulation approach, the implementation of MAPS demands a minimum of parallel programming effort and allows for reuse of existing serial simulation codes.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

The rails toolkit - Enabling end-system topology-aware high end computing

The rails toolkit - Enabling end-system topology-aware high ...

引用

4th ieee international Conference on eScience, eScience 2008

作者： Vishwanath, Venkatram Leigh, Jason Nam, Sungwon Renambot, Luc Shimizu, Takashi Takahashi, Hirokazu Takizawa, Makoto Kamatani, Osamu Electronic Visualization Laboratory University of Illinois at Chicago Chicago IL United States NTT Network Innovation Laboratories Yokosuka Japan

ISBN: (纸本)9780769535357

We present a novel rails approach so that future e-Science applications can effectively exploit future system architectures, including multi-core and many-core architectures, multiple network cards, multiple graphical processing units and hybrid hierarchical memory architectures. We define "rail" as the co-scheduling of two or more of these resources. This approach enables creation of parallel multi-rails through every aspect of an end system: from processing on the multi- and many cores, to generation of multiple data flows and streaming over multi-lane NICs connected via a parallel interconnect. We describe a novel open-source multi-rail toolkit and evaluate end-system parameters that impact the efficiency of such multi-rail systems, including Interrupt, Memory, Thread and core Affinities - key properties for achieving scalable performance. © 2008 ieee.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

The Fresh Breeze Project: A multi-core chip supporting composable parallel programming

The Fresh Breeze Project: A multi-core chip supporting compo...

引用

10th workshop on Advances in Parallel and Distributed Computational Models/22nd ieee international Parallel and Distributed Processing Symposium

作者： Dennis, Jack B. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781424416936

The Fresh Breeze Project concerns the architecture and design of a multicore chip that can achieve superior performance while supporting composability of parallel programs. The requirements of composability imply that the management of processor allocation and memory management must be sufficiently flexible to permit reassignment of resources according to the current needs of computations. The Fresh Breeze Programming model combines the spawn/join threading model of Cilk[4] with a write-once memory model based on fixed-size chunks that are allocated and freed by efficient hardware mechanisms. This model supports computing jobs by many users, each consisting of a hierarchy of function activations. The model satisfies all six principles for supporting modular program construction[3]. Within this programming model, it is possible for any parallel program to be used, without change, as a component in building larger parallel programs.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Resolving physical conflicts in multiagent systems

Resolving physical conflicts in multiagent systems

引用

3rd international multi-Conference on computing in the Global Information Technology, ICCGI 2008

作者： Rabuzin, Kornelije Malekovic, Mirko Cubrilo, Mirko University of Zagreb Faculty of Organization and Informatics Varazdin Croatia

ISBN: (纸本)9780769532752

During the project we were working on physical conflicts occurred in a multiagent system. In order to resolve the problem many different conflict resolution strategies were examined and many proposed solutions found. In this paper we explore conflicts as well as their causes and possible solutions. Based upon this research we implemented a centralized solution and added a reactive agent in the database in order to avoid conflict situations and efficiently allocate a set of resources. © 2008 ieee.

关键词： multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Parallel Structural Join algorithm on shared-memory multi-core systems

Parallel Structural Join algorithm on shared-memory multi-co...

引用

9th international Conference on Web-Age Information Management, WAIM 2008

作者： Liu, Le Feng, Jianhua Li, Guoliang Qian, Qian Li, Jianhui Department of Computer Science and Technology Tsinghua University Beijing China Intel Corporation Shanghai China

ISBN: (纸本)9780769531854

The leap from single-core to multi-core has permanently altered the course of computing, enabling increased productivity, powerful energy-efficient performance, and leading-edge advanced computing experiences. Although traditional single-thread XPath query evaluation algorithms can run properly on multi-core CPUs, they cannot take full use of the computing resources of multi-core CPUs. To take advantage of multi-core, efficient parallel algorithms are fairly desirable to evaluate XPath in parallel. In this paper, we present, PSJ, an efficient Parallel Structural Join algorithm for evaluating XPath. PSJ can skip many ancestor or descendant elements by evenly and efficiently partitioning the input element lists into some buckets. PSJ obtains high performance by evaluating XPath step in each bucket in parallel. It is very efficient to partition the input lists and is effective to evaluate XPath step in buckets, and therefore PSJ achieves a high speedup ratio. We have implemented our proposed algorithm and the experimental results show that PSJ algorithm achieves high performance and outperforms the existing state-of-the-art methods significantly. © 2008 ieee.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

MOOLAP: Towards multi-objective OLAP

MOOLAP: Towards multi-objective OLAP

引用

24th ieee international Conference on Data Engineering/ 1st international workshop on Secure Semantic Web

作者： Antony, Shyarn Wu, Ping Agrawal, Divyakant El Abbadi, Amr Univ Calif Santa Barbara Santa Barbara CA 93106 USA

ISBN: (纸本)9781424418367

Aggregation is among the core functionalities of OLAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. When more than one aggregation function is involved and the notion of interest is not clearly defined, skyline queries provide a robust mechanism to capture the potentially interesting points where (i) users do not need to specify a ranking function and (ii) the result is independent of the dimension scales. To provide better exploration functionalities in OLAP systems, we propose to use skyline queries over aggregated data to identify the most interesting groups. Since aggregation functions have to be ad-hoc to cover a wide variety of user interests, the skyline over the aggregates has to be computed on the fly. Hence any algorithm to compute such a skyline must be fast and be able to progressively produce the result set with potential skyline groups being produced as early as possible. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and design an optimal algorithm. We further refine the algorithm by taking into account systems issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results validate the performance and progressive benefits of our algorithm.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共98页 << < 83 84 85 86 87 88 89 90 91 92 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：