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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
19 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

763 篇 工学
- 735 篇 计算机科学与技术...
- 525 篇 软件工程
- 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 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 dongarra jack
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,000 篇 英文
19 篇 其他

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

共 1019 条记录，以下是141-150 订阅

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

详细简洁

排序：

Version vectors based synchronization engine for mobile devices

Version vectors based synchronization engine for mobile devi...

引用

international conference on parallel and distributed computing and Networks

作者： Castro, Carlos Quiroz Pakkala, Timo Software and Application Technologies Laboratory Nokia Research Center FI-0045 Nokia Group P.O. Box 407 Finland

ISBN: (纸本)9780889866379

Current synchronization engines are mainly designed to reconcile data repositories between multiple clients and a central server on a star-like topology. A different approach is needed to achieve synchronization on peer-to-peer topologies where any node can be both client and server and updates may happen independently. Version vectors are one solution to the problem, ensuring global convergence of the datasets and providing straightforward conflict detection, while letting applications to control the conflict resolution semantics in their specific domain. In this paper an implementation of a synchronization engine for contact data in mobile devices using version vectors is presented. The engine is capable of optimistically synchronizing databases among many nodes in a peer-to-peer fashion.

关键词： distributed databases applications data management synchronization version vectors mobile computing

来源：评论

学校读者我要写书评

暂无评论

Mcore: A simple structure for effective overlay multicast on mobile ad hoc networks

Mcore: A simple structure for effective overlay multicast on...

引用

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

作者： Li, Yamin Peng, Shietung Chu, Wanming Hosei Univ Dept Comp Sci Tokyo 1848584 Japan Univ Aizu Dept Comp Hardware Aizu Wakamatsu Fukushima 9658580 Japan

ISBN: (纸本)9780889866386

Overlay multicast protocol constructs a virtual mesh spanning all member nodes of a multicast group and employs standard unicast routing to fulfill multicast functionality on application layer. The advantages of this approach are simplicity and flexibility. However, efficiency and stability are the issues that must be addressed as the size of the multicast group grows in the mobile ad hoc networks (MANETs). In this paper, we propose an effective structure for overlay multicast to solve these problems in MANETs. Instead of using a spanning tree on the virtual mesh, we adopt a simple structure called MCore for multicast. An MCore is a path that minimizes the sum of the distances of all vertices to the path plus the length of the path. The MCore is more stable and easier to maintain than the spanning tree in MANETs. The simulation results show that our approach handles the flexibility and mobility issues in overlay multicast protocols effectively for large multicast group size.

关键词： mobile ad hoc networks (MANETs) multicast overlay mesh efficiency stability distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Procedings of the Fifteenth iasted international Conforence on parallel and distributed computing and systems: Volume I

Procedings of the Fifteenth IASTED International Conforence ...

引用

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

ISBN: (纸本)088986392X

The proceedings contains 85 papers from the Fifteenth iasted international conference on parallel and distributed computing and systems: Volume I. The topics discussed include: divisible load scheduling for grid computing;comparison of centralized and decentralized service discovery in a grid environment;reliable multicast protocols for Java-based grid middleware platforms;self-correcting broadcast in distributed hash tables;adaptive file-grain distribution in a cluster file system;and a request-based self-stabilizing token passing.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Probabilistic or deterministic QoS guarantees for flows scheduled with FP/DM

Probabilistic or deterministic QoS guarantees for flows sche...

引用

international conference on parallel and distributed computing and Networks

作者： Minet, Pascale Martin, Steven Saidane, Leila Azouz Masmoudi, Sahla INRIA Rocquencourt F-78153 Le Chesnay France Univ Paris 11 LRI F-91405 Orsay France ENSI Tunis 2010 Tunisia

ISBN: (纸本)9780889866379

In this paper, we consider flows requiring quantitative end-to-end QoS guarantees. We focus more particularly on the end-to-end response times of flows and their probability of meeting their end-to-end deadlines. We assume that packets are scheduled according to their fixed priority, reflecting the importance degree of the flow. If on a node two packets have the same fixed priority, the packet with the smallest relative deadline on the node considered is scheduled first. Therefore, this non-preemptive scheduling, called FP/DM, takes into account the deadline constraint. The deterministic approach, based on a worst case analysis, may lead to a bound on the flow end-to-end response times that can be reached infrequently. A network dimensioning based on this bound can be expensive in terms of resources. That is why we are interested in probabilistic QoS guarantees. We then evaluate the benefits brought by FP/DM with regard to FP/FIFO. With the deterministic approach, we compare the worst case response times and the laxities of the flows considered. With the probabilistic approach, we compare the probabilities of meeting the deadlines for the flows considered as well as the p-schedulabibility of the flow set.

关键词： scheduling queueing system QoS distributed real-time systems

来源：评论

学校读者我要写书评

暂无评论

Combination of XML-RPC and mobile agent technologies

Combination of XML-RPC and mobile agent technologies

引用

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

作者： Motomura, Shinichi Kawamura, Takao Sugahara, Kazunori Tottori Univ Grad Sch Engn 4-101Koyama Minami Tottori Japan Tottori Univ Dept Informat & Knowledge Engn Tottori Japan

ISBN: (纸本)9780889866386

In this paper, we present usages of XML-RPC and the effectiveness in a mobile agent framework named Maglog which is implemented in a Java environment. XML-RPC is used for the following two purposes in Maglog. First, it is a transport mechanism that an agent migrates from one computer to another one. Second, it is an interface which is accessible from applications, written in any other language, which support for XML-RPC. In order to realize an agent migration mechanism, custom serialization mechanism is implemented to customize Java's built-in serialization mechanism. In custom serialization mechanism, objects which represent for an agent are encoded as an XML document. Encoded objects are transferred using XMLRPC. For deserialization, a dynamic class loader is implemented. If no custom serialization is used, an object cannot be deserialized on a remote host, because the class description of the object may not be in the host. As an example of an interface which is accessible from applications, we show a user interface program of a distributed e-Leaming system which we have developed.

关键词： distributed software systems and applications XML-RPC XML mobile agent Java

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Network design considerations for exascale supercomputers

Network design considerations for exascale supercomputers

引用

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

作者： Feng, Rui Zhang, Peng Deng, Yuefan School of Computer Science and Engineering Beihang University Beijing China Department of Applied Mathematics and Statistics Stony Brook University Stony Brook NY United States

We consider the network design optimization for the Exascale class supercomputers by altering the widely analyzed and implemented torus networks. Our alteration scheme involves interlacing the torus networks with bypass links of lengths 6 hops, 9 hops, 12 hops, and mixed 6 and 12 hops. These bypass links are optimal resulting from exhaustive search of massive possibilities. Our case study is constructed by strategically coupling 288 racks of 6 × 6 × 36 nodes to a full system with 72 × 72 × 72 nodes. The peak performance of such a system is 0.56 Exa-flops when CPU-GPU complexes are adopted as a node module capable of 1.5 Tflops. Our design optimizes, simultaneously, the system performance, performancecost ratio, and power efficiency. The network diameter and the average node-to-node network distance, regarded as the performance metrics, got reduced, from the original 3D torus network, by 83.3% and 80.4%, respectively. Similarly, the performance-cost ratio and power efficiency are also increased 1.43 and 4.44 times, respectively.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Enumerating Global States of a distributed Computation

Enumerating Global States of a Distributed Computation

引用

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

作者： Garg, Vijay K. Department of Electrical Engineering University of Texas at Austin Austin TX 78712-1084 United States

ISBN: (纸本)088986392X

Global predicate detection is a fundamental problem in distributed computing in the areas of distributed debugging and software fault-tolerance. It requires searching the global state lattice of a computation to determine if any consistent global state satisfies the given predicate. We give an efficient algorithm that perform the lex traversal of the lattice. We also give a space efficient algorithm for the breadth-first-search (BFS) traversal.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Explicit data organization SIMD instruction set architecture for media processors

Explicit data organization SIMD instruction set architecture...

引用

international conference on parallel and distributed computing and Networks

作者： Liu, Chunyue Qin, Xing Yan, Xiaolang Zhejiang Univ Inst VLSI Design Hangzhou 310027 Peoples R China

ISBN: (纸本)9780889866379

An Explicit Data Organization (EDO-SIMD) instruction set architecture (ISA) is proposed in this paper to reduce the data organization overhead of SIMD (Single Instruction Multiple Data) for media processors. It explicitly describes the data organization information in instruction words and merges the data organization with computation and store operation. An implementation of EDO-SIMD ISA based on a baseline SIMD processor is described and cycle accurate simulator for evaluation is designed. Simulation results show that, relative to the baseline SIMD architecture, EDO-SIMD ISA can achieve 1.34 to 1.40 speedups for the benchmark of real time H.264/AVC decoder and reduce 17.7% of the code size with only 0.49% increase in hardware area.

关键词： parallel processing EDO-SIMD ISA media processor

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：