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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

324 篇 会议
8 册 图书
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 251 篇 计算机科学与技术...
- 154 篇 软件工程
- 73 篇 信息与通信工程
- 40 篇 电气工程
- 13 篇 控制科学与工程
- 12 篇 电子科学与技术（可...
- 8 篇 生物工程
- 6 篇 机械工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
- 3 篇 仪器科学与技术
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 土木工程
- 2 篇 力学（可授工学、理...
- 2 篇 化学工程与技术
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
65 篇 理学
- 58 篇 数学
- 8 篇 生物学
- 8 篇 统计学（可授理学、...
- 4 篇 物理学
- 2 篇 化学
- 2 篇 地球物理学
48 篇 医学
- 48 篇 临床医学
35 篇 管理学
- 23 篇 管理科学与工程(可...
- 17 篇 工商管理
- 16 篇 图书情报与档案管...
3 篇 法学
- 3 篇 社会学
2 篇 教育学
- 2 篇 教育学
2 篇 农学
1 篇 经济学

主题

57 篇 distributed comp...
23 篇 distributed comp...
14 篇 parallel algorit...
14 篇 parallel process...
13 篇 parallel process...
12 篇 concurrent compu...
11 篇 application soft...
10 篇 computer science
9 篇 computer archite...
7 篇 grid computing
7 篇 parallel computi...
7 篇 web services
6 篇 theory of comput...
6 篇 computer communi...
6 篇 educational inst...
6 篇 computer network...
5 篇 parallel archite...
5 篇 mpi
5 篇 parallel computa...
5 篇 internet

机构

4 篇 southwest jiaoto...
4 篇 harbin inst tech...
3 篇 zhejiang univ co...
3 篇 chinese acad sci...
3 篇 coll. of comp. s...
3 篇 institute of com...
2 篇 department of co...
2 篇 huazhong univ sc...
2 篇 univ elect sci &...
2 篇 nanjing univ pos...
2 篇 hosei univ dept ...
2 篇 school of comput...
2 篇 shanghai jiao to...
2 篇 department of ma...
2 篇 department of in...
2 篇 department of co...
2 篇 centre for distr...
2 篇 sch. of comp./co...
2 篇 national laborat...
2 篇 department of co...

作者

4 篇 zomaya albert y.
4 篇 li y
4 篇 min fan
4 篇 yang guo-wei
4 篇 zhang jun-yan
4 篇 shen hong
3 篇 zhang hl
3 篇 yang g
3 篇 fang bx
3 篇 jin h
3 篇 nong xiao
3 篇 pingzhi fan
3 篇 hai jin
3 篇 hong shen
2 篇 lee k
2 篇 depei qian
2 篇 sayaka kamei
2 篇 kim s
2 篇 jianhua sun
2 篇 kakugawa h

语言

336 篇 英文
1 篇 中文

检索条件"任意字段=Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings"

共 337 条记录，以下是131-140 订阅

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

详细简洁

排序：

Loop parallelisation for the Jikes RVM

Loop parallelisation for the Jikes RVM

引用

6th International Conference on parallel and distributed computing, applications and technologies (pdcat 2005)

作者： Zhao, JS Rogers, I Kirkham, C Watson, I Univ Manchester Manchester Lancs England

ISBN: (纸本)0769524052

Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallel threads and processors has fewer limitations, but most computer programs tend to be serial in nature. This paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We show Spec JVM benchmark results for this optimisation. The performance on a current desktop processor is slower than without parallel threads, caused by thread creation costs, but with these costs removed the performance is better than the serial code. We measure the threading costs and discuss how a future computer architecture will enable this optimisation to be feasible in exploiting thread instead of instruction and/or vector parallelism.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A new way to high performance NFS for clusters

A new way to high performance NFS for clusters

引用

6th International Conference on parallel and distributed computing, applications and technologies (pdcat 2005)

作者： Tang, RF Xiong, J Ma, J Meng, D Chinese Acad Sci Grad Sch Natl Res Ctr Intelligent Comp Syst Inst Comp Technol Beijing 100864 Peoples R China

ISBN: (纸本)0769524052

For its simplicity, reliability and maturity, NFS is widely-used in clusters. However, due to its high overheads and implementation limitations, the standard NFS cannot fully exert the potential abilities provided by multiple network channels and multiple SCSI channely on the server. In this paper, we present a new efficient way to high performance NFS implementation for cluster applications. By adding mechanisms to make good use of NFS server's multiple communication channels and multiple I/O channels, CluserNFS can potentially provide better I/O performance khan standard NFS, as illustrated by our simulation experiment results.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A distributed self-stabilizing algorithm for finding a connected dominating set in a graph

A distributed self-stabilizing algorithm for finding a conne...

引用

6th International Conference on parallel and distributed computing, applications and technologies (pdcat 2005)

作者： Jain, A Gupta, A Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

ISBN: (纸本)0769524052

A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected Connected dominating sets have major applications in routing in wireless ad-hoc networks. In this paper, we present a distributed self-estabilizing algorithm for finding a connected dominating set of a graph. Starting from an arbitrary initial state, the algorithm finds a connected dominating set in 002) time, where N is the number of nodes. We also show detailed simulation results to indicate that in practice, the algorithm finas small-sized connected dominating sets in a short time.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A Java framework for high level parallel programming using powerlists 18

A Java framework for high level parallel programming using p...

引用

18th International Conference on parallel and distributed computing, applications and technologies, pdcat 2017

作者： Niculescu, Virginia Loulergue, Frederic Bufnea, Darius Sterca, Adrian Faculty of Mathematics and Computer Science Babeş-Bolyai University Cluj-Napoca Romania School of Informatics Computing and Cyber Systems Northern Arizona University United States

ISBN: (纸本)9781538631515

parallel programs based on the Divide & Conquer paradigm could be successfully defined in a simple way using powerlists. These parallel recursive data structures and their algebraic theories offer both a methodology to design parallel algorithms and parallel programming abstractions to ease the development of parallel applications. The paper presents how programs based on powerlists can be implemented in Java using the JPLF framework we developed. The design of this framework is based on powerlists theory, but in the same time follows the object-oriented design principles that provide flexibility and maintainability. Examples are given and performance experiments are conducted. The results emphasize the utility and the efficiency of the framework. © 2017 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of local similarity search for unstructured text using prefix filtering 18

Parallel implementation of local similarity search for unstr...

引用

18th International Conference on parallel and distributed computing, applications and technologies, pdcat 2017

作者： Agrawal, Manu Manchanda, Kartik Soni, Ribhav Lal, Anurag Chowdary, Ravindranath Varanasi221005 India

ISBN: (纸本)9781538631515

Identifying partially duplicated text segments among documents is an important research problem with applications in plagiarism detection and near-duplicate web page detection. We investigate the problem of local similarity search for finding partially replicated text, focusing on its parallel implementation. Our aim is to find text windows that are approximately similar in two documents, using a filter verification framework. We present various parallel approaches to the problem, of which input data partitioning along with the reduction of individual index maps was found to be most suitable. We analyzed the effect of varying similarity threshold and number of processes on speedup, and also performed cost analysis. Experimental results show that the proposed method achieves up to 13x speedup on a 24-core processor. © 2017 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of dynamic programming problems using wavefront and rank convergence with full resource utilization 18

Parallel implementation of dynamic programming problems usin...

引用

18th International Conference on parallel and distributed computing, applications and technologies, pdcat 2017

作者： Sourabh, Vivek Pahariya, Parth Agarwal, Isha Gautam, Ankit Chowdary, C. Ravindranath Varanasi221005 India

ISBN: (纸本)9781538631515

In this paper, we propose a novel approach which uses full processor utilization to compute a particular class of dynamic programming problems parallelly. This class includes algorithms such as Longest Common Subsequence and Needleman-Wunsch. In a dynamic programming, a larger problem is divided into smaller problems which are then solved, and the results are used to compute the final result. Each subproblem can be considered as a stage. If computations made in a stage are independent of the computations made in other stages, then these stages can be calculated in parallel. The idling of processors bottlenecks the performance of the currently existing parallel algorithms. In this paper, we are using rank convergence for computation of each stage ensuring full processor utilization. This increases the efficiency and speedup of the parallel algorithm. © 2017 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

An Experimental Analysis for Memory Usage of GOS Core

An Experimental Analysis for Memory Usage of GOS Core

引用

9th International Conference on parallel and distributed computing, applications and technologies

作者： Lu, Xiaoyi Yue, Qiang Zou, Yongqiang Wang, Xiaoning Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China

ISBN: (纸本)9780769534435

As grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an Anti-TestCase-based approach to analyze the memory usage of GOS core software, and present a set of Anti-TestCases, which describe predefined memory problems of GOS core. This approach is applied with a set of automated test tools in controlled experiments including basic memory requirements, memory errors and memory usage of GOS core. With the experiment and analysis, we find several memory usage results of GOS core and they are valuable for other systems based on JVM, Tomcat and Axis. We also give some JVM memory configuration suggestions for better performance in the production server.

关键词： Memory management System testing Vehicle crash testing Application software Web services Grid computing Middleware Space technology Java distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for computing reversal distance

Parallel algorithm for computing reversal distance

引用

6th International Conference on parallel and distributed computing, applications and technologies, pdcat 2005

作者： Shen, Yi-Fei Chen, Guo-Liang National High Performance Computing Center Department of Computer Science University of Science and Technology of China 230027 Hefei Anhui China

ISBN: (纸本)0769524052

computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a parallel algorithm to computing reversal distance of two signed permutations. Our algorithm consists three parts and runs in O(lg2(n)) time using O(n2) processors in SIMD-CREWmodel. © 2005 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

ProjectileSort - Rule based parallel sorting algorithm - Architecture for reconfigurable multi-partition object arrays 18

ProjectileSort - Rule based parallel sorting algorithm - Arc...

引用

18th International Conference on parallel and distributed computing, applications and technologies, pdcat 2017

作者： Liyanage, Nandika Staffordshire University United Kingdom

ISBN: (纸本)9781538631515

Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time consuming task even using the latest hardware and software technologies. Sorting is one of the key concepts that helps to improve the efficiency of various computational process. Unlike the early single processor or single server operations using monolithic applications, multi-core distributed environments required more advanced computational theories and algorithms. Existing sorting theories are basically derived from linear algorithms and enhanced to support for distributed processing. This research discuss the characteristics of existing parallel sorting algorithms, techniques, limitation. Aim and objective is to introduce a new pure parallel sorting algorithm and sorting architecture that pointing to execute under latest distributed environments. The proposed pattern and the sorting architecture can be used as rule based parallel sorting technique and algorithm to support for any type of distributed environment to sort infinite dataset. © 2017 IEEE.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

A ring removal movement-based mobility location update scheme

A ring removal movement-based mobility location update schem...

引用

6th International Conference on parallel and distributed computing, applications and technologies (pdcat 2005)

作者： Yang, YQ Yang, JC Cao, JW Cent China Normal Univ Dept Comp Sci Wuhan 430079 Peoples R China

ISBN: (纸本)0769524052

Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost. In this paper, a ring removal movement-based location update scheme with a selective paging is proposed This location update scheme reduces the location updates by removing the ring formed in terminal's movement path. Numerical results show that the proposed movement-based update scheme provides a better performance than the improved movement-based registration (IMBR) scheme [1] when the terminal's callto-mobility (CMR) ratio [2] is small.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共34页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：