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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

118 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

72 篇 工学
- 70 篇 计算机科学与技术...
- 23 篇 软件工程
- 11 篇 电气工程
- 11 篇 信息与通信工程
- 5 篇 控制科学与工程
- 3 篇 机械工程
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 2 篇 网络空间安全
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 交通运输工程
- 1 篇 安全科学与工程
15 篇 理学
- 11 篇 数学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
9 篇 管理学
- 6 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

17 篇 distributed comp...
7 篇 hardware
6 篇 parallel computi...
6 篇 cloud computing
5 篇 parallel process...
5 篇 scalability
5 篇 prototypes
5 篇 optimization
4 篇 parallel algorit...
4 篇 computational mo...
4 篇 real-time system...
4 篇 distributed data...
3 篇 internet of thin...
3 篇 runtime
3 篇 computer archite...
3 篇 throughput
3 篇 quality of servi...
3 篇 processor schedu...
3 篇 load management
3 篇 federated learni...

机构

2 篇 universidad cató...
2 篇 technopôle domol...
2 篇 e2s uppa univers...
2 篇 universidad simó...
2 篇 georgia inst tec...
2 篇 vsb-technical un...
2 篇 otto von guerick...
2 篇 sysgo prague cze...
2 篇 universidad inte...
2 篇 univ hamburg ham...
2 篇 western norway u...
2 篇 stanford univ de...
2 篇 universität hamb...
2 篇 bosch stuttgart
2 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 harbin institute...
2 篇 stanford univ de...
2 篇 thales italy flo...
2 篇 otto von guerick...

作者

2 篇 jiang wei
2 篇 laudan janek
2 篇 jannek squar
2 篇 wagner meira jr.
2 篇 squar jannek
2 篇 bader david a.
2 篇 pande vijay s.
2 篇 michael kuhn
2 篇 janek laudan
2 篇 liu jie
2 篇 anna fuchs
2 篇 kuhn michael
2 篇 heinrich paul
2 篇 beberg adam l.
2 篇 jerry chun-wei l...
2 篇 yuanfa li
2 篇 wang qinglin
2 篇 fuchs anna
2 篇 madduri kamesh
2 篇 sheikh ghafoor

语言

121 篇 英文

检索条件"任意字段=23rd International Symposium on Parallel and Distributed Computing, ISPDC 2024"

共 121 条记录，以下是41-50 订阅

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

详细简洁

排序：

Improving parallel I/O autotuning with performance modeling 14

Improving parallel I/O autotuning with performance modeling

引用

23rd ACM symposium on High-Performance parallel and distributed computing, HPDC 2014

作者： Behzad, Babak Byna, Surendra Wild, Stefan M. Prabhat Snir, Marc Univ. of Illinois Urbana-Champaign United States Lawrence Berkeley Laboratory United States Argonne National Laboratory United States

ISBN: (纸本)9781450327480

Various layers of the parallel I/O subsystem offer tunable parameters for improving I/O performance on large-scale computers. However, searching through a large parameter space is challenging. We are working towards an autotuning framework for determining the parallel I/O parameters that can achieve good I/O performance for different data write patterns. In this paper, we characterize parallel I/O and discuss the development of predictive models for use in effectively reducing the parameter space. Applying our technique on tuning an I/O kernel derived from a large-scale simulation code shows that the search time can be reduced from 12 hours to 2 hours, while achieving 54X I/O performance speedup. Copyright © 2014 ACM.

关键词： optimization autotuning performance modeling performance parallel i/o

来源：评论

学校读者我要写书评

暂无评论

Predictive and distributed routing balancing on high-speed cluster networks

Predictive and distributed routing balancing on high-speed c...

引用

23rd international symposium on Computer Architecture and High Performance computing, SBAC-PAD 2011

作者： Castillo, Carlos Núñez Lugones, Diego Franco, Daniel Luque, Emilio Computer Architecture and Operating Systems Department Universitat Autònoma de Barcelona Spain

ISBN: (纸本)9780769545738

In high performance clusters current parallel application communication needs such as traffic pattern, communication volume, etc., change along time and are difficult to know in advance. Such needs often exceed or do not match available resources causing resource use imbalance, network congestion, throughput reduction and message latency increase, thus degrading the overall system performance. Studies on parallel applications show repetitive behavior that can be characterized by a set of representative phases. This work presents a Predictive and distributed Routing Balancing (PrdRB) technique, a new method developed to gradually control network congestion, based on paths expansion, traffic distribution, applications pattern repetitiveness and speculative adaptive routing, in order to maintain low latency values. PrdRB monitors messages latencies on routers and logs solutions to congestion, to quickly respond in future similar situations. Traffic congestion experiments were conducted in order to evaluate the performance of the method, and improvements were observed. © 2011 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

MIC-check: A distributed checkpointing framework for the Intel many integrated cores architecture 14

MIC-check: A distributed checkpointing framework for the Int...

引用

23rd ACM symposium on High-Performance parallel and distributed computing, HPDC 2014

作者： Rajachandrasekar, Raghunath Potluri, Sreeram Venkatesh, Akshay Hamidouche, Khaled Wasi-Ur-Rahman, Md. Panda, Dhabaleswar K. Ohio State University United States

ISBN: (纸本)9781450327480

The advent of many-core architectures like Intel MIC is enabling the design of increasingly capable supercomputers within reasonable power budgets. Fault-tolerance is becoming more important with the increased number of components and the complexity in these heterogeneous clusters. Checkpoint-restart mechanisms have been traditionally used to enhance the dependability of applications, and to enable dynamic task rescheduling in the face of system failures. Naive checkpointing protocols, which are predominantly I/O-intensive, face severe performance bottlenecks on the Xeon Phi architecture due to several inherent and acquired limitations. Consequently, existing checkpointing frameworks are not capable of serving distributed MPI applications that leverage heterogeneous hardware architectures. This paper discusses the I/O limitations on the Xeon Phi system, and describes the architecture and design of a novel distributed checkpointing framework, namely MIC-Check, for HPC applications running on it. Copyright © 2014 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Small-File Access in parallel File Systems

Small-File Access in Parallel File Systems

引用

23rd IEEE international parallel and distributed Processing symposium

作者： Carns, Philip Lang, Sam Ross, Robert Vilayannur, Murali Kunkel, Julian Ludwig, Thomas Argonne Natl Lab Div Math & Comp Sci 9700 S Cass Ave Argonne IL 60439 USA VMware Inc Palo Alto CA 94304 USA Heidelberg Univ Inst Comp Sci Heidelberg Germany

ISBN: (纸本)9781424437511

Today's computational science demands have resulted in ever larger parallel computers, and storage systems have grown to match these demands. parallel file systems used in this environment are increasingly specialized to extract the highest possible performance for large I/O operations, at the expense of other potential workloads. While some applications have adapted to I/O best practices and can obtain good performance on these systems, the natural I/O patterns of many applications result in generation of many small files. These applications are not well served by current parallel file systems at very large scale. This paper describes five techniques for optimizing small-file access in parallel file systems for very large scale systems. These five techniques are all implemented in a single parallel file system (PVFS) and then systematically assessed on two test platforms. A microbenchmark and the mdtest benchmark are used to evaluate the optimizations at an unprecedented scale. We observe as much as a 905% improvement in small-file create rates, 1,106% improvement in small-file stat rates, and 727% improvement in small-file removal rates, compared to a baseline PVFS configuration on a leadership computing platform using 16,384 cores.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Bobolang - A language for parallel streaming applications 14

Bobolang - A language for parallel streaming applications

引用

23rd ACM symposium on High-Performance parallel and distributed computing, HPDC 2014

作者： Falt, Zbynek Bednárek, David Kruliš, Martin Yaghob, Jakub Zavoral, Filip Charles University in Prague Faculty of Mathematics and Physics Czech Republic

ISBN: (纸本)9781450327480

At present time, the programmers may choose from a number of streaming languages. They cover various aspects of the development process of streaming applications;however, specification of complex or runtime-dependent parts of the applications still remains a great challenge. We have analysed a large amount of requirements raised by the development of multiple data streaming parallel applications and proposed a novel language called Bobolang. It contains syntactic and semantic features which allow the programmer to naturally solve most of the problems, which we met in the design of streaming applications. The language is used to specify the structure of the whole application as well as the inner structure of each operator. Thanks to the properties of the language, Bobolang can create an optimized evaluation plan which is capable of making the best use of the available hardware resources. The language has been employed in several practical problems and it has proven itself to be a very powerful tool for the development of data-intensive parallel applications. Copyright © 2014 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 23rd international symposium on Computer Architecture and High Performance computing, SBAC-PAD 2011

Proceedings - 23rd International Symposium on Computer Archi...

引用

23rd international symposium on Computer Architecture and High Performance computing, SBAC-PAD 2011

ISBN: (纸本)9780769545738

The proceedings contain 26 papers. The topics discussed include: accelerating maximum likelihood based phylogenetic kernels using network-on-chip;high performance by exploiting information locality through reverse computing;workload balancing methodology for data-intensive applications with divisible load;predictive and distributed routing balancing on high-speed cluster networks;rapid development of error-free architectural simulators using dynamic runtime testing;classification and elimination of conflicts in hardware transactional memory systems;structure-constrained microcode compression;improving the accuracy of high performance BLAS implementations using adaptive blocked algorithms;parallel biological sequence comparison on heterogeneous high performance computing platforms with BSP++;computing properties of large scalable and fault-tolerant logical networks;and speeding up learning in real-time search through parallel computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Why online dynamic mesh refinement is better for parallel climatological models

Why online dynamic mesh refinement is better for parallel cl...

引用

23rd international symposium on Computer Architecture and High Performance computing, SBAC-PAD 2011

作者： Schepke, Claudio Maillard, Nicolas Schneider, Joerg Heiss, Hans-Ulrich Caixa Postal 15.064 91.501-970 - Porto Alegre - RS Brazil Einsteinufer 17 10587 Berlin Germany

ISBN: (纸本)9780769545738

Forecast precisions of climatological models are limited by computing power and time available for the executions. As more and faster processors are used in the computation, the resolution of the mesh adopted to represent the Earth's atmosphere can be increased, and consequently the numerical forecast is more accurate and shows local phenomena. However, a finer mesh resolution, able to include local phenomena in a global atmosphere integration, is still not possible. To overcome this situation, different mesh refinement levels can be used at the same time for different areas. In this context, this paper evaluates how mesh refinement at run time can improve performance for climatological models. In order to contribute with this analysis, an online dynamic mesh refinement was developed. It increases mesh resolution in parts of a parallel distributed model, when special atmosphere conditions are registered during the execution. The results show that the parallel execution of this improvement provides better resolution for the meshes, without a significant increase of execution time. © 2011 IEEE.

关键词： Earth atmosphere

来源：评论

学校读者我要写书评

暂无评论

Supporting correlation analysis on scientific datasets in parallel and distributed settings 14

Supporting correlation analysis on scientific datasets in pa...

引用

23rd ACM symposium on High-Performance parallel and distributed computing, HPDC 2014

作者： Su, Yu Agrawal, Gagan Woodring, Jonathan Biswas, Ayan Shen, Han-Wei Computer Science and Engineering Ohio State University Columbus OH 43210 United States Los Alamos National Laboratory Los Alamos NM 87544 United States

ISBN: (纸本)9781450327480

With growing computational capabilities of parallel machines, scientific simulations are being performed at finer spatial and temporal scales, leading to a data explosion. Careful analysis of this data holds much promise for future scientific discoveries. Particularly, correlation analysis, which focuses on studying the potential relationships among multiple variables, is becoming a useful method for scientific analysis. This paper focuses on the problem of correlation analysis across large-scale simulation datasets, including 1) accelerating this analysis with the use of bitmap indexing as a representative summary of the data, 2) developing efficient algorithms for parallel execution, 3) performing analysis in distributed environments, i.e., for cases where different attributes are stored in geographically distributed repositories, and 4) combining sampling with correlation analysis. These algorithms have been implemented in a system that provides a high-level API for specification of the analyses, including allowing correlation analysis on specified value-based and dimension-based subsets of the data, and supports interactive and incremental analysis. We have extensively evaluated our framework for efficiency, and have also carried out case studies with domain scientists to establish how it can aid datadriven discovery process. Copyright © 2014 ACM.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Computation and communication efficient graph processing with distributed immutable view 14

Computation and communication efficient graph processing wit...

引用

23rd ACM symposium on High-Performance parallel and distributed computing, HPDC 2014

作者： Chen, Rong Ding, Xin Wang, Peng Chen, Haibo Zang, Binyu Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450327480

Cyclops is a new vertex-oriented graph-parallel framework for writing distributed graph analytics. Unlike existing distributed graph computation models, Cyclops retains simplicity and computation-efficiency by synchronously computing over a distributed immutable view, which grants a vertex with read-only access to all its neighboring vertices. The view is provided via readonly replication of vertices for edges spanning machines during a graph cut. Cyclops follows a centralized computation model by assigning a master vertex to update and propagate the value to its replicas unidirectionally in each iteration, which can significantly reduce messages and avoid contention on replicas. Being aware of the pervasively available multicore-based clusters, Cyclops is further extended with a hierarchical processing model, which aggregates messages and replicas in a single multicore machine and transparently decomposes each worker into multiple threads ondemand for different stages of computation. We have implemented Cyclops based on an open-source Pregel clone called Hama. Our evaluation using a set of graph algorithms on an in-house multicore cluster shows that Cyclops outperforms Hama from 2.06X to 8.69X and 5.95X to 23.04X using hash-based and Metis partition algorithms accordingly, due to the elimination of contention on messages and hierarchical optimization for the multicore-based clusters. Cyclops (written in Java) also has comparable performance with PowerGraph (written in C++) despite the language difference, due to the significantly lower number of messages and avoided contention. Copyright © 2014 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Speculative symbolic execution

Speculative symbolic execution

引用

2012 IEEE 23rd international symposium on Software Reliability Engineering, ISSRE 2012

作者： Zhang, Yufeng Chen, Zhenbang Wang, Ji National Laboratory for Parallel and Distributed Processing Department of Computing Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769548883

Symbolic execution is an effective path oriented and constraint based program analysis technique. Recently, there is a significant development in the research and application of symbolic execution. However, symbolic execution still suffers from the scalability problem in practice, especially when applied to large-scale or very complex programs. In this paper, we propose a new fashion of symbolic execution, named Speculative Symbolic Execution (SSE), to speed up symbolic execution by reducing the invocation times of constraint solver. In SSE, when encountering a branch statement, the search procedure may speculatively explore the branch without regard to the feasibility. Constraint solver is invoked only when the speculated branches are accumulated to a specified number. In addition, we present a key optimization technique that enhances SSE greatly. We have implemented SSE and the optimization technique on Symbolic Pathfinder (SPF). Experimental results on six programs show that, our method can reduce the invocation times of constraint solver by 20.7% to 48.7% (with an average of 29.9%), and save the search time from 23.6% to 43.6% (with an average of 30%). © 2012 IEEE.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：