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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

291 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

224 篇 工学
- 216 篇 计算机科学与技术...
- 149 篇 软件工程
- 58 篇 信息与通信工程
- 12 篇 电气工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 控制科学与工程
- 1 篇 安全科学与工程
27 篇 理学
- 18 篇 数学
- 8 篇 生物学
- 3 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 系统科学
15 篇 管理学
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
- 3 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学

主题

33 篇 cloud computing
16 篇 parallel computi...
11 篇 parallel process...
11 篇 distributed comp...
11 篇 distributed comp...
9 篇 computer archite...
9 篇 computational mo...
8 篇 parallel program...
8 篇 resource managem...
8 篇 distributed syst...
7 篇 peer to peer com...
7 篇 optimization
7 篇 high performance...
6 篇 fault tolerance
6 篇 educational inst...
6 篇 servers
6 篇 real-time system...
6 篇 protocols
6 篇 performance eval...
6 篇 gpu

机构

3 篇 a*star institute...
3 篇 topic committee ...
2 篇 univ adelaide sc...
2 篇 univ texas dept ...
2 篇 washington univ ...
2 篇 school of comput...
2 篇 laria laboratoir...
2 篇 guizhou universi...
2 篇 guizhou universi...
2 篇 beihang univ sta...
2 篇 graduate school ...
2 篇 los alamos natl ...
2 篇 tsinghua univers...
2 篇 univ calif san d...
2 篇 department of co...
2 篇 scripps res inst...
2 篇 kth royal inst t...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 kent state univ ...

作者

5 篇 li xiaorong
3 篇 xiaorong li
2 篇 seme david
2 篇 kanagasabai raja...
2 篇 cong guojing
2 篇 riccardo loti
2 篇 le duy ngan
2 篇 putchong uthayop...
2 篇 dongarra jack
2 篇 motomura shinich...
2 篇 taufer m
2 篇 ta nguyen binh d...
2 篇 kawamura takao
2 篇 vlassov vladimir
2 篇 kerbyson dj
2 篇 bader david a.
2 篇 tziritas nikos
2 篇 wu weigang
2 篇 liu jie
2 篇 coddington pd

语言

303 篇 英文

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

共 303 条记录，以下是51-60 订阅

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

详细简洁

排序：

SLINC: A framework for volunteer computing

SLINC: A framework for volunteer computing

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Baldassari, James Finkel, David Toth, David Raytheon Network Centr Syst Tewksbury MA USA Worcester Polytech Inst Comp Sci Dept Worcester MA USA

ISBN: (纸本)9780889866386

Volunteer computing is an innovative approach to high performance computing that relies on volunteers who donate their personal computers' unused resources to a computationally intensive research project. Prominent volunteer computing projects include SETI@home, Folding@Home, and the Great Internet Mersenne Prime Search (GIMPS). Many volunteer computing projects are built upon a volunteer computing framework that abstracts functionality that is common to all volunteer computing projects, such as network communications, database access, and project management. these volunteer computing frameworks tend to be complex, limiting, and difficult to use. We have designed and implemented a new volunteer computing framework called the Simple Light-weight Infrastructure for Network computing (SLINC) that addresses the disadvantages we identified with existing frameworks. SLINC is a flexible and extensible volunteer computing framework that will enable researchers to more easily build volunteer computing projects.

关键词： volunteer computing and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Globally distributed computation over the Internet - the POPCORN project

Globally distributed computation over the Internet - The POP...

引用

18th international conference on distributed computing systems

作者： Nisan, N London, S Regev, O Camiel, N Hebrew Univ Jerusalem Inst Comp Sci Jerusalem Israel

ISBN: (纸本)0780350049

the POPCORN project provides an infrastructure for globally distributed computation over the whole Internet. it provides any programmer connected to the Internet with a single huge virtual parallel computer composed of all processors On the Internet which care to participate at any given moment. the system provides a market-based mechanism of trade it? CPU time to motivate processors To provide their CPU cycles for other peoples computations. "Selling" CPU time is as easy as visiting a certain web site with a Java-enabled browser. "Buying" CPU time is done by writing a parallel program, using our programming paradigm (and libraries). this paradigm was designed as to fit the situation of global computation. A third entity in our system is a "market" for CPU time, which is where buyers and sellers meet and trade. the system has been implemented and may be visited and used on our web-site: http://***/-popcorn.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Repeat analysis in dna sequences with parallel computing method on Grid

Repeat analysis in dna sequences with parallel computing met...

引用

18th IASTED international conference on parallel and distributed computing and systems, pdcs 2006

作者： Arefin, Md. Ahsan Anwar, Abdullah Ibney Wasif, Abu Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka Bangladesh

the development of Grid environment provides an efficient way for implementing the parallel algorithm. Here we focus on the discovery of short recurring patterns in DNA sequences that represent binding sites for certain proteins in the process of gene regulation. We develop parallel computing algorithm for solving this problem by partitioning the overall DNA sequences. this provides us an option to implement the algorithm on Grid and to evaluate its performance. We use the open source software "Alchemi" for building the Grid environment. Also by using a merging repeat approach to find these patterns, we address other related problems, including finding of repetition with insertion and deletion.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

GRAS: A research and development framework for grid and P2P infrastructures

GRAS: A research and development framework for grid and P2P ...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Quinson, Martin Univ Nantes LORIA F-44035 Nantes France

ISBN: (纸本)9780889866386

distributed service architectures are mandatory to handle the platform scale and dynamicity hindering the development of grid and P2P applications. these large-scaled distributed applications are difficult to design, develop and tune because of both theoretical and practical issues. this paper presents the GRAS framework that allows developers to first implement and experiment with such an infrastructure in simulation, benefiting from a controlled environment. the infrastructure can then be deployed in situ without code modification. We detail our design goals, and contrast them with the state of the art. We study the exchange of a message (from the Pastry protocol) using either GRAS 0 or several other solutions. We quantify both the code complexity and the performance and find that GRAS performs better according to both metrics.

关键词： distributed application development grid simulation

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for finding the (k, l)-center of tree networks

An efficient parallel algorithm for finding the (<i>k</i>, <...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Wang, Deqiang Li, Yuanhui Wang, Yan Wang, Kelun Dalian Maritime Univ Naut Sci & Technol Inst Dalian 116026 Peoples R China Northwest A & F Univ Sci Dept Yangling 712100 Peoples R China Dalian Maritime Univ Dept Math Dalian 116026 Peoples R China

ISBN: (纸本)9780889866386

this paper research on how to select a subtree with exactly k leaves and a diameter of at most 1, which minimizes the distance from the farthest vertex to the subtree. We call such a subtree (k, l)-center of a tree network. In this paper, an efficient parallel algorithm is proposed for finding a (k, l)-center of a tree network. this algorithm performs on the EREW PRAM in O(log n) time using O(n) work.

关键词： tree center parallel algorithm EREW PRAM

来源：评论

学校读者我要写书评

暂无评论

Investigating the replica transfer scheduling problem

Investigating the replica transfer scheduling problem

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Loukopoulos, thanasis Tziritas, Nikos Lampsas, Petros Lalis, Spyros Univ Thessaly Dept Comp & Commun Engn Glavani 37 Volos 38221 Greece

ISBN: (纸本)9780889866386

the Replica Placement Problem (RPP) aims at selecting the nodes for duplicating data objects in order to optimize their access. Even though a lot of work already exists on RPP, the issue of implementing the resulting allocation scheme is typically overlooked. In this paper we introduce the Replica Transfer Scheduling Problem (RTSP), briefly stated as: given a network of servers with limited storage capacitv, a set of data objects and two replication schemes x(old) and X-new, find a schedule of object transfers and deletions for implementing X-old based on X-old with minimum communication cost. Given that this problem is NP-complete, we introduce several different heuristics to solve it, and evaluate them via simulations.

关键词： replica placement replica transfers distributed systems

来源：评论

学校读者我要写书评

暂无评论

Solving the longest common subsequence (LCS) problem using the associative ASC processor with reconfigurable 2D mesh

Solving the longest common subsequence (LCS) problem using t...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Virdi, Sabegh Singh Wang, Hong Walker, Robert A. Kent State Univ Dept Comp Sci Kent OH 44242 USA

ISBN: (纸本)9780889866386

As new genes are sequenced, it is common for molecular biologists to compare the new gene's DNA to known sequences. One simple form of DNA sequence comparison is done by solving the Longest Common Subsequence (LCS) problem. In this paper, we propose a parallel algorithm and specialized FPGA-based processor (the associative ASC Processor with reconfigurable 2D mesh) to solve the exact and approximate match LCS problems. this solution uses inexpensive hardware and can be reconfigured as new analysis techniques are developed, making it particularly attractive for processing biosequences.

关键词： SIMD associative computing processor array longest common subsequence sequence analysis biosequences

来源：评论

学校读者我要写书评

暂无评论

the efficient characterization of adaptive applications through fine profiling based on data locality

The efficient characterization of adaptive applications thro...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Liu, Qingyuan Tomko, Karen A. Univ Cincinnati Dept Elect & Comp Engn & Comp Sci Cincinnati OH 45221 USA

ISBN: (纸本)9780889866386

the efficient characterization of adaptive parallel applications is usually challenging due to their complexity and large problem size. Unlike traditional profiling approaches which target the tracing of events or determining performance parameters for subroutines, the approach described in this paper attempts to discover the inherent adaptivity of parallel applications mapped to the computation domain/mesh, which are independent of runtime environment, so as to aid in the performance tuning of parallel applications, especially dynamic load balancing and repartitioning. Our profiling scheme only requires one-time execution of the target program on any platform to generate a sequence of traces with timestamps. the traces can then be fed to simulations under various system configurations while independent of the real application. Preliminary experiments have been performed to evaluate the proposed profiling techniques.

关键词： parallel computing mesh-based adaptive application profiling

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of Shallow Water Model on distributed Memory Architectures 20

Parallel Implementation of Shallow Water Model on Distribute...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Ganeshamoorthy, K. Silva, K.P.M.K. Ranasinghe, D.N. Wait, R. Department of Computing & Intelligent Systems University of Colombo School of Computing 35 Reid Avenue Colombo-7 Sri Lanka International Science Programme Department of Information Technology Uppsala University Uppsala Sweden

ISBN: (纸本)9781604233926

In this paper, we study the impact of memory architectures, distributed memory (DM) and virtual shared memory (VSM), in the solution of parallel numerical algorithms on a multi-processor nodes cluster. the parallel implementation of the shallow water equations to model the Tsunami effect is chosen to be the case study. Data is partitioned into sub domains, namely a four into three (4 × 3) Grid scheme and a eight into six (8×6) Grid scheme which are used for the parallel implementation of this model. We present four parallel algorithms in each Grid scheme: distributed memory without threads, distributed memory with threads, virtual shared memory without threads, and virtual shared memory with threads. these four parallel algorithms have been implemented on a high performance cluster, connected to the"Nordugrid". Experiments are realized using the Message Passing Interface (MPI) library, the C/Linda, and the Linux pthreads. Subject to available memory, the virtual shared memory version without threads performs best, but as the task is scaled up, the threaded version becomes efficient in both DM and VSM implementations. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

MSOMS: A meta simulation Framework for Optimizing Multidomain Simulation

MSOMS: A meta simulation Framework for Optimizing Multidomai...

引用

18th IASTED international conference on parallel and distributed computing and systems

作者： Khan, Moinul H. Georgia Inst Technol Austin TX 78739 USA

ISBN: (纸本)9780889866386

Complex system design and analysis requires simulations with different views or domains. Multi-domain simulation models typically are a collection of simulation model integrated through various means. these concurrent models may be implemented to be closely integrated or distributed as parallel-distributed simulation or mix of the two. Performance of a coupled simulation between multiple domain models depends on various factors. Some of them are, integration backplane architecture, messaging schemes, sharing scheme, level of coupling, fidelity of domain models etc. Framework for Optimizing Multidomain Simulation (MSOMS) is a framework which can be used to estimate performance and effectiveness of integration methods under various scenarios. the framework is referred as meta-simulation, since it is a "simulation of a simulation". this paper captures formulation and demonstration of MSOMS. We compared two possible implementations of a multi-domain model using MSOMS as a case study.

关键词： multidomain modeling HLA distributed simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：