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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

637 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

321 篇 工学
- 306 篇 计算机科学与技术...
- 161 篇 软件工程
- 40 篇 信息与通信工程
- 29 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 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...
131 篇 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...
27 篇 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

语言

684 篇 英文
3 篇 中文
2 篇 其他
1 篇 西班牙文

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

共 690 条记录，以下是541-550 订阅

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

详细简洁

排序：

Task scheduling in distributed computing systems with a genetic algorithm

Task scheduling in distributed computing systems with a gene...

引用

International conference on High Performance computing in the Asia-Pacific Region

作者： Sung-Ho Woo Sung-Bong Yang Shin-Dug Kim Tack-Don Han Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). The paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.

关键词： Processor scheduling distributed computing Genetic algorithms distributed control Scheduling algorithm Job shop scheduling Data communication Robustness parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Noncontiguous I/O through PVFS

Noncontiguous I/O through PVFS

引用

IEEE International conference on Cluster computing

作者： Avery Ching A. Choudhary Wei-keng Liao R. Ross W. Gropp Center for Parallel and Distributed Computing Northwestern University Evanston IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

With the tremendous advances in processor and memory technology, I/O has risen to become the bottleneck in high-performance computing for many applications. The development of parallel file systems has helped to ease the performance gap, but I/O still remains an area needing significant performance improvement. Research has found that noncontiguous I/O access patterns in scientific applications combined with current file system methods, to perform these accesses lead to unacceptable performance for large data sets. To enhance performance of noncontiguous I/O, we have created list I/O, a native version of noncontiguous I/O. We have used the parallel Virtual File System (PVFS) to implement our ideas. Our research and experimentation shows that list I/O outperforms current noncontiguous I/O access methods in most I/O situations and can substantially enhance the performance of real-world scientific applications.

关键词： File systems File servers Concurrent computing Linux distributed computing Application software Costs Network servers Mathematics Computer science

来源：评论

学校读者我要写书评

暂无评论

An object oriented system for developing distributed applications

An object oriented system for developing distributed applica...

引用

International conference on High Performance computing

作者： G. Singh Yiwen Gu Department of Computing and Information Sciences Kansas State University Manhattan KS USA

With the recent advances in communication technology and the availability of powerful desktop computers, networking has gained popularity and many applications are being moved onto the Internet. To ease the development of distributed applications, software support to facilitate coordination and communication is needed. The paper describes an object oriented system for structured design and development of distributed applications. The basic system consists of a set of multithreaded servers, one server for each site in the network, which provide some basic communication facilities. The system has been developed using JAVA as the programming language. We use the software support provided by this basic system to define commonly used patterns of interaction in distributed applications. We also identify several different techniques for systematic composition of patterns to develop different applications. We illustrate the use of our system by defining some patterns and using them to build a sample application.

关键词： Application software Computer networks Web server Java Internet distributed computing Network servers Computer languages Collaborative work Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A unified approach to global concurrency control and global deadlocks in a multidatabase environment

A unified approach to global concurrency control and global ...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： SangKeun Lee Chong-Sun Hwang WonGyu Lee Department of Computer Science and Engineering Korea University Seoul South Korea Department of Computer Science Education Korea University Seoul South Korea

ISBN: (纸本)0818682272

Our objective is to provide a theoretical foundation for multidatabase transaction management that deals with global concurrency control and global deadlocks in a uniform manner. We first propose rigid conflict serializability as a sufficient condition for the global transaction management to ensure global serializability in multidatabase environment. Subsequently, it is shown that the enforcement of rigid conflict serializability through a rigid method at the time each global subtransaction begins its execution avoids global deadlocks. The deadlock-free policy in the paper seems to be attractive due to the simple and uniform approach it takes. The basic advantage of the approach is that the global transaction manager can allow any interleavings among normal database operations belonging to global transactions without any mechanism at global level.

关键词： Concurrency control System recovery Transaction databases Concurrent computing Database systems Computer science education Protocols Milling machines Terminology

来源：评论

学校读者我要写书评

暂无评论

A concurrent program debugging environment using real-time replay

A concurrent program debugging environment using real-time r...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： E.H. Paik Y.S. Chung B.S. Lee Chae-Woo Yoo SDE Section Electronics and Telecommunications Research Institute Taejon South Korea School of Computing Soongsil University Seoul South Korea

A common debugging strategy involves re-execution of a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail in concurrent programs. Because of variations in message latencies and process scheduling, different runs on the given input may produce different results. This non-repeatability rules out the reproduction of errors which is the cornerstone of conventional debugging techniques. So, guaranteeing reproducibility is major issue in the concurrent program debugging. This paper discusses the design and implementation of a concurrent program debugging environment which replays the error-occurred execution and debugs the errors using a recorded event history file and input data.

关键词： Debugging Probes Monitoring Joining processes Programming profession Runtime Computer bugs Delay Reproducibility of results History

来源：评论

学校读者我要写书评

暂无评论

EvA: a tool for optimization with evolutionary algorithms

EvA: a tool for optimization with evolutionary algorithms

引用

EUROMICRO conference

作者： J. Wakunda A. Zell Wilhelm-Schickard-Institut für Informatik Lehrstuhl Rechnerarchitektur Universität Tubingen Tubingen Germany

We describe the EvA software package which consists of parallel (and sequential) implementations of genetic algorithms (GAs) and evolution strategies (ESs) and a common graphical user interface. We concentrate on the descriptions of the two distributed implementations of GAs and ESs which are of most interest for the future. We present comparisons of different kinds of genetic algorithms and evolution strategies that include implementations of distributed algorithms on the Intel Paragon, a large MIMD computer and massively parallel algorithms on a 16384 processor MasPar MP-1, a large SIMD computer. The results show that parallelization of evolution strategies not only achieves a speedup in execution time of the algorithm, but also a higher probability of convergence and an increase of quality of the achieved solutions. In the benchmark functions we tested, the distributed ESs have a better performance than the distributed GAs.

关键词： Evolutionary computation Electronic switching systems Genetic algorithms Concurrent computing distributed computing Software packages Graphical user interfaces distributed algorithms parallel algorithms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Design of a parallel genetic algorithm for the Internet

Design of a parallel genetic algorithm for the Internet

引用

Communications, Power and computing conference: WESCANEX

作者： D. Joseph W. Kinsner Department of Electrical and Computer Engineering University of Manitoba Winnipeg MAN Canada

This paper proposes a parallel implementation of the genetic algorithm (GA) on the Internet which will improve the algorithm's performance. It is motivated by the possibility of aiding research into complex search and optimization problems that use the GA. Requirements and constraints regarding parallelization of the GA are identified. A parallel GA is developed for an ideal PRAM architecture and is shown to have an asymptotic running time of O(log n), an improvement over the sequential GA. A parallel GA is also designed for a Unix network and has an asymptotic running time comparable to the ideal system. The algorithm is a decentralized, asynchronous, and fault-tolerant design that matches the characteristics of the network. The GA population is divided into colonies that are distributed among processors. Trade policies are executed for the exchange of genes.

关键词： Algorithm design and analysis Genetic algorithms Internet Power engineering computing Concurrent computing Fault tolerance Electronic mail Constraint optimization Phase change random access memory Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Numerical Tokamak Turbulence Calculations on the CRAY T3E 97

Numerical Tokamak Turbulence Calculations on the CRAY T3E

引用

Supercomputing conference

作者： V.E. Lynch J-N. Leboeuf B.A. Carreras J.D. Alvarez L. Garcia Oak Ridge National Laboratory Oak Ridge TN USA Universidad Carlos III de Madrid Madrid Spain

ISBN: (纸本)9780897919852

Full cross section calculations of ion-temperature-gradient-driven turbulence with Landau closure are being carried out as part of the Numerical Tokamak Turbulence Project, one of the U. S. Department of Energy's Phase II Grand Challenges. Calculations of cylindrical multihelicity ion-temperature-gradient-driven turbulence with previously unattainable resolution were completed on the National Energy Research Scientific computing Center's 160- processor distributed-memory CRAY T3E parallel computer. Both T3E benchmark results and physics results will be presented. Work is in progress to increase the resolution, improve the performance of the parallel code, and include toroidal geometry in these calculations for the new fully configured, 512-processor, T3E-900 model.

关键词： Tokamaks Laboratories Geometry Stability Thermal conductivity Magnetic devices Toroidal magnetic fields Scientific computing Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

An efficient adaptive routing algorithm for the faulty star graph

An efficient adaptive routing algorithm for the faulty star ...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： L.Q. Bai H. Ebara H. Nakano Dept. of Commun. Osaka Univ. Japan

This paper introduces an adaptive distributed routing algorithm for the faulty star graph. By giving two routing rules based on the properties of nodes, an optimal routing function for the fault-free star graph is presented. For a given destination in the n-star graph, n-1 node-disjoint and edge-disjoint subgraphs, which are derived from n-1 adjacent edges of the destination, can be constructed by applying this routing function and the concept of breadth first search. When faults are encountered, the algorithm can route messages to the destination by finding a fault-free subgraph based on the local failure information. As long as the number f of faults (node faults and/or edge faults) is less than the degree n-1 of the n-star graph, the algorithm can adaptively find a path of length at most d+4f to route messages successfully from a source to a destination, where d is the distance between two nodes.

关键词： Routing Hypercubes System recovery Topology Fault tolerance Very large scale integration Algorithm design and analysis Costs Adaptive systems Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A hierarchical processor scheduling policy for distributed-memory multicomputer systems

A hierarchical processor scheduling policy for distributed-m...

引用

International conference on High Performance computing

作者： S.P. Dandamudi T.K. Thyagaraj Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

Processor scheduling policies for distributed memory systems can be divided into space sharing or time sharing policies. In space sharing, the set of processors in the system is partitioned and each partition is assigned for the exclusive use of a job. In time sharing policies, on the other hand, none of the processors is given exclusively to jobs; instead, several jobs share the processors (for example, in a round robin fashion). There are advantages and disadvantages associated with each type of policy. Typically, space sharing policies are good at low to moderate system loads and when job parallelism does not vary much. However, at high system loads and widely varying job parallelism, time sharing policies provide a better performance. We propose a new policy that is based on a hierarchical organization that incorporates the merits of these two types of policies. The new policy is a hybrid policy that uses both space sharing as well as time sharing to achieve better performance. We demonstrate that, at most system loads of interest, the proposed policy outperforms both space sharing and time sharing policies by a wide margin.

关键词： Processor scheduling Time sharing computer systems Round robin parallel processing distributed computing Computer science Large-scale systems Concurrent computing Message passing Delay

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共69页 << < 51 52 53 54 55 56 57 58 59 60 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：