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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是751-760 订阅

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

详细简洁

排序：

Deterministic multithreading for Java-based replicated objects

Deterministic multithreading for Java-based replicated objec...

引用

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

作者： Domaschka, Joerg Hauck, Franz J. Reiser, Hans P. Kapitza, Ruediger Univ Ulm Distributed Syst Lab Ulm Germany Univ Erlangen Nurnberg Dept Distributed Syst & Operating Syst Nurnberg Germany

ISBN: (纸本)9780889866386

This paper describes a novel approach to deterministic multithreading for active replication of Java objects. Unlike other existing approaches, the presented deterministic thread scheduler fully supports the native Java synchronisation mechanisms, including reentrant locks, condition variables, and time bounds on wait operations. Furthermore, this paper proposes source-code transformation as a novel approach for intercepting Java synchronisation statements. This allows the reuse of existing object implementations and simplifies application development.

关键词： determinism consistency multithreading object replication fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A distributed optimization approach to ubiquitous display environments

A distributed optimization approach to ubiquitous display en...

引用

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

作者： Heider, Thomas Giersich, Martin Kirste, Thomas Rostock Univ Mobile Multimedia Informat Syst Grp Rostock Germany

ISBN: (纸本)9780889866386

Emerging multiple display infrastructures provide users with a large number of semi-public and private displays. Selecting what information to present on which display here becomes a real issue, especially when multiple users with diverging interests have to be considered. This especially holds for dynamic ensembles of displays. We propose to cast the Display Mapping problem as an optimization task. We develop an explicit criterion for the global quality of a display mapping and then describe a distributed algorithm based on the GRASP framework that is able to approximate the global optimum through local interaction between display devices. We claim that such a distributed optimization approach, based on the definition of an explicit global quality measure, is a general concept for achieving coherent ensemble behavior.

关键词： distributed agents optimization algorithms ubiquitous computing multiple display environments

来源：评论

学校读者我要写书评

暂无评论

Implementing a multiple-instruction-stream associative MASC processor

Implementing a multiple-instruction-stream associative MASC ...

引用

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

作者： Wang, Hong Walker, Robert A. Univ Toledo Dept Engn Technol 2801 W Bancroft St Toledo OH 43606 USA Kent State Univ Dept Comp Sci Kent OH 44242 USA

ISBN: (纸本)9780889866386

For search-intensive applications such as data mining and bioinformatics, a SIMD Processor Array on a Chip may be an effective architecture, and if the application is control-intensive, a Multiple SIMD (MSIMD) architecture may further increase processor utilization. In this paper, we describe the implementation of an associative MSIMD architecture on the MASC Processor. The MASC Processor implemented using FPGAs, is easily scalable, and dynamically assigns tasks to Processing Elements as the program executes.

关键词： SIMD multiple SIMD (MSIMD) associative computing processor array processor design FPGA

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Service-aware virtual machine placement mechanism for utility computing

Service-aware virtual machine placement mechanism for utilit...

引用

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

作者： Kawato, Masahiro Machida, Fumio Maeno, Yoshiharu NEC Corp Ltd Internet Syst Res Labs Nakahara Ku 1753 Shimonumabe Kawasaki Kanagawa 2118666 Japan

ISBN: (纸本)9780889866386

Dynamic server resource allocation to services on networks, or utility computing, is a powerful technology to provide required computer resources for multiple service providers at low cost. Virtual machine (VM) technology can be combined with utility computing to further improve server resource utilization. An important technical issue about VM-based utility computing is optimal placement of VMs on physical server nodes, because performance of services may be seriously affected by VM placement. We address this issue by introducing an on-line placement algorithm on the basis of performance influence among services. We have implemented this algorithm and evaluated on a simulated environment. The results have shown that the proposed mechanism can get roughly 25% better score calculated by the placement rules compared with a random placement algorithm.

关键词： virtual machine utility computing resource allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：