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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,744 篇 会议
29 册 图书
27 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,385 篇 工学
- 1,269 篇 计算机科学与技术...
- 595 篇 软件工程
- 237 篇 信息与通信工程
- 217 篇 电气工程
- 87 篇 控制科学与工程
- 54 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
306 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 38 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
199 篇 管理学
- 131 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 58 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
102 篇 distributed comp...
73 篇 parallel process...
60 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 grid computing
38 篇 distributed data...
37 篇 parallel program...
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
11 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,773 篇 英文
12 篇 中文
10 篇 俄文
10 篇 其他

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

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

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

详细简洁

排序：

Using grid computing to enable distributed radar data retrieval and processing

Using grid computing to enable distributed radar data retrie...

引用

7th international conference on parallel and Distrubuted computing, applications and technologies

作者： Arias, Diego Rivera, Wilson Univ Puerto Rico Dept Elect & Comp Engn Parallel & Distributed Comp Lab Mayaguez PR 00680 USA

ISBN: (纸本)9780769527369

We describe a tool that implements a set of services to manipulate and store data from a radar network in a transparent way to end users. A major requirement of this system is data availability and reliability. Consequently, we have implemented a redundancy schema based on the Information Dispersal Algorithm (IDA). Preliminary results show that the IDA based replication provides better reliability and less storage spending than traditional replication.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Routing based on Improved Safety Levels in Pancake Graphs 15

Fault-Tolerant Routing based on Improved Safety Levels in Pa...

引用

15th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Nishiyama, Yo Hirai, Yuki Kaneko, Keiichi Tokyo Univ Agr & Technol Grad Sch Engn Dept Comp & Informat Sci Koganei Tokyo 1848588 Japan

ISBN: (纸本)9781479983346

In a parallel processing system, a pancake graph is one of the superior topologies for interconnection network because of the small diameter and the high degree. In previous research, fault-tolerant routing using restricted global information called safety levels in a pancake graph was proposed. But there are some rooms for improvement. therefore, we propose a fault-tolerant routing algorithm based on improved safety levels to attain higher reachability. In addition, we estimated the proposed method in time and space complexities, and carried out a computer experiment to verify its effectiveness.

关键词： multicomputer interconnection network parallel proccessing

来源：评论

学校读者我要写书评

暂无评论

REST: A Redundancy-based Energy-efficient Cloud Storage System

REST: A Redundancy-based Energy-efficient Cloud Storage Syst...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Li, Hongyan Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9780769548791

Energy consumption has increasingly become a serious problem in contemporary data centers. the electricity bill contributes a significant fraction of the Total Cost of Ownership (TCO), and it has been predicted to increase at an even faster pace in the following years. In an attempt to reduce the energy consumption in cloud infrastructures, we propose REST, an energy-efficient cloud storage built upon an open source cluster-based object store similar to GFS. It achieves high energy-efficiency by cleverly exploiting the redundancy and its asymmetric accesses existing in the system without compromising inherent well-established mechanisms, while maintaining reasonable performance level. By slightly altering the data-layout policy, REST can safely keep a large amount of redundant storage nodes in standby mode or even powered off most of the time. Deploying a sophisticated real-time workload monitor, it provides flexibility to power up standby or powered down nodes to accommodate the variations in workloads. In addition, trade-offs between energy and performance can be conveniently made by simply adjusting a trade-off metric in REST. the FileBench experimental results have demonstrated that power savings can be as high as 29%, still providing comparable or even better performance.

关键词： cloud storage data centre distributed storage energy efficient power saving

来源：评论

学校读者我要写书评

暂无评论

distributed Memory Partitioning of High-throughput Sequencing Datasets for Enabling parallel Genomics Analyses 17

Distributed Memory Partitioning of High-Throughput Sequencin...

引用

8th ACM international conference on Bioinformatics, Computational Biology,and Health Informatics (ACM-BCB)

作者： Jammula, Nagakishore Chockalingam, Sriram P. Aluru, Srinivas Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9781450347228

State-of-the-art high-throughput sequencing instruments decipher in excess of a billion short genomic fragments per run. the output sequences are referred to as reads. these read datasets facilitate a wide variety of analyses with applications in areas such as genomics, metagenomics, and transcriptomics. Owing to the large size of the read datasets, such analyses are often compute and memory intensive. In this paper, we present a parallel algorithm for partitioning large-scale read datasets in order to facilitate distributed-memory parallel analyses. During the process of partitioning the read datasets, we construct and partition the associated de Bruijn graph in parallel. this allows applications that make use of a variant of the de Bruijn graph, such as de novo assembly, to directly leverage the generated de Bruijn graph partitions. In addition, we propose a mechanism for evaluating the quality of the generated partitions of reads and demonstrate that our algorithm produces high quality partitions. Our implementation is available at ***/ParBLiSS/read_partitioning.

关键词： memory partitioning

来源：评论

学校读者我要写书评

暂无评论

Information flow control in role-based model for distributed objects

Information flow control in role-based model for distributed...

引用

8th international conference on parallel and distributed Systems (ICPADS 2001)

作者： Izaki, K Tanaka, K Takizawa, M Tokyo Denki Univ Dept Comp & Syst Engn Tokyo 101 Japan

ISBN: (纸本)0769511538

Various kinds of distributed applications are realized in object-based frameworks. Object-based technologies are used to design, applications and enhance the interoperability among applications. In addition to realizing the interoperability, the system is required to be secure. the secure system is required to not only protect objects from illegally manipulated but also illegal information flow among objects. In this paper, we discuss a role-based access control model in the object-based systems and how to resolve illegal information flour in the roles. We define a safe set of roles where no illegal information flow occurs. We discuss an algorithm to check if illegal information flow occurs. In addition, we discuss hour to safely perform transactions belonging to unsafe roles.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A distributed architecture for Internet router level topology discovering systems

A distributed architecture for Internet router level topolog...

引用

4th international conference on parallel and distributed computing, applications and technologies (PDCAT 2003)

作者： Jiang, Y Fang, BX Hu, MZ Zhang, HL Yun, XC Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China

ISBN: (纸本)0780378407

In the past five years, hosts on Internet have multiplied more than five times, and along with the network's rapid expansion, more and more attention is paid to the challenging task of studying the topology characteristics of Internet infrastructure. Based on the features of Internet topology discovery and practical experience, we present a three-level distributed architecture for Internet router-level routing topology discovering system. We employ an integrated framework for the deployment of the system. We are examining, from a macroscopic point of view, what architecture is appropriate for this-like system, with an emphasis placed on the flexibility in practical work. the architecture enjoys the advantages of a clear train of thought and high modularization. Experiments show that this architecture has an instructive meaning for the development, deployment, and maintenance of Internet topology discovering system.

关键词： internet topology discovery architecture router level routing

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel sorting compatible with the standard qsort

An efficient parallel sorting compatible with the standard q...

引用

10th international conference on parallel and distributed computing, applications and technologies

作者： Man, Duhu Ito, Yasuaki Nakano, Koji Hiroshima Univ Dept Informat Engn Hiroshima 7398527 Japan

ISBN: (纸本)9781424452910

the main contribution of this paper is to present an efficient parallel sorting "psort" compatible with the standard qsort. Our parallel sorting "psort" is implemented such that its interface is compatible with "qsort" in C Standard Library. therefore, any application program that uses standard "qsort" can be accelerated by simply replacing "qsort" call by our "psort". Also, "psort" uses standard "qsort" as a "subroutine for local sequential sorting. So, if the performance of "qsort" is improved by anyone in the community, then that of our "psort" is also automatically improved. To evaluate the performance of our "psort", we have implemented our parallel sorting in a Linux server with two Intel quad-core processors (i.e. eight processor cores). the experimental results show that our "psort" is approximately 6 times faster than standard "qsort" using 8 processors. Since the speed up factor cannot be more than 8 if we use 8 cores, our algorithm is close to optimal. Also, as far as we know, no previously published parallel implementations achieve a speed up factor less than 4 using 8 cores.

关键词： parallel algorithm Sorting Multicore processor C standard library

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Partitioning a Tree into Sibling Subtree Clusters Weighted in a Given Range

An Algorithm for Partitioning a Tree into Sibling Subtree Cl...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Chen, Hao Luo, GuangCun Qin, Ke Peng, NingDuo Hao, Wen Univ Elect Sci & Technol China Chengdu Peoples R China Air force Command Automat Stn Chengdu Peoples R China

ISBN: (纸本)9780769548791

Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. this paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cluster is at least l and at most u, where l and u are given integers with lthms for trees only allow that a cluster corresponds to a subtree, our algorithm also considers clusters containing several subtrees as long as these subtrees have the same parent node or their root vertices are adjacent siblings. We call this [l, u] sibling partitioning. We deal with two problems of [l, u] sibling partitioning for a given tree: the minimal partition problem is to find an [l, u] sibling partitioning with the minimum number of clusters;the p-partition problem is to find an [l, u] sibling partitioning with a given number p of clusters. In this paper, we present the first polynomial-time algorithm to solve the two problems.

关键词： Tree partition Sibling Subtrees Dynamic Programming distributed computing

来源：评论

学校读者我要写书评

暂无评论

Cache Partitioning on Chip Multi-processors for Balanced parallel Scientific applications

Cache Partitioning on Chip Multi-processors for Balanced Par...

引用

10th international conference on parallel and distributed computing, applications and technologies

作者： Suo, Guang Natl Univ Def Technol Sch Comp Natl Lab Paralleling & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781424452910

nowadays, more and more supercomputers are built on multi-core processors with shared caches. However, the conflict accesses to shared cache from different threads or processes become a performance bottleneck for parallel applications. Cache partitioning can be used to allocate cache resources for different processes exclusively according to the demands of the processes. Conflicted accesses are avoided by restricting cache accesses to distinct private part of shared caches. this paper studies the problem of shared cache partition for balanced MPI parallel applications in CMP architecture, presenting the performance oriented cache partitioning framework, including Spatial-Level Cache Partitioning(SLCP), Time-level Cache Partitioning(TLCP) and the evaluation of them. We evaluate SLCP and TLCP based on a quad-core simulator. Experiment shows that the SLCP and TLCP outperforms traditional LRU cache replacement policy in IPC throughput and miss rate metric. Specifically, for large workloads, TLCP outperforms LRU by up to 20% and on average 8.7%.

关键词： Cache Partitioning CMP MPI

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：