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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

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

共 3536 条记录，以下是3241-3250 订阅

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

详细简洁

排序：

Compiling distributed C++

Compiling distributed C++

引用

International symposium on parallel and distributed processing (IPDPS)

作者： H. Carr R.R. Kessler M. Swanson Department of Computer Science University of Utah Salt Lake UT USA

distributed C++ (DC++) is a language for writing parallel applications on loosely coupled distributed systems in C++. Its key idea is to extend the C++ class into 3 categories: gateway classes which act as communication and synchronization entry points between abstract processors, classes whose instances may be passed by value between abstract processors via gateways, and vanilla C++ classes. DC++ code is compiled to C++ code with calls to the DC++ runtime system. the DC++ compiler wraps gateway classes with handle classes so that remote procedure calls are transparent. It adds static variables to value classes and produces code which is used to marshal and unmarshal arguments when these value classes are used in remote procedure calls. Value classes are deep copied and preserve structure sharing. this paper shows DC++ compilation and performance.< >

关键词： Yarn Monitoring Programming profession Computer science Cities and towns Application software LAN interconnection Workstations Local area networks Multitasking

来源：评论

学校读者我要写书评

暂无评论

A fast and efficient strategy for submesh allocation in mesh-connected parallel computers

A fast and efficient strategy for submesh allocation in mesh...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： D. Das Sharma D.K. Pradhan Department of Computer Science Texas A and M University College Station TX USA

A new approach for dynamic submesh allocation in mesh-connected multiprocessor system, which supports a multi-user environment, is proposed. the proposed strategy effectively prunes the search space by searching for free submeshes on the corners of allocated submeshes along with the corners of the mesh system. A submesh is selected with the potential of causing the least amount of fragmentation in the system. the proposed strategy possesses complete submesh recognition capability; it is a best-fit strategy, as well. Existing strategies do not provide this combination of capabilities. the deallocation time and memory overhead is shown to be constant in that it does not grow with the size of the mesh. Simulation results indicate that the proposed strategy outperforms the existing ones in terms of parameters such as average delay in honoring a request, standard deviation of the delays, average allocation time, average deallocation time, and the amount of memory required.< >

关键词： Concurrent computing Delay effects Computer science Multiprocessing systems Operating systems

来源：评论

学校读者我要写书评

暂无评论

Extended distributed genetic algorithm for channel routing

Extended distributed genetic algorithm for channel routing

引用

International symposium on parallel and distributed processing (IPDPS)

作者： B.B. Prahlada Rao R.C. Hansdah Computer Science and Automation Department Indian Institute of Science Bangalore India

In this paper, we propose a new parallel genetic algorithm (GA), called extended distributed genetic algorithm (EDGA) for channel routing problem. the EDGA combines the advantages of previous parallel GA models, viz., master/slave GA model and distributed GA model. In EDGA, the root processor executes the conventional genetic algorithm with global selection on total population and the remaining processors execute conventional genetic algorithm with local selection on subpopulations. After certain number of generations, the total population on the root processor and the subpopulations on the remaining processors are unchanged, and the process is repeated till terminating conditions are reached. this incorporates features of both global and local selection in the proposed EDGA. the EDGA is designed to obtain good speedup, global optimal solution, and full utilization of the parallel system. We have implemented master/slave GA, distributed GA, and the proposed EDGA in C on a transputer-based parallel MIMD machine and compared their performance. It is found that the EDGA achieves higher speedup than both master/slave GA, and distributed GA.< >

关键词： Genetic algorithms Routing Master-slave Integrated circuit interconnections Simulated annealing Wire parallel processing Computer science Automation Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 34th Annual symposium on Foundations of Computer Science

Proceedings of the 34th Annual Symposium on Foundations of C...

引用

proceedings of the 34th Annual symposium on Foundations of Computer Science

ISBN: (纸本)0818643706

the symposium materials contain 74 papers. the topics covered include coordination games, competitive distributed paging, throughput-competitive on-line routing, NP trees, random sampling, sorting, graph bisection, the perfect phylogeny problem, sorting by reversals, approximating shortest superstrings, communication complexity, graph connectivity problems, parallel algorithms, statistical query learning, PAC learning, quantum circuit complexity, computational geometry, exact learning, Motion planning problems, Las Vegas algorithms for matrix groups, network flow problems, multicommodity flow, and dynamic word problems.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Cloning ADT modules to increase parallelism: rationale and techniques

Cloning ADT modules to increase parallelism: rationale and t...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： L.R. Welch Department of Computer and Information Science New Jersey Institute of Technology Newark NJ USA

this paper presents efficient techniques for identifying opportunities to increase parallelism when the asynchronous remote procedure call model of parallel execution is applied to programs constructed from abstract data type (ADT) modules. Frequently, an ADT module is needed simultaneously by multiple clients, thus causing contention. To decrease queueing delays to execute module operations, cloning of modules is often useful. the main contribution of this work is a heuristic to efficiently determine, for each module used in a program, an upper bound on the number of clones of that module that can be used concurrently. the results include transformation rules for conditionals, so that the clone analysis algorithm avoids considering an exponential number of paths through the program. Additionally, a technique is presented to determine the number of clones required each time a loop is unrolled. Furthermore, analysis is given to consider the effects of intermodule dependence relationships on the sharing of clones.< >

关键词： Cloning Upper bound Military computing parallel processing Delay Algorithm design and analysis Timing Programming profession Encapsulation Information science

来源：评论

学校读者我要写书评

暂无评论

An efficient transitive closure algorithm for distributed databases 5

An efficient transitive closure algorithm for distributed da...

引用

5th International Conference on Computing and Information, ICCI 1993

作者： Toroslu, I.H. Henschen, L. Dept. of Electr. Eng. and Comput. Sci. Northwestern Univ. EvanstonIL60208 United States

ISBN: (纸本)0818642122

Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for shared-nothing architectures. We present a new efficient algorithm for full TC problem for shared-nothing architecture. Using simulation, we also study and examine the performance of the algorithm. © 1993 ieee.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel hypercube algorithms for polygon problems

Optimal parallel hypercube algorithms for polygon problems

引用

International symposium on parallel and distributed processing (IPDPS)

作者： M.J. Atallah D.Z. Chen Department of Computer Sciences Purdue University West Lafayette IN USA Department of Computer Science and Engineering University of Notre Dame Notre Dame IN USA

We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(log n)-time, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-vertex simple polygon P for monotonicity, and other related problems as well. Previously it was not known how to achieve these complexity bounds on hypercubes, one of the main difficulties being that there is no known optimal sorting hypercube algorithm that achieves these bounds. In fact these are the first optimal geometric hypercube algorithms that do not assume that the input is given already sorted by x or y coordinates. the hypercube model we use is the standard one, with O(1) local memory per processor, and with one-port communication.< >

关键词： Hypercubes Testing Kernel Teleprinting Sorting Computer science

来源：评论

学校读者我要写书评

暂无评论

Recursive Diagonal Torus: an interconnection network for massively parallel computers

Recursive Diagonal Torus: an interconnection network for mas...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Y.L. Yang H. Amano H. Shibamura T. Sueyoshi Department of Comp Science Keio University Yokohama Japan Department of Artificial Intelligence Kyushu Institute of Technology Iizuka Japan

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2/sup 16/ nodes. By adding remote links to the diagonal directions of the torus network recursively, the RDT can realize a smaller diameter (e.g., it is 11 for 2/sup 16/ nodes) with smaller number of links per node (i.e., 8 links per node) than that of the hypercube. A simple routing algorithm called vector routing, which is near-optima and easy to implement is also proposed. the RDT comprises the mesh structure, and emulates hypercube and tree structures easily. FFT and the bitonic sorting algorithm are also easy to implement.< >

关键词： Multiprocessor interconnection networks Computer networks Concurrent computing Hypercubes Routing Mesh networks Tree data structures Sorting Communication networks Network topology

来源：评论

学校读者我要写书评

暂无评论

Analysis of link traffic in incomplete hypercubes

Analysis of link traffic in incomplete hypercubes

引用

International symposium on parallel and distributed processing (IPDPS)

作者： N.-F. Tzeng H. Kumar Center for Advanced Computer Studies University of Southwestern Louisiana Lafayette LA USA

A variation of the hypercube, called the incomplete hypercube, allows any sized construction, providing for better incremental flexibility. In this paper, traffic density over links in an incomplete hypercube with arbitrary size is analyzed for the first time. Despite its structural non-homogeneity, an incomplete hypercube is shown to exhibit bounded link traffic density (i.e., /spl les/ 2 messages per link per cycle) under the uniform message distribution, independent of the system size. As a result, it is easily achievable to build an incomplete hypercube with sufficient link communication capability that avoids any potential points of congestion, ensuring high performance. the incomplete hypercube thus appears to be an attractive and practical candidate topology for interconnecting parallel systems, since it shares every advantage of complete hypercubes while eliminating the restriction on system sizes.< >

关键词： Hypercubes Topology Joining processes parallel machines Routing Broadcasting Flexible structures Degradation Nearest neighbor searches

来源：评论

学校读者我要写书评

暂无评论

An optimal scheme of parallel processing for test generation in a distributed system 2

An optimal scheme of parallel processing for test generation...

引用

2nd ieee Asian Test symposium, ATS 1993

作者： Inoue, T. Yonezawa, T. Fujiwara, H. Advanced Institute of Science and Technology Nara 8916-5 Takayama-Cho Ikoma Nara630-01 Japan Matsushita Electric Industrial Co. Ltd. 1006 Kadoma Kadoma-Shi Osaka570 Japan

ISBN: (纸本)081863930X

this paper presents an approach to parallel processing of test generation for logic circuits in a loosely-coupled distributed network of general purpose computers. We first analyze the relation between the number of processors and the total processing time for a client-server model (CS model). the result of the analysis shows that for the CS model there exists an optimal number of processors which minimizes the total processing time. In order to get a more efficient scheme than the CS model, we propose another model called a client-agent-server model (CAS model), which is derived by adding agent processors to the CS model. We formulate the problem of test generation on the CAS model, and analyze the relation between the number of processors and the total processing time. Our analysis leads to an optimal scheme for the CAS model which minimizes the total processing time for a given number of processors. We present experimental results for the ISCAS benchmark circuits by implementing the CAS model on a network of workstations. © 1993 ieee.

关键词： General purpose computers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 321 322 323 324 325 326 327 328 329 330 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：