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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,501 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,574 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,571 篇 英文
2 篇 其他
1 篇 葡萄牙文

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2574 条记录，以下是2061-2070 订阅

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

详细简洁

排序：

Homogeneous redundancy: a technique to ensure integrity of molecular simulation results using public computing

Homogeneous redundancy: a technique to ensure integrity of m...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： M. Taufer D. Anderson P. Cicotti C.L. Brooks Center for Theoretical Biological Physics University of California San Diego La Jolla CA USA Department of Molecular Biology (TPC6) Scripps Research Institute La Jolla CA USA Department of Computer Science University of Texas El Paso El Paso TX USA Spaces Sciences Laboratory University of California Berkeley Berkeley CA USA Department of Computer Science University of California San Diego La Jolla CA USA

distributed computing using PCs volunteered by the public can provide high computing capacity at low cost. However, computational results from volunteered PCs have a non-negligible error rate, so result validation is needed to ensure overall correctness. A generally applicable technique is "redundant computing", in which each computation is done on several separate computers, and results are accepted only if there is a consensus. Variations in numerical processing between computers (due to a variety of hardware and software factors) can lead to different results for the same task. In some cases, this can be addressed by doing a "fuzzy comparison" of results, so that two results are considered equivalent if they agree within given tolerances. However, this approach is not applicable to applications that are "divergent", that is, for which small numerical differences can produce large differences in the results. In this paper we examine the problem of validating results of divergent applications. We present a novel approach called homogeneous redundancy (HR), in which the redundant instances of a computation are dispatched to numerically identical computers, allowing strict equality comparison of the results. HR has been deployed in Predictor@home, a world-wide community effort to predict protein structure from sequence.

关键词： Computational modeling Personal communication networks distributed computing Computer errors Hardware Application software Redundancy Biological system modeling Biology computing Computer science

来源：评论

学校读者我要写书评

暂无评论

A dynamic hybrid scheduling algorithm with clients' departure for impatient clients in heterogeneous environments

A dynamic hybrid scheduling algorithm with clients' departur...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： N. Saxena Kalyan Basu S.K. Das C.M. Pinotti Computer Science & Engineering Department University of Texas Arlington Arlington TX USA Department of Mathematics and Informatics University of Perugia Perugia Italy

the essence of efficient scheduling and data transmission techniques lies in providing the Web-applications with advanced data processing capabilities. In this paper we have efficiently combined the push and the pull scheduling to develop a new, practical, dynamic, hybrid scheduling strategy for heterogenous, asymmetric environments. the proposed algorithm dynamically computes the probabilities and the optimal cutoff-point to separate the push and the pull data sets. the data items are also assumed to be of variable lengths. While the push strategy uses the flat, round-robin scheduling, the pull items are determined by stretch-optimal (max-request min-service time) scheduling policy. In order to make the scheduling more practical, we have considered the impact of the impatience of the clients waiting to get the service of a particular data item. the effects of this impatience can lead to departure of specific client(s) from the system. Our proposed hybrid scheduling strategy takes care of these effects to capture a real portrayal of the system dynamics. these scenarios are modelled by suitable birth and death process to analyze the overall expected delay of the system. Subsequently, simulation results corroborate the average system performance and points out significant improvement over existing hybrid systems in terms of average waiting time spent by a client.

关键词： Scheduling algorithm Processor scheduling Dynamic scheduling Broadcasting Data communication Quality of service Delay Mathematics Informatics Data processing

来源：评论

学校读者我要写书评

暂无评论

distributed artificial neural network architectures

Distributed artificial neural network architectures

引用

ieee international symposium on High Performance Computing Systems and applications (HPCS)

作者： D. Calvert J. Guan Computing and Information Science University of Guelph Guelph ONT Canada

the computational cost of training artificial neural network (ANN) algorithms limits the use of large systems capable of processing complex problems. Implementing ANNs on a parallel or distributed platform to improve performance is therefore desirable. this work illustrates a method to predict and evaluate the performance of distributed ANN algorithms by analyzing the performance of the comparatively simple mathematical operations, which are used to construct the ANN. the ANN algorithms are divided into simple components: matrix and vector multiplication, matrix processed through a function, competition in a matrix. these basic operational parts are examined individually and it is demonstrated that the computation processes of distributed neural networks can be derived from the composition of these basic operations. three popular network architectures are examined: multi-layer perceptrons with back-propagation learning, self-organizing map, and radial basis functions network.

关键词： Artificial neural networks Computer architecture Computational efficiency Performance analysis Algorithm design and analysis Computer networks distributed computing Neural networks Multilayer perceptrons Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Performance implications of virtualization and hyper-threading on high energy physics applications in a grid environment

Performance implications of virtualization and hyper-threadi...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： L. Gilbert J. Tseng R. Newman S. Iqbal R. Pepper O. Celebioglu Jenwei Hsieh M. Cobban University of Oxford Oxford UK Dell Inc. Austin TX USA Millbank House Dell Inc. Bracknell Berkshire UK

the simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. these features make such simulations ideal candidates for grid computing. We are taking as an example the GEANT4 detector simulation used for physics studies within the ATLAS experiment at CERN. One key issue in grid computing is that of network and system security, which can potentially inhibit the wide spread use of such simulations. Virtualization provides a feasible solution because it allows the creation of virtual compute nodes in both local and remote compute clusters, thus providing an insulating layer which can play an important role in satisfying the security concerns of all parties involved. However, it has performance implications. this study provides quantitative estimates of the virtualization and hyper-threading overhead for GEANT on commodity clusters. Results show that virtualization has less than 15% run-time overhead, and that the best run time (with the non-SMP licence of ESX VMware) is achieved by using one virtual machine per CPU. We also observe that hyper-threading does not provide an advantage in this application. Finally, the effect of virtualization on run-time, throughput, mean response time and utilization is estimated using simulations.

关键词： Application virtualization Computational modeling Grid computing Runtime Concurrent computing Physics computing parallel processing Detectors Data security Insulation

来源：评论

学校读者我要写书评

暂无评论

Software-directed disk power management for scientific applications

Software-directed disk power management for scientific appli...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： S.W. Son M. Kandemir A. Choudhary CSE Department Pennsylvania State University University Park PA USA ECE Department Northwestern University Evanston IL USA

Disk power consumption is becoming an increasingly important issue in high-end servers that execute large-scale data-intensive applications. In particular, array-based scientific codes can spend a significant portion of their power budget on the disk subsystem. Observing this, the prior research proposed several strategies, such as spinning down to low-power modes or adjusting the speed of the disk in lower RPM, to reduce power consumption on the disk subsystem. A common characteristic of most of these techniques is that they are reactive, in the sense that they make their decisions based on the disk access patterns observed during execution. While such techniques are certainly useful and the published studies reveal that they can be very effective in some cases, one can conceivably achieve better results by adopting a proactive scheme. Focusing on array-intensive scientific applications, this paper makes two important contributions. First, it presents a compiler-driven proactive approach to disk power management. In this approach, the compiler analyzes the application code and extracts the disk access pattern. It then uses this information to insert explicit disk power management calls in the appropriate places in the code. It also pre-activates a disk (placed into the low-power mode) before it is actually needed to eliminate the potential performance impact of disk power management. the second contribution of this paper is a code transformation approach that can be used to increase the savings coming from a disk power management scheme (whether reactive or proactive). Our experimental results with several scientific application codes show that both the proactive disk power management approach and the disk layout aware code transformations are beneficial from both power consumption and execution time perspectives.

关键词： Energy management Application software Energy consumption Power system management Pattern analysis Data mining Large-scale systems Cooling Voltage Operating systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling based on the impact over process communication of parallel applications

Scheduling based on the impact over process communication of...

引用

ieee international symposium on High Performance Computing Systems and applications (HPCS)

作者： R.P. Ishii R.F. de Mello L.J. Senger M.J. Santana R.H.C. Santana Instituto de Ciências Matemáticas e de Computação Universidade de Sáo Paulo Sao Paulo Brazil

this paper presents a new model for the evaluation of the impacts on processing operations resulting from the communication among processes. the model quantifies the traffic volume imposed on the communication network by means of the latency parameters and the overhead. Such parameters represent the load that each process imposes over the network and the delay on the CPU, as a consequence of the network operations. the delay is represented on the model by means of metric measurements slowdown. the equations that quantify the costs involved in the processing operation and message exchange are defined. In the same way, equations to determine the maximum network bandwidth are used on the decision-making scheduling. the proposed model uses a constant that delimitates the communication network maximum allowed usage, this constant defines two possible scheduling techniques: group scheduling or through communication network. Such techniques are incorporated to the DPWP policy, generating an extension of this policy. Results confirm the performance enhancement of parallel applications.

关键词： Processor scheduling Communication networks Delay Bandwidth Resource management Equations Decision making distributed computing Weather forecasting Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Collective caching: application-aware client-side file caching 05

Collective caching: application-aware client-side file cachi...

引用

international symposium on High Performance distributed Computing

作者： Wei-keng Liao K. Coloma A. Choudhary L. Ward E. Russell S. Tideman Electrical and Computer Engineering Department Northwestern University USA Scalable Computing Systems Department Sandia National Laboratories

ISBN: (纸本)9780780390379

parallel file subsystems in today's high-performance computers adopt many I/O optimization strategies that were designed for distributed systems. these strategies, for instance client-side file caching, treat each I/O request process independently, due to the consideration that clients are unlikely related with each other in a distributed environment. However, it is inadequate to apply such strategies directly in the high-performance computers where most of the I/O requests come from the processes that work on the same parallel applications. We believe that client-side caching could perform more effectively if the caching subsystem is aware of the process scope of an application and regards all the application processes as a single client. In this paper, we propose the idea of "collective caching" which coordinates the application processes to manage cache data and achieve cache coherence without involving the I/O servers. To demonstrate this idea, we implemented a collective caching subsystem at user space as a library, which can be incorporated into any message passing interface implementation to increase its portability. the performance evaluation is presented with three I/O benchmarks on an IBM SP using its native parallel file system, GPFS. Our results show significant performance enhancement obtained by collective caching over the traditional approaches.

关键词： Concurrent computing Application software File servers File systems Laboratories Message passing parallel processing Data structures Libraries

来源：评论

学校读者我要写书评

暂无评论

MPI ruby with remote memory access

MPI ruby with remote memory access

引用

13th ieee international symposium on High Performance distributed Computing (HPDC-13)

作者： Aycock, CC Univ Oxford Comp Lab Oxford OX1 3QD England

Advances in communication for parallel programming have yielded one-sided messaging systems. the MPI bindings for Ruby have been augmented to include the remote memory access functions of MPI-2.

ISBN: (纸本)0780321754

Advances in communication for parallel programming have yielded one-sided messaging systems. the MPI bindings for Ruby have been augmented to include the remote memory access functions of MPI-2.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

GATES: A grid-based middleware for processing distributed data streams

GATES: A grid-based middleware for processing distributed da...

引用

13th ieee international symposium on High Performance distributed Computing (HPDC-13)

作者： Chen, L Reddy, K Agrawal, G Ohio State Univ Dept Comp & Informat Sci Columbus OH 43210 USA

ISBN: (纸本)0780321754

Increasingly, a number of applications rely on, or can potentially benefit from, analysis and monitoring of data streams. Moreover, many of these applications involve high volume data streams and require distributed processing of data arising from a distributed set of sources. thus, we believe that a grid environment is well suited for flexible and adaptive analysis of these streams. this paper reports the design and initial evaluation of a middleware for processing distributed data streams. Our system is referred to as GATES (Grid-based Adaptive Execution on Streams). this system is designed to use the existing grid standards and tools to the extent possible. It flexibly achieves the best accuracy that is possible while maintaining the real-time constraint on the analysis. We have developed a self-adaptation algorithm for this purpose. Results from a detailed evaluation of this system demonstrate the benefits of distributed processing, and the effectiveness of our self-adaptation algorithm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Discouraging free riding in a peer-to-peer CPU-sharing grid

Discouraging free riding in a peer-to-peer CPU-sharing grid

引用

13th ieee international symposium on High Performance distributed Computing (HPDC-13)

作者： Andrade, N Brasileiro, F Cirne, W Mowbray, M Univ Fed Campina Grande Dept Sistemas & Comp Campina Grande Brazil

ISBN: (纸本)0780321754

Grid computing has excited many with the promise of access to huge amounts of resources distributed across the globe. However there are no largely, adopted solutions for automatically assembling grids, and this limits the scale of today's grids. Some argue that this is due to the overwhelming coinplexity of the proposed economy-based solutions. Peer-to-peer grids have emerged as a less complex alternative. We are currently deploying OurGrid, one such peer-to-peer grid. OurGrid is a CPU-sharing grid that targets Bag-of-Tasks applications (i.e. parallel applications whose tasks are independent). In order to ease system deployment, OurGrid is based on a very lightweight autonomous reputation scheme. Free riding is an iniportant issue for any peer-to-peer system. the aim of this paper is to show that OurGrid's reputation system successfully discourages free riding, making it in each peer's own interest to collaborate with the peer-to-peer community We show this in two steps. First, we analyze the conditions under which a reputation scheme can discourage free riding in a CPU-sharing grid. Second, we show that OurGrid's reputation scheme satisfies these conditions, even in the presence of malicious peers. Unlike other distributed mechanisms for discouraging free riding, OurGrid's reputation scheme achieves this without requiring a shared cryptographic infrastructure or specialized storage..

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 203 204 205 206 207 208 209 210 211 212 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：