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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Architecting an object recognition system using parallel design patterns

Architecting an object recognition system using parallel des...

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2010

作者： Brutch, Tasneem G. Su, Bor-Yiing Samsung Electronics EECS Department UC Berkeley San Jose CA United States Samsung Electronics EECS Department UC Berkeley Berkeley CA United States

ISBN: (纸本)9780889868786

In this paper, we use an object recognition application as a case study to illustrate our parallelization Methodology, for architecture, design and development. Our goal was to identify a methodology with a streamlined process for problem analysis, design and development, and use this design methodology in developing a high quality parallel object recognition application, with an efficient and scalable implementation. Our parallelization methodology consists of application design, concurrency analysis, implementation, debugging and testing, and performance tuning phases. In this paper, we focus on the application design, concurrency analysis and implementation phases of the parallelization methodology, to illustrate selection and use of parallel design patterns, during design and implementation phases. In the concurrency analysis phase, we identified key application computations, and performed application decomposition and dependency analysis. During application design, appropriate parallel design patterns were mapped to the problem for efficient parallelization of computations. We illustrate how parallel design patterns were used to guide algorithmic choices during application design, and how design patterns were used in exploring the design space for an efficient implementation, while satisfying the constraints and requirements of the object recognition problem. Applications in the area of object recognition tend to have similar computational flows with variations in input size. A design pattern based approach to parallel software architecture provided us with a common vocabulary for design and development, and helped in meeting the requirements and constraints of the original problem. We found that using our parallelization methodology resulted in a streamlined process for project planning and execution. In this paper, we step through the application design process using parallel design patterns. We review related work in the area of object recognition, and provi

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Byzantine fault tolerant execution of long-running distributed applications

Byzantine fault tolerant execution of long-running distribut...

引用

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

作者： Pallemulle, Sajeeva L. Wehrman, Ian Goldman, Kenneth J. Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

ISBN: (纸本)9780889866386

Long-running distributed applications that automate critical decision processes require Byzantine fault tolerance to ensure progress in spite of arbitrary failures. Existing replication protocols for data servers guarantee that externally requested operations execute correctly even if a bounded number of replicas fail arbitrarily. However, since these protocols only support passive state machine replication, they are insufficient to support continued correct execution of autonomous long-running distributed applications. Building on the Castro and Liskov Byzantine Fault Tolerance protocol for replicated state machines (CLBFT), we present a practical algorithm for Byzantine fault-tolerant execution of autonomous distributed applications. The algorithm supports replicated clients that actively execute application logic by issuing operation requests on replicated data servers as well as other replicated clients. Our work facilitates dynamic upgrades to replica groups, supports both synchronous and asynchronous operation requests, and provides fault isolation between replica groups with respect to both correctness and performance. The algorithm scales well to large replica groups with only twice the latency and message complexity as compared to CLBFT, which supports only unreplicated clients.

关键词： fault tolerant systems Byzantine agreement autonomous distributed applications

来源：评论

学校读者我要写书评

暂无评论

Load Balancing in distributed Adaptive Task Partitioning

Load Balancing in Distributed Adaptive Task Partitioning

引用

Proceedings of the Fifteenth iasted international conference on parallel and distributed computing and systems

作者： Achalla, Chandrasekhar Kaugars, Karlis De Doncker, Elise Department of Computer Science Western Michigan University Kalamazoo Ml 49008 United States

ISBN: (纸本)088986392X

Adaptive task partitioning may introduce implicit hot spots in the computations which affect the parallel performance of the adaptive multivariate integration algorithm. To maintain parallel efficiency, one needs to balance the load of the processors by distributing the computationally intensive parts of the problem domain. We study and improve the performance of the scheduler based or centralized load balancing method in the adaptive task partitioning algorithm implemented in ParInt.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Automated distributed simulation in ptolemy II

Automated distributed simulation in ptolemy II

引用

international conference on parallel and distributed computing and Networks

作者： Cuadrado, Daniel Lazaro Ravn, Anders P. Koch, Peter Aalborg Univ Niels Jernes Vej 12 Aalborg 9220 Denmark

ISBN: (纸本)9780889866379

Despite the well known advantages of distributed processing for intensive computations like simulation, frameworks often fail to exploit them. A distributed simulation is harder to develop than a sequential one, because it is necessary to interface and map activities to processors and handle the ensuing communication and synchronization problems. Very often the designer has to explicitly specify extra information concerning distribution for the framework to make an effort to exploit parallelism. This paper presents Automated distributed Simulation (ADS), which allows the designer to forget about distribution concerns while benefiting from the advantages. ADS relies on the actor formalism. It is realized as an open source implementation for the Ptolemy II simulation framework. Experiments compare different topologies, granularities and number of blocks, achieving linear speedups for practical cases. We implement pipelining techniques so iterative models with purely sequential topologies can benefit from ADS.

关键词： distributed processing automatic deployment simulation actor Ptolemy speedup

来源：评论

学校读者我要写书评

暂无评论

Toward more parallel frequent itemset mining algorithms

Toward more parallel frequent itemset mining algorithms

引用

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

作者： Kessl, Robert Tvrdík, Pavel Department of Computer Science and Engineering Faculty of Electrical Engineering Czech Technical University Prague Czech Republic

ISBN: (纸本)9780889867048

This paper presents improvements of the parallel-FIMI method for statical load balancing of mining of all frequent itemsets on a distributed-memory (DM) parallel machine. This method probabilistically partitions the space of all frequent itemsets into partitions of approximately the same size. The improvements consist in paralelization of the approximate partitioning of the search space and of dynamic reordering of items during construction of prefix-based equivalence classes. The new versions of the method achieve nearly linear speedups up to 10 processors.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Lower level architecture of the Sombrero single address space distributed operating system

Lower level architecture of the Sombrero single address spac...

引用

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

作者： Miller, Donald S. White, Donald B. Skousen, Alan C. Tcherepov, Rossen Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA

ISBN: (纸本)9780889866386

Sombrero is an object-oriented single address space operating system whose virtual address space can be distributed over multiple nodes. This paper presents recent additions to the design and implementation of the lower level architecture of Sombrero. This design exploits Sombrero's object-oriented development model to provide an implementation of a lower-level architecture for the Alpha platform. Software representations of the hardware system's major components have been implemented. The existing middle level architectural modules now use the lower-level services, These include board and processor level hardware interfaces as well as interrupt processing, device driver and protocol component architectures. We contrast differences in the ways these things are designed and operate in a single address space environment with the way they are done in a conventional multiple address space operating system. Features covered include the use of passive servers, simple efficient thread switching and threads blocking within interrupts. Passive and active device drivers are described and the rational for each mode given. The performance of the Sombrero protocol stack was closely examined with attention to its passive service architecture and thread switching method. The current Sombrero Prototype is described.

关键词： single address space operating systems operating systems distributed operating systems object-oriented systems distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Implementation of surface-to-surface contact algorithms using iterative solvers on parallel computers

Implementation of surface-to-surface contact algorithms usin...

引用

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

作者： Kim, Eui Joong Laursen, Tod A. Samsung SDS IT R&D Ctr Seoul South Korea Duke Univ Dept Civil & Environm Engn Durham NC 27708 USA

ISBN: (纸本)9780889866386

In this work, we introduce a robust parallel surface-to-surface contact solution strategy for three dimensional frictional contact problems. A new algorithm is described which has improved overall capability with respect to numerical robustness and spatial convergence rates, showing also good parallel efficiency. In part because numerical methods for contact problems typically result in ill-conditioned and highly unsymmetric stiffness matrices, direct methods for equation solving have typically been preferred in such applications. However, for large-scale contact numerical modeling, the direct method appears to be limited by its requirements for memory and computation time, which scale with the number of unknowns n as )(n(1.5)) and O(n(2)), respectively. In this paper, we have implemented a parallel contact algorithm using iterative solution methods, and have applied it to several numerical examples using an Intel Xeon based Linux cluster and an HP-Compaq AlphaServer with up to 512 processors. Relatively good scalable performance has been observed in the applications tested.

关键词： mortar contact implicit dynamic/quasi-static problem parallel iterative solver

来源：评论

学校读者我要写书评

暂无评论

Group k-mutual exclusion for distributed systems

Group k-mutual exclusion for distributed systems

引用

Proceedings of the Fifteenth iasted international conference on parallel and distributed computing and systems

作者： Jiang, Jehn-Ruey Department of Information Management Hsuan Chuang University Hsin-Chu 300 Taiwan

ISBN: (纸本)088986392X

In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the nodes to have identifications. The delay and session switches of the proposed algorithm are Ω(n2) and Ω(n), respectively.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scalable synchronization of clocks in distributed environments

Scalable synchronization of clocks in distributed environmen...

引用

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

作者： Liu, Jun Computer Science Department University of North Dakota United States

ISBN: (纸本)9780889867048

In many distributed applications, identifying the sequence of event occurrence is useful. Doing so requires local clocks to be properly synchronized with each other. This paper presents a method of pseudo-synchronization of clocks by making use of the occurrence time of events included in direct "happened-before" relations. The basic idea is to approximate the actual clock shift between two clocks using the minimum transmission delay of messages between a pair of hosts. Evaluation results suggest that non-base clocks are closely synchronized with a base clock without violating the direct "happened-before" relations.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Improved asynchronous group mutual exclusion in token-passing networks

Improved asynchronous group mutual exclusion in token-passin...

引用

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

作者： Lin, David Moh, Teng-Sheng Moh, Melody San Jose State Univ Dept Comp Sci San Jose CA 95192 USA

ISBN: (纸本)9780889866386

Group mutual exclusion (GME) was first introduced by Joung [5] as a generalization of the n-process mutual exclusion problem, and subsequently modeled as the Congenial Talking Philosophers problem. GME allows processes requesting for the same resource to concurrently access the shared resource. However, a process requesting a resource that is different from the one currently being used will not be able to access the requested resource at the same time. Two solutions to the GME problem for a ring network exist. One by Wu and Joung had an unbounded message size problem [11, 12], the second one by Cantarell, et. al. provided a bound for message size, but could potentially generate an unbounded number of messages [2, 3]. This work presents a GME algorithm for a token-passing network that solves both problems by providing a bound both to the number of messages and to message size. Analysis results of time and message complexities and of correctness are presented. Performance is evaluated by simulation experiments, which further validate complexity analyses.

关键词： distributed algorithm group mutual exclusion message passing token passing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：