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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

1,020 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010"

共 1020 条记录，以下是591-600 订阅

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

详细简洁

排序：

A data flow implementation of agent-based distributed graph search

A data flow implementation of agent-based distributed graph ...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Hamchi, Imad Hoarau, Mathieu Fillinger, Antoine Crouzier, Nicolas Diduch, Lukas Michel, Martial Stanford, Vincent National Institute of Standards and Technology 100 Bureau Drive Gaithersburg 20899 MD United States Dakota Consulting Inc. Silver Spring MD United States Systems Plus Inc. Rockville MD United States

ISBN: (纸本)9780889868113

Biological ants organize themselves into forager groups that converge to shortest paths to and from food sources. This has motivated development of a large class of biologically inspired agent-based graph search techniques, called Ant Colony Optimization, to solve diverse combinatorial problems. Our approach to parallel graph search uses multiple ant agent populations distributed across processors and clustered computers to solve largescale graph search problems. We discuss our implementation using the NIST Data Flow System II, and show good scalability of our parallel search algorithm.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Shared workspaces: A concept for implementing a distributed escience-environment in grid- and cloud-based infrastructures

Shared workspaces: A concept for implementing a distributed ...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Hönig, Udo Schiffmann, Wolfram Department of Mathematics and Computer Science University of Hagen 58084 Hagen Germany

ISBN: (纸本)9780889868113

Modern science requires a close collaboration of scientists who are possibly scattered all over the world. The ongoing spreading of the internet and the emergence of grid and cloud techniques in recent years have caused intensified efforts in the development of infrastructures that are suitable to enhance a world-wide collaboration of researchers. The term 'eScience' designates a scientific paradigm which has the primary goal to employ a shared digital infrastructure to improve the collaboration of researchers in the core areas of science. Nevertheless, a mere interconnection of hardware resources, programs, and data would be insufficient to achieve this aim. In this paper we will propose the concept of Shared Workspaces which will simplify the worldwide interdisciplinary collaboration. A platform based on this concept implements a controlled and secure communication, facilitates a connection with high performance computers, and enables the exchange and archiving of programs, data, communications and (intermediate) results. It also allows a connection to legacy projects and repositories.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the implicitly restarted Arnoldi/Lanczos method

Parallel implementation of the implicitly restarted Arnoldi/...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Ainsworth Jr., George O. Ribeiro, Fernando L.B. Magluta, Carlos Programa de Engenharia Civil - COPPE Universidade Federal Do Rio de Janeiro Av. Brigadeiro Trompowsky CT I-216 Ilha do Fundão 91445-970 Rio de Janeiro - RJ Brazil

ISBN: (纸本)9780889868113

This work presents a parallel implementation of the implicitly restarted Arnoldi/Lanczos method for the solution of eigenproblems approximated by the finite element method. The implicitly restarted Arnoldi/Lanczos uses a restart scheme in order to improve the convergence of the desired portion of the spectrum, maintaining the orthogonality of the Krylov basis. The presented implementation is suitable for distributed memory architectures, specially PC clusters. In the parallel solution, a subdomain by subdomain approach was implemented and overlapping and non-overlapping mesh partitions were used. Compressed data structures in the formats CSRC and CSRC/CSR were used to store the global matrices coefficients. The parallelization of numerical linear algebra operations presented in both Krylov and implicitly restarted methods are discussed. In order to point out the efficiency and applicability of the proposed algorithms, a numerical example is shown.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

parallel transient simulator by GPU using CUDA

Parallel transient simulator by GPU using CUDA

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Isoda, Yuuya Yokota, Makoto Taniguchi, Ittetsu Fukui, Masahiro Graduate School of Science and Engineering Ritsumeikan University 1-1-1 Noji-higashi Kusatsu Shiga 525-8577 Japan

ISBN: (纸本)9780889868113

The progress of semiconductor technology enables to implement a large system to only one chip, and physical problems such as IR-drop, electro migration, etc. become serious problems for VLSI circuit. To alleviate these problems, VLSI circuit optimization which includes fast and accurate circuit simulator is necessary. This paper describes fast and accurate parallel transient simulator for RLC power grid circuit by GPU (Graphics Processing Unit) using CUDA. The GPU is a processor specified for graphic processing, and its architecture is quite unique. This paper proposes transient simulation method considering the feature of GPU architecture. Experimental results show that proposed transient simulator can achieve 173 times faster simulation than CPU, and the simulation error between proposed simulator and simulator executed on CPU is under 0.01%.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An adaptive scheduling scheme for large-scale workflows on heterogeneous environments

An adaptive scheduling scheme for large-scale workflows on h...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Ohno, Kazuhiko Matsumoto, Masaki Sasaki, Takahiro Kondo, Toshio Nakashima, Hiroshi Department of Information Engineering Mie University 1577 Kurimamachiya-cho Tsu Mie 514-8507 Japan Academic Center for Computing and Media Studies Kyoto University Yoshida-Honmachi Sakyo-ku Kyoto 606-8501 Japan

ISBN: (纸本)9780889868113

We are eloping a task parallel script language MegaScript for executing large-scale workflows on widely distributed heterogeneous environments. For efficient execution of this language, we have proposed a multi-layered task scheduling scheme: the upper layer making rough global scheduling, and the lower layer making precise local scheduling. However, the cost for local scheduling is still a serious issue. Therefore, we propose an adaptive scheduling scheme appropriate to this kind of workflow. The scheme adaptively switches DAG scheduling and independent task scheduling, reducing the scheduling cost for independent task sets in the workflow. The results of our evaluation show our scheme achieved a 540 times speedup of total scheduling time when each host executes 100 tasks on average without serious extension of the makespan less than 7%.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for computing alternate paths avoiding failed nodes and links

Distributed algorithms for computing alternate paths avoidin...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Bhosle, Amit M. Gonzalez, Teofilo F. Department of Computer Science University of California Santa Barbara CA 93106 United States

ISBN: (纸本)9780889868113

A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally recomputed on a failure does not pay off since the failed element recovers fairly quickly, and the recomputed routing paths need to be discarded. In this paper, we present the first distributed algorithm that computes the alternate paths required by some proactive recovery schemes for handling transient failures. Our algorithm computes paths that avoid a failed node, and provides an alternate path to a particular destination from an upstream neighbor of the failed node. With minor modifications, we can have the algorithm compute alternate paths that avoid a failed link as well. To the best of our knowledge all previous algorithms proposed for computing alternate paths are centralized, and need complete information of the network graph as input to the algorithm.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Highly parallel multi-dimensional fast fourier transform on fine- and coarse-grained many-core approaches

Highly parallel multi-dimensional fast fourier transform on ...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Saybasili, A. Beliz Tzannes, Alexandros Brooks, Bernard R. Vishkin, Uzi Laboratory of Computational Biology NIH/NHLBI Bethesda MD 20892 United States Istanbul Technical University Maslak Istanbul Turkey University of Maryland Computer Science Department College Park MD 20742 United States University of Maryland Institute for Advanced Computer Studies College Park MD 20742 United States

ISBN: (纸本)9780889868113

Multi-dimensional fixed-point fast Fourier transform(FFT) methods were developed and tested on two generalpurpose many-core architecture platforms. One is the highly-parallel fine-grained eXplicit Multi-Threaded (XMT) single-chip parallel architecture that targets reducing single task completion time. The second is 8xDual Core AMD Opteron 8220. The results show that the former outperforms the latter not only in speedup and ease of programming, but also with small data sets (small-scale parallelism). One of our results on XMT was a super-linear speedup (by a factor larger than the number of processors) observed under some rather unique circumstances.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Topologically adaptive parallel breadth-first search on multicore processors

Topologically adaptive parallel breadth-first search on mult...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Xia, Yinglong Prasanna, Viktor K. Computer Science Department University of Southern California Los Angeles CA 90007 United States Ming Hsieh Department of Electrical Engineering University of Southern California Los Angeles CA 90007 United States

ISBN: (纸本)9780889868113

Breadth-first Search (BFS) is a fundamental graph theory algorithm that is extensively used to abstract various challenging computational problems. Due to the fine-grained irregular memory accesses, parallelization of BFS can exhibit limited performance on cache-based systems. In this paper, we study the relationship between the topology of input graphs and the performance of BFS on multicore systems. We propose a model to estimate the scalability of BFS with respect to a given graph. Using this model, we propose a topologically adaptive parallel BFS algorithm on multicore systems. The proposed algorithm estimates scalability of each iteration of BFS with respect to the input graph at runtime. An adaptive barrier is developed for this algorithm, which dynamically adjusts the number of threads participating in the BFS according to the estimated scalability. In this way, we reduce the synchronization overhead. We evaluate the proposed algorithm using various graphs on state-of-the-art multicore systems. The proposed method exhibits improved performance compared with traditional parallel BFS algorithms for which the number of threads is fixed.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of a user-oriented availability benchmark for distributed file systems

Design and evaluation of a user-oriented availability benchm...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Chen, Xin Langston, Jeremy He, Xubin Scott, Stephen Department of Electrical and Computer Engineering Tennessee Technological University Cookeville TN 38505 United States Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States

ISBN: (纸本)9780889868113

Availability is a critical indicator in evaluating modern distributed file systems, however, it's very difficult to correctly evaluate the availability of those systems due to their complexity. For example, in addition to measuring the availability in terms of the number of nines, it might be more useful and necessary to characterize other metrics such as performance degradation under faulty conditions, the time from fault to failure, and to discover correlation among failures if exists. In this paper, we propose a user-oriented benchmark tool (D-FACT) to evaluate a distributed file system under various faulty scenarios. There are several advantages of the proposed benchmark tool. First, it provides a mechanism for users to define their customized evaluation policies which are independent of different target file systems. Second, it is able to model the consequences of various real world faults, which provides the flexibility to emulate any user-defined faults, and also lets users focus on the layer of the target file system. Third, it can be extended to apply in a distributed system. A case study on PVFS2 is conducted using our benchmark, and the preliminary results demonstrate its effectiveness.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

A history-based heuristic to optimize data access in distributed environments

A history-based heuristic to optimize data access in distrib...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Ishii, Renato Porfirio De Mello, Rodrigo Fernandes Universidade Federal de Mato Grosso Do sul Faculdade de Computação FACOM Caixa Postal 549 Campo Grande Mato Grosso do Sul 79070-900 Brazil Universidade de São Paulo Instituto de Ciências Matemáticas e de Computaçã o ICMC Caixa Postal 668 São Carlos São Paulo 13560-970 Brazil

ISBN: (纸本)9780889868113

Data Grid, a class of Grid computing, aims at providing services and infrastructure to data-intensive distributed applications which need to access, transfer and modify large data storages. A common issue on Data Grids is the data access optimization, which has been addressed through different approaches such as: bio-inspired and replication (LRU, LFU, Economic Model) strategies. However, few of these approaches consider application features to optimize data access operations (read-and-write). These features define the application behavior, which can support the optimization of operations and, consequently, improve the global system performance. Motivated by the need of efficient data access in large scale distributed environments and by the use of application characteristics, this paper proposes a new heuristic to optimize data accesses (read-andwrite operations) based on application historical behavior. Simulation results confirm that the heuristic reduces application execution time when compared to other approaches commonly considered.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 56 57 58 59 60 61 62 63 64 65 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：