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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

23 篇 会议

馆藏范围

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

日期分布

学科分类号

20 篇 工学
- 19 篇 计算机科学与技术...
- 10 篇 软件工程
- 3 篇 电子科学与技术（可...
- 3 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 石油与天然气工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
8 篇 理学
- 6 篇 数学
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 系统科学
7 篇 管理学
- 6 篇 管理科学与工程(可...
- 5 篇 工商管理
- 2 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

3 篇 grid computing
2 篇 graphics process...
2 篇 parallel process...
2 篇 distributed comp...
1 篇 musculoskeletal ...
1 篇 scalability
1 篇 information anal...
1 篇 component
1 篇 ant colony optim...
1 篇 infrastructure a...
1 篇 efficiency
1 篇 fast fourier tra...
1 篇 distributed serv...
1 篇 resource allocat...
1 篇 overlay networks
1 篇 parallel computi...
1 篇 routing protocol...
1 篇 distributed inte...
1 篇 services virtual...
1 篇 finite element m...

机构

1 篇 hitachi ltd. cen...
1 篇 laboratory of co...
1 篇 national institu...
1 篇 school of comput...
1 篇 university of ma...
1 篇 harrow school of...
1 篇 department of el...
1 篇 istanbul technic...
1 篇 department of ma...
1 篇 heinz nixdorf in...
1 篇 citadel 171 moul...
1 篇 universidade fed...
1 篇 dept. of compute...
1 篇 systems plus inc...
1 篇 department of el...
1 篇 univ catania die...
1 篇 department of el...
1 篇 university of ma...
1 篇 natl. inst. adv....
1 篇 university of pa...

作者

1 篇 tsuchiya jun-ich...
1 篇 fukui keisuke
1 篇 michel martial
1 篇 de mello rodrigo...
1 篇 choi k.
1 篇 hönig udo
1 篇 li xin
1 篇 isoda yuuya
1 篇 ribeiro fernando...
1 篇 meleis waleed
1 篇 lilja david j.
1 篇 brooks bernard r...
1 篇 fillinger antoin...
1 篇 liu xingwu
1 篇 scott stephen
1 篇 hoarau mathieu
1 篇 chang tao-hsiang
1 篇 kishimoto hiro
1 篇 deveci deniz
1 篇 morana giovanni

语言

23 篇 英文

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

共 23 条记录，以下是11-20 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Adaptive grid computing for MPI applications

Adaptive grid computing for MPI applications

引用

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

作者： Zhang, Juemin Meleis, Waleed Department of Electrical and Computer Engineering Northeastern University Boston MA 02115 United States

ISBN: (纸本)9780889868113

Our objective is to provide location-, topology-, and administrative- transparent grid computing forMPI applications, while hiding the physical details of computing platforms and heterogeneous networks fromthe application elopers and users. To achieve this objective, we introduced a new resource allocation model, workflow structures to specify MPI applications involving multiple tasks, and message relay to enable communication across different networks. We eloped the SGR framework, which integrates workflow scheduling, task grouping, and message relay services, while hiding resource allocation, heterogeneous networks, and decentralized resource management systems from application elopers and users. The SGR system has been implemented on a Globus-enabled computing grid. We created a simulation environment to investigate our model and various schedulers. Using the findings from simulation, we implemented the SGR framework and tested the model's implementation on a two-cluster grid. We observed that duplication can improve performance by more than 15%, which matches our simulation results. Moreover, we evaluated our new message relay service for cross-site message passing. The test results indicate that although the SGR's message relay service has some communication overhead, the system is scalable with respect to the number of processes and the message size.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

distributed heterogeneous hashing and deterministic dynamical decompositions

Distributed heterogeneous hashing and deterministic dynamica...

引用

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

作者： Deveci, Deniz Kortenjan, Michael Schomaker, Gunnar Heinz Nixdorf Institute Computer Science Departament Paderborn Germany

ISBN: (纸本)9780889868113

We present an architecture using a dynamical deterministic unit ring decomposition to improve the balancing quality of an heterogeneous dynamic hashing scheme. This new approach, denoted by DhHHT, is capable to distribute any subsetD' ⊆ D of uniformitems balanced among a dynamical node set V . Further, the capacity of a node, labeled as c(v)min v ∈ V , is allowed to change during runtime and causes no overhead. The challenge in this area is to assign to each v ∈ V approximately |D'| . c(v)/Σu∈V c(u) items, even if nodes are added or removed from V , where |D| denotes the cardinality of D. We will show that DhHHT reaches this without global knowledge about V nor by capacity normalization. Further, DhHHT has an improved model complexity of O(|V |), which is reduced by O(log n) compared to previous approaches. Its special design purpose is to manage limited resources with persistent allocation requests, where even slightly constant balancing iations are intolerable. We also present an uniform dynamical deterministic hash range decomposition, used to place nodes in the hash range, which provides a constant upper and lower iation of 1.118 = s = 1.809. The decomposition is embedded within the DhHHT architecture.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Gpride-a generalized priority-based distributed floor control protocol for collaborative applications

Gpride-a generalized priority-based distributed floor contro...

引用

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

作者： Banik, Shankar M. Chang, Tao-Hsiang Citadel 171 Moultrie Street Charleston SC 29409 United States

ISBN: (纸本)9780889868113

Nowadays Internet users participate in different types of collaborative applications from different parts of the world. In these types of applications, users need to coordinate access to shared resources. This coordination is termed as floor control and researchers have proposed different types of floor control protocols in the literature. Certain types of collaborative applications require that a user with higher priority will be given preference over a user with lower priority at the time of floor assignment by the underlying protocol. This implies that the protocol needs to consider the priority of the user while assigning the floor. If two users are contending for the floor and their priorities are same, then the user who has requested the floor first will get the floor before the other user. These applications also require that this coordination should be performed without the help of any centralized controller. In this paper, we propose GPRIDE - a Generalized PRIority-based distributed floor control protocol for collaborative applications. We have implemented our proposed protocol using BSD Sockets API and tested the performance of the protocol on the PlanetLab network for different conditions. PlanetLab is an overlay testbed that connects several academic and research institutions all over the world in a virtual network.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

A highly parallel GPU-based hash accelerator for a data deduplication system

A highly parallel GPU-based hash accelerator for a data dedu...

引用

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

作者： Li, Xin Lilja, David J. Department of Electrical and Computer Engineering University of Minnesota Twin Cities Minneapolis MN United States

ISBN: (纸本)9780889868113

Recently, data storage systems with data deduplication have been introduced as a method of reducing storage space by eliminating redundant data. In a deduplication storage system, the collision-resistant fingerprint of each data segment must be calculated using a hash algorithm. This paper presents a GPU based accelerator, called g-Dedu, for processing the hash computation of the deduplication system. The g-Dedu accelerator algorithm is especially designed for handling the variable and small size of the data used in a deduplication system, which cannot be processed efficiently by a GPU in a straightforward way. Our data organization approach uses a hierarchical data structure to organize the processing data. A scheduler manages these data for optimal GPU processing. Our patterned data segment approach overcomes some noticeable performance drops resulting from the GPU memory model. Furthermore, different from some previous GPU hash accelerator work, our approach strictly follows the hash processing standard. Using this new approach, g-Dedu achieves 6 times speedup on the SHA-1 computation, and 7.4 times speedup on the SHA-2 computation when compared with a CPU-based mplementation.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of itcell system: Towards the next-generation data center for cloud compting u

Design and implementation of itcell system: Towards the next...

引用

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

作者： Shigeta, Soichi Savva, Andreas Imai, Yuji Yoshida, Taketoshi Fukui, Keisuke Nishikawa, Katsuhiko Kishimoto, Hiro Research Center for Cloud Computing Fujitsu Laboratories Ltd. 4-1-1 Kamikodanaka Nakahara Kawasaki Kanagawa 211-8588 Japan

ISBN: (纸本)9780889868113

Cloud computing is attracting considerable attention as a paradigm shift in the way of supplying and using computing resources. To realize a platform of Cloud computing, large-scale data centers equipped with a huge number of physical resources have to be constructed and operated. One of the big concerns is then how to reduce the resource management and operational cost. Moreover, for reasons of security, users require isolation of their virtual systems running on a shared Cloud platform. Especially, business application systems need strong isolation to protect their private and confidential information. Accordingly, we have been developing new technologies to support the operation and management of such next-generation data centers. In this paper, we describe the design and implementation of ITcell system a platform for IaaS (Infrastructure as a Service) style Cloud computing. Our concept for ITcell is treating physical resources like cells in living organisms-numerous, easily replaceable and integrated in a larger whole. In the development of ITcell system, we addressed and solved the following issues: (1) efficient management of physical resources;(2) rapid integration of new physical servers;(3) managing a VAS (virtual application system) as a single unit;and (4) ensuring network isolation between VAS instances on a shared platform.

关键词： Infrastructure as a service (IaaS)

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a Prototype of RHiNET-2: A Network-based distributed parallel computing System

Performance Evaluation of a Prototype of RHiNET-2: A Network...

引用

21st iasted international Multi-conference on Applied Informatics

作者： Otsuka, Tomohiro Watanabe, Konosuke Tsuchiya, Jun-ichiro Harada, Hiroshi Yamamoto, Junji Nishi, Hiroaki Kudoh, Tomohiro Amano, Hideharu Dept. of Computer Science Keio University Hiyoshi Yokohama 223-8522 Japan Hewlett-Packard Japan Ltd. Hitachi Ltd. Central Research Laboratory Natl. Inst. Adv. Indust. Sci./T.

ISBN: (纸本)0889863415

RHiNET is a network which has advantages of both Local Area Networks (LANs) and System Area Networks (SANs). In this paper, preliminary performance evaluation of RHiNET-2 on a small prototype system is described. We use two benchmark applications, IS from the NAS parallel Benchmarks and LU from the SPLASH-2 Benchmark Suite, on the SCore Cluster System Software. The performance is improved 3.12 times in IS and 3.64 times in LU on a system with four nodes.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：