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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A distributed approach for solving systems of nonlinear equations

A distributed approach for solving systems of nonlinear equa...

引用

13th international symposium on Symbolic and Numeric Algorithms for Scientific computing, SYNASC 2011

作者： Mocanu, Adrian ŢǍpuş, Nicolae Department of Computer Science POLITEHNICA University of Bucharest Romania

ISBN: (纸本)9780769546308

Solving a system of nonlinear equations is a common operation in many practical applications such as analyzing physics experiments or running simulations of analog electronic circuits. Applications become more and more complex, both in terms of variables and number of involved equations, severely limiting the applicability of the sequential algorithms. As both the processing power and the available bandwidth in modern network increase, the distributing solution becomes more and more appealing. This paper presents a parallel algorithm for solving systems nonlinear of equations based on the Newton-Raphson method. The core of this algorithm is the Gaussian reduction. Our implementation attempts to minimize the overall amount of data to be transferred during both the Gauss pivoting operation and each Newton-Raphson iteration. © 2011 IEEE.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Trade-offs in token ring systems

Trade-offs in token ring systems

引用

6th international symposium on parallel computing in Electrical Engineering, PARELEC 2011

作者： Haddix, Furman Minnesota State University Mankato United States

ISBN: (纸本)9780769543970

In addition to trade-offs between convergence and response spans as described by Gouda and Evangelist [1], we consider state space utilization with regard to processing and communications, and sensitivity to delay time estimates. In order to be delay insensitive, estimates of transmission and/or computation time are used, which we implement as virtual nodes. The estimated number of nodes is defined as NE. We define M as the number of processes, and N as the total number of nodes required in the problem space. These algorithms require that NE > N in order that correctness and desired behavior can be guaranteed. We define auto-synchronization as the characteristic of a system such that performance is related to N, rather than NE, even though state space necessarily is related to NE. Although our examples are delay insensitive deterministic unidirectional token rings, we believe that these concepts apply to many other paradigms of self-stabilization. © 2011 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Attic: A case study for distributing data in BOINC projects

Attic: A case study for distributing data in BOINC projects

引用

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

作者： Elwaer, AbdelHamid Harrison, Andrew Kelley, Ian Taylor, Ian School Of computer Science and Informatics Cardiff University Cardiff United Kingdom

ISBN: (纸本)9780769543857

The BOINC toolkit is a very successful software infrastructure for the development of "volunteer computing" projects. For data distribution, the standard BOINC architecture provides uses a centralized server, or fixed set of pre-configured servers, each with a copy of a project's input files. This mirrored configuration has provided a way for BOINC projects to increase the size of their user-base and manage their data as projects grow. However, such a centrally administered approach can be limiting in terms of performance metrics, such as scalability and reliability, and also for management, since such servers have to be manually installed and configured for use. In this paper, we study an alternative approach, which is capable of providing a more lightweight and dynamic environment for distributing data, called Attic. Attic makes use of a secure decentralized approach and BitTorrent-like file swarming techniques to serve data and manage load. To compare our approach to the current centralized infrastructure, we show three experiments where we have integrated Attic with BOINC;each compares how Attic performs against BOINC as fragments (chunks) of the original data file are distributed and downloaded concurrently from multiple data centers. Our results show that careful choice of chunk size, by analyzing a server's uploading capabilities and file size, can result in large throughput gains for Attic when compared to the current BOINC data distribution paths. © 2011 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Toolchain for programming, simulating and studying the XMT many-core architecture

Toolchain for programming, simulating and studying the XMT m...

引用

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

作者： Keceli, Fuat Tzannes, Alexandros Caragea, George C. Barua, Rajeev Vishkin, Uzi University of Maryland College Park United States

ISBN: (纸本)9780769543857

The Explicit Multi-Threading (XMT) is a generalpurpose many-core computing platform, with the vision of a 1000-core chip that is easy to program but does not compromise on performance. This paper presents a publicly available toolchain for XMT, complete with a highly configurable cycle-accurate simulator and an optimizing compiler. The XMT toolchain has matured and has been validated to a point where its description merits publication. In particular, research and experimentation enabled by the toolchain played a central role in supporting the ease-of-programming and performance aspects of the XMT architecture. The compiler and the simulator are also important milestones for an efficient programmer's workflow from PRAM algorithms to programs that run on the shared memory XMT hardware. This workflow is a key component in accomplishing the dual goal of ease-of-programming and performance. The applicability of our toolchain extends beyond specific XMT choices. It can be used to explore the much greater design space of shared memory many-cores by system researchers or by programmers. As the toolchain can practically run on any computer, it provides a supportive environment for teaching parallel algorithmic thinking with a programming component. Unobstructed by techniques such as decomposition-first and programming for locality, this environment may be useful in deferring the teaching of these techniques, when desired, to more advanced or platform-specific courses. © 2011 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

ECMLS'11 - Proceedings of the 2nd international Workshop on Emerging Computational Methods for the Life Sciences

ECMLS'11 - Proceedings of the 2nd International Workshop on ...

引用

2nd international Workshop on Emerging Computational Methods for the Life Sciences, ECMLS'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed computing, HPDC 2011

ISBN: (纸本)9781450307024

The proceedings contain 5 papers. The topics discussed include: a parallel random forest classifier for R;adapting bioinformatics applications for heterogeneous systems: a case study;a hierarchical framework for cross-domain MapReduce execution;characterizing deep sequencing analytics using BFAST: towards a scalable distributed architecture for next-generation sequencing data;and high-throughput virtual molecular docking: hadoop implementation of autodock4 on a private cloud.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Contention modeling for multithreaded distributed shared memory machines: The cray XMT

Contention modeling for multithreaded distributed shared mem...

引用

IEEE/ACM international symposium on Cluster, Cloud and Grid computing

作者： Secchi, Simone Tumeo, Antonino Villa, Oreste High Performance Computing Pacific Northwest National Laboratory Richland WA 99352 United States

ISBN: (纸本)9780769543956

distributed Shared Memory (DSM) machines are a wide class of multi-processor computing systems where a large virtually-shared address space is mapped on a network of physically distributed memories. High memory latency and network contention are two of the main factors that limit performance scaling of such architectures. Modern high-performance computing DSM systems have evolved towards the exploitation of massive hardware multi-threading and fine-grained memory hashing to tolerate irregular latencies, avoiding network hot-spots and improving scalability. parallel simulation is a promising approach, which has been extensively used to model the performance of such large-scale machines. One of the most critical factors in coping with the simulation speed-accuracy trade-off is network modeling. The Cray XMT is a massively multi-threaded supercomputing architecture that belongs to the DSM class. In this paper, we discuss the development of a network contention model for a full-system XMT simulator. We start by measuring the effects of network contention on a 128-processorXMT machine, we then investigate the trade-off that exists between simulation accuracy and speed, comparing three network models which operate at different levels of accuracy. The comparison and model validation is performed by executing a string-matching algorithm on the full-system simulator and on the actual machine, using three datasets that generate noticeably different contention patterns. Results prove that simulator accuracy in execution time remains within 10 of the real machine. We also show that the slowdown due to contention modeling is limited to 20, when simulating a small number of processors, and becomes negligible for simulations with higher processor counts. © 2011 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Temperature aware load balancing for parallel applications: Preliminary work

Temperature aware load balancing for parallel applications: ...

引用

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

作者： Sarood, Osman Gupta, Abhishek Kalé, Laxmikant V. Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 United States

ISBN: (纸本)9780769543857

Increasing number of cores and clock speeds on a smaller chip area implies more heat dissipation and an ever increasing heat density. This increased heat, in turn, leads to higher cooling cost and occurrence of hot spots. Effective use of dynamic voltage and frequency scaling (DVFS) can help us alleviate this problem. But there is an associated execution time penalty which can get amplified in parallel applications. In high performance computing, applications are typically tightly coupled and even a single overloaded core can adversely affect the execution time of the entire application. This makes load balancing of utmost value. In this paper, we outline a temperature aware load balancing scheme, which uses DVFS to keep core temperatures below a user-defined threshold with minimum timing penalty. While doing so, it also reduces the possibility of hot spots. We apply our scheme to three parallel applications with different energy consumption profiles. Results from our technique show that we save up to 14% in execution time and 12% in machine energy consumption as compared to frequency scaling without using load balancing. We are also able to bound the average temperature of all the cores and reduce the temperature deviation amongst the cores by a factor of 3. © 2011 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Tracking structure of streaming social networks

Tracking structure of streaming social networks

引用

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

作者： Ediger, David Riedy, Jason Bader, David A. Meyerhenke, Henning College of Computing Georgia Institute of Technology Atlanta GA United States

ISBN: (纸本)9780769543857

Current online social networks are massive and still growing. For example, Facebook has over 500 million active users sharing over 30 billion items per month. The scale within these data streams has outstripped traditional graph analysis methods. Real-time monitoring for anomalies may require dynamic analysis rather than repeated static analysis. The massive state behind multiple persistent queries requires shared data structures and flexible representations. We present a framework based on the STINGER data structure that can monitor a global property, connected components, on a graph of 16 million vertices at rates of up to 240 000 updates per second on 32 processors of a Cray XMT. For very large scale-free graphs, our implementation uses novel batching techniques that exploit the scale-free nature of the data and run over three times faster than prior methods. Our framework handles, for the first time, real-world data rates, opening the door to higher-level analytics such as community and anomaly detection. © 2011 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Automatic library generation for BLAS3 on GPUs

Automatic library generation for BLAS3 on GPUs

引用

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

作者： Cui, Huimin Wang, Lei Xue, Jingling Yang, Yang Feng, Xiaobing Institute of Computing Technology Chinese Academy of Sciences China Graduate University Chinese Academy of Sciences China School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9780769543857

High-performance libraries, the performance-critical building blocks for high-level applications, will assume greater importance on modern processors as they become more complex and diverse. However, automatic library generators are still immature, forcing library developers to manually tune library to meet their performance objectives. We are developing a new script-controlled compilation framework to help domain experts reduce much of the tedious and error-prone nature of manual tuning, by enabling them to leverage their expertise and reuse past optimization experiences. We focus on demonstrating improved performance and productivity obtained through using our framework to tune BLAS3 routines on three GPU platforms: up to 5.4x speedups over the CUBLAS achieved on NVIDIA GeForce 9800, 2.8x on GTX285, and 3.4x on Fermi Tesla C2050. Our results highlight the potential benefits of exploiting domain expertise and the relations between different routines (in terms of their algorithms and data structures). © 2011 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Achieving target MTTF by duplicating reliability-critical components in high performance computing systems

Achieving target MTTF by duplicating reliability-critical co...

引用

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

作者： Nakka, Nithin Choudhary, Alok Grider, Gary Bent, John Nunez, James Khalsa, Satsangat Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana IL United States Department of Electrical Engineering and Computer Science Northwestern University Evanston IL United States Los Alamos National Laboratories Albuquerque NM United States

ISBN: (纸本)9780769543857

Mean Time To failure, MTTF, is a commonly accepted metric for reliability. In this paper we present a novel approach to achieve the desired MTTF with minimum redundancy. We analyze the failure behavior of large scale systems using failure logs collected by Los Alamos National Laboratory. We analyze the root cause of failures and present a choice of specific hardware and software components to be made fault-tolerant, through duplication, to achieve target MTTF at minimum expense. Not all components show similar failure behavior in the systems. Our objective, therefore, was to arrive at an ordering of components to be incrementally selected for protection to achieve a target MTTF. We propose a model for MTTF for tolerating failures in a specific component, system-wide, and order components according to the coverage provided. Systems grouped based on hardware configuration showed similar improvements in MTTF when different components in them were targeted for fault-tolerance. © 2011 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 453 454 455 456 457 458 459 460 461 462 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：