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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,527 篇 英文
20 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是801-810 订阅

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

详细简洁

排序：

A Task parallel Algorithm for Computing the Costs of All-Pairs Shortest Paths on the CUDA-compatible GPU

A Task Parallel Algorithm for Computing the Costs of All-Pai...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Okuyama, Tomohiro Ino, Furnihiko Hagihara, Kenichi Osaka Univ Grad Sch Informat Sci & Technol Osaka 5608531 Japan

ISBN: (纸本)9780769534718

This paper proposes a fast method for computing the costs of all-pairs shortest paths (APSPs) on the graphics processing unit (GPU). The proposed method is implemented using compute unified device architecture (CUDA), which offers us a development environment for performing general-purpose computation on the GPU. Our method is based on Harish's iterative algorithm that computes the cost of the single-source shortest path (SSSP) for every source vertex. We present that exploiting task parallelism in the APSP problem allows us to efficiently use on-chip memory in the GPU, reducing the amount of data being transferred from relatively slower off-chip memory. Furthermore, our task parallel scheme is useful to exploit a higher parallelism, increasing the efficiency with highly threaded code. As a result, our method is 3.4-15 times faster than the prior method. Using on-chip memory, our method eliminates approximately 20% of data loads from off-chip memory.

关键词： All-pairs shortest path CUDA GPU acceleration acceleration shortest path Shortcuts off-chip parallel algorithms Paths

来源：评论

学校读者我要写书评

暂无评论

The Influence of Efficient Message Passing Mechanisms on High Performance distributed Scientific Computing

The Influence of Efficient Message Passing Mechanisms on Hig...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Mirtaheri, Seyedeh Leili Khaneghah, Ehsan Mousavi Sharifi, Mohsen Azgomi, Mohammad Abdollahi Iran Univ Sci & Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9780769534718

parallel programming and distributed programming are two solutions for scientific applications to provide high performance and fast response time in parallel systems and distributed systems. parallel and distributed systems must provide inter process communication (IPC) mechanisms like message passing mechanism as underlying platforms to enable communication between local and especially geographically dispersed and physically distributed processes. Communication overhead is the major problem in these systems and there are a lot of efforts to develop more efficient message passing mechanisms or to improve the network communication speed. This paper provides hard evidence that an efficient implementation of message passing mechanism on multi-computers reduces the execution time of a molecular dynamics code. A well-known program for macromolecular dynamics and mechanics called CHARMm is executed on a networked cluster. The performance of CHARMm is measured with two distributed implementations of message passing, namely a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is shown that the performance of CHARMm on a DIPC2006 configured cluster is by far better than its performance on an optimized MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientists are nowadays faced with more computational complexity and look for more efficient systems and mechanisms. Efficient distributed IPC mechanisms have direct effect on running scientists' simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC.

关键词： High Performance Scientific Computing distributed Inter Process Communication distributed Systems Operating System Kernel Molecular Dynamics

来源：评论

学校读者我要写书评

暂无评论

CLCP - A distributed Cross-Layer Commit Protocol for Mobile Ad-hoc Networks

CLCP - A Distributed Cross-Layer Commit Protocol for Mobile ...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Obermeier, Sebastian Boettcher, Stefan Kleine, Dominik Univ Gesamthsch Paderborn D-33102 Paderborn Germany

ISBN: (纸本)9780769534718

Transaction processing in mobile ad-hoc networks must take network problems like node disconnection, message loss, and network partitioning into consideration. We present a distributed cross-layer atomic commit protocol called CLCP that uses multiple coordinators and makes use of acknowledgement messages to piggyback information. We evaluated transaction processing in mobile ad-hoc networks by using two mobility models (i.e. Attraction Point and Manhattan Geometry), and compared CLCP with both atomic commit protocols, 2PC and Paxos Commit, each implemented in 3 versions, i.e. without acknowledgements, with Relay Routing, and with Nearest Forward Progress Routing. Special to our simulation environment is the use of the quasi-unit-disc model, which assumes a non-binary message reception probability that captures real-world behavior much better than the classical unit-disc-model, often used in theory Using the quasi-unit-disc model, our evaluation shows the following results. CLCP and "2PC without acknowledement messages" have a significantly lower energy consumption than the other protocols, and CLCP is able to commit significantly more distributed transactions than all the other atomic commit protocols for each of the mobility models.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Analyzing QoS Approach for parallel Soft Real-Time

Analyzing QoS Approach for Parallel Soft Real-Time

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Furtado, Pedro Univ Coimbra P-3000 Coimbra Portugal

ISBN: (纸本)9780769534718

parallel transactional systems are systems that execute transaction tasks in multiple servers, with load-balancing. We consider time constraints on those tasks and the fact that the tasks run in milliseconds means that fast admission control should be used. We propose such an admission control approach. Although there are scheduler designs building and maintaining complete deadline feasible schedules for jobs, with typical costs of O(n(2)) on the number of jobs, we are looking for simple and fast admission test add-on solutions to LWR that can be used with tasks running in milliseconds (e.g. transactions) as well as with lengthier jobs. We give the strictest possible bounds that guarantee deadlines, the deadline-feasibility algorithm with complexity O(n/number of servers), a system model and the approach itself We show, by means of simulation comparison to typical alternatives, that the proposed approach is a good solution.

关键词： load-balancing real-time scheduling transactional systems Load balancing Religious Missions jobs Admission control MILLISECOND soft real-time Time constraints Servers

来源：评论

学校读者我要写书评

暂无评论

An Improved Design for UMP (Ubiquitous Multi-Processor) System

An Improved Design for UMP (Ubiquitous Multi-Processor) Syst...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Zhang, Gongwei Dong, Mianxiong Zheng, Long Zeng, Deze Guo, Minyi Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China Univ Aizu Sch Comp Sci & Engn Aizu Wakamatsu 9658580 Japan

ISBN: (纸本)9780769534718

Recently, pervasive computing has become a very hot research field. Future Creation Lab., Olympus Corp. and the University of Aizu are working on this future technology to facilitate people's everyday life. The system we have proposed is named UMP-Percomp, a ubiquitous multiprocessor-based pipeline processing architecture to support high performance pervasive application development. Until now, we have implemented a prototype system to evaluate the performance of the architecture. However, the structure of the prototype system has some limitations: lack of scalability, inefficient pipeline algorithm, and do not do anything if there is lack of available PEs. So we modify the design to change these disadvantages. We add a UDP server to each component to support scalability and component substitution. We design a parallel algorithm to maximum the usage of PEs, and we also consider the situation of lacking suitable PEs. Finally, we do an experiment on the new system to compare with the old system.

关键词： design improvement Future technologies Scalability Multiprocessor parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Fractal analysis of Internet traffic using a parallel processing network simulator

Fractal analysis of Internet traffic using a parallel proces...

引用

6th International symposium on Communication Systems, Networks and Digital Signal processing

作者： Dobrescu, Radu Dobrescu, Matei Hossu, Daniela Taralunga, Sebastian Univ Politehn Bucuresti Fac Control & Comp Bucharest Romania

ISBN: (纸本)9781424418756

The goal of this paper is to prove by simulations in an virtual environment the potential of fractal analysis techniques in evaluation of network characteristics putting together two new research results: an Internet model based on scale free network graphs where inference based on self similarity and fractal behavior can be applied and a powerful experimental test-bed which allows parallel processing running pdns (parallel/distributed network simulator) package simultaneously on different sub-networks having scale free topology.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

parallel IP lookup using multiple SRAM-based pipelines

Parallel IP lookup using multiple SRAM-based pipelines

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Jiang, Weirong Prasanna, Viktor K. Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781424416936

Pipelined SRAM-based algorithmic solutions have become competitive alternatives to TCAMs (ternary content addressable memories)for high throughput IP lookup. Multiple pipelines can be utilized in parallel to improve the throughput further However several challenges must be addressed to make such solutions feasible. First, the memory distribution over different pipelines as well as across different stages of each pipeline must be balanced. Second, the traffic among these pipelines should be balanced. third, the intra-flow packet order should be preserved. In this paper we propose a parallel SRAM-based multi-pipeline architecture for IP lookup. A two-level mapping scheme is developed to balance the memory requirement among the pipelines as well as across the stages in a pipeline. To balance the traffic, we propose a flow pre-caching scheme to exploit the inherent caching in the architecture. Our technique uses neither a large reorder buffer nor complex reorder logic. Instead, a payload exchange scheme exploiting the pipeline delay is used to maintain the intra-flow packet order Extensive simulation using real-life traffic traces shows that the proposed architecture with 8 pipelines can achieve a throughput of up to 10 billion packets per second (GPPS) while preserving intra-flow packet order.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

A Programming Framework for Incremental Data Distribution in Iterative Applications

A Programming Framework for Incremental Data Distribution in...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Chan, Philip Abramson, David Monash Univ Caulfield Sch Informat Technol MESSAGE Lab Caulfield Vic Australia

ISBN: (纸本)9780769534718

Successful HPC over desktop grids and non-dedicated NOWs is challenging, since good performance is difficult to achieve due to dynamic workloads. On iterative data-parallel applications, this is addressed by dynamic data distribution. However, current approaches migrate an application from one distribution to another in one single phase, which can impact performance. In this paper, we present D-3-ARC, a programming framework to support adaptive and incremental data distribution, so that data migration takes place over several successive iterations. D-3-ARC consists of a runtime system and an API for specifying the distribution of arrays as well as how data redistribution takes place. We demonstrate how D-3-ARC can be used to develop an incremental strategy for data distribution in a Poisson solver, utilising a runtime feedback mechanism to determine how much data to migrate during each iteration.

关键词： Dynamic Data Redistribution Incremental Data Distribution Iterative Applications Message-Passing Interface parallel Programming Frameworks data distribution incremental data Data Migration iterative methods IMPACT PROPERTIES single phase Iterative Runtime

来源：评论

学校读者我要写书评

暂无评论

A New Authentication Protocol for Wireless Communication Network Based on ieee802.16

A New Authentication Protocol for Wireless Communication Net...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Li, Ruixue Fang, Zhiyi Ca, Wei Yin, Yumei Xu, Peng Jilin Univ Coll Comp Sci & Technol Key Lab Symbol Computat & Knowledge Engn Minist Educ Changchun 130012 Peoples R China Liaodong Univ Coll Informat Technol Dandong 118003 Peoples R China Chinese Acad Sci Changchun Inst Opt Fine Mech & Phys Changchun 130033 Peoples R China

ISBN: (纸本)9780769534718

After analyzing the specific security requirements of the wireless communication network based on ieee802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol for wireless mobile environment was proposed and designed. Then, its security was analyzed from the angle of technical realization and formal analysis to verify whether the original safety goals were achieved. Especially, formal analysis was mostly done. Finally, system testing was also carried out and the results were analyzed to verify function and performance of the new protocol.

关键词： ieee802.16 wireless communication network authentication protocol formal analysis

来源：评论

学校读者我要写书评

暂无评论

An effective approach for consistency management of replicas in Data Grid

An effective approach for consistency management of replicas...

引用

ieee International symposium on parallel and distributed processing with Applications

作者： Belalem, Ghalem Haddad, Cherif Slimani, Yahya Univ Oran Es Senia Dept Comp Sci Fac Sci \ Oran Algeria Univ Tunis Fac Sci & Tunis Dept Comp Sci Tunis Tunisia

ISBN: (纸本)9780769534718

Nowadays, Data Grids are can be seen as a frameworks responding to the needs large scale applications by affording varied geographically distributed resources set. The main aim here is to ensure a robust and efficient access and quality data, to improve the availability, we must improve application costs and to tolerate the faults. In such systems, these advantages are not yielded by means others than replication mechanisms. The effective use the replication technique involves several problems, in relation with the problem of the coherence maintenance of replicas. Our contribution consists new approach for the consistency management in the data grid. The proposed approach combines between pessimistic and optimistic approaches, taking into account benefits of both approaches, to find a compromise between performance and quality. In addition, our approach has been extended by c mechanism placement of replicas based on models of market economies.

关键词： Consistency management Data Grid Hybrid approach Optimistic approach Pessimistic approach Placement replicas REPLICA Grid computing distributed energy resources Pessimism Data Quality Frameworks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 77 78 79 80 81 82 83 84 85 86 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：