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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

636 篇 会议
29 册 图书
26 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

321 篇 工学
- 306 篇 计算机科学与技术...
- 160 篇 软件工程
- 41 篇 信息与通信工程
- 29 篇 电气工程
- 17 篇 控制科学与工程
- 15 篇 电子科学与技术（可...
- 8 篇 力学（可授工学、理...
- 8 篇 机械工程
- 8 篇 航空宇航科学与技...
- 7 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 5 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 生物工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 交通运输工程
116 篇 理学
- 83 篇 数学
- 28 篇 物理学
- 10 篇 系统科学
- 7 篇 生物学
- 7 篇 统计学（可授理学、...
- 5 篇 化学
- 3 篇 大气科学
39 篇 管理学
- 26 篇 管理科学与工程(可...
- 16 篇 工商管理
- 14 篇 图书情报与档案管...
11 篇 医学
- 7 篇 临床医学
- 5 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
2 篇 教育学
1 篇 法学
1 篇 农学
1 篇 艺术学

主题

153 篇 concurrent compu...
132 篇 distributed comp...
86 篇 parallel process...
57 篇 application soft...
56 篇 computer science
52 篇 parallel algorit...
50 篇 computer network...
48 篇 computer archite...
42 篇 parallel process...
38 篇 workstations
38 篇 hardware
34 篇 computational mo...
34 篇 costs
31 篇 message passing
30 篇 high performance...
26 篇 parallel program...
26 篇 delay
24 篇 processor schedu...
22 篇 programming prof...
20 篇 bandwidth

机构

5 篇 department of co...
3 篇 polytechnic univ...
3 篇 harbin institute...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 université jean ...
2 篇 enea headquarter...
2 篇 leibniz universi...
2 篇 department of co...
2 篇 georgia inst tec...
2 篇 syracuse univ sy...
2 篇 ruhr university ...
2 篇 unicredit milan
2 篇 northwestern uni...
2 篇 mcgill universit...
2 篇 upc barcelonatec...
2 篇 warsaw universit...
2 篇 ibm canada softw...
2 篇 university of an...

作者

4 篇 a. choudhary
4 篇 yongqiang sun
3 篇 priya unnikrishn...
3 篇 babik marian
3 篇 kit barton
3 篇 hluchy ladislav
3 篇 sun yq
3 篇 tae-geun kim
3 篇 xinda lu
3 篇 choudhary a
3 篇 m. sato
2 篇 davies a.j.
2 篇 ercan mf
2 篇 ibéria medeiros
2 篇 holger fröning
2 篇 to-yat cheung
2 篇 pascal welke
2 篇 linara adilova
2 篇 schwan k
2 篇 donato malerba

语言

686 篇 英文
3 篇 中文
1 篇 西班牙文
1 篇 其他

检索条件"任意字段=Proceedings of the 1997 Conference on Advances in Parallel and Distributed Computing"

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

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

详细简洁

排序：

Techniques to provide run-time support for solving irregular problems

Techniques to provide run-time support for solving irregular...

引用

IEEE International conference on parallel and distributed Systems

作者： No, J Choudhary, A Syracuse Univ Syracuse NY 13244 USA

ISBN: (纸本)0818682272

In this paper we present a runtime library design based on the two-phase collective I/O technique for irregular applications. The design is motivated by the requirements of a large number of ASCI (Accelerated Strategic computing Initiative) applications, although the design and interface is general enough to be used from any irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O at the same time, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, SO that only one group performs I/O simultaneously, while the nest group performs communication to rearrange data, and this entire process is pipelined. This reduces the contention at the I/O nodes but requires more complicated scheduling and a possible degradation in communication performance. We obtained up to 40 MBytes/sec. application level performance on the Caltech's Intel Paragon (with 16 IO nodes, each containing one disk) which includes on-the-fly reordering costs. We observed up to 60 MBytes/sec on the ASCI/Red machine with only three I/O nodes (with RAIDS).

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A parallel Connectivity Algorithm for de Bruijn Graphs in Metagenomic Applications 15

A Parallel Connectivity Algorithm for de Bruijn Graphs in Me...

引用

International conference for High Performance computing, Networking, Storage and Analysis (SC)

作者： Flick, Patrick Jain, Chirag Pan, Tony Aluru, Srinivas Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9781450337236

Dramatic advances in DNA sequencing technology have made it possible to study microbial environments by direct sequencing of environmental DNA samples. Yet, due to the huge volume and high data complexity, current de novo assemblers cannot handle large metagenomic datasets or fail to perform assembly with acceptable quality. This paper presents the first parallel solution for decomposing the metagenomic assembly problem without compromising the post-assembly quality. We transform this problem into that of finding weakly connected components in the de Bruijn graph. We propose a novel distributed memory algorithm to identify the connected subgraphs, and present strategies to minimize the communication volume. We demonstrate the scalability of our algorithm on a soil metagenome dataset with 1.8 billion reads. Our approach achieves a runtime of 22 minutes using 1280 Intel Xeon cores for a 421 GB uncompressed FASTQ dataset. Moreover, our solution is generalizable to finding connected components in arbitrary undirected graphs.

关键词： Metagenomic assembly soil microbiology de Bruijn graph connected component labeling

来源：评论

学校读者我要写书评

暂无评论

Methods for partitioning data to improve parallel execution time for sorting on heterogeneous clusters

引用

1st International conference on Grid and Pervasive computing

作者： Cerin, Christophe Dubacq, Jean-Christophe Roch, Jean-Louis Univ Paris 13 LIPN CNRS UMR 7030 F-93430 Villetaneuse France INRIA INPG UJF ID IMAGProjet MOAIS F-38330 St Martin Dheres France

ISBN: (纸本)3540338098

The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds. Such an application requires a partitioning step. For uniformly related processors (processors speeds are related by a constant factor), we develop a constant time technique for mastering processor load and execution time in an heterogeneous environment and also a technique to deal with unknown cost functions. For non uniformly related processors, we use a technique based on dynamic programming. Most of the time, the solutions are in O(p) (p is the number of processors), independent of the problem size n. Consequently, there is a small overhead regarding the problem we deal with but it is inherently limited by the knowing of time complexity of the portion of code following the partitioning.

关键词： Complexity of parallel algorithms Data distribution Heterogeneous computing parallel in-core sorting

来源：评论

学校读者我要写书评

暂无评论

A checkpointing strategy for scalable recovery on distributed parallel systems 97

A checkpointing strategy for scalable recovery on distribute...

引用

1997 ACM/IEEE conference on Supercomputing, SC 1997

作者： Naik, Vijay K. Midkiff, Samuel P. Moreira, Jose E. IBM T. J. Watson Research Center P. O. Box 218 Yorktown Heights NY 10598 United States

ISBN: (纸本)0897919858

In this paper, we describe a new scheme for checkpointing parallel applications on message-passing scalable distributed memory systems. The novelty of our scheme is that a checkpointed application can be restored, from its checkpointed state, in a reconfigured form. Thus, a parallel application may be checkpointed while executing with t1 tasks on p1 processors, and then restarted from the checkpointed state with t2 tasks on p2 processors. As a result, applications can recover from partial failures in the underlying system. Also, the reconfigurable checkpointed states can be migrated from one parallel system to another even if they do not have the same number of processors. We describe a new programming model for implementing a reconfigurable checkpointing scheme for parallel programs. This new model is derived from the DRMS programming model, developed in the context of run-time reconfiguration of parallel applications. A key component of our implementation is the distribution-independent representation of application array data structures in persistent storage. For further optimizing the performance of checkpoint/restart operations, we provide parallel array section streaming operations for such distributed arrays. We present performance data for the reconfigurable checkpointing and restarting of parallel applications and compare that with the performance of conventional forms of checkpointing. Our results demonstrate the advantages of the new scheme we describe. © 1997 ACM.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

A game-theoretic model for dynamic load balancing in distributed systems 09

A game-theoretic model for dynamic load balancing in distrib...

引用

International conference on advances in computing, Communication and Control, ICAC3'09

作者： Aote, Shailendra S. Kharat, M.U. PG Dept. of CSE G.H.R.C.E. Nagpur India

ISBN: (纸本)9781605583518

Process of improving the performance of a parallel and distributed system through a redistribution of load among the processors is called load balancing. If it is being done at run time then it treats as dynamic load balancing. In this paper we present the framework for obtaining a user optimal load balancing scheme in distributed system. We formulate the Dynamic load balancing problem in distributed systems as a noncooperative game among users. The system model considers various parameters and accordingly the load balancing algorithm is defined. For the proposed noncooperative load balancing game, we consider the structure of the Nash equilibrium. Based on this structure we derive a new distributed load balancing algorithm. Our focus is to define the load balancing problem and the scheme to overcome it, by using new area called game theory. Copyright 2009 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

New parallel volume rendering based on shear-wrap using a pipeline framework

New parallel volume rendering based on shear-wrap using a pi...

引用

conference on Visual Data Exploration and Analysis IV

作者： Huang, XH Li, W Zheng, NN Xi'an Jiaotong Univ. (China)

ISBN: (纸本)0819424285

In distributed computing environment, an important factor affecting performance of parallel algorithm is communication bandwidth. A new parallel volume rendering algorithm is presented in this paper, based on Shear-Wrap fractorization of the Viewing Transformation using Pipeline Framework of PCs. Taking full use of overlap of communication and computing, we overcome the bottleneck of communication. In the existed algorithms based on object partition, local rendering and image composition are divided into two serial processes. Communication hardly happens during local rendering. In the period of image compositing, however, communication is very busy, and even congested. Furthermore, there are a big synchronism overhead in this period. This paper well solves this drawback by making local rendering and image compositing concurrently through pipeline of PCs. We have experimented on a pipeline composing of 16 Pentiums. The result shows that, performance is not affected much by communication and system overhead is little compared to rendering time. This paper provides a new method for studying on low-price, high-efficiency and real-time volume rendering system.

关键词： distributed parallel volume rendering Shear-Wrap

来源：评论

学校读者我要写书评

暂无评论

The reliability analysis of resiliency framework for grid services

The reliability analysis of resiliency framework for grid se...

引用

4th IASTED International conference on advances in Computer Science and Technology, ACST 2008

作者： Tangmankhong, Kroeksak Charoenchaiamornkij, Pornchai Achalakul, Tiranee Computer Engineering Department Faculty of Engineering King Mongkuth University of Technology Thunburi 126 Prachauthis Road Bangmod Thungkru Bangkok 10140 Thailand

ISBN: (纸本)9780889867307

The services are generally used in distributed computing platforms called "Grid Services" that combines the Grid technology with the web service concept. In the Grid computing environment, several services are crucial. When these services fail, the computing can be terminated. The service reliability is a requirement of the system. Thus, we proposed to a prototype of reliable service model based on resiliency replication that uses forward recovery concepts. We study on the model's performance and its reliability and constructed an experiment to prove our analysis with the measured value. The results presented that the model predicted the performance very close from the actual value.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed particle collision simulation with decentralized control

引用

3rd International conference on Grid and Pervasive computing

作者： Li, Ruipeng Jiang, Hai Su, Hung-Chi Zhang, Bin Jenness, Jeff Arkansas State Univ Dept Computat Sci State Univ AR 72467 USA Univ Arkansas Dept Chem & Phys Fayetteville AR 72701 USA

ISBN: (纸本)9783540680819

Scientific computing applications with highly demanding data capacity and computation power drive a computing platform migration from shared memory machines to multi-core/multiprocessor computer clusters. However, overheads in coordinating operations across computing nodes could counteract the benefit of having extra machines. Furthermore, the hidden dependency in applications slows down the simulation over non-shared memory machines. This paper proposed a framework to utilize multi-core/multiprocessor clusters for distributed simulation. Among several coordination schemes, decentralized control approach has demonstrated its effectiveness in reducing the communication overheads. A speculative execution strategy is applied to exploit parallelism thoroughly and overcome strong data dependency. Performance analysis and experiments are provided to demonstrate the performance gains.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

On Automated Testing of Description Logic Reasoners

引用

5th International conference on distributed computing and Internet Technologies (ICDCIT)

作者： Babik, Marian Hluchy, Ladislav Department of Parallel and Distributed Computing Institute of Informatics Slovak Academy of Sciences Slovakia

ISBN: (纸本)9783540897361

OWL and RDF/RDFS are ontological languages developed by the World Wide Web Consortium (W3), which have become a de facto standard for the, ontological descriptions in various domains. The evolution of these standards was influenced by the numerous advances in the research of knowledge representation and reasoning. Although support for reasoning and standardized representation is the key benefit, of these technologies, there is a lack of existing test, frameworks, which would be capable of addressing many crucial aspects of the Semantic Web applications. In this paper we propose a methodology for automated testing of OWL reasoners based on the real-world ontologies. This specification covers both terminological and assertional reasoning as well as checking of the correctness of the answers. An open-source implementation of such framework is described and a study of initial result is provided. The tests cover an extensive set of reasoners and ontologies and provide a state-of-the-art insight, into the field of OWL reasoning.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A fully distributed prime numbers generation using the wheel sieve

A fully distributed prime numbers generation using the wheel...

引用

IASTED International conference on parallel and distributed computing and Networks, as part of the 23rd IASTED International Multi-conference on Applied Informatics

作者： Paillard, Gabriel Laboratoire d'Informatique Université Paris-Nord UMR CNRS 7030 99 avenue Jean-Baptiste Clement 93430 Villetaneuse France

This article presents a new distributed approach for generating all prime numbers up to a given limit. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the advances of the parallel computers (which have permitted to reach large limits or to obtain the previous results in a shorter time), prime numbers generation still represents an attractive domain of research. Nowadays, prime numbers play a central role in cryptography and their interest has been increased by the very recent proof that primality testing is in P. In this work, we propose a new distributed algorithm which generates all prime numbers in a given finite interval [2,..., n], based on the wheel sieve. As far as we know, this paper designs the first fully distributed wheel sieve algorithm.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：