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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是321-330 订阅

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

详细简洁

排序：

Performance characterization and optimization of parallel I/O on the Cray XT

Performance characterization and optimization of parallel I/...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Yu, Weikuan Vetter, Jeffrey S. Oral, H. Sarp Oak Ridge Natl Lab Oak Ridge TN 37831 USA

ISBN: (纸本)9781424416936

this paper presents an extensive characterization, tuning, and optimization of parallel PO on the Cray XT supercomputer, named Jaguar, at Oak Ridge National Laboratory. We have characterized the performance and scalability for different levels of storage hierarchy including a single Lustre object storage target, a single S2A storage couplet, and the entire system. Our analysis covers both data- and metadata-intensive I/O patterns. In particular, for small, non-contiguous data-intensive I/O on Jaguar, we have evaluated several parallel I/O techniques, such as data sieving and two-phase collective I/O, and shed light on their effectiveness. Based on our characterization, we have demonstrated that it is possible, and often prudent, to improve the I/O performance of scientific benchmarks and applications by tuning and optimizing I/O. For example, we demonstrate that the I/O performance of the S3D combustion application can be improved at large scale by tuning the I/O system to avoid a bandwidth degradation of 49% with 8192 processes when compared to 4096 processes. We have also shown that the performance of Flash I/O can be improved by 34% by tuning the collective I/O parameters carefully.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Massively parallel cosmological simulations with ChaNGa

Massively parallel cosmological simulations with ChaNGa

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Jetley, Pritish Gioachin, Filippo Mendes, Celso Kale, Laxmikant V. Quinn, thomas Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Univ Washington Dept Astron Seattle WA 98195 USA

ISBN: (纸本)9781424416936

Cosmological simulators are an important component in the study of the formation of galaxies and large scale structures, and can help answer many important questions about the universe. Despite their utility, existing parallel simulators do not scale effectively on modern machines containing thousands of processors. In this paper we present ChaNGa, a recently released production simulator based on the CHARM++ infrastructure. To achieve scalable performance, ChaNGa employs various optimizations that maximize the overlap between computation and communication. We present experimental results of ChaNGa simulations on machines with thousands of processors, including the IBM Blue Gene/L and the Cray XT3. the paper goes on to highlight efforts toward even more efficient and scalable cosmological simulations. In particular, novel load balancing schemes that base decisions on certain characteristics of tree-based particle codes are discussed. Further, the multistepping capabilities of ChaNGa are presented, as are solutions to the load imbalance that such multiphase simulations face. We outline key requirements for an effective practical implementation and conclude by discussing preliminary results from simulations run with our multiphase load balancer.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Optimal replication transition strategy in distributed hierarchical systems

Optimal replication transition strategy in distributed hiera...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Hsu, Chun-Chen Wang, Chien-Min Liu, Pangfeng Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10764 Taiwan Acad Sinica Inst Informat Sci Nankang Taiwan Natl Taipei Univ Grad Inst Networking & Multimedia New Taipei 23741 Taiwan

ISBN: (纸本)9781424416936

We study the replication transition problem in distributed hierarchical systems. Most distributed systems replicate data to increase data access efficiency. A replication strategy dictates where the replicas are stored in respond to the data access pattern, therefore a good strategy can effectively improve data access efficiency. However the access pattern in a distributed system is constantly changing. As a result, a good replication strategy must evolve accordingly. the replication transition problem is to seek an efficient transition from one replication strategy to another in order to cope with the dynamic access pattern. this paper focuses on solving the replication transition problem on tree topology, which is one of the most important models in Data Grid systems and web proxy systems from the literature. To the best of our knowledge, our work is the first that proposes an optimal algorithm for the replication transition problem on tree topology. the algorithm has a time complexity of O(n log Delta log(n Lambda)), where n is the number of sites, A is the maximum degree in the tree and A is the largest communication delay in the network.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

A prefetching scheme for energy conservation in parallel disk systems

A prefetching scheme for energy conservation in parallel dis...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Manzanares, Adam Bellani, Kiramnai Qin, Xiao Auburn Univ Dept Comp Sci & Software Engn Auburn AL 36830 USA

ISBN: (纸本)9781424416936

Large-scale parallel disk systems are frequently used to meet the demands of information systems requiring high storage capacities. 4 critical problem with these large-scale parallel disk systems is the fact that disks consume a significant amount of energy. To design economically attractive and environmentally friendly parallel disk systems, we developed two energy-aware prefetching strategies for parallel disk systems with disk buffers. First, we introduce a new buffer disk architecture that can provide significant energy savings for parallel disk systems while achieving high performance. Second, we design a prefetching approach to utilize an extra disk to accommodate prefetched data sets that are frequently accessed. third, we develop a second prefetching strategy that makes use of an existing disk in the parallel disk system as a buffer disk. Compared with the first prefetching scheme, the second approach lowers the capacity of the parallel disk system. However, the second approach is more cost-effective and energy-efficient than the first prefetching technique. Finally, we quantitatively compare both of our prefetching approaches against two conventional strategies including a dynamic power management technique and a non-energy-aware scheme. Using empirical results we show that our novel prefetching approaches are able to reduce energy dissipation in parallel disk systems by 44% and 50% when compared against a non-energy aware approach. Similarly, our strategies are capable of conserving 22% and 30% of the energy when compared to the dynamic power management technique.

关键词： Energy dissipation

来源：评论

学校读者我要写书评

暂无评论

Randomized Algorithms for Mapping Clustered Object-Oriented Software onto distributed Architectures

Randomized Algorithms for Mapping Clustered Object-Oriented ...

引用

ieee International symposium on Signal processing and Information Technology

作者： Hamad, Safwat H. Ammar, Reda A. Khalifa, Mohamed E. Fergany, Tahany Ain Shams Univ Fac Comp & Informat Sci Cairo Egypt Univ Connecticut Dept Comp Sci & Engn Storrs CT USA Univ New Haven Dept Comp Sci West Haven CT USA

ISBN: (纸本)9781424435548

distributed Object Oriented (DOO) applications have been developed for solving complex problems in various scientific fields. One of the most important aspects of the DOO systems is the efficient distribution of software classes among different nodes in order to solve the mismatch problem that may appear when the software structure does not match up the available hardware organization. We have proposed a multistep approach for restructuring DOO software. According to this approach, the OO system is partitioned into clusters that are then merged into lager groups forming what we call Merged Cluster Graph. the last step in this approach is concerned by mapping these merged clusters onto the target distributed architecture. Generally, the mapping problem is intractable thus allowing only for efficient heuristics. this paper presents two algorithms to solve the mapping problem using a randomized approach. the proposed algorithms has proved to be efficient, Simple and easy to understand and implement. Furthermore, the performance of the proposed algorithms was tested against some existing deterministic techniques. the experimental results showed an outstanding performance of the proposed algorithms in minimizing the overall mapping cost of the produced assignments.

关键词： randomized algorithms Software Frameworks object orientation computer software ARCHITECTURE computer programs Distribute Surjective

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of tabu search method for job scheduling in distributed environments

Design and evaluation of tabu search method for job scheduli...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Xhafa, Fatos Carretero, Javier Alba, Enrique Dorronsoro, Bernabe Dept. of Languages and Informatics Systems Polytechnic University of Catalonia Spain Dept. of Languages and Computer Science University of Málaga Spain Faculty of Science Technology and Communication University of Luxembourg Luxembourg Luxembourg

ISBN: (纸本)9781424416936

the efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications. the scheduling problem is computationally hard even when there are no dependencies among jobs. thus, we present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We consider the job scheduling as a bi-objective optimization problem consisting of the minimization of the makespan and flowtime. the bi-objectivity is tackled through a hierarchic approach in which makespan is considered a primary objective and flowtime a secondary one. An extensive experimental study has been first conducted in order to fine-tune the parameters of our TS algorithm. then, our tuned TS is compared versus two well known TS algorithms in the literature (one of them is hybridized with an ant colony optimization algorithm)for the problem. the computational results show that our TS implementation clearly outperforms the compared algorithms. Finally, we evaluated the performance of our TS algorithm on a new set of instances that better fits with the concept of computational grid. these instances are composed of a higher number of -heterogeneous- machines (up to 256) and emulate the dynamic behavior of these systems.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

parallel implementations of three scientific applications using LB_Migrate

Parallel implementations of three scientific applications us...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Chaube, Rohit Banicescu, Ioana Carino, Ricolindo L. Mississippi State Univ Dept Elect & Comp Engn Mississippi State MS USA Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS USA Mississippi State Univ Ctr Computat Sci Mississippi State MS USA Mississippi State Univ Ctr Adv Vehicular Syst Mississippi State MS USA

ISBN: (纸本)9781424416936

In this paper we focus on the implementation of large scientific applications with LB_Migrate, a dynamic load balancing library. the library employs dynamic loop scheduling techniques to address performance degradation factors due to load imbalance, provides a flexible interface with the native data structure of the application, and performs data migration. the library is reusable and it is not application specific. For initial testing, the library was employed in three applications: the profiling of an automatic quadrature routine, the simulation of a hybrid model for image denoising, and N-body simulations. We discuss the original applications without the library, the changes made to the applications to be able to interface with the library, and we present experimental results. Performance results indicate that the library adds minimal overhead, up to 6%, and it varies from application to application. However the benefits gained from the use of the library are substantial.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Optimizing network performance of computing pipelines in distributed environments

Optimizing network performance of computing pipelines in dis...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Wu, Qishi Gu, Yi Zhu, Mengxia Rao, Nageswara S. V. Univ Memphis Dept Comp Sci Memphis TN 38152 USA So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA Oak Ridge Natl Lab Div Math & Comp Sci Oak Ridge TN 37831 USA

ISBN: (纸本)9781424416936

Supporting high performance computing pipelines over wide-area networks is critical to enabling large-scale distributed scientific applications that require fast responses for interactive operations or smooth flows for data streaming. We construct analytical cost models for computing modules, network nodes, and communication links to estimate the computing times on nodes and the data transport times over connections. Based on these time estimates, we present the Efficient Linear Pipeline Configuration method based on dynamic programming that partitions the pipeline modules into groups and strategically maps them onto a set of selected computing nodes in a network to achieve minimum end-to-end delay or maximum frame rate. We implemented this method and evaluated its effectiveness with experiments on a large set of simulated application pipelines and computing networks. the experimental results show that the proposed method outperforms the Streamline and Greedy algorithms. these results, together with polynomial computational complexity, make our method a potential scalable solution for large practical deployments.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

On the Optimization of Resource Utilization in distributed Multimedia Applications 08

On the Optimization of Resource Utilization in Distributed M...

引用

8th ieee International symposium on Cluster Computing and the Grid

作者： Yang, R. van der Mei, R. D. Roubos, D. Seinstra, F. J. Koole, G. M. Vrije Univ Amsterdam Fac Sci NL-1081 HV Amsterdam Netherlands

ISBN: (纸本)9781424442379

the application and research area of Multimedia Content Analysis (MAICA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and archives. In recent years, there has been a tremendous growth in the MMCA application domain (for real-time and off-line execution scenarios alike), and this growth is likely to continue in the near future. Multimedia applications operated in a real-time environment pose very strict requirements on the obtained processing times, while off-line applications have to perform within 'tolerable' time frames. To meet these requirements, large-scale multimedia applications typically are being executed on Grid systems consisting of large collections of compute clusters. For optimized use of resources, it is essential to determine the optimal number of compute nodes per cluster, properly dealing with the perceived computation versus communication ratio. this ratio generally depends on the characteristics of the application at hand, and on the software and hardware specifics of the computational environment. Motivated by these observations, in this paper we develop a simple and easy-to-implement method to determine the "optimal" number of parallel compute nodes. the method is based on the classical binary search method for non-linear optimization, and does not depend on the, usually unknown, specifics of the system. Extensive experimental validation on a real distributed system shows that our method is indeed highly effective.

关键词： Resource management Streaming media Data mining Multimedia systems Grid computing Application software Hardware Concurrent computing Search methods Optimization methods

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing population of mobile agents

Self-stabilizing population of mobile agents

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Golebiewski, Zbigniew Kutylowski, Miroslaw Luczak, Tomasz Zagorski, Filip Univ Wroclaw Inst Comp Sci Ul Joliot Curie 15 PL-50383 Wroclaw Poland Wroclaw Univ Technol Inst Math & Comp Sci PL-50370 Wroclaw Poland Adam Mickiewicz Univ Fac Math & Comp Sci PL-61614 Poznan Poland

ISBN: (纸本)9781424416936

We investigate a problem of maintaining a target population of mobile agents in a distributed system. the purpose of the agents is to perform certain activities, so the goal is to avoid overpopulation (leading to waste of resources) as well as underpopulation (resulting in a poor service). We assume that there must be no centralized control over the number of agents, since it might result in system's vulnerability. We analyze a simple protocol in which each node keeps at most one copy of an agent and if there is a single agent in a node, a new agent is born with a certain probability p. At each time step the agents migrate independently at random to chosen locations. We show that during a protocol execution the number of agents stabilizes around a level depending on p. We derive analytically simple formulas that determine probability p based on the target fraction of nodes holding an agent. the previous proposals of this type were based on experimental data only.

关键词： mobile agents worms distributed computing combinatorial analysis stochastic analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：