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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

127 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

120 篇 工学
- 118 篇 计算机科学与技术...
- 102 篇 电气工程
- 9 篇 软件工程
- 4 篇 信息与通信工程
- 2 篇 网络空间安全
- 1 篇 机械工程
- 1 篇 控制科学与工程
6 篇 理学
- 6 篇 数学
- 1 篇 统计学（可授理学、...
5 篇 管理学
- 4 篇 管理科学与工程(可...
- 2 篇 工商管理
- 2 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学

主题

12 篇 gpu
8 篇 distributed proc...
6 篇 conferences
6 篇 parallel program...
6 篇 distributed comp...
5 篇 computational mo...
5 篇 distributed algo...
4 篇 parallel algorit...
4 篇 graph algorithms
4 篇 approximation al...
4 篇 fault tolerance
4 篇 cuda
4 篇 distributed syst...
4 篇 parallel computi...
4 篇 parallel
4 篇 high performance...
4 篇 instruction sets
4 篇 graphics process...
3 篇 parallel process...
3 篇 parallelism

机构

3 篇 lawrence berkele...
2 篇 georgia inst tec...
2 篇 georgia state un...
2 篇 bordeaux inp tal...
2 篇 inst univ france
2 篇 lawrence berkele...
2 篇 virginia tech bl...
2 篇 dept. of electri...
2 篇 ohio state univ ...
2 篇 indian inst tech...
2 篇 indian stat inst...
1 篇 ws02 inc colombo...
1 篇 department of el...
1 篇 department of co...
1 篇 univ calif berke...
1 篇 univ erlangen nu...
1 篇 indian inst sci ...
1 篇 seoul natl univ ...
1 篇 niccolo cusano u...
1 篇 univ hong kong d...

作者

3 篇 buluc aydin
3 篇 yelick katherine
2 篇 oliker leonid
2 篇 mondal kaushik
2 篇 feng wu-chun
2 篇 prasanna viktor
2 篇 özgüner f.
2 篇 doǧan a.
2 篇 lumsdaine andrew
2 篇 azad ariful
2 篇 saule erik
2 篇 moses william k....
2 篇 trystram denis
2 篇 choudhury neel
2 篇 wickramaarachchi...
2 篇 faverge mathieu
2 篇 molla anisur rah...
2 篇 simmhan yogesh
2 篇 vuduc richard
1 篇 pouchet louis-no...

语言

130 篇 英文

检索条件"任意字段=29th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015"

共 130 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings - 2015 ieee 29th international parallel and distributed processing symposium, ipdps 2015

Proceedings - 2015 IEEE 29th International Parallel and Dist...

引用

29th ieee international parallel and distributed processing symposium, ipdps 2015

ISBN: (纸本)9781479986484

the proceedings contain 109 papers. the topics discussed include: balanced coloring for parallel computing applications;high-performance graph analytics on manycore processors;scalable community detection with the Louvain algorithm;cooperative computing for autonomous data centers;divide and conquer symmetric tridiagonal eigensolver for multicore architectures;contention-based nonminimal adaptive routing in high-radix networks;identifying the culprits behind network congestion;embedding nonblocking multicast virtual networks in fat-tree data centers;cashmere: heterogeneous many-core computing;a scheduling and runtime framework for a cluster of heterogeneous machines with multiple accelerators;hierarchical DAG scheduling for hybrid distributed systems;pushing the performance envelope of modular exponentiation across multiple generations of GPUs;and addressing fairness in SMT multicores with a progress-aware scheduler.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2015 ieee 29th international parallel and distributed processing symposium Workshops, ipdpsW 2015

Proceedings - 2015 IEEE 29th International Parallel and Dist...

引用

29th ieee international parallel and distributed processing symposium Workshops, ipdpsW 2015

ISBN: (纸本)0769555101

the proceedings contain 143 papers. the topics discussed include: bridging the gap between performance and bounds of Cholesky factorization on heterogeneous platforms;efficient message logging to support process replicas in a volunteer computing environment;early multi-node performance evaluation of a knights corner (KNC) Based NASA supercomputer;mini-NOVA: a lightweight ARM-based virtualization microkernel supporting dynamic partial reconfiguration;real-time multiprocessor architecture for sharing stream processing accelerators;relocation-aware floorplanning for partially-reconfigurable FPGA-based systems;experiences with compiler support for processors with exposed pipelines;performance modeling of matrix multiplication on 3d memory integrated FPGA;enhancing speedups for FPGA accelerated SPICE through frequency scaling and precision reduction;and an automated high-level design framework for partially reconfigurable FPGAs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

29th ieee international parallel & distributed processing symposium

引用

Computer 2014年第11期47卷 c3-c3页

Describes the above-named upcoming conference event. May include topics to be covered or calls for papers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distinct Random Sampling from a distributed Stream 29

Distinct Random Sampling from a Distributed Stream

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Chung, Yung-Yu Tirthapura, Srikanta Iowa State Univ 2215 Coover Hall Ames IA 50011 USA

ISBN: (纸本)9781479986484

We consider continuous maintenance of a random sample of distinct elements from a massive data stream, whose input elements are observed at multiple distributed sites that communicate via a central coordinator. At any point, when a query is received at the coordinator, it responds with a random sample from the set of all distinct elements observed at the different sites so far. We present the first algorithms for distinct random sampling from a distributed stream. We also present a lower bound on the expected number of messages that must be transmitted by any distributed algorithm, showing that our algorithm is message optimal to within a factor of four. We present extensions to sliding windows, and experimental results showing the performance of our algorithm on real-world data sets.

关键词： Distinct Sampling Random Sampling distributed Stream Mining Distinct Elements

来源：评论

学校读者我要写书评

暂无评论

An Automated Framework for Decomposing Memory Transactions to Exploit Partial Rollback 29

An Automated Framework for Decomposing Memory Transactions t...

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Dhoke, Aditya Palmieri, Roberto Ravindran, Binoy Virginia Tech Blacksburg VA 24061 USA

ISBN: (纸本)9781479986484

In this paper, we present a framework that automatically decomposes programmer-written flat transactions into closed-nested transactions. the framework relies on two key mechanisms for the decomposition. the first is a static tool that analyzes application source code and produces a compact representation of transactions' business logic. the second is a runtime monitor that captures the actual contention level of shared objects and, relying on the outcome of the static tool, triggers the optimal closed-nested configuration for the workload at hand. We implemented this framework atop QR-CN, an open source fault-tolerant DTM written in Java. Our experimental studies conducted using the TPC-C, Vacation and Bank benchmarks reveal that the framework yields better performance than flat nesting and manual closed nesting, especially when the workload changes.

关键词： Transaction Nesting distributed Transactional Memory Adaptivity

来源：评论

学校读者我要写书评

暂无评论

Optimizing Sparse Matrix Operations on GPUs using Merge Path 29

Optimizing Sparse Matrix Operations on GPUs using Merge Path

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Dalton, Steven Olson, Luke Baxter, Sean Merrill, Duane Garland, Michael Univ Illinois Dept Comp Sci Urbana IL 61821 USA Nvidia Res Santa Clara CA 95050 USA

ISBN: (纸本)9781479986484

Irregular computations on large workloads are a necessity in many areas of computational science. Mapping these computations to modern parallel architectures, such as GPUs, is particularly challenging because the performance often depends critically on the choice of data-structure and algorithm. In this paper, we develop a parallel processing scheme, based on Merge Path partitioning, to compute segmented row-wise operations on sparse matrices that exposes parallelism at the granularity of individual nonzeros entries. Our decomposition achieves competitive performance across many diverse problems while maintaining predictable behavior dependent only on the computational work and ameliorates the impact of irregularity. We evaluate the performance of three sparse kernels: SpMV, SpAdd and SpGEMM. We show that our processing scheme for each kernel yields comparable performance to other schemes in many cases and our performance is highly correlated, nearly 1, to the computational work irrespective of the underlying structure of the matrices.

关键词： parallel gpu sparse matrix-matrix sorting

来源：评论

学校读者我要写书评

暂无评论

Online Top-k-Position Monitoring of distributed Data Streams 29

Online Top-<i>k</i>-Position Monitoring of Distributed Data ...

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Maecker, Alexander Malatyali, Manuel Heide, Friedhelm Meyer Auf Der Univ Paderborn Heinz Nixdorf Inst Paderborn Germany Univ Paderborn Dept Comp Sci Paderborn Germany

ISBN: (纸本)9781479986484

Consider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k nodes currently observing the largest values, for a given k between 1 and n. We design and analyze an algorithm that solves this problem while bounding the amount of messages exchanged between the nodes and the coordinator. Our algorithm employs the idea of using filters which, intuitively speaking, leads to few messages to be sent, if the new input is "similar" to the previous ones. the algorithm uses a number of messages that is on expectation by a factor of O((log Delta + k) . log n) larger than that of an offline algorithm that sets filters in an optimal way, where Delta is upper bounded by the largest value observed by any node.

关键词： continuous computation distributed maximum distributed monitoring online data streams top-k tracking

来源：评论

学校读者我要写书评

暂无评论

2W-FD: A Failure Detector Algorithm with QoS 29

2W-FD: A Failure Detector Algorithm with QoS

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Tomsic, Alejandro Z. Sens, Pierre Garcia, Joao Arantes, Luciana Sopena, Julien Univ Paris 06 Sorbonne Univ CNRS InriaLIP6 F-75005 Paris France Univ Lisbon Inst Super Tecn P-1699 Lisbon Portugal

ISBN: (纸本)9781479986484

Failure detection plays a central role in the engineering of distributed systems. Furthermore, many applications have timing constraints and require failure detectors that provide quality of service (QoS) with some quantitative timeliness guarantees. therefore, they need failure detectors that are fast and accurate. We introduce the Two Windows Failure Detector (2W-FD), an algorithm that provides QoS and is able to react to sudden changes in network conditions, a property that currently existing algorithms do not satisfy. We ran tests on real traces and compared the 2W-FD to state-of-the-art algorithms. Our results show that our algorithm presents the best performance in terms of speed and accuracy in unstable scenarios.

关键词： Failure Detectors Quality of Service Fault Tolerance distributed Algorithms Reliability Quiescence

来源：评论

学校读者我要写书评

暂无评论

LUC: Limiting the Unintended Consequences of power scaling on parallel transaction-oriented workloads 29

LUC: Limiting the Unintended Consequences of power scaling o...

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Chang, Hung-Ching Li, Bo Back, Godmar Butt, Ali R. Cameron, Kirk W. Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA

ISBN: (纸本)9781479986484

Following an exhaustive set of experiments, we identify slowdowns in I/O performance that occur when processor power and frequency are increased. Our initial analyses indicate slowdowns are more likely to occur and more acute when the number of parallel I/O threads increases and the variability between runs is high. We use a microbenchmark-driven methodology to simplify isolation of the root causes of I/O performance loss. We classify the observed performance loss into two categories: file synchronization and file write delays. We introduce LUC, a runtime system to Limit the Unintended Consequences of power scaling and dynamically improve I/O performance. We demonstrate the effectiveness of the LUC system running on two platforms for two critical parallel transaction-oriented workloads including a mail server (varMail) and online transaction processing (oltp).

关键词： parallel and distributed processing I/O performance power runtime systems

来源：评论

学校读者我要写书评

暂无评论

3D Cartesian Transport Sweep for Massively parallel Architectures with PARSEC 29

3D Cartesian Transport Sweep for Massively Parallel Architec...

引用

29th ieee international parallel and distributed processing symposium (ipdps)

作者： Moustafa, Salli Faverge, Mathieu Plagne, Laurent Ramet, Pierre EDF R&D 1 Ave Gen Gaulle F-92141 Clamart France INRIA Bordeaux Sud Ouest LaBRI Talence France Univ Bordeaux Talence France Bordeaux INP Talence France

ISBN: (纸本)9781479986484

High-fidelity nuclear power plant core simulations require solving the Boltzmann transport equation. In discrete ordinates methods, the most computationally demanding operation of this equation is the sweep operation. Considering the evolution of computer architectures, we propose in this paper, as a first step toward heterogeneous distributed architectures, a hybrid parallel implementation of the sweep operation on top of the generic task-based runtime system: PARSEC. Such an implementation targets three nested levels of parallelism: message passing, multi-threading, and vectorization. A theoretical performance model was designed to validate the approach and help the tuning of the multiple parameters involved in such an approach. the proposed parallel implementation of the Sweep achieves a sustained performance of 6.1 Tflop/s, corresponding to 33.9% of the peak performance of the targeted supercomputer. this implementation compares favorably with state-of-art solvers such as PARTISN;and it can therefore serve as a building block for a massively parallel version of the neutron transport solver DOMINO developed at EDF.

关键词： 3D Sweep distributed computing Hybrid parallelism Computational model Task-Based Programing Model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：