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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

638 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

639 篇 英文
20 篇 其他

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

共 659 条记录，以下是41-50 订阅

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

详细简洁

排序：

Memory utilization analysis of Java middleware for distributed real-time and embedded systems

Memory utilization analysis of Java middleware for distribut...

引用

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

作者： Qu, Runtao Hirano, Satoshi Ohkawa, Takeshi AIST Natl Inst Adv Ind Sci & Technol Informat Technol Res Inst AIST Tsukuba Cent 2 Tsukuba Ibaraki 3058568 Japan

ISBN: (纸本)9780889866386

distributed object-oriented middleware technologies have been adopted for ubiquitous communicating real-time and embedded systems. Although Java plays an important role in building distributed object-oriented middleware because of its portability and productivity, it is not popularto real-time system developers because it is slow and hard to keep real-timeness due to garbage collection. this paper presents a novel memory classification and measurement approach for modem programming language such as Java to analyze the memory utilization of middleware technologies in order to improve them for embedded systems using limited computing resource. We classified Java memory into four categories such as static, quasi-static, quasi-dynamic and dynamic, and show how to measure the size of each memory. Intensive case studies using popular Java middleware technologies such as Web Services, CORBA, RMI and HORB revealed that reducing the use of dynamic memory has contributed far more to the efficiency and performance than reducing the use of quasi-static and quasi-dynamic memory.

关键词： memory analysis Java middleware distributed system

来源：评论

学校读者我要写书评

暂无评论

INTESER: An integrated solution to provide QoS, traffic engineering and fault tolerance in an MPLS network

INTESER: An integrated solution to provide QoS, traffic engi...

引用

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

作者： Che, Hao Gupta, Manoj Velayutham, Sundar Lagoa, Constantino Wang, Zhijun Univ Texas Arlington Comp Sci & Engn Arlington TX 76019 USA Penn State Univ Elect Engn State Coll PA USA Hong Kong Polytech Univ Comp Sci Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9780889866386

In this paper, we put forward an integrated solution to provide service quality features in an MPLS network, called Integrated, QoS-based Traffic Engineering with Service Restoration (INTESER). INTESER employs a distributed multipath forwarding paradigm in an MPLS domain to enable optimal, QoS-aware traffic engineering and service restoration through static call admission control, and dynamic load balancing and rate adaptation at the domain edge. the core nodes can be QoS agnostic and use a single FIFO queue at each output port. Preliminary simulation results demonstrate the promising prospective of the proposed solution as a simpler and more scalable alternative to the existing solutions.

关键词： MPLS quality of service traffic engineering service restoration distributed control resource provisioning

来源：评论

学校读者我要写书评

暂无评论

String matching engine using parallel hashing

String matching engine using parallel hashing

引用

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

作者： Katta, Pavan Nourani, Mehrdad Panigrahy, Rina Univ Texas Richardson Ctr Integrated Circuits & Syst Richardson TX 75083 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA

ISBN: (纸本)9780889866386

In this paper we present a hardware architecture for string matching. Our solution based on parallelized hashing is capable of handling wire line speeds with zero false-positive probability. String matching modules are extensively used in the network security domain especially in network intrusion detection systems where they are required to operate at wire line speeds. We analyze the performance of our architecture and show the expected throughput for various configurations of the system. We also report the details of our implementation in an Field Programmable Gate Array (FPGA) and compare the performance of this system to an Application Specific Integrated Circuit (ASIC) implementation. Our analysis shows that our system is capable of matching 16000 strings at line speeds of 45Gbps (i.e. 36 OC - 12 links).

关键词： computer network security pattern matching site security monitoring string matching

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

FastPara: a high-level declarative data-parallel programming framework on clusters

FastPara: a high-level declarative data-parallel programming...

引用

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

作者： Mao, Yong Gu, Yunhong Chen, Jia Grossman, Robert L. Univ Illinois Lab Adv Comp 322 SEOM-C 249851S Morgan Chicago IL 60607 USA

ISBN: (纸本)9780889866386

this paper presents FastPara, a C++ programming framework and associated runtime support for writing and running data-parallel applications in computer cluster environments. With FastPara, the user writes a declaration of the data to be exchanged between processes for a certain data-parallel processing algorithm. FastPara will handle all the process communications without any users' efforts. Complex data structures and variable-length arrays are well supported so that users can easily apply this framework to their data-parallel applications. FastPara's runtime provides built-in support for process management and fault tolerance for the parallel processing. FastPara can greatly simplify the development cycle. Based on the performance tests we did, FastPara demonstrated good communication efficiency and little process coordination overhead. We believe that FastPara is a very useful framework in developing data-parallel applications.

关键词： parallel-programming framework data-parallel cluster

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Communication-conscious mapping of regular nested loop programs onto massively parallel processor arrays

Communication-conscious mapping of regular nested loop progr...

引用

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

作者： Siegel, Sebastian Merker, Renate Hannig, Frank Teich, Juergen Tech Univ Dresden Inst Circuits & Syst D-01062 Dresden Germany Univ Erlangen Nurnberg Dept Comp Sci 12 D-91058 Erlangen Germany

ISBN: (纸本)9780889866386

Methods for an efficient mapping of algorithms to parallel architectures are of utmost importance because many state-of-the-art embedded digital systems deploy parallelism to increase their computational power. this paper deals with the mapping of loop programs onto processor arrays implemented in an FPGA or available as (reconfigurable) coarsegrained processor architectures. Most existing work is closely related to approaches from the DSP domain and is not able to exploit the full parallelism of a given algorithm and the computational potential of a typical 2-dimensional array. In contrast, we present a mapping methodology which incorporates many important parameters of the target architecture in one approach. these are: number of processing elements, resources of the data path and memory within a processing element, and interconnection within the processor array. Based on these parameters, we formulate an optimization problem whose solution specifies an efficient mapping of an algorithm to the target architecture. We can optimize for speed of the algorithm and/or hardware cost caused by the communication and computation resources of the architecture.

关键词： processor array interconnection data path hardware mapping integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：