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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,527 篇 英文
20 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是921-930 订阅

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

详细简洁

排序：

Stochastic approach to scheduling multiple divisible tasks on a heterogeneous distributed computing system

Stochastic approach to scheduling multiple divisible tasks o...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Kamthe, Ankur Lee, Soo-Young University of California Merced Computer Science and Engineering Merced CA 95344 United States Auburn University Dept. of Electrical and Computer Engineering Auburn AL 36849 United States

ISBN: (纸本)1424409101

Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In this paper, the problem of scheduling multiple, divisible independent tasks on a heterogeneous distributed computing system is addressed. The "stochastic" approach, which was previously applied to DAG scheduling, is employed for scheduling a group of multiple divisible as well as whole independent tasks. It explicitly considers the standard deviations (temporal heterogeneity) in addition to the mean execution times in deriving a schedule, in order to model more closely what would actually happen "on average" on a temporally heterogeneous system (instead of approximating the random weights by their means only as in other approaches). Through an extensive computer simulation, it has been shown that the proposed approach can improve schedules significantly over those by a scheme which uses the average weights only. ©2007 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Domain decomposition vs. master-slave in apparently homogeneous systems

Domain decomposition vs. master-slave in apparently homogene...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Banino-Rokkones, Cyril Sem Sælandsvei 7-9 NO-7491 Trondheim Norway

ISBN: (纸本)1424409101

This paper investigates the utilization of the master-slave (MS) paradigm as an alternative to domain decomposition (DD) methods for parallelizing lattice gauge theory (LGT) models within distributed memory environments. The motivations for this investigation are twofold. First, LGT models are inherently difficult to parallelize efficiently with DD methods. Second, DD methods have proven useful for homogeneous environments, but are impractical for heterogeneous and dynamic environments. Besides, many modern supercomputer architectures that look homogeneous (such as multi-core or SMP), are in fact heterogeneous and dynamic environments. We highlight this issue by comparing a traditional first-come first-served MS implementation to a simple but yet efficient selective MS scheduling strategy that automatically accounts for system, heterogeneity and variability. Our experimental results with the parallelization of our LGT model, reveal that the selective MS implementation achieves good efficiency, but lacks of scalability. In contrast, the DD method is highly scalable, but at the expense of a poor efficiency. These results open up for a hybrid approach, where the MS and the DD methods would, be combined for achieving scalable high performance. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Combining compression, encryption and fault-tolerant coding for distributed storage

Combining compression, encryption and fault-tolerant coding ...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Sobe, Peter Peter, Kathrin University of Luebeck Inst. of Computer Engineering Ratzeburger Allee 160 D-23538 Luebeck Zuse Institute Berlin Computer Science Research Takusstrasse 7 D-14195 Berlin

ISBN: (纸本)1424409101

Storing data in distributed systems aims to offer higher bandwidth and scalability than storing locally. But, a couple of disadvantageous issues must be taken into account such as unreliability caused by faults, temporal downtimes and malicious attacks. To improve dependability, redundancy codes like parity can be used as well as more sophisticated codes such as Reed/Solomon. Another issue - security requirements - arise when data is kept in untrusted units in a network. To encrypt data, it is common to use security algorithms like AES. For efficient transfer and storage, the amount of data can be reduced by compression algorithms. All. these techniques - data distribution, fault-tolerant coding, encryption and compression - can be employed together using independent algorithms, but in a proper combination. A superposition of these techniques exploiting synergies is still an issue for research. Thus, in this paper we study proper technique combinations applied to distributed storage. The combinations are classified and examined with respect to their potential benefit and limitations. For our model, performance parameters from the distributed storage system NetRAID are used. © 2007 ieee.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

Revisiting deterministic multithreading strategies

Revisiting deterministic multithreading strategies

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Domaschka, Jörg Schmied, Andreas I. Reiser, Hans P. Hauck, Franz J. Ulm University Institute of Distributed Systems James-Franck-Ring O-27 89069 Ulm Germany

ISBN: (纸本)1424409101

Deterministic behaviour is a prerequisite for most approaches to object replication. In order to avoid the non-determinism of multithreading, many object replication systems are limited to using sequential method execution. In this paper, we survey existing application-level scheduling algorithms that enable deterministic concurrent execution of object methods. Multithreading leads to a more efficient execution on multiple CPUs and multi-core CPUs, and it enables the object programmer to use condition variables for coordination between multiple invocations. In existing algorithms, a thread may only start or resume if there are no potentially nondeterministic conflicts with other running threads. A decision only based on past actions, without knowledge of future behaviour, must use a pessimistic strategy that can cause unnecessary restrictions to concurrency. Using a priori knowledge about future actions of a thread allows increasing the concurrency. We propose static code analysis as a way for predicting the lock acquisitions of object methods. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A key-based adaptive transactional memory executor

A key-based adaptive transactional memory executor

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Bai, Tongxin Shen, Xipeng Zhang, Chengliang Scherer III, William N. Ding, Chen Scott, Michael L. Computer Science Department University of Rochester Computer Science Department College of William and Mary Computer Science Department Rice University

ISBN: (纸本)1424409101

Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where nonconflicting operations proceed in parallel. Many of these structures take the abstract form of a dictionary, in which each transaction is associated with a search key. By regrouping transactions based on their keys, one may improve locality and reduce conflicts among parallel transactions. In this paper, we present an executor that partitions transactions among available, processors. Our key-based adaptive partitioning monitors incoming transactions, estimates the probability distribution of their keys, and adaptively determines the (usually nonuniform) partitions. By comparing the adaptive partitioning with uniform, partitioning and round-robin keyless partitioning on a 16-processor SunFire 6800 machine, we demonstrate that key-based adaptive partitioning significantly improves the throughput of finegrained parallel operations on concurrent data structures. © 2007 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

A framework for experimental validation and performance evaluation in fault tolerant distributed system

A framework for experimental validation and performance eval...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Meling, Hein Department of Electrical Engineering and Computer Science University of Stavanger 4036 Stavanger Norway

ISBN: (纸本)1424409101

Performing experimental evaluation of fault tolerant distributed systems is a complex and tedious task, and automating as much as possible of the execution and evaluation of experiments is often necessary to test a broad spectrum of possible executions of the system to obtain good coverage. The confidence of the results obtained from an experimental evaluation depends on the degree of control over the environment in which experiments are being executed. Typically, an uncontrolled environment is exposed to numerous sources of external influence that can affect the obtained results. Automated and repeated executions can be used to reduce the impact of such influences. In this paper, a framework for experimental validation and performance evaluation of fault management in a fault tolerant distributed system is presented. The framework provides a facility to execute experiments in a configured target system. It is based on injecting faults or other events needed to test the fault handling capability of the system. Relevant events are logged, and collected for postprocessing and analysis, e.g. to construct a single global timeline of events occurring at different nodes in the target system. This timeline of events can then be used to validate the behavior a system, and to evaluate its performance. ©2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scalable compression and replay of communication traces in massively parallel environments

Scalable compression and replay of communication traces in m...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Noeth, Michael Mueller, Frank Schulz, Martin De Supinski, Bronis R. North Carolina State University Department of Computer Science Raleigh NC 27695-7534 Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94551

ISBN: (纸本)1424409101

Characterizing the communication behavior of large-scale applications is a difficult and costly task due to code/system complexity and their long execution times. An alternative to running actual codes is to gather their communication traces and then replay them, which facilitates application tuning and future procurements. While past approaches lacked lossless scalable trace collection, we contribute an approach that provides orders of magnitude smaller, if not near constant-size, communication traces regardless of the number of nodes while preserving structural information. We introduce intra- and inter-node compression techniques of MPI events and present results of our implementation for BlueGene/L. Given this novel capability, we discuss its impact on communication tuning and beyond. To the best of our knowledge, such a concise representation of MPI traces in a scalable manner combined with deterministic MPI call replay are without any precedence. ©2007 ieee.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Self adaptive application level fault tolerance For parallel and distributed computing

Self adaptive application level fault tolerance For parallel...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Chen, Zizhong Yang, Ming Francia III, Guillermo Dongarra, Jack Jacksonville State University MCIS Department Jacksonville AL 36265 United States University of Tennessee Knoxville Department of Computer Science Knoxville TN 37996

ISBN: (纸本)1424409101

Most application level fault tolerance schemes in literature are non-adaptive in the sense that the fault tolerance schemes incorporated in applications are usually designed without incorporating information from system environments such as the amount of available memory and the local or network I/O bandwidth. However, from an application point of view, it is often desirable for fault tolerant high performance applications to be able to achieve high performance under whatever system environment it executes with as low fault tolerance overhead as possibile. In this paper, we demonstrate that, in order to achieve high reliability with as low performance penalty as possible, fault tolerant schemes in applications need to be able to adapt themselves to different system environments. We propose a framework under which different fault tolerant schemes can be incorporated in applications using an adaptive method. Under this framework, applications are able to choose near optimal fault tolerance schemes at run time according to the specific characteristics of the platform on which the application is executing. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Implementing Hirschberg's PRAM-algorithm for connected components on a global cellular automaton

Implementing Hirschberg's PRAM-algorithm for connected compo...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Jendrsczok, J. Hoffmann, R. Keller, J. TU Darmstadt FB Informatik FG Rechnerarchitektur Hochschulstraße 10 D-64289 Darmstadt FernUniversität in Hagen Fakultät für Mathematik und Informatik Universitätsstr. 1 D-58084 Hagen

ISBN: (纸本)1424409101

The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical CA model. In differentiation to the CA model the neighbors are not fixed and local, they are variable and global. The GCA model is applicable to a wide range of parallel algorithms, and it can be implemented on reconfigurable hardware. We discuss the GCA implementation of PRAM algorithms, exemplified by the algorithm of Hirschberg et al., which determines the connected components of a given undirected graph. Insights are that efficient mappings of PRAM algorithms onto GCA exist, and that PRAM and GCA optimality criteria differ because the latter takes memory consumption into account. This makes the GCA a parallel computational model and an implementation platform, thus narrowing the gap between theory and practice. © 2007 ieee.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Software tools for performance modeling of parallel programs

Software tools for performance modeling of parallel programs

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Martínez, Diego R. Blanco, Vicente Boullón, Marcos Cabaleiro, José C. Rodríguez, Casiano Rivera, Francisco F. University of Santiago de Compostela Dept. of Electronics and Computer Science Santiago de Compostela A Coruna Spain La Laguna University Dept. Statistics and Computer Science La Laguna Tenerife Spain

ISBN: (纸本)1424409101

This paper presents a framework based on a user driven methodology to obtain analytical models of MPI applications on parallel, systems in a systematic and easy to use way. This methodology consists of two stages. In the first one, instrumentation of the source code is performed using CALL, which is a profiling tool for interacting with the code in an easy, simple and direct way. New features are added to CALL to obtain different performace metrics and store the performance information in XML files. Using this information, an analytical model of the performance behavior is obtained in the second stage by means of R, a language and environment for statistical analysis. The structure of the whole framework is detailed in this paper, and some selected examples are used to show its practical use. © 2007 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 89 90 91 92 93 94 95 96 97 98 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：