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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2007"

共 620 条记录，以下是151-160 订阅

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

详细简洁

排序：

The numerical risks of reduction operations in OpenMP

The numerical risks of reduction operations in OpenMP

引用

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

作者： Trefftz, Christian Tao, Yonglei Jorgensen, Paul School of Computing Grand Valley State University Allendale MI 49401-9403 United States

ISBN: (纸本)9780889867048

OpenMP is a popular programming environment for high-level shared-memory parallel processing in C, C++ and Fortran on multiple platforms. Using OpenMP, application developers can focus on the code they want to parallelize for better performance without having to do all the work in code parallelization. While hiding much of the complexity in parallel processing, it imposes a great challenge for the developers to make sure the run-time behavior of the code is as expected. In this paper, we explore potential risks with using OpenMP through reduction, a frequently performed operation in parallel processing.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

A mobile agent based workflow rescheduling approach for grids

A mobile agent based workflow rescheduling approach for grid...

引用

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

作者： Dong, Fangpeng Akl, Selim G. School of Computing Queen's University Kingston ON K7L3N6 Canada

ISBN: (纸本)9780889867048

This paper addresses the workflow rescheduling problem in the Grid where resource performance is fluctuating and hard to predict. Unlike existing rescheduling approaches targeting the same problem, the proposed a mobile agent based distributed approach. Once a workflow is submitted to a central workflow scheduler, an initial schedule for tasks in that workflow will be created first. Then, at the workflow run-time, mobile agents which carry those tasks will reschedule themselves by a rescheduling algorithm when resource performance changes.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

A scheduler for local grid resource domain in high throughput environment

A scheduler for local grid resource domain in high throughpu...

引用

iasted international conference on parallel and distributed computing and networks

作者： Sun, W Inoguchi, Y Zhang, YY Japan Adv Inst Sci & Technol Grad Sch Informat Sci 1-1 Asahidai Nomi Ishikawa 9231292 Japan Japan Adv Inst Sci & Technol Ctr Informat Sci Nomi Ishikawa 9231292 Japan Japan Sci & Technol Agcy PRESTO Kawaguchi Saitama Japan

ISBN: (纸本)088986568X

Grid computing inevitably evolves to an infrastructure that satisfies various kinds of requirements, thus demanding more complex resource management. The scheduler introduced here is designed to serve a local resource domain in complex resource management. It uses MCT (Minimum Completion Time) for the immediate mode scheduling and an improved GA (Genetic Algorithm) for the batch mode scheduling to obtain the highest possible throughput and utilization. We created a simulation and compared our scheduler with three other benchmark algorithms. The experimental results indicate that our scheduler can achieve higher throughput and utilization than the benchmark algorithms subject to varying task flow, except when the arrival rate of tasks is very low. The dynamic scheduling cycle and batch size make the scheduler more adaptive for task flow varying, and decrease the number of tasks missing deadlines when resources fluctuate. The improved genetic algorithm is the key to obtain better results in a busy task flow.

关键词： Grid computing task scheduling Genetic Algorithm high throughput and utilization

来源：评论

学校读者我要写书评

暂无评论

An overview of IP telephony security issues and recommended solutions

An overview of IP telephony security issues and recommended ...

引用

iasted international conference on parallel and distributed computing and networks, as part of the 23rd iasted international Multi-conference on Applied Informatics

作者： Knezevic, Petar Srsen, Vedran Segaric, Kresimir Faculty of Electrical Engineering and Computing Unska 3 Croatia

In the last few years one of the most interesting questions in IT world is that of convergence between data and voice networks. This procedure cuts down overall expenses of implementation, usage and support of a telephone network, as the expenses of other telephone. Beside the procedures that are prerequisite for the realization of this concept (e.g. ensuring the quality of the transferred voice), it is necessary to ensure the security of that traffic from various threats «inherited» from data traffic. This paper is about preventive protection of voice traffic transferred through a converged data/voice network.

关键词： Internet telephony

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous channel bonding revisited

Heterogeneous channel bonding revisited

引用

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

作者： Andresen, Daniel Hanenkamp, Sterling Department of Computing Sciences Kansas State University

ISBN: (纸本)088986392X

Efficient communication in distributed systems is essential for optimal system performance. As parallel computation develops, many different kinds of messages need to be sent between machines. These messages may have different requirements for network latency and bandwidth. In this paper, we revisit combining two physical interfaces into one virtual network (channel bonding). In contrast with most existing implementations, we communicate via heterogenous interfaces, and explore a number of more sophisticated scheduling algorithms than the round-robin technique used in the standard Beowulf channel-bonding driver. We explore the relative tradeoffs of interface scheduling overhead versus the additional bandwidth possible with multiple interfaces. Using both Gigabit Ethernet and Fast Ethernet networks, we evaluate system performance using netPerf. We show significant performance gains for small messages, with incremental improvements for larger packets.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for disjoint paths in star networks

A distributed algorithm for disjoint paths in star networks

引用

20th iasted international conference on parallel and distributed computing and Systems, PDCS 2008

作者： Hamad, Ahmad Karaata, Mehmet Hakan Department of Computer Engineering Kuwait University P.O. Box 5969 Safat 13060 Kuwait

ISBN: (纸本)9780889867741

A stabilizing system guarantees that, regardless of the current configuration, the system reaches a legal configuration in a bounded number of steps and the system configuration remains legal thereafter. Whereas, a stabilizing system that maintains no explicit variables in the processes of the system is referred to as an inherently stabilizing system, and hence all system states are legal by construction. Due to this attribute, inherently stabilizing systems are immune to transient faults and do not experience any delay due arbitrary system initialization. We view a fault that perturbs the system configuration but not the program as transient fault. Due to these features, inherently stabilizing distributed protocols for peer-to-peer, sensor and mobile networks are desirable. Hypercube, star networks and their variations that provide an increased degree of scalability have been initially design for parallel networks. However, their scalability and the presence of multiple disjoint paths in these topologies make them viable alternatives to existing peer-to-peer and sensor networks topologies. In this paper, we proposed an inherently stabilizing algorithm for delivering messages over all node-disjoint paths from a process to another in star networks. The proposed algorithm has numerous applications including VLSI layout, reliable networks routing, secure message transmission, and network survivability. The proposed routing algorithm is optimal with respect to its state space and lengths of the node-disjoint paths.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Deployment of parallel direct sparse linear solvers within a parallel finite element code

Deployment of parallel direct sparse linear solvers within a...

引用

iasted international conference on parallel and distributed computing and networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Klimowicz, A.N.F. Mihajlović, M.D. Heil, M. School of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Mathematics University of Manchester Lamb Building Manchester United Kingdom

ISBN: (纸本)0889865701

In this paper we present and evaluate the performance of two different strategies for the deployment of parallel multifrontal and multiple frontal sparse linear solvers in the context of a parallel finite element code. Direct sparse linear solvers are based on sophisticated reorganisation of the standard Gaussian elimination algorithm with the aim of exploring matrix sparsity and reducing the amount of fill-in. Such codes can be successfully applied to very large linear systems, and are especially effective when a sparse linear system needs to be solved for multiple right-hand sides. Unfortunately, many important applications, such as finite element solutions of non-linear, transient problems, require repeated factorisation of the coefficient matrix. In such cases the only way of achieving good performance is parallelisation of both the computation of the finite element matrices and the linear system solution phase. We have developed two different designs for deployment of parallel multifrontal and multiple frontal sparse linear solvers in this context, each deploying three different strategies for the assembly of the global data. These designs are suitable for parallel and heterogeneous architectures. Experiments confirm high efficiency, low communication cost, and reduced initial memory requirements of our deployment designs, compared to a standard deployment strategy.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed performance of self-organizing neural grove

Parallel and distributed performance of self-organizing neur...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and Systems

作者： Inoue, Hirotaka Tsuda, Michiaki Narihisa, Hiroyuki Department of Electrical Engineering Kure National College of Technology 2-2-11 Agaminami Kure-shi Hiroshima 737-8506 Japan Department of Information Okayama University of Science 1-1 Ridai-cho Okayama-shi Okayama 700-0005 Japan

In this paper, we present the improving capability of accuracy and the parallel efficiency of self-organizing neural groves (SONGs) for classification on a MIMD parallel computer. Self-generating neural networks (SGNNs) are originally proposed on adopting to classification or clustering by automatically constructing self-generating neural tree (SGNT) from given training data. The SONG is composed of plural SGNTs each of which is independently generated by shuffling the order of the given training data, and the output of the SONG is voted all outputs of the SGNTs. We allocate each of SGNTs to each of processors in the MIMD parallel computer. Experimental results show that the more the number of processors increases, the more the classification accuracy increases for all problems.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for constructing multicast trees

Distributed algorithms for constructing multicast trees

引用

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

作者： Lo Re, Giuseppe Gatani, Luca Ist. Calcolo/Reti Alte Prestazioni Consiglio Nazionale delle Ricerche Palermo Italy

ISBN: (纸本)088986392X

This paper proposes two distributed algorithms for the heuristic solution of the Steiner Tree Problem in Network (SPN). The problem has a practical application in the construction of a minimum cost distribution tree for multicast transmission. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Currently, given the lack of efficient distributed methods, the existing protocols build the multicast distribution tree using some selected central node. The proposed distributed algorithms allow the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithms have been implemented and tested both in simulation and on experimental active networks, and their performance values are presented.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Order and balance in continuously-fault-tolerant distributions of objects

Order and balance in continuously-fault-tolerant distributio...

引用

iasted international conference on parallel and distributed computing and networks

作者： Coucopoulos, G Goel, N Nayak, A Santoro, N Carleton Univ Sch Comp Sci Ottawa ON K1N 5B6 Canada Cistel Technol Inc Ottawa ON K2E 7V7 Canada Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada Carleton Univ Sch Comp Sci Ottawa ON K1N 5B6 Canada

ISBN: (纸本)088986568X

A distributed object systems is said to be K-tolerant if every object is available after the simultaneous failure of up to K nodes. The problem is that a K-tolerant system, after failures, is no longer K-tolerant;that is, subsequent failures may compromise the availability of the objects. A continuously K-tolerant system is one which starting from a K-tolerant configuration, after the failure of up to K nodes, reconfigures itself so to remain K-tolerant. The existing protocols for maintaining continuous K-tolerance do so without regard to the resulting structure of the available data. For example if the distributed set of objects was sorted, this ordering would be most likely lost after restructuring. Analogously, a balanced distribution of the objects among the nodes might also be not achieved in the new distribution after reorganization. In this paper, we present a mechanism for maintaining continuous K-tolerance while keeping the load balanced and the objects sorted. The proposed solution uses minimum amount of replication and has a cost comparable to the one of the known unstructured solutions.

关键词： distributed file fault tolerance continuous K-fault tolerance protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：