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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,925 篇 会议
282 篇 期刊文献
26 册 图书
1 篇 科技报告

馆藏范围

11,234 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,466 篇 工学
- 5,207 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 885 篇 电气工程
- 573 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,033 篇 理学
- 813 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,583 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
598 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
383 篇 parallel program...
367 篇 peer to peer com...
356 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
20 篇 maciejewski anth...
19 篇 feng wu-chun
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
17 篇 panda dhabaleswa...
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 hai jin
14 篇 gopalakrishnan g...
14 篇 alexey lastovets...

语言

11,156 篇 英文
68 篇 其他
10 篇 中文

检索条件"任意字段=International Symposium on Parallel and Distributed Computing"

共 11234 条记录，以下是4471-4480 订阅

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

详细简洁

排序：

Challenges of scaling algebraic multigrid across modern multicore architectures

Challenges of scaling algebraic multigrid across modern mult...

引用

25th IEEE international parallel and distributed Processing symposium, IPDPS 2011

作者： Baker, Allison H. Gamblin, Todd Schulz, Martin Yang, Ulrike Meier Center for Applied Scientific Computing Lawrence Livermore National Laboratory 7000 East Avenue Livermore CA 94550 United States

ISBN: (纸本)9780769543857

Algebraic multigrid (AMG) is a popular solver for large-scale scientific computing and an essential component of many simulation codes. AMG has shown to be extremely efficient on distributed-memory architectures. However, when executed on modern multicore architectures, we face new challenges that can significantly deteriorate AMG's performance. We examine its performance and scalability on three disparate multicore architectures: a cluster with four AMD Opteron Quad-core processors per node (Hera), a Cray XT5 with two AMD Opteron Hex-core processors per node (Jaguar), and an IBM Blue Gene/P system with a single Quad-core processor (Intrepid). We discuss our experiences on these platforms and present results using both an MPI-only and a hybrid MPI/OpenMP model. We also discuss a set of techniques that helped to overcome the associated problems, including thread and process pinning and correct memory associations. © 2011 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Provisioning openCL capable infrastructure with infiniband verbs

Provisioning openCL capable infrastructure with infiniband v...

引用

2011 10th international symposium on parallel and distributed computing, ISPDC 2011

作者： Reynolds, Christopher J. Lichtenberger, Zsolt Winter, Stephen Centre for Parallel Computing School of Electronics and Computer Science University of Westminster London United Kingdom

ISBN: (纸本)9780769545400

The availability of low cost high performance hardware such as graphical processing units (GPUs) has been the driving force for considerable change in both traditional high performance computing (HPC), and more recently the data centre. Vendor independent methods of accessing such hardware include the recently standardised OpenCL framework. However, using GPUs as accelerators for certain computational algorithms requires careful provisioning of infrastructure in order to balance cost, power consumption, and device utilization. In this paper we describe vOpenCL, an architecture for provisioning OpenCL capable hardware. vOpenCL works by transparently offloading processing from traditional cluster nodes, to a remotely located farm of OpenCL capable processors such as GPUs. vOpenCL differs from existing provisioning solutions since it provides mechanisms to optimize the data transfers between components. This is achieved through the use of a module/plug in which fully exploits the Infiniband interconnect architecture. We provide full analysis of vOpenCL and all of its plugins, in a range of scenarios including from within virtualized environments. For certain algorithms, we demonstrate that the Infiniband plug in can provide significant performance benefits. © 2011 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Asynchronous peer-to-peer distributed computing for financial applications

Asynchronous peer-to-peer distributed computing for financia...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Garcia, Thierry Ming, Chau Nguyen, The Tung El-Baz, Didier Spiteri, Pierre Université de Toulouse INP - ENSEEIHT IRIT 2 Rue Camichel F-31071 Toulouse Cedex France Advanced Solutions Accelerator 199 Rue de l'Oppidum F-34170 Castelnau le Lez France CNRS - LAAS 7 avenue du colonel Roche F-31077 Toulouse France Université de Toulouse UPS INSA INP ISAE France

ISBN: (纸本)9780769543857

This paper deals with the numerical solution of financial applications, more specifically the computation of American and European options derivatives modelled by boundary values problems. In such applications we have to solve large-scale algebraic linear systems. We concentrate on synchronous and asynchronous parallel iterative algorithms carried out on peer-to-peer networks. The properties of the operators arising in the discretized problem ensure the convergence of the parallel iterative synchronous and asynchronous algorithms. Computational experiments performed on peer-to-peer networks are presented and analyzed. © 2011 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Power and performance management in priority-type cluster computing systems

Power and performance management in priority-type cluster co...

引用

25th IEEE international parallel and distributed Processing symposium, IPDPS 2011

作者： Xiong, Kaiqi Department of Computer Science Texas A and M University Commerce TX United States

ISBN: (纸本)9780769543857

Cluster computing not only improves performance but also increase power consumption. It is a challenge to increase the performance of a cluster computing system and reduce its power consumption simultaneously. In this paper, we consider a collection of cluster computing resources owned by a service provider to host an enterprise application for multiple class business customers where customer requests are distinguished, with different request characteristics and service requirements. We start with a development of computing an average end-to-end delay and an average energy consumption for multiple class customers in such an application. Then, we present approaches for optimizing the average end-to-end delay subject to the constraint of an average energy consumption and optimizing the average end-to-end energy consumption subject to the constraints of an average end-to-end delay for all class and each class customer requests respectively. Moreover, a service provider processes the service requests of customers according to a service level agreement (SLA), which is a contract agreed between a customer and a service provider. It becomes important and commonplace to prioritize multiple customer services in favor of customers who are willing to pay higher fees. We propose an approach for minimizing the total cost of cluster computing resources allocated to ensure multiple priority customer service guarantees by the service provider. It is demonstrated through our simulation that the proposed approaches are efficient and accurate for power management and performance guarantees in priority-type cluster computing systems. © 2011 IEEE.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A micro threading based concurrency model for parallel computing

A micro threading based concurrency model for parallel compu...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Yang, Qiang Jesshope, C.R. Fu, Jian Institute of Informatics University of Amsterdam Netherlands

ISBN: (纸本)9780769543857

The continuing launch of various multi-core processors backs parallel computing for gaining higher performance;however, it also exerts pressures on software developers concerning how to make full use of the multiplicity of resources to get the required benefits due to high coupling of parallel programs to specified hardware. In this paper, we propose SVP, a micro-threading based concurrency model, as an alternative to efficiently program on and manage multi-core, even many-core systems. SVP isolates programming from executing resources so that programs are compiled once and execute regardless of actual cores available, not only numbers, but also properties to achieve scalable speedup. Such lower coupling, better flexibility and portability in parallel applications are highly appreciated. To investigate SVP, tool chains and a fully functional software simulator of an SVP many-core chip have been developed for test and verification. Using this infrastructure, we are able to show how much we can gain from SVP and how speedup is scaled by running the same binary code of Game of Life on a scalable many-core platform. © 2011 IEEE.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

The Large Scale Data Facility: Data intensive computing for scientific experiments

The Large Scale Data Facility: Data intensive computing for ...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： García, Ariel O. Bourov, Serguei Hammad, Ahmad Van Wezel, Jos Neumair, Bernhard Streit, Achim Hartmann, Volker Jejkal, Thomas Neuberger, Patrick Stotzka, Rainer Steinbuch Centre for Computing Karlsruhe Germany Institute for Data Processing and Electronics Karlsruhe Germany

ISBN: (纸本)9780769543857

The Large Scale Data Facility (LSDF) at the Karlsruhe Institute of Technology was started end of 2009 with the aim of supporting the growing requirements of data intensive experiments. In close cooperation with the involved scientific communities, the LSDF provides them not only with adequate storage space but with a directly attached analysis farm and -more importantly- with value added services for their big scientific data-sets. Analysis workflows are supported through the mixed Hadoop and OpenNebula Cloud environments directly attached to the storage, and enable the efficient processing of the experimental data. Metadata handling is a central part of the LSDF, where a metadata repository, community specific metadata schemes, graphical tools, and APIs were developed for accessing and efficiently organizing the stored data-sets. © 2011 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing master-slave token circulation and efficient topology computation in a tree of arbitrary size

Self-stabilizing master-slave token circulation and efficien...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Goddard, Wayne Srimani, Pradip K. School of Computing Clemson University Clemson SC 29634-0974 United States

ISBN: (纸本)9780769543857

Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization. We consider the model introduced by Lee et al. where there is one designated master node and all other nodes are anonymous and as simple as possible. We provide here a master-slave algorithm that achieves token circulation in a tree, and using that, enables the master node to compute the topology of the tree. We show that the complexity of the algorithm is at most 2n rounds O(n2) steps, and the space complexity at the slave nodes is almost constant in the sense that storage needed col lectively at all n slave nodes is 2n bits. © 2011 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Evolving N-body simulations to determine the origin and structure of the Milky Way Galaxy's halo using volunteer computing

Evolving N-body simulations to determine the origin and stru...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Desell, Travis Magdon-Ismail, Malik Szymanski, Boleslaw Varela, Carlos A. Willett, Benjamin A. Arsenault, Matthew Newberg, Heidi Department of Computer Science Rensselaer Polytechnic Institute Troy NY United States Department of Physics Applied Physics and Astronomy Rensselaer Polytechnic Institute Troy NY United States

ISBN: (纸本)9780769543857

This work describes research done by the Milky-Way@Home project to use N-Body simulations to model the formation of the Milky Way Galaxy's halo. While there have been previous efforts to use N-Body simulations to perform astronomical modeling, to our knowledge this is the first to use evolutionary algorithms to discover the initial parameters to the N-Body simulations so that they accurately model astronomical data. Performing a single 32,000 body simulation can take up to 200 hours on a typical processor, with an average of 15 hours. As optimizing the input parameters to these N-Body simulations typically takes at least 30,000 or more simulations, this work is made possible by utilizing the computing power of the 35,000 volunteered hosts at the Milky-Way@Home project, which are currently providing around 800 teraFLOPS. This work also describes improvements to an open-source framework for generic distributed optimization (FGDO), which provide more efficient validation in performing these evolutionary algorithms in conjunction the Berkeley Open Infrastructure for Network computing (BOINC). © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel Extended Basic Operations for Conic Curves Cryptography over Ring Zn

Parallel Extended Basic Operations for Conic Curves Cryptogr...

引用

9th IEEE international symposium on parallel and distributed Processing with Applications Workshops (ISPAW)/ICASE/SGH/GSDP

作者： Li, Yongnan Xiao, Limin Chen, Siming Tian, Hongyun Ruan, Li Yu, Binbin Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China

ISBN: (纸本)9780769544298

This paper presents parallel extended operations of point-addition and point-double for cryptosystem on conic curves over ring Zn. The data dependencies are deduced by analyzing the definitions of two extended operations. Take procedure of paralleling extended point-addition as an example. We employ the Chinese Remainder Theorem to divide point-addition over ring Zn into two point-additions over finite field Fp and finite field Fq. Then the temporary values of point-addition over two finite fields are merged to get the final result of extended point-addition over ring Zn. The analysis of parallel methodology is based on our previous works about the basic parallel algorithms used in conic curves cryptosystem. computing extended point-addition and point-double both need to execute three steps. For getting the average runtime and speedup ratio, different cases are considered in the second step. The performance evaluation demonstrates that our techniques improve the efficiencies of two extended operations. Additionally, the parallel methods introduced in this paper are also more efficient than traditional parallel algorithms.

关键词： conic curves cryptosystem ring Zn Chinese Remainder Theorem parallel algorithm point-addition point-double

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 444 445 446 447 448 449 450 451 452 453 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：